Xin He
Orcid: 0000-0002-3904-0478Affiliations:
- State University of New York at Buffalo, Department of Computer Science and Engineering, NY, USA
According to our database1,
Xin He
authored at least 78 papers
between 1987 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Math. Struct. Comput. Sci., 2022
2020
Proceedings of the Theory and Applications of Models of Computation, 2020
2016
2015
Proceedings of the Theory and Applications of Models of Computation, 2015
Proceedings of the Theory and Applications of Models of Computation, 2015
Proceedings of the Algorithms - ESA 2015, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
Theor. Comput. Sci., 2014
Algorithmica, 2014
2013
2012
Theor. Comput. Sci., 2012
Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height.
J. Graph Algorithms Appl., 2012
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Theor. Comput. Sci., 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
SIAM J. Discret. Math., 2008
2006
Inf. Process. Lett., 2006
Int. J. Found. Comput. Sci., 2006
2005
Inf. Process. Lett., 2005
Discret. Comput. Geom., 2005
2004
Proceedings of the Graph Drawing, 12th International Symposium, 2004
2003
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs.
Proceedings of the Algorithms, 2002
2001
J. Parallel Distributed Comput., 2001
J. Algorithms, 2001
Finding a hamiltonian paths in tournaments on clusters - a provably communication-efficient approach.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
2000
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs.
SIAM J. Comput., 2000
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000
1999
Theor. Comput. Sci., 1999
SIAM J. Discret. Math., 1999
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications.
SIAM J. Comput., 1999
Algorithmica, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999
1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1997
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems.
Theor. Comput. Sci., 1997
J. Parallel Distributed Comput., 1997
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
1996
Discret. Appl. Math., 1996
An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
Algorithmica, 1996
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
Discret. Appl. Math., 1995
An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs.
Algorithmica, 1995
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
1994
SIAM J. Discret. Math., 1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
1993
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993
Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
1992
Proceedings of the Algorithm Theory, 1992
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992
1991
An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon.
Inf. Process. Lett., 1991
1990
Theor. Comput. Sci., 1990
Algorithmica, 1990
Algorithmica, 1990
1988
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
SIAM J. Comput., 1988
J. Algorithms, 1988
1987
Inf. Comput., October, 1987