Planar realizations of nonlinear Davenport-Schinzel sequences by segments
Discrete & Computational Geometry
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Linear programming with two variables per inequality in poly-log time
SIAM Journal on Computing
An upper bound on the number of planar K-sets
Discrete & Computational Geometry
On disjoint concave chains in arrangements of (pseudo) lines
Information Processing Letters
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Parametric Problems on Graphs of Bounded Tree-Width
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
How to cut pseudo-parabolas into segments
Proceedings of the eleventh annual symposium on Computational geometry
Parametric polymatroid optimization and its geometric applications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |