UB - University at Buffalo, The State University of New York Computer Science and Engineering

Roles

  • Professor

Research Areas

Theory and Algorithms
image of theory

Methods and techniques for developing efficient algorithms, especially graph algorithms, parallel algorithms and architectures, graph drawing, computational geometry, and group testing algorithms. Obstacles to proving non-trivial lower bounds in complexity theory. Properties of complexity classes, with relationships between classes and with identification of properties of problems that affect their computational complexity. | More »

Students

News

Courses

Technical Reports

2003-10
Zhang, Huaming; He, Xin. Improved Visibility Representation of Plane Graphs, August 27, 2003.
2003-06
Zhang, Huaming; He, Xin. Canonical Ordering Tree and Its Applications in Graph Drawing, May 30, 2003.
2002-13
Zhang, Huaming; He, Xin. On Even Triangulations of 2-Connected Embedded Graphs, July 6, 2002.
95-06
He, Xin. Grid Embedding of Internally Triangulated Plane Graphs without Non-empty Triangles, February 2, 1995.
92-18
Sunder, S.; He, Xin. An NC Algorithm , July 1, 1992.
91-16
He, Xin. Parallel Algorithm for Cograph Recognition with Applications (Revised), June 1, 1991.
91-05
He, Xin. Efficient Parallel Algorithms for Two Graph Layout Problems, June 1, 1991.
90-26
Sanath, R.; He, Xin. Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices, February 1, 1990.
90-24
He, Xin. On Finding the Rectangular Duals of Planar Triangulated Graphs, September 1, 1990.
90-23
He, Xin. An Improved Algorithm for the Planar 3-Cut Problem, February 1, 1990.
Valid XHTML 1.0 Transitional