| Publication | Date of Publication | Type |
|---|
| Faster algorithms for largest empty rectangles and boxes | 2026-04-27 | Paper |
| More dynamic data structures for geometric set cover with sublinear update time | 2026-04-27 | Paper |
| Simple multi-pass streaming algorithms for skyline points and extreme points | 2026-04-21 | Paper |
| Dynamic geometric connectivity in the plane with constant query time | 2025-11-24 | Paper |
| Enclosing points with geometric objects | 2025-11-24 | Paper |
| Convex polygon containment: improving quadratic to near linear time | 2025-11-24 | Paper |
| Semialgebraic range stabbing, ray shooting, and intersection counting in the plane | 2025-11-24 | Paper |
| Faster algorithms for text-to-pattern Hamming distances | 2025-08-15 | Paper |
| Polynomial representations of threshold functions and algorithmic applications | 2025-08-06 | Paper |
| Towards an optimal method for dynamic planar point location | 2025-08-05 | Paper |
Dynamic geometric set cover, revisited
SIAM Journal on Computing | 2025-06-25 | Paper |
| Klee's measure problem made easy | 2025-05-20 | Paper |
Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
ACM Transactions on Algorithms | 2025-02-21 | Paper |
On the number of incidences when avoiding an induced biclique in geometric settings
Discrete & Computational Geometry | 2025-02-19 | Paper |
| 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 |
| scientific article; zbMATH DE number 7788426 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788427 (Why is no real title available?) | 2024-01-15 | Paper |
Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Faster approximation algorithms for geometric set cover
(available as arXiv preprint) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7760157 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
| scientific article; zbMATH DE number 7740882 (Why is no real title available?) | 2023-09-20 | Paper |
| Dynamic Colored Orthogonal Range Searching. | 2023-09-20 | Paper |
Faster algorithms for largest empty rectangles and boxes
Discrete & Computational Geometry | 2023-08-17 | Paper |
| Orthogonal point location and rectangle stabbing queries in 3-d | 2023-06-05 | Paper |
| scientific article; zbMATH DE number 7651168 (Why is no real title available?) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7633283 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-15 | Paper |
scientific article; zbMATH DE number 7561415 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| On Locality-Sensitive Orderings and Their Applications | 2022-07-18 | Paper |
| Smallest k-enclosing rectangle revisited | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559220 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559224 (Why is no real title available?) | 2022-07-18 | Paper |
Optimal algorithms for geometric centers and depth
SIAM Journal on Computing | 2022-06-08 | Paper |
Computing Shapley values in the plane
Discrete & Computational Geometry | 2022-03-22 | Paper |
Deterministic APSP, Orthogonal Vectors, and More
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Improved Upper and Lower Bounds for LR Drawings of Binary Trees
Lecture Notes in Computer Science | 2021-12-01 | Paper |
More on change-making and related problems
Journal of Computer and System Sciences | 2021-11-25 | Paper |
More on change-making and related problems
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Smallest \(k\)-enclosing rectangle revisited
Discrete & Computational Geometry | 2021-08-18 | Paper |
Orthogonal point location and rectangle stabbing queries in 3-d
(available as arXiv preprint) | 2021-07-28 | Paper |
Better Data Structures for Colored Orthogonal Range Reporting
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Dynamic geometric data structures via shallow cuttings
Discrete & Computational Geometry | 2021-01-29 | Paper |
Dynamic geometric data structures via shallow cuttings
Discrete & Computational Geometry | 2021-01-29 | Paper |
Approximating text-to-pattern Hamming distances
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Range closest-pair search in higher dimensions
Computational Geometry | 2021-01-07 | Paper |
| scientific article; zbMATH DE number 7236428 (Why is no real title available?) | 2020-08-18 | Paper |
| Dynamic planar orthogonal point location in sublogarithmic time | 2020-08-18 | Paper |
| Tree drawings revisited | 2020-08-18 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-08-18 | Paper |
On locality-sensitive orderings and their applications
SIAM Journal on Computing | 2020-08-03 | Paper |
Tree drawings revisited
Discrete & Computational Geometry | 2020-06-16 | Paper |
| Faster Approximate Diameter and Distance Oracles in Planar Graphs | 2020-05-27 | Paper |
Orthogonal range reporting and rectangle stabbing for fat rectangles
(available as arXiv preprint) | 2020-01-16 | Paper |
Range closest-pair search in higher dimensions
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-01-13 | Paper |
More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems
ACM Transactions on Algorithms | 2019-12-02 | Paper |
| scientific article; zbMATH DE number 7122316 (Why is no real title available?) | 2019-10-25 | Paper |
Two approaches to building time-windowed geometric data structures
Algorithmica | 2019-08-20 | Paper |
Faster approximate diameter and distance oracles in planar graphs
Algorithmica | 2019-06-27 | Paper |
Selection and sorting in the ``restore'' model
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Discrete & Computational Geometry | 2019-05-21 | Paper |
Adaptive and approximate orthogonal range counting
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Morphing planar graph drawings with a polynomial number of steps
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling | 2019-05-10 | Paper |
| Optimal halfspace range reporting in three dimensions | 2019-05-06 | Paper |
| Comparison-based time-space lower bounds for selection | 2019-05-06 | Paper |
| All-pairs shortest paths in geometric intersection graphs | 2019-02-27 | Paper |
| Approximate shortest paths and distance oracles in weighted unit-disk graphs | 2019-02-27 | Paper |
| Applications of Chebyshev polynomials to low-dimensional computational geometry | 2019-02-27 | Paper |
Improved bounds for drawing trees on fixed points with L-shaped edges
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
Algorithmica | 2019-01-11 | Paper |
Towards an optimal method for dynamic planar point location
SIAM Journal on Computing | 2018-12-19 | Paper |
Improved deterministic algorithms for linear programming in low dimensions
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Selection and sorting in the ``restore'' model
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Adaptive and approximate orthogonal range counting
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back | 2018-08-13 | Paper |
| Applications of Chebyshev polynomials to low-dimensional computational geometry | 2018-08-13 | Paper |
| Dynamic orthogonal range searching on the RAM, revisited | 2018-08-13 | Paper |
Instance-optimal geometric algorithms
Journal of the ACM | 2018-08-02 | Paper |
A clustering-based approach to kinetic closest pair
Algorithmica | 2018-07-26 | Paper |
An improved approximation algorithm for the discrete Fréchet distance
Information Processing Letters | 2018-07-17 | Paper |
Deterministic APSP, orthogonal vectors, and more: quickly derandomizing Razborov-Smolensky
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved deterministic algorithms for linear programming in low dimensions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6861957 (Why is no real title available?) | 2018-04-19 | Paper |
| More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems | 2018-03-15 | Paper |
| Two approaches to building time-windowed geometric data structures | 2018-01-30 | Paper |
| Dynamic streaming algorithms for \(\varepsilon\)-kernels | 2018-01-30 | Paper |
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
Computational Geometry | 2018-01-22 | Paper |
Dynamic data structures for approximate Hausdorff distance in the word RAM
Computational Geometry | 2018-01-22 | Paper |
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Multi-pass geometric algorithms
Proceedings of the twenty-first annual symposium on Computational geometry | 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 |
| scientific article; zbMATH DE number 6789228 (Why is no real title available?) | 2017-10-10 | Paper |
On the succinct representation of equivalence classes
Algorithmica | 2017-10-09 | Paper |
Speeding up the four Russians algorithm by about one more logarithmic factor
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Faster core-set constructions and data stream algorithms in fixed dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Towards in-place geometric algorithms and data structures
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
A fully dynamic algorithm for planar
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Persistent predecessor search and orthogonal point location on the word RAM | 2017-09-29 | Paper |
| All-pairs shortest paths in geometric intersection graphs | 2017-09-22 | Paper |
Succinct indices for path minimum, with applications
Algorithmica | 2017-07-07 | Paper |
How to morph planar graph drawings
SIAM Journal on Computing | 2017-05-30 | Paper |
On guarding orthogonal polygons with sliding cameras
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
Discrete & Computational Geometry | 2016-12-20 | Paper |
Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
Discrete & Computational Geometry | 2016-12-20 | Paper |
Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees
Information Processing Letters | 2016-06-09 | Paper |
Multidimensional range selection
Algorithms and Computation | 2016-01-11 | Paper |
Drawing partially embedded and simultaneously planar graphs
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM | 2015-09-20 | Paper |
Linear-space data structures for range minority query in arrays
Algorithmica | 2015-09-02 | Paper |
Clustered Integer 3SUM via Additive Combinatorics
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Fast string dictionary lookup with one error
Combinatorial Pattern Matching | 2015-08-20 | Paper |
| scientific article; zbMATH DE number 6472622 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469174 (Why is no real title available?) | 2015-08-03 | Paper |
Finding median in read-only memory on integer input
Theoretical Computer Science | 2015-04-29 | Paper |
Geometric red-blue set cover for unit squares and related problems
Computational Geometry | 2015-04-27 | Paper |
Linear-space data structures for range mode query in arrays
Theory of Computing Systems | 2015-02-05 | Paper |
Drawing partially embedded and simultaneously planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Persistent predecessor search and orthogonal point location on the word RAM
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms | 2014-11-18 | Paper |
On the bichromatic k-set problem
ACM Transactions on Algorithms | 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
Algorithms - ESA 2014 | 2014-10-08 | Paper |
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
| scientific article; zbMATH DE number 6321467 (Why is no real title available?) | 2014-07-25 | Paper |
On hardness of jumbled indexing
Automata, Languages, and Programming | 2014-07-01 | Paper |
Deterministic rectangle enclosure and offline dominance reporting on the RAM
Automata, Languages, and Programming | 2014-07-01 | Paper |
| scientific article; zbMATH DE number 6297698 (Why is no real title available?) | 2014-05-22 | Paper |
Maximum-weight planar boxes in \(O(n^2)\) time (and better)
Information Processing Letters | 2014-04-30 | Paper |
Optimal partition trees
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Stochastic minimum spanning trees in Euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Exact algorithms and APX-hardness results for geometric packing and covering problems
Computational Geometry | 2014-01-22 | Paper |
Closest pair and the post office problem for stochastic points
Computational Geometry | 2014-01-22 | Paper |
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Computational Geometry | 2014-01-22 | Paper |
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
Algorithms and Computation | 2014-01-14 | Paper |
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
Graph Drawing | 2013-12-20 | Paper |
Quake heaps: a simple alternative to Fibonacci heaps
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Smart-grid electricity allocation via strip packing with slicing
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Self-approaching graphs
Graph Drawing | 2013-04-03 | Paper |
Approximation algorithms for maximum independent set of pseudo-disks
Discrete & Computational Geometry | 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
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On levels in arrangements of surfaces in three dimensions
Discrete & Computational Geometry | 2012-08-13 | Paper |
Optimal partition trees
Discrete & Computational Geometry | 2012-05-22 | Paper |
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Closest pair and the post office problem for stochastic points
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Dynamic connectivity: connecting to networks and geometry
SIAM Journal on Computing | 2011-07-29 | Paper |
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing | 2010-11-04 | Paper |
Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
Computational Geometry | 2010-09-02 | Paper |
All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764826 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5764817 (Why is no real title available?) | 2010-08-06 | Paper |
Dynamic subgraph connectivity with geometric applications
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM | 2010-07-14 | Paper |
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
SIAM Journal on Computing | 2010-04-29 | Paper |
Well-separated pair decomposition in linear time?
Information Processing Letters | 2010-04-19 | Paper |
An improved algorithm for online unit clustering
Algorithmica | 2009-11-25 | Paper |
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry | 2009-11-16 | Paper |
A randomized algorithm for online unit clustering
Theory of Computing Systems | 2009-09-02 | Paper |
Dynamic coresets
Discrete & Computational Geometry | 2009-08-27 | Paper |
A note on maximum independent sets in rectangle intersection graphs
Information Processing Letters | 2009-07-09 | Paper |
On approximate range counting and depth
Discrete & Computational Geometry | 2009-07-06 | Paper |
Dynamic ham-sandwich cuts in the plane
Computational Geometry | 2009-06-18 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Dynamic connectivity for axis-parallel rectangles
Algorithmica | 2009-05-06 | Paper |
Drawing \(K_{2,n}\): A lower bound
Information Processing Letters | 2009-03-23 | Paper |
An Improved Algorithm for Online Unit Clustering
Lecture Notes in Computer Science | 2009-03-06 | Paper |
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On levels in arrangements of curves, iii
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On approximate range counting and depth
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5507843 (Why is no real title available?) | 2009-02-12 | Paper |
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485434 (Why is no real title available?) | 2009-01-05 | Paper |
All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
Algorithmica | 2008-04-03 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Dynamic Connectivity for Axis-Parallel Rectangles
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A Randomized Algorithm for Online Unit Clustering
Approximation and Online Algorithms | 2008-02-21 | Paper |
Dynamic Subgraph Connectivity with Geometric Applications
SIAM Journal on Computing | 2007-06-26 | Paper |
Multi-pass geometric algorithms
Discrete & Computational Geometry | 2007-02-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Three problems about simple polygons
Computational Geometry | 2006-10-25 | Paper |
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry | 2006-10-10 | Paper |
GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry | 2006-05-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Low-Dimensional Linear Programming with Violations
SIAM Journal on Computing | 2005-09-16 | Paper |
On levels in arrangements of curves. II: A simple inequality and its consequences
Discrete & Computational Geometry | 2005-08-17 | Paper |
A note on 3D orthogonal graph drawing
Discrete Applied Mathematics | 2005-08-17 | Paper |
ON ENUMERATING AND SELECTING DISTANCES
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Balanced vertex-orderings of graphs
Discrete Applied Mathematics | 2005-05-04 | Paper |
Fun-Sort -- or the chaos of unordered binary search
Discrete Applied Mathematics | 2005-02-23 | Paper |
Euclidean bounded-degree spanning tree ratios
Discrete & Computational Geometry | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2119699 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119700 (Why is no real title available?) | 2004-11-29 | Paper |
APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
On levels in arrangements of curves
Discrete & Computational Geometry | 2003-08-21 | Paper |
A fully dynamic algorithm for planar width
Discrete & Computational Geometry | 2003-08-21 | Paper |
Semi-Online Maintenance of Geometric Optima and Measures
SIAM Journal on Computing | 2003-06-19 | Paper |
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms | 2003-05-27 | Paper |
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Computational Geometry | 2003-03-10 | Paper |
| scientific article; zbMATH DE number 1759407 (Why is no real title available?) | 2002-10-13 | Paper |
Fly cheaply: On the minimum fuel consumption problem
Journal of Algorithms | 2002-07-08 | Paper |
Reporting curve segment intersections using restricted predicates
Computational Geometry | 2001-03-25 | Paper |
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase(\le k)-Levels in Three Dimensions
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1305404 (Why is no real title available?) | 2000-06-29 | Paper |
More planar two-center algorithms
Computational Geometry | 2000-01-17 | Paper |
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
Journal of Algorithms | 1998-11-24 | Paper |
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
Discrete & Computational Geometry | 1998-07-27 | Paper |
| scientific article; zbMATH DE number 910884 (Why is no real title available?) | 1996-08-22 | Paper |
