| Publication | Date of Publication | Type |
|---|
| Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic | 2024-11-28 | Paper |
The complexity of order type isomorphism
Discrete & Computational Geometry | 2024-10-25 | Paper |
| External-memory dictionaries with worst-case update cost | 2024-09-11 | Paper |
| A general technique for searching in implicit sets via function inversion | 2024-05-29 | Paper |
| How fast can we play Tetris greedily with rectangular pieces? | 2024-05-16 | Paper |
| Modular subset sum, dynamic strings, and zero-sum sets | 2024-05-14 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
How fast can we play Tetris greedily with rectangular pieces?
Theoretical Computer Science | 2024-03-05 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
Competitive Online Search Trees on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
(available as arXiv preprint) | 2023-09-20 | Paper |
Worst-Case Efficient Dynamic Geometric Independent Set
(available as arXiv preprint) | 2023-09-20 | Paper |
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7650291 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
| scientific article; zbMATH DE number 7525497 (Why is no real title available?) | 2022-05-11 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
Dynamic Trees with Almost-Optimal Access Cost
(available as arXiv preprint) | 2021-08-04 | Paper |
Belga B-trees
Theory of Computing Systems | 2021-08-03 | Paper |
Belga B-trees
Theory of Computing Systems | 2021-08-03 | Paper |
Competitive Online Search Trees on Trees
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-08-18 | Paper |
Spanning properties of Theta-Theta-6
Graphs and Combinatorics | 2020-04-30 | Paper |
Subquadratic encodings for point configurations
(available as arXiv preprint) | 2020-01-13 | Paper |
Belga B-trees
Computer Science – Theory and Applications | 2019-10-22 | Paper |
The Complexity of Order Type Isomorphism
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Subquadratic algorithms for algebraic 3SUM
Discrete & Computational Geometry | 2019-05-21 | Paper |
| Confluent persistence revisited | 2019-05-10 | Paper |
| Using hashing to solve the dictionary problem | 2019-05-10 | Paper |
| The geometry of binary search trees | 2019-05-06 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Subquadratic algorithms for algebraic generalizations of 3SUM
(available as arXiv preprint) | 2018-08-13 | Paper |
Weighted dynamic finger in binary search trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Solving \(k\)-SUM using few linear queries
(available as arXiv preprint) | 2018-03-02 | Paper |
| Incremental Voronoi diagrams | 2018-01-30 | Paper |
Incremental Voronoi diagrams
Discrete & Computational Geometry | 2018-01-11 | Paper |
Incremental Voronoi diagrams
Discrete & Computational Geometry | 2018-01-11 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Searching edges in the overlap of two plane graphs
(available as arXiv preprint) | 2017-09-22 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
A linear potential function for pairing heaps
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
The power and limitations of static binary search trees with lazy finger
Algorithmica | 2016-12-21 | Paper |
Encoding 2D range maximum queries
Theoretical Computer Science | 2015-12-08 | Paper |
The power and limitations of static binary search trees with lazy finger
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Retroactive data structures
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Range minimum query indexes in higher dimensions
Combinatorial Pattern Matching | 2015-08-20 | Paper |
| scientific article; zbMATH DE number 6469156 (Why is no real title available?) | 2015-08-03 | Paper |
Worst-case optimal tree layout in external memory
Algorithmica | 2015-07-10 | Paper |
Cache-oblivious persistence
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Why some heaps support constant-amortized-time decrease-key operations, and others do not
Automata, Languages, and Programming | 2014-07-01 | Paper |
| scientific article; zbMATH DE number 6297800 (Why is no real title available?) | 2014-05-22 | Paper |
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Encodings for range selection and top-\(k\) queries
Lecture Notes in Computer Science | 2013-09-17 | Paper |
In pursuit of the dynamic optimality conjecture
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Combining binary search trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
On the hierarchy of distribution-sensitive properties for data structures
Acta Informatica | 2013-08-05 | Paper |
Efficient reconfiguration of lattice-based modular robots
Computational Geometry | 2013-07-31 | Paper |
Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
A priority queue with the time-finger property
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Meshes preserving minimum feature size
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Oja centers and centers of gravity
Computational Geometry | 2012-12-04 | Paper |
Continuous blooming of convex polyhedra
Graphs and Combinatorics | 2012-01-24 | Paper |
A unifying property for distribution-sensitive priority queues
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Encoding 2D range maximum queries
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
The cost of cache-oblivious searching
Algorithmica | 2011-09-20 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Unit-time predecessor queries on massive data sets
Algorithms and Computation | 2010-12-09 | Paper |
Mergeable dictionaries
Automata, Languages and Programming | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5764827 (Why is no real title available?) | 2010-08-06 | Paper |
Grid vertex-unfolding orthostacks
International Journal of Computational Geometry & Applications | 2010-07-27 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Minimal Locked Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Wrapping spheres with flat paper
Computational Geometry | 2009-06-30 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
The Complexity of Diffuse Reflections in a Simple Polygon
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Dynamic Optimality—Almost
SIAM Journal on Computing | 2008-03-28 | Paper |
Grid Vertex-Unfolding Orthostacks
Discrete and Computational Geometry | 2008-03-18 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science | 2007-09-18 | Paper |
Geodesic ham-sandwich cuts
Discrete & Computational Geometry | 2007-04-26 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete & Computational Geometry | 2005-08-02 | Paper |
Queaps
Algorithmica | 2005-05-13 | Paper |
Key-independent optimality
Algorithmica | 2005-05-13 | Paper |
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2119641 (Why is no real title available?) | 2004-11-29 | Paper |
Expected asymptotically optimal planar point location
Computational Geometry | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 2086251 (Why is no real title available?) | 2004-08-11 | Paper |
Space-efficient planar convex hull algorithms
Theoretical Computer Science | 2004-08-10 | Paper |
Proximate point searching
Computational Geometry | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1979484 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1979500 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1786508 (Why is no real title available?) | 2002-08-21 | Paper |
| Alternatives to splay trees with \(O(\log n)\) worst-case access times | 2002-01-30 | Paper |
| Optimal planar point location | 2002-01-30 | Paper |
scientific article; zbMATH DE number 1617246 (Why is no real title available?)
(available as arXiv preprint) | 2001-07-11 | Paper |
Vertex Ranking of Degenerate Graphs
(available as arXiv preprint) | N/A | Paper |
