| Publication | Date of Publication | Type |
|---|
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
| Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D | 2024-11-28 | Paper |
| Near-optimal min-sum motion planning for two square robots in a polygonal environment | 2024-11-28 | Paper |
| Decomposing the complement of the union of cubes and boxes in three dimensions | 2024-10-25 | Paper |
| Improved algebraic degeneracy testing | 2024-10-16 | Paper |
| Eli Goodman (1933--2021) and Ricky Pollack (1935--2018) | 2024-09-26 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2024-09-11 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
| Covering points by hyperplanes and related problems | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147341 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| Throwing a sofa through the window | 2023-12-21 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2023-11-23 | Paper |
| Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. | 2023-11-02 | Paper |
| How to Find a Point in the Convex Hull Privately | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060017 | 2023-11-02 | Paper |
| Bottleneck matching in the plane | 2023-06-26 | Paper |
| Space-aware reconfiguration | 2023-05-12 | Paper |
| Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions” | 2023-02-10 | Paper |
| Computing the smallest k-enclosing circle and related problems | 2023-01-18 | Paper |
| Time and space efficient collinearity indexing | 2023-01-09 | Paper |
| Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications | 2022-12-16 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2022-12-09 | Paper |
| Computing depth orders and related problems | 2022-12-09 | Paper |
| Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems | 2022-12-08 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| On rich points and incidences with restricted sets of lines in 3-space | 2022-10-31 | Paper |
| Dynamic data structures for fat objects and their applications | 2022-08-19 | Paper |
| A combinatorial bound for linear programming and related problems | 2022-08-18 | Paper |
| On Ray Shooting for Triangles in 3-Space and Related Problems | 2022-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091017 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091042 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088935 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088995 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075809 | 2022-05-11 | Paper |
| Counting and Cutting Rich Lenses in Arrangements of Circles | 2022-04-20 | Paper |
| The maximum-level vertex in an arrangement of lines | 2022-03-21 | Paper |
| Incidences between points and curves with almost two degrees of freedom | 2022-02-24 | Paper |
| Space-Aware Reconfiguration | 2021-09-20 | Paper |
| Union of Hypercubes and 3D Minkowski Sums with Random Sizes. | 2021-07-28 | Paper |
| Stabbing pairwise intersecting disks by five points | 2021-06-14 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-04-29 | Paper |
| On the complexity of the \(k\)-level in arrangements of pseudoplanes | 2021-04-28 | Paper |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time | 2021-04-14 | Paper |
| Output sensitive algorithms for approximate incidences and their applications | 2021-01-07 | Paper |
| On rich lenses in planar arrangements of circles and related problems | 2020-12-07 | Paper |
| Dominance Product and High-Dimensional Closest Pair under L_infty | 2020-11-25 | Paper |
| Eliminating depth cycles among triangles in three dimensions | 2020-10-23 | Paper |
| Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications | 2020-10-23 | Paper |
| Algebraic Techniques in Geometry | 2020-09-09 | Paper |
| Incidences with curves in three dimensions | 2020-07-06 | Paper |
| Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location | 2020-06-16 | Paper |
| Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111687 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111688 | 2020-05-27 | Paper |
| Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111741 | 2020-05-27 | Paper |
| Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points | 2019-10-25 | Paper |
| Incidences between points and lines in three dimensions | 2019-06-12 | Paper |
| A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model | 2019-05-21 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2019-05-15 | Paper |
| Reporting Neighbors in High-Dimensional Euclidean Space | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743404 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633823 | 2019-05-06 | Paper |
| Dynamic Time Warping and Geometric Edit Distance | 2019-03-28 | Paper |
| Point-line incidences in space | 2018-11-23 | Paper |
| Incidences between points and circles in three and higher dimensions | 2018-11-23 | Paper |
| Lenses in arrangements of pseudo-circles and their applications | 2018-11-23 | Paper |
| Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations | 2018-11-23 | Paper |
| Polyhedral Voronoi diagrams of polyhedra in three dimensions | 2018-11-23 | Paper |
| The Elekes-Szabó theorem in four dimensions | 2018-11-13 | Paper |
| Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications | 2018-11-05 | Paper |
| Kinetic and dynamic data structures for closest pair and all nearest neighbors | 2018-11-05 | Paper |
| Algorithms for center and Tverberg points | 2018-11-05 | Paper |
| Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles | 2018-11-05 | Paper |
| The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 2018-10-30 | Paper |
| A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM | 2018-08-13 | Paper |
| Partial-matching RMS distance under translation: combinatorics and algorithms | 2018-07-25 | Paper |
| The number of unit-area triangles in the plane: theme and variation | 2018-07-23 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-07-16 | Paper |
| Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances | 2018-07-16 | Paper |
| Eliminating Depth Cycles among Triangles in Three Dimensions | 2018-07-16 | Paper |
| Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications | 2018-07-16 | Paper |
| Homotheties and incidences | 2018-05-24 | Paper |
| On triple intersections of three families of unit circles | 2018-04-23 | Paper |
| Incidences between points and lines in R4 | 2018-04-23 | Paper |
| Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage | 2018-04-23 | Paper |
| The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 2018-04-23 | Paper |
| Polynomials vanishing on grids: The Elekes-Rónyai problem revisited | 2018-04-23 | Paper |
| Almost tight bounds for eliminating depth cycles in three dimensions | 2018-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607914 | 2018-03-15 | Paper |
| Distinct distances between points and lines | 2018-02-28 | Paper |
| Incidences between points and lines on two- and three-dimensional varieties | 2018-02-28 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-02-26 | Paper |
| Distinct distances between a collinear set and an arbitrary set of points | 2017-10-24 | Paper |
| An improved bound on the number of unit area triangles | 2017-10-20 | Paper |
| Distinct Distances from Three Points | 2017-10-10 | Paper |
| Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited | 2017-10-10 | Paper |
| Incidences between points and lines in three dimensions | 2017-10-10 | Paper |
| The number of unit-area triangles in the plane: Theme and variations | 2017-10-10 | Paper |
| Improved Bounds for Incidences Between Points and Circles | 2017-10-04 | Paper |
| Almost tight bounds for eliminating depth cycles in three dimensions | 2017-09-29 | Paper |
| An improved bound for k -sets in three dimensions | 2017-09-29 | Paper |
| The 2-center problem with obstacles | 2017-09-29 | Paper |
| On the number of congruent simplices in a point | 2017-09-29 | Paper |
| The union of congruent cubes in three dimensions | 2017-09-29 | Paper |
| Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles | 2017-09-29 | Paper |
| The Clarkson-Shor technique revisited and extended | 2017-09-29 | Paper |
| Balanced lines, halving triangles, and the generalized lower bound theorem | 2017-09-29 | Paper |
| A tight bound for the number of different directions in three dimensions | 2017-09-29 | Paper |
| Curve-sensitive cuttings | 2017-09-29 | Paper |
| Hausdorff distance under translation for points and balls | 2017-09-29 | Paper |
| On lines avoiding unit balls in three dimensions | 2017-09-29 | Paper |
| Algorithms for center and Tverberg points | 2017-09-29 | Paper |
| Solution of Scott's problem on the number of directions determined by a point set in 3-space | 2017-09-29 | Paper |
| New results on shortest paths in three dimensions | 2017-09-29 | Paper |
| Counting and representing intersections among triangles in three dimensions | 2017-09-29 | Paper |
| On the union of κ-round objects | 2017-09-29 | Paper |
| On empty convex polygons in a planar point set | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365154 | 2017-09-29 | Paper |
| On the number of unit-area triangles spanned by convex grids in the plane | 2017-06-29 | Paper |
| Cutting algebraic curves into pseudo-segments and applications | 2017-05-29 | Paper |
| Incidences between points and lines in \({\mathbb {R}}^4\) | 2017-05-11 | Paper |
| Finding the largest disk containing a query point in logarithmic time with linear storage | 2017-03-30 | Paper |
| Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited | 2017-01-25 | Paper |
| Incidences with curves in \(\mathbb{R}^d\) | 2016-12-06 | Paper |
| Polynomials vanishing on grids: The Elekes-Rónyai problem revisited | 2016-08-22 | Paper |
| In Memory of Jacob Schwartz | 2016-06-15 | Paper |
| Generalizations of the Szemerédi-Trotter theorem | 2016-05-12 | Paper |
| Distinct and repeated distances on a surface and incidences between points and spheres | 2016-04-06 | Paper |
| Incidences between points on a variety and planes in R^3 | 2016-03-15 | Paper |
| Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions | 2016-02-03 | Paper |
| On triple intersections of three families of unit circles | 2016-02-03 | Paper |
| On the union of fat tetrahedra in three dimensions | 2015-12-07 | Paper |
| Incidences with Curves in ℝ d | 2015-11-19 | Paper |
| Weak ε-nets and interval chains | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501826 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501288 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501300 | 2015-08-03 | Paper |
| Geometrically aware communication in random wireless networks | 2015-08-03 | Paper |
| Lenses in arrangements of pseudo-circles and their applications | 2015-08-01 | Paper |
| Distinct distances on two lines | 2015-06-19 | Paper |
| Improved bounds on weak ε-nets for convex sets | 2015-05-07 | Paper |
| Sets with few distinct distances do not have heavy lines | 2015-04-29 | Paper |
| Improved bounds for incidences between points and circles | 2015-02-17 | Paper |
| Union of random minkowski sums and network vulnerability analysis | 2015-02-17 | Paper |
| Incidences between points and lines on a two-dimensional variety | 2015-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934665 | 2014-12-18 | Paper |
| Hausdorff distance under translation for points and balls | 2014-11-18 | Paper |
| Union of random Minkowski sums and network vulnerability analysis | 2014-11-14 | Paper |
| Reporting Neighbors in High-Dimensional Euclidean Space | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921663 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921709 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921711 | 2014-10-13 | Paper |
| Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms | 2014-10-08 | Paper |
| A note on distinct distances in rectangular lattices | 2014-09-04 | Paper |
| On the union complexity of diametral disks | 2014-08-14 | Paper |
| FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT | 2014-08-11 | Paper |
| Counting plane graphs | 2014-08-07 | Paper |
| Finding the maximal empty disk containing a query point | 2014-08-07 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2014-07-30 | Paper |
| Improved Bounds for the Union of Locally Fat Objects in the Plane | 2014-07-30 | Paper |
| On Range Searching with Semialgebraic Sets. II | 2014-04-11 | Paper |
| The 2-center problem in three dimensions | 2014-04-03 | Paper |
| A kinetic triangulation scheme for moving points in the plane | 2014-04-03 | Paper |
| On degrees in random triangulations of point sets | 2014-04-03 | Paper |
| Incidences in three dimensions and distinct distances in the plane | 2014-04-03 | Paper |
| Counting Plane Graphs: Cross-Graph Charging Schemes | 2014-02-24 | Paper |
| On lattices, distinct distances, and the Elekes-Sharir framework | 2013-06-02 | Paper |
| The 2-center problem in three dimensions | 2013-04-29 | Paper |
| Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique | 2013-04-15 | Paper |
| Counting Plane Graphs: Cross-Graph Charging Schemes | 2013-04-03 | Paper |
| Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique | 2012-10-15 | Paper |
| Unit Distances in Three Dimensions | 2012-09-04 | Paper |
| Improved Bounds for Geometric Permutations | 2012-08-10 | Paper |
| Near-linear approximation algorithms for geometric hitting sets | 2012-04-26 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2012-03-15 | Paper |
| Semialgebraic Range Reporting and Emptiness Searching with Applications | 2011-11-07 | Paper |
| Non-Degenerate Spheres in Three Dimensions | 2011-08-16 | Paper |
| Incidences in Three Dimensions and Distinct Distances in the Plane | 2011-08-16 | Paper |
| On degrees in random triangulations of point sets | 2011-07-07 | Paper |
| Counting triangulations of planar point sets | 2011-06-01 | Paper |
| On lines, joints, and incidences in three dimensions | 2011-04-11 | Paper |
| Approximate Halfspace Range Counting | 2011-04-04 | Paper |
| Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes | 2011-04-04 | Paper |
| Line Transversals of Convex Polyhedra in $\mathbb{R}^3$ | 2011-04-04 | Paper |
| Relative \((p,\varepsilon )\)-approximations in geometry | 2011-03-31 | Paper |
| The overlay of minimization diagrams in a randomized incremental construction | 2011-03-31 | Paper |
| A kinetic triangulation scheme for moving points in the plane | 2011-03-25 | Paper |
| Range minima queries with respect to a random permutation, and approximate range counting | 2011-03-10 | Paper |
| An Improved Bound for k-Sets in Four Dimensions | 2011-01-17 | Paper |
| On lines and joints | 2010-11-08 | Paper |
| An improved bound on the number of unit area triangles | 2010-11-08 | Paper |
| Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space | 2010-11-02 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2010-09-06 | Paper |
| Cutting triangular cycles of lines in space | 2010-08-16 | Paper |
| Distinct distances in three and higher dimensions | 2010-08-16 | Paper |
| Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting | 2010-08-16 | Paper |
| On the number of crossing-free matchings, (cycles, and partitions) | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579389 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3564724 | 2010-05-26 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Extremal problems on triangle areas in two and three dimensions | 2009-11-26 | Paper |
| Linear data structures for fast ray-shooting amidst convex polyhedra | 2009-08-27 | Paper |
| Efficient Colored Orthogonal Range Counting | 2009-06-22 | Paper |
| On regular vertices of the union of planar convex objects | 2009-05-13 | Paper |
| On overlays and minimization diagrams | 2009-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619956 | 2009-04-14 | Paper |
| The Minkowski sum of a simple polygon and a segment | 2009-03-23 | Paper |
| Eppstein's bound on intersecting triangles revisited | 2009-03-04 | Paper |
| On planar intersection graphs with forbidden subgraphs | 2009-02-20 | Paper |
| Bi-criteria linear-time approximations for generalized k-mean/median/center | 2009-02-12 | Paper |
| On regular vertices on the union of planar objects | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602879 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602886 | 2009-02-12 | Paper |
| On approximate halfspace range counting and relative epsilon-approximations | 2009-02-12 | Paper |
| The complexity of the outer face in arrangements of random segments | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602914 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601518 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601522 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601527 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601549 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601564 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302610 | 2009-01-08 | Paper |
| Stabbing Convex Polygons with a Segment or a Polygon | 2008-11-25 | Paper |
| Arrangements in Geometry: Recent Advances and Challenges | 2008-09-25 | Paper |
| Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra | 2008-09-25 | Paper |
| Efficient algorithms for maximum regression depth | 2008-08-19 | Paper |
| Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes | 2008-08-13 | Paper |
| On the performance of the ICP algorithm | 2008-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514515 | 2008-07-21 | Paper |
| Computing a Center-Transversal Line | 2008-04-17 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| An optimal-time algorithm for shortest paths on a convex polytope in three dimensions | 2008-04-16 | Paper |
| Solution of Scott's problem on the number of directions determined by a point set in 3-space | 2007-12-19 | Paper |
| Online Conflict‐Free Coloring for Intervals | 2007-10-22 | Paper |
| On the Number of Crossing‐Free Matchings, Cycles, and Partitions | 2007-06-26 | Paper |
| Computing Maximally Separated Sets in the Plane | 2007-06-26 | Paper |
| A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\) | 2007-02-14 | Paper |
| Kinetic and dynamic data structures for convex hulls and upper envelopes | 2006-12-14 | Paper |
| On the union of \(\kappa\)-round objects in three and four dimensions | 2006-12-06 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| On graphs that do not contain the cube and related problems | 2006-06-27 | Paper |
| Repeated Angles in Three and Four Dimensions | 2006-06-01 | Paper |
| On empty convex polygons in a planar point set | 2006-04-28 | Paper |
| \(k\)-sets in four dimensions | 2006-03-21 | Paper |
| Minkowski sums of monotone and general simple polygons | 2006-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374253 | 2006-03-09 | Paper |
| Topological graphs with no large grids | 2005-11-24 | Paper |
| Counting and representing intersections among triangles in three dimensions | 2005-11-01 | Paper |
| Lines avoiding unit balls in three dimensions | 2005-11-01 | Paper |
| Crossing patterns of semi-algebraic sets | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692689 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692728 | 2005-09-28 | Paper |
| Curve-Sensitive Cuttings | 2005-09-16 | Paper |
| Output-Sensitive Construction of the Union of Triangles | 2005-09-16 | Paper |
| Top-Down Analysis of Path Compression | 2005-09-16 | Paper |
| Pseudo-Line Arrangements: Duality, Algorithms, and Applications | 2005-09-16 | Paper |
| Ray shooting and stone throwing with near-linear storage | 2005-05-12 | Paper |
| An improved bound for joints in arrangements of lines in space | 2005-04-15 | Paper |
| Incidences between points and circles in three and higher dimensions | 2005-04-15 | Paper |
| Cutting triangular cycles of lines in space | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657590 | 2005-03-14 | Paper |
| The Simplex Algorithm in Dimension Three | 2005-02-21 | Paper |
| Cell complexities in hyperplane arrangements | 2004-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829016 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829017 | 2004-11-29 | Paper |
| On the number of directions determined by a three-dimensional points set | 2004-10-14 | Paper |
| Point–Line Incidences in Space | 2004-09-24 | Paper |
| Distinct Distances in Three and Higher Dimensions | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819250 | 2004-09-24 | Paper |
| Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046485 | 2004-08-12 | Paper |
| On the number of views of translates of a cube and related problems. | 2004-03-14 | Paper |
| Polyhedral Voronoi diagrams of polyhedra in three dimensions | 2004-03-11 | Paper |
| The Clarkson–Shor Technique Revisited and Extended | 2004-02-20 | Paper |
| Speeding up the incremental construction of the union of geometric objects in practice. | 2004-01-23 | Paper |
| The union of congruent cubes in three dimensions | 2003-08-21 | Paper |
| On neighbors in geometric permutations. | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411344 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411384 | 2003-07-08 | Paper |
| 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations | 2003-06-19 | Paper |
| The Partition Technique for Overlays of Envelopes | 2003-06-19 | Paper |
| Cutting circles into pseudo-segments and improved bounds for incidences | 2003-03-17 | Paper |
| The number of congruent simplices in a point set | 2003-03-17 | Paper |
| Reporting intersecting pairs of convex polytopes in two and three dimensions | 2003-03-10 | Paper |
| The Random Edge Rule on Three-Dimensional Linear Programs | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778548 | 2002-11-18 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2002-11-04 | Paper |
| The 2-Center Problem with Obstacles | 2002-10-02 | Paper |
| Radial points in the plane | 2002-08-21 | Paper |
| Exact and approximation algorithms for minimum-width cylindrical shells | 2002-07-22 | Paper |
| An improved bound for \(k\)-sets in three dimensions | 2002-07-10 | Paper |
| On the complexity of arrangements of circles in the plane | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768272 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708236 | 2002-01-17 | Paper |
| Online point location in planar arrangements and its applications | 2002-01-17 | Paper |
| Approximation algorithms for minimum-width annuli and shells | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721992 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952660 | 2001-01-29 | Paper |
| Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945502 | 2000-11-12 | Paper |
| Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\) | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501661 | 2000-09-04 | Paper |
| Dynamic data structures for fat objects and their applications | 2000-05-08 | Paper |
| On the complexity of the union of fat convex objects in the plane | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945501 | 2000-03-23 | Paper |
| Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications | 2000-03-19 | Paper |
| On the boundary of the union of planar convex sets | 1999-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401030 | 1999-11-08 | Paper |
| Motion planning for a convex polygon in a polygonal environment | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252267 | 1999-06-17 | Paper |
| Line transversals of balls and smallest enclosing cylinders in three dimensions | 1999-05-27 | Paper |
| Partial surface matching by using directed footprints | 1999-05-03 | Paper |
| The discrete 2-center problem | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225313 | 1999-01-18 | Paper |
| Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions | 1999-01-17 | Paper |
| On the Number of Incidences Between Points and Curves | 1998-11-22 | Paper |
| Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces | 1998-07-27 | Paper |
| Voronoi diagrams in higher dimensions under certain polyhedral distance functions | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385513 | 1998-05-04 | Paper |
| Largest placement of one convex polygon inside another | 1998-03-11 | Paper |
| Approximating shortest paths on a convex polytope in three dimensions | 1998-02-17 | Paper |
| The common exterior of convex polygons in the plane | 1998-02-16 | Paper |
| An Expander-Based Approach to Geometric Optimization | 1998-02-10 | Paper |
| The Union of Convex Polyhedra in Three Dimensions | 1998-02-10 | Paper |
| Computing Envelopes in Four Dimensions with Applications | 1998-02-10 | Paper |
| On Translational Motion Planning of a Convex Polyhedron in 3-Space | 1998-02-10 | Paper |
| Quasi-planar graphs have a linear number of edges | 1998-01-05 | Paper |
| A near-linear algorithm for the planar 2-center problem | 1997-08-24 | Paper |
| Coordinated motion planning for two independent robots | 1997-07-07 | Paper |
| Ray Shooting Amidst Spheres in Three Dimensions and Related Problems | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335198 | 1997-04-23 | Paper |
| On critical orientations in the Kedem-Sharir motion planning algorithm | 1997-03-23 | Paper |
| Filling gaps in the boundary of a polyhedron | 1997-02-28 | Paper |
| Excess in arrangements of segments | 1997-02-27 | Paper |
| A subexponential bound for linear programming | 1997-02-18 | Paper |
| Ray Shooting Amidst Convex Polygons in 2D | 1996-12-08 | Paper |
| A near-linear algorithm for the planar segment-center problem | 1996-11-26 | Paper |
| Efficient randomized algorithms for some geometric optimization problems | 1996-11-26 | Paper |
| Computing depth orders for fat objects and related problems | 1996-11-10 | Paper |
| Robot motion planning | 1996-11-05 | Paper |
| A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886049 | 1996-08-22 | Paper |
| Piecewise-Linear Interpolation between Polygonal Slices | 1996-07-31 | Paper |
| The overlay of lower envelopes and its applications | 1996-06-27 | Paper |
| Almost tight upper bounds for the single cell and zone problems in the three dimensions | 1996-06-23 | Paper |
| Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions | 1996-06-05 | Paper |
| Lines in space: Combinatorics and algorithms | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875176 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848610 | 1996-03-27 | Paper |
| Applications of Parametric Searching in Geometric Optimization | 1995-11-22 | Paper |
| Common tangents and common transversals | 1995-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4328185 | 1995-09-19 | Paper |
| New bounds for lower envelopes in three dimensions, with applications to visibility in terrains | 1995-08-27 | Paper |
| Almost tight upper bounds for lower envelopes in higher dimensions | 1995-08-27 | Paper |
| Algorithms for bichromatic line-segment problems and polyhedral terrains | 1995-08-20 | Paper |
| Vertical decomposition of arrangements of hyperplanes in four dimensions | 1995-08-13 | Paper |
| An elementary approach to lower bounds in geometric discrepancy | 1995-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763391 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763393 | 1995-04-11 | Paper |
| Selecting Heavily Covered Points | 1995-04-06 | Paper |
| Improved bounds on weak \(\varepsilon\)-nets for convex sets | 1995-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138742 | 1995-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325546 | 1995-03-12 | Paper |
| On the union of fat wedges and separating a collection of segments by a line | 1994-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140428 | 1994-11-29 | Paper |
| Motion planning in the presence of moving obstacles | 1994-11-03 | Paper |
| Castles in the air revisited | 1994-09-26 | Paper |
| On the number of views of polyhedral terrains | 1994-09-26 | Paper |
| \(k\)-sets and random hulls | 1994-08-22 | Paper |
| Ray shooting in polygons using geodesic triangulations | 1994-08-10 | Paper |
| On joints in arrangements of lines in space and related problems | 1994-08-09 | Paper |
| Computing the smallest \(k\)-enclosing circle and related problems | 1994-08-03 | Paper |
| Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines | 1994-08-03 | Paper |
| Extremal polygon containment problems | 1994-07-21 | Paper |
| On the sum of squares of cell complexities in hyperplane arrangements | 1994-06-06 | Paper |
| An improved technique for output-sensitive hidden surface removal | 1994-05-05 | Paper |
| Fat Triangles Determine Linearly Many Holes | 1994-04-27 | Paper |
| Computing a Segment Center for a Planar Point Set | 1994-04-20 | Paper |
| Computing a Face in an Arrangement of Line Segments and Related Problems | 1994-02-24 | Paper |
| An invariant property of balls in arrangements of hyperplanes | 1994-01-19 | Paper |
| Optimal slope selection via expanders | 1993-11-15 | Paper |
| Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection | 1993-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138981 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138982 | 1993-10-20 | Paper |
| Counting Circular Arc Intersections | 1993-10-10 | Paper |
| Diameter, width, closest line pair, and parametric searching | 1993-09-30 | Paper |
| CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON | 1993-08-22 | Paper |
| Selecting distances in the plane | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036602 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037403 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037434 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038708 | 1993-05-18 | Paper |
| On the Zone Theorem for Hyperplane Arrangements | 1993-05-17 | Paper |
| The upper envelope of Voronoi surfaces and its applications | 1993-05-16 | Paper |
| Efficient hidden surface removal for objects with small union size | 1993-05-16 | Paper |
| On the zone of a surface in a hyperplane arrangement | 1993-05-16 | Paper |
| Circle Shooting in a Simple Polygon | 1993-05-16 | Paper |
| The number of edges of many faces in a line segment arrangement | 1993-01-17 | Paper |
| Quasi-optimal upper bounds for simplex range searching and new zone theorems | 1993-01-17 | Paper |
| Applications of a new space-partitioning technique | 1992-12-14 | Paper |
| Off-line dynamic maintenance of the width of a planar point set | 1992-09-27 | Paper |
| Counting and cutting cycles of lines and rods in space | 1992-09-27 | Paper |
| Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom | 1992-09-27 | Paper |
| Finding effective ``Force targets for two-dimensional, multifinger frictional grips | 1992-08-13 | Paper |
| On disjoint concave chains in arrangements of (pseudo) lines | 1992-06-28 | Paper |
| Arrangements of curves in the plane --- topology, combinatorics, and algorithms | 1992-06-28 | Paper |
| Randomized incremental construction of Delaunay and Voronoi diagrams | 1992-06-28 | Paper |
| Repeated angles in the plane and related problems | 1992-06-28 | Paper |
| Efficient Motion Planning for an L-Shaped Object | 1992-06-28 | Paper |
| A simple output-sensitive algorithm for hidden surface removal | 1992-06-28 | Paper |
| A singly exponential stratification scheme for real semi-algebraic varieties and its applications | 1992-06-26 | Paper |
| On \(k\)-sets in arrangements of curves and surfaces | 1992-06-26 | Paper |
| Tight bounds on a problem of lines and intersections | 1992-06-25 | Paper |
| Points and triangles in the plane and halving planes in space | 1992-06-25 | Paper |
| On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm | 1992-06-25 | Paper |
| Merging visibility maps | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359793 | 1991-01-01 | Paper |
| The complexity and construction of many faces in arrangements of lines and of segments | 1990-01-01 | Paper |
| The complexity of many cells in arrangements of planes and related problems | 1990-01-01 | Paper |
| The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 | 1990-01-01 | Paper |
| Storing line segments in partition trees | 1990-01-01 | Paper |
| Combinatorial complexity bounds for arrangements of curves and spheres | 1990-01-01 | Paper |
| An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space | 1990-01-01 | Paper |
| On the two-dimensional Davenport-Schinzel problem | 1990-01-01 | Paper |
| Triangles in space or building (and analyzing) castles in the air | 1990-01-01 | Paper |
| An algorithm for generalized point location and its applications | 1990-01-01 | Paper |
| Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection | 1990-01-01 | Paper |
| Computing the geodesic center of a simple polygon | 1989-01-01 | Paper |
| The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis | 1989-01-01 | Paper |
| Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences | 1989-01-01 | Paper |
| The upper envelope of piecewise linear functions: Algorithms and applications | 1989-01-01 | Paper |
| On the general motion-planning problem with two degrees of freedom | 1989-01-01 | Paper |
| On arrangements of Jordan arcs with three intersections per pair | 1989-01-01 | Paper |
| Implicitly representing arrangements of lines or segments | 1989-01-01 | Paper |
| A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3481216 | 1989-01-01 | Paper |
| Planar realizations of nonlinear Davenport-Schinzel sequences by segments | 1988-01-01 | Paper |
| Separating two simple polygons by a sequence of translations | 1988-01-01 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| The shortest watchtower and related problems for polyhedral terrains | 1988-01-01 | Paper |
| Improved lower bounds on the length of Davenport-Schinzel sequences | 1988-01-01 | Paper |
| A survey of motion planning and related geometric algorithms | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795219 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796750 | 1988-01-01 | Paper |
| On the shortest paths between two convex polyhedra | 1988-01-01 | Paper |
| Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams | 1987-01-01 | Paper |
| Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram | 1987-01-01 | Paper |
| Almost linear upper bounds on the length of general Davenport-Schinzel sequences | 1987-01-01 | Paper |
| Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons | 1987-01-01 | Paper |
| A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space | 1987-01-01 | Paper |
| On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028378 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3479543 | 1987-01-01 | Paper |
| On Shortest Paths Amidst Convex Polyhedra | 1987-01-01 | Paper |
| On k-Hulls and Related Problems | 1987-01-01 | Paper |
| An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832091 | 1987-01-01 | Paper |
| On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles | 1986-01-01 | Paper |
| Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes | 1986-01-01 | Paper |
| Probabilistic propositional temporal logics | 1986-01-01 | Paper |
| Generalized voronoi diagrams for moving a ladder. I: Topological analysis | 1986-01-01 | Paper |
| On Shortest Paths in Polyhedral Spaces | 1986-01-01 | Paper |
| Intersection and Closest-Pair Problems for a Set of Planar Discs | 1985-01-01 | Paper |
| Concurrent Probabilistic Programs, Or: How to Schedule If You Must | 1985-01-01 | Paper |
| On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles | 1984-01-01 | Paper |
| Verification of Probabilistic Programs | 1984-01-01 | Paper |
| On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems | 1984-01-01 | Paper |
| On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds | 1983-01-01 | Paper |
| Termination of Probabilistic Concurrent Program | 1983-01-01 | Paper |
| On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674052 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3721314 | 1983-01-01 | Paper |
| Experience with the SETL Optimizer | 1983-01-01 | Paper |
| Some modified algorithms for Dijkstra's longest upsequence problem | 1982-01-01 | Paper |
| Fast composition of sparse maps | 1982-01-01 | Paper |
| Some Observations Concerning Formal Differentiation of Set Theoretic Expressions | 1982-01-01 | Paper |
| Transformational Derivation of a Garbage Collection Algorithm | 1982-01-01 | Paper |
| A strong-connectivity algorithm and its applications in data flow analysis | 1981-01-01 | Paper |
| A strange sorting method inspired by formal differentiation | 1981-01-01 | Paper |
| An Automatic Technique for Selection of Data Representations in SETL Programs | 1981-01-01 | Paper |
| Formal integration: A program transformation technique | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922156 | 1981-01-01 | Paper |
| Structural analysis: A new approach to flow analysis in optimizing compilers | 1980-01-01 | Paper |
| A new proof of the Maurey-Pisier theorem | 1979-01-01 | Paper |
| Shrinking Minimal Systems and Complementation oflpnSpaces in Reflexive Banach Spaces | 1979-01-01 | Paper |
| A non-nice extreme operator | 1977-01-01 | Paper |
| A counterexample on extreme operators | 1976-01-01 | Paper |
| Extremal structure in operator spaces | 1974-01-01 | Paper |
| A Note on Extreme Elements in A 0 (K, E) | 1974-01-01 | Paper |
| Characterization and properties of extreme operators into C(Y) | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5634821 | 1971-01-01 | Paper |
