| Publication | Date of Publication | Type |
|---|
| An optimal algorithm for higher-order Voronoi diagrams in the plane: the usefulness of nondeterminism | 2024-11-28 | Paper |
| On the fine-grained complexity of small-size geometric set cover and discrete \(k\)-center for small \(k\) | 2024-11-14 | Paper |
| Constant-hop spanners for more geometric intersection graphs, with even smaller size | 2024-10-16 | Paper |
| Minimum \(L_\infty\) Hausdorff distance of point sets under translation: g eneralizing Klee's measure problem | 2024-10-16 | Paper |
| Hopcroft's problem, log-star shaving, 2D fractional cascading, and decision trees | 2024-07-19 | Paper |
| Dynamic geometric set cover, revisited | 2024-07-19 | Paper |
| Simpler reductions from exact triangle | 2024-05-29 | Paper |
| On the number of incidences when avoiding an induced biclique in geometric settings | 2024-05-14 | Paper |
| Simplex range searching revisited: how to shave logs in multi-level data structures | 2024-05-14 | Paper |
| Finding triangles and other small subgraphs in geometric intersection graphs | 2024-05-14 | Paper |
| Reducing \textsf{3SUM} to \textsf{Convolution-3SUM} | 2024-05-14 | Paper |
| Dynamic generalized closest pair: revisiting Eppstein's technique | 2024-05-14 | Paper |
| On the change-making problem | 2024-05-14 | Paper |
| Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147343 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147344 | 2024-01-15 | Paper |
| Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059975 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059976 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075915 | 2023-09-20 | Paper |
| Dynamic Colored Orthogonal Range Searching. | 2023-09-20 | Paper |
| Faster algorithms for largest empty rectangles and boxes | 2023-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104077 | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874497 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5057205 | 2022-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091054 | 2022-07-21 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2022-07-18 | Paper |
| Smallest k-enclosing rectangle revisited | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088947 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088951 | 2022-07-18 | Paper |
| Optimal Algorithms for Geometric Centers and Depth | 2022-06-08 | Paper |
| Computing Shapley values in the plane | 2022-03-22 | Paper |
| Deterministic APSP, Orthogonal Vectors, and More | 2022-02-08 | Paper |
| Improved Upper and Lower Bounds for LR Drawings of Binary Trees | 2021-12-01 | Paper |
| More on change-making and related problems | 2021-11-25 | Paper |
| Smallest \(k\)-enclosing rectangle revisited | 2021-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002701 | 2021-07-28 | Paper |
| Better Data Structures for Colored Orthogonal Range Reporting | 2021-02-02 | Paper |
| Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions | 2021-02-02 | Paper |
| Dynamic geometric data structures via shallow cuttings | 2021-01-29 | Paper |
| Approximating text-to-pattern Hamming distances | 2021-01-19 | Paper |
| Range closest-pair search in higher dimensions | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115792 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115793 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115791 | 2020-08-18 | Paper |
| Subquadratic Encodings for Point Configurations | 2020-08-18 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2020-08-03 | Paper |
| Tree drawings revisited | 2020-06-16 | Paper |
| Faster Approximate Diameter and Distance Oracles in Planar Graphs | 2020-05-27 | Paper |
| Range closest-pair search in higher dimensions | 2020-01-16 | Paper |
| Orthogonal range reporting and rectangle stabbing for fat rectangles | 2020-01-16 | Paper |
| Subquadratic encodings for point configurations | 2020-01-13 | Paper |
| More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems | 2019-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240419 | 2019-10-25 | Paper |
| Two approaches to building time-windowed geometric data structures | 2019-08-20 | Paper |
| Faster approximate diameter and distance oracles in planar graphs | 2019-06-27 | Paper |
| Selection and Sorting in the “Restore” Model | 2019-06-20 | Paper |
| Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back | 2019-05-21 | Paper |
| Adaptive and Approximate Orthogonal Range Counting | 2019-05-15 | Paper |
| Morphing Planar Graph Drawings with a Polynomial Number of Steps | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743501 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633824 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633820 | 2019-05-06 | Paper |
| All-pairs shortest paths in geometric intersection graphs | 2019-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626308 | 2019-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626302 | 2019-02-27 | Paper |
| Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges | 2019-02-20 | Paper |
| Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation | 2019-01-11 | Paper |
| Towards an Optimal Method for Dynamic Planar Point Location | 2018-12-19 | Paper |
| Improved Deterministic Algorithms for Linear Programming in Low Dimensions | 2018-11-13 | Paper |
| Selection and Sorting in the “Restore” Model | 2018-11-13 | Paper |
| Adaptive and Approximate Orthogonal Range Counting | 2018-11-05 | Paper |
| Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580100 | 2018-08-13 | Paper |
| Dynamic Orthogonal Range Searching on the RAM, Revisited | 2018-08-13 | Paper |
| Instance-Optimal Geometric Algorithms | 2018-08-02 | Paper |
| A clustering-based approach to kinetic closest pair | 2018-07-26 | Paper |
| An improved approximation algorithm for the discrete Fréchet distance | 2018-07-17 | Paper |
| Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky | 2018-07-16 | Paper |
| Improved Deterministic Algorithms for Linear Programming in Low Dimensions | 2018-07-16 | Paper |
| Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636506 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607939 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132862 | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132861 | 2018-01-30 | Paper |
| Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points | 2018-01-22 | Paper |
| Dynamic data structures for approximate Hausdorff distance in the word RAM | 2018-01-22 | Paper |
| Approximation algorithms for maximum independent set of pseudo-disks | 2017-10-20 | Paper |
| Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection | 2017-10-20 | Paper |
| Multi-pass geometric algorithms | 2017-10-20 | Paper |
| A Clustering-Based Approach to Kinetic Closest Pair | 2017-10-17 | Paper |
| Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368724 | 2017-10-10 | Paper |
| On the succinct representation of equivalence classes | 2017-10-09 | Paper |
| Speeding up the Four Russians Algorithm by About One More Logarithmic Factor | 2017-10-05 | Paper |
| Faster core-set constructions and data stream algorithms in fixed dimensions | 2017-09-29 | Paper |
| Towards in-place geometric algorithms and data structures | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365104 | 2017-09-29 | Paper |
| Euclidean bounded-degree spanning tree ratios | 2017-09-29 | Paper |
| Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus | 2017-09-29 | Paper |
| A fully dynamic algorithm for planar | 2017-09-29 | Paper |
| All-pairs shortest paths in geometric intersection graphs | 2017-09-22 | Paper |
| Succinct indices for path minimum, with applications | 2017-07-07 | Paper |
| How to Morph Planar Graph Drawings | 2017-05-30 | Paper |
| On Guarding Orthogonal Polygons with Sliding Cameras | 2017-05-05 | Paper |
| Necklaces, convolutions, and \(X+Y\) | 2017-03-27 | Paper |
| A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions | 2016-12-20 | Paper |
| Optimal deterministic algorithms for 2-d and 3-d shallow cuttings | 2016-12-20 | Paper |
| Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees | 2016-06-09 | Paper |
| Multidimensional Range Selection | 2016-01-11 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2016-01-07 | Paper |
| Dynamic planar convex hull operations in near-logarithmic amortized time | 2015-09-20 | Paper |
| Linear-space data structures for range minority query in arrays | 2015-09-02 | Paper |
| Clustered Integer 3SUM via Additive Combinatorics | 2015-08-21 | Paper |
| Fast String Dictionary Lookup with One Error | 2015-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501824 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501289 | 2015-08-03 | Paper |
| Finding median in read-only memory on integer input | 2015-04-29 | Paper |
| Geometric red-blue set cover for unit squares and related problems | 2015-04-27 | Paper |
| Linear-space data structures for range mode query in arrays | 2015-02-05 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2015-01-07 | Paper |
| Persistent Predecessor Search and Orthogonal Point Location on the Word RAM | 2014-12-05 | Paper |
| Comparison-based time-space lower bounds for selection | 2014-11-18 | Paper |
| On the bichromatic k -set problem | 2014-11-18 | Paper |
| On the bichromatic \(k\)-set problem | 2014-11-18 | Paper |
| On levels in arrangements of surfaces in three dimensions | 2014-10-13 | Paper |
| Finding the shortest bottleneck edge in a parametric minimum spanning tree | 2014-10-13 | Paper |
| Succinct Indices for Path Minimum, with Applications to Path Reporting | 2014-10-08 | Paper |
| All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time | 2014-09-09 | Paper |
| Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5171169 | 2014-07-25 | Paper |
| On Hardness of Jumbled Indexing | 2014-07-01 | Paper |
| Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417615 | 2014-05-22 | Paper |
| Maximum-weight planar boxes in \(O(n^2)\) time (and better) | 2014-04-30 | Paper |
| Optimal partition trees | 2014-04-03 | Paper |
| Orthogonal range searching on the RAM, revisited | 2014-03-24 | Paper |
| Stochastic minimum spanning trees in euclidean spaces | 2014-03-24 | Paper |
| Three problems about dynamic convex hulls | 2014-03-24 | Paper |
| Exact algorithms and APX-hardness results for geometric packing and covering problems | 2014-01-22 | Paper |
| Closest pair and the post office problem for stochastic points | 2014-01-22 | Paper |
| Streaming and dynamic algorithms for minimum enclosing balls in high dimensions | 2014-01-22 | Paper |
| Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers | 2014-01-14 | Paper |
| Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations | 2013-12-20 | Paper |
| Quake Heaps: A Simple Alternative to Fibonacci Heaps | 2013-09-13 | Paper |
| Smart-Grid Electricity Allocation via Strip Packing with Slicing | 2013-08-12 | Paper |
| Self-approaching Graphs | 2013-04-03 | Paper |
| Approximation algorithms for maximum independent set of pseudo-disks | 2012-09-19 | Paper |
| Linear-space data structures for range mode query in arrays | 2012-08-23 | Paper |
| Linear-Space Data Structures for Range Minority Query in Arrays | 2012-08-14 | Paper |
| On levels in arrangements of surfaces in three dimensions | 2012-08-13 | Paper |
| Optimal partition trees | 2012-05-22 | Paper |
| Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions | 2011-08-12 | Paper |
| Closest Pair and the Post Office Problem for Stochastic Points | 2011-08-12 | Paper |
| Dynamic Connectivity: Connecting to Networks and Geometry | 2011-07-29 | Paper |
| More Algorithms for All-Pairs Shortest Paths in Weighted Graphs | 2010-11-04 | Paper |
| Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection | 2010-09-02 | Paper |
| All-pairs shortest paths for unweighted undirected graphs in o(mn) time | 2010-08-16 | Paper |
| A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579415 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579406 | 2010-08-06 | Paper |
| Dynamic subgraph connectivity with geometric applications | 2010-08-05 | Paper |
| A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries | 2010-07-14 | Paper |
| Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time | 2010-04-29 | Paper |
| Well-separated pair decomposition in linear time? | 2010-04-19 | Paper |
| An improved algorithm for online unit clustering | 2009-11-25 | Paper |
| A (slightly) faster algorithm for Klee's measure problem | 2009-11-16 | Paper |
| A randomized algorithm for online unit clustering | 2009-09-02 | Paper |
| Dynamic coresets | 2009-08-27 | Paper |
| A note on maximum independent sets in rectangle intersection graphs | 2009-07-09 | Paper |
| On approximate range counting and depth | 2009-07-06 | Paper |
| Dynamic ham-sandwich cuts in the plane | 2009-06-18 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Dynamic connectivity for axis-parallel rectangles | 2009-05-06 | Paper |
| Drawing \(K_{2,n}\): A lower bound | 2009-03-23 | Paper |
| An Improved Algorithm for Online Unit Clustering | 2009-03-06 | Paper |
| A (slightly) faster algorithm for klee's measure problem | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602896 | 2009-02-12 | Paper |
| On levels in arrangements of curves, iii | 2009-02-12 | Paper |
| On approximate range counting and depth | 2009-02-12 | Paper |
| More algorithms for all-pairs shortest paths in weighted graphs | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549594 | 2009-01-05 | Paper |
| All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time | 2008-04-03 | Paper |
| Necklaces, Convolutions, and X + Y | 2008-03-11 | Paper |
| Dynamic Connectivity for Axis-Parallel Rectangles | 2008-03-11 | Paper |
| A Randomized Algorithm for Online Unit Clustering | 2008-02-21 | Paper |
| Dynamic Subgraph Connectivity with Geometric Applications | 2007-06-26 | Paper |
| Multi-pass geometric algorithms | 2007-02-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Three problems about simple polygons | 2006-10-25 | Paper |
| Faster core-set constructions and data-stream algorithms in fixed dimensions | 2006-10-10 | Paper |
| GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS | 2006-05-29 | Paper |
| Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time | 2006-05-16 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Low-Dimensional Linear Programming with Violations | 2005-09-16 | Paper |
| On levels in arrangements of curves. II: A simple inequality and its consequences | 2005-08-17 | Paper |
| A note on 3D orthogonal graph drawing | 2005-08-17 | Paper |
| ON ENUMERATING AND SELECTING DISTANCES | 2005-06-10 | Paper |
| Balanced vertex-orderings of graphs | 2005-05-04 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| Euclidean bounded-degree spanning tree ratios | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828970 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828971 | 2004-11-29 | Paper |
| APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS | 2004-09-29 | Paper |
| On levels in arrangements of curves | 2003-08-21 | Paper |
| A fully dynamic algorithm for planar width | 2003-08-21 | Paper |
| Semi-Online Maintenance of Geometric Optima and Measures | 2003-06-19 | Paper |
| Polynomial-time approximation schemes for packing and piercing fat objects | 2003-05-27 | Paper |
| Optimizing area and aspect ratio in straight-line orthogonal tree drawings | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536356 | 2002-10-13 | Paper |
| Fly cheaply: On the minimum fuel consumption problem | 2002-07-08 | Paper |
| Reporting curve segment intersections using restricted predicates | 2001-03-25 | Paper |
| Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252285 | 2000-06-29 | Paper |
| More planar two-center algorithms | 2000-01-17 | Paper |
| Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming | 1998-11-24 | Paper |
| Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams | 1998-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886058 | 1996-08-22 | Paper |
