New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
A practical approximation algorithm for the LMS line estimator
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
Shattering a set of objects in 2D
Discrete Applied Mathematics
Parallelizability of Some P-Complete Problems
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Protecting Facets in Layered Manufacturing
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Anatomy of a Geometric Algorithm
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Smallest Color-Spanning Objects
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry: Theory and Applications
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
Speeding up the incremental construction of the union of geometric objects in practice
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Output-sensitive construction of the union of triangles
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Counting and representing intersections among triangles in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the least median square problem
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Computing large planar regions in terrains, with an application to fracture surfaces
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Lower bounds for linear degeneracy testing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower bounds for linear degeneracy testing
Journal of the ACM (JACM)
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graphical Models - Special issue on PG2004
Open problems around exact algorithms
Discrete Applied Mathematics
Covering point sets with two disjoint disks or squares
Computational Geometry: Theory and Applications
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Enclosing weighted points with an almost-unit ball
Information Processing Letters
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Maximum stabbing line in 2D plane
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Hardness of comparing two run-length encoded strings
Journal of Complexity
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient robust digital hyperplane fitting with bounded error
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
A panoply of quantum algorithms
Quantum Information & Computation
Finding longest approximate periodic patterns
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Computational Geometry: Theory and Applications
Computing the least median of squares estimator in time O(nd)
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
The complexity of geometric problems in high dimension
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Subquadratic algorithms for 3SUM
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Covering many or few points with unit disks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Discovering lag intervals for temporal dependencies
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
On the coarseness of bicolored point sets
Computational Geometry: Theory and Applications
On computing the centroid of the vertices of an arrangement and related problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |