A linear-time algorithm for testing the inscribability of trivalent polyhedra
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Angles of planar triangular graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The drawability problem for minimum weight triangulations
Theoretical Computer Science
Computational Geometry: Theory and Applications
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Triangulations without Minimum-Weight Drawing
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Matching points with rectangles and squares
Computational Geometry: Theory and Applications
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Computational Geometry: Theory and Applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Matching points with rectangles and squares
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
2-Change for k-connected networks
Operations Research Letters
Blocking Delaunay triangulations
Computational Geometry: Theory and Applications
Approximate proximity drawings
Computational Geometry: Theory and Applications
Hi-index | 0.00 |