| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| How fast can we play Tetris greedily with rectangular pieces? | 2024-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| Competitive Online Search Trees on Trees | 2023-10-23 | Paper |
| An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. | 2023-09-20 | Paper |
| Worst-Case Efficient Dynamic Geometric Independent Set | 2023-09-20 | Paper |
| Fragile complexity of adaptive algorithms | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875625 | 2023-02-03 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075805 | 2022-05-11 | Paper |
| Fragile complexity of adaptive algorithms | 2022-05-10 | Paper |
| Dynamic Trees with Almost-Optimal Access Cost | 2021-08-04 | Paper |
| Belga B-trees | 2021-08-03 | Paper |
| Competitive Online Search Trees on Trees | 2021-02-02 | Paper |
| Subquadratic Encodings for Point Configurations | 2020-08-18 | Paper |
| Spanning properties of Theta-Theta-6 | 2020-04-30 | Paper |
| Subquadratic encodings for point configurations | 2020-01-13 | Paper |
| Belga B-trees | 2019-10-22 | Paper |
| The Complexity of Order Type Isomorphism | 2019-06-20 | Paper |
| Subquadratic algorithms for algebraic 3SUM | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743421 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743423 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633860 | 2019-05-06 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580085 | 2018-08-13 | Paper |
| Weighted dynamic finger in binary search trees | 2018-07-16 | Paper |
| Solving k-SUM using few linear queries | 2018-03-02 | Paper |
| Incremental Voronoi diagrams | 2018-01-30 | Paper |
| Incremental Voronoi diagrams | 2018-01-11 | Paper |
| Proximate planar point location | 2017-09-29 | Paper |
| Geodesic ham-sandwich cuts | 2017-09-29 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| Searching edges in the overlap of two plane graphs | 2017-09-22 | Paper |
| Necklaces, convolutions, and \(X+Y\) | 2017-03-27 | Paper |
| A Linear Potential Function for Pairing Heaps | 2017-02-01 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2016-12-21 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2015-09-11 | Paper |
| Retroactive data structures | 2015-09-02 | Paper |
| Range Minimum Query Indexes in Higher Dimensions | 2015-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501269 | 2015-08-03 | Paper |
| Worst-case optimal tree layout in external memory | 2015-07-10 | Paper |
| Cache-Oblivious Persistence | 2014-10-08 | Paper |
| Entropy, triangulation, and point location in planar subdivisions | 2014-09-09 | Paper |
| Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417721 | 2014-05-22 | Paper |
| A static optimality transformation with applications to planar point location | 2014-03-24 | Paper |
| Encodings for Range Selection and Top-k Queries | 2013-09-17 | Paper |
| In Pursuit of the Dynamic Optimality Conjecture | 2013-09-13 | Paper |
| Combining Binary Search Trees | 2013-08-06 | Paper |
| On the hierarchy of distribution-sensitive properties for data structures | 2013-08-05 | Paper |
| Efficient reconfiguration of lattice-based modular robots | 2013-07-31 | Paper |
| PROXIMITY GRAPHS: E, δ, Δ, χ AND ω | 2013-06-24 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| A priority queue with the time-finger property | 2013-01-18 | Paper |
| Meshes Preserving Minimum Feature Size | 2013-01-07 | Paper |
| Oja centers and centers of gravity | 2012-12-04 | Paper |
| Continuous blooming of convex polyhedra | 2012-01-24 | Paper |
| A Unifying Property for Distribution-Sensitive Priority Queues | 2012-01-13 | Paper |
| Encoding 2D range maximum queries | 2011-12-16 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| The cost of cache-oblivious searching | 2011-09-20 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Unit-Time Predecessor Queries on Massive Data Sets | 2010-12-09 | Paper |
| Mergeable Dictionaries | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579416 | 2010-08-06 | Paper |
| GRID VERTEX-UNFOLDING ORTHOSTACKS | 2010-07-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Minimal Locked Trees | 2009-10-20 | Paper |
| Wrapping spheres with flat paper | 2009-06-30 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| The Complexity of Diffuse Reflections in a Simple Polygon | 2008-09-18 | Paper |
| Dynamic Optimality—Almost | 2008-03-28 | Paper |
| Grid Vertex-Unfolding Orthostacks | 2008-03-18 | Paper |
| Necklaces, Convolutions, and X + Y | 2008-03-11 | Paper |
| A unified access bound on comparison-based dynamic dictionaries | 2007-09-18 | Paper |
| Geodesic ham-sandwich cuts | 2007-04-26 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| Key-independent optimality | 2005-05-13 | Paper |
| Queaps | 2005-05-13 | Paper |
| A locality-preserving cache-oblivious dynamic dictionary | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828912 | 2004-11-29 | Paper |
| Expected asymptotically optimal planar point location | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044350 | 2004-08-11 | Paper |
| Space-efficient planar convex hull algorithms | 2004-08-10 | Paper |
| Proximate point searching | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425937 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425955 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547801 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768317 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768341 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721966 | 2001-07-11 | Paper |
