Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Counting facets and incidences
Discrete & Computational Geometry
Computational Geometry: Theory and Applications
On disjoint concave chains in arrangements of (pseudo) lines
Information Processing Letters
On the sum of squares of cell complexities in hyperplane arrangements
Journal of Combinatorial Theory Series A
Many-face complexity in incremental convex arrangements
Information Processing Letters
Arrangements and their applications in robotics: recent developments
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Handbook of discrete and computational geometry
Erased arrangements of lines and convex decompositions of polyhedra
Computational Geometry: Theory and Applications
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and 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 |