| Publication | Date of Publication | Type |
|---|
| The complexity of order type isomorphism | 2024-10-25 | Paper |
| Deep cliques in point sets | 2024-10-25 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| Competitive Online Search Trees on Trees | 2023-10-23 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Fragile complexity of adaptive algorithms | 2023-03-22 | 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 |
| An optimal algorithm to compute the inverse beacon attraction region | 2020-08-18 | Paper |
| Subquadratic Encodings for Point Configurations | 2020-08-18 | Paper |
| Self-approaching paths in simple polygons | 2020-04-22 | Paper |
| Polyhedral characterization of reversible hinged dissections | 2020-04-03 | Paper |
| Which convex polyhedra can be made by gluing regular hexagons? | 2020-04-03 | Paper |
| Cookie clicker | 2020-04-03 | Paper |
| Subquadratic encodings for point configurations | 2020-01-13 | Paper |
| Belga B-trees | 2019-10-22 | Paper |
| Pole Dancing: 3D Morphs for Tree Drawings | 2019-09-16 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | 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/Q5743423 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633837 | 2019-05-06 | Paper |
| Dynamic graph coloring | 2019-04-25 | Paper |
| Bottleneck detour tree of points on a path | 2019-03-20 | Paper |
| Pole dancing: 3D morphs for tree drawings | 2019-02-15 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Threes!, Fives, 1024!, and 2048 are hard | 2018-11-23 | Paper |
| Interlocked open linkages with few joints | 2018-11-23 | Paper |
| On the diameter of tree associahedra | 2018-10-30 | Paper |
| Pole Dancing: 3D Morphs for Tree Drawings | 2018-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580085 | 2018-08-13 | Paper |
| Self-approaching paths in simple polygons | 2018-08-13 | Paper |
| Weighted dynamic finger in binary search trees | 2018-07-16 | Paper |
| The dual diameter of triangulations | 2018-02-19 | Paper |
| Incremental Voronoi diagrams | 2018-01-30 | Paper |
| A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino | 2018-01-30 | Paper |
| Induced Ramsey-type results and binary predicates for point sets | 2018-01-18 | Paper |
| Incremental Voronoi diagrams | 2018-01-11 | Paper |
| Induced Ramsey-type results and binary predicates for point sets | 2017-10-24 | Paper |
| Optimal detection of intersections between convex polyhedra | 2017-10-05 | Paper |
| On the complexity of halfspace area queries | 2017-09-29 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| Geodesic ham-sandwich cuts | 2017-09-29 | Paper |
| Proximate planar point location | 2017-09-29 | Paper |
| Searching edges in the overlap of two plane graphs | 2017-09-22 | Paper |
| Dynamic graph coloring | 2017-09-22 | Paper |
| Threes!, Fives, 1024!, and 2048 are Hard | 2017-07-17 | Paper |
| Reconstructing Point Set Order Types from Radial Orderings | 2017-05-19 | Paper |
| Necklaces, convolutions, and \(X+Y\) | 2017-03-27 | Paper |
| Approximating the average stretch factor of geometric graphs | 2017-03-09 | Paper |
| Reversible Nets of Polyhedra | 2017-02-01 | Paper |
| Bust-a-Move/Puzzle Bobble Is NP-complete | 2017-02-01 | Paper |
| Space-Time Trade-offs for Stack-Based Algorithms | 2017-01-30 | Paper |
| A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters | 2016-12-21 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2016-12-21 | Paper |
| The four bars problem | 2016-09-26 | Paper |
| Optimizing some constructions with bars: new geometric knapsack problems | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949117 | 2015-10-07 | Paper |
| Reconstructing Point Set Order Typesfrom Radial Orderings | 2015-09-11 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2015-09-11 | Paper |
| Space-time trade-offs for stack-based algorithms | 2015-09-02 | Paper |
| Retroactive data structures | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501269 | 2015-08-03 | Paper |
| Bichromatic compatible matchings | 2015-07-27 | Paper |
| Worst-case optimal tree layout in external memory | 2015-07-10 | Paper |
| Generalized river crossing problems | 2015-05-29 | Paper |
| Isoperimetric enclosures | 2015-05-22 | Paper |
| Bichromatic compatible matchings | 2015-02-17 | Paper |
| Entropy, triangulation, and point location in planar subdivisions | 2014-09-09 | Paper |
| Computing a visibility polygon using few variables | 2014-08-13 | Paper |
| Online graph exploration algorithms for cycles and trees by multiple searchers | 2014-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417721 | 2014-05-22 | Paper |
| Optimal algorithms for constrained 1-center problems | 2014-03-31 | Paper |
| A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters | 2014-03-31 | Paper |
| A center transversal theorem for hyperplanes and applications to graph drawing | 2014-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747414 | 2014-02-14 | Paper |
| Triangulating and guarding realistic polygons | 2014-01-22 | Paper |
| Draining a polygon-or-rolling a ball out of a polygon | 2014-01-22 | Paper |
| The clique problem in ray intersection graphs | 2013-11-06 | Paper |
| Helly numbers of polyominoes | 2013-09-26 | Paper |
| Thirty essays on geometric graph theory | 2013-09-25 | Paper |
| De-amortizing binary search trees | 2013-08-12 | Paper |
| Coloring hypergraphs induced by dynamic point sets and bottomless rectangles | 2013-08-12 | Paper |
| Combining binary search trees | 2013-08-06 | Paper |
| A Polynomial Bound for Untangling Geometric Planar Graphs | 2013-06-28 | Paper |
| Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)} | 2013-06-24 | Paper |
| A center transversal theorem for hyperplanes and applications to graph drawing | 2013-03-18 | Paper |
| Stable roommates spanner | 2012-12-04 | Paper |
| Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs | 2012-12-04 | Paper |
| Oja centers and centers of gravity | 2012-12-04 | Paper |
| Non-crossing matchings of points with geometric objects | 2012-10-12 | Paper |
| The Clique Problem in Ray Intersection Graphs | 2012-09-25 | Paper |
| Algorithms and complexity of generalized river crossing problems | 2012-08-22 | Paper |
| Algorithmic folding complexity | 2012-01-24 | Paper |
| Continuous blooming of convex polyhedra | 2012-01-24 | Paper |
| Colorful strips | 2012-01-24 | Paper |
| Every large point set contains many collinear points or an empty pentagon | 2012-01-24 | Paper |
| Computing the visibility polygon using few variables | 2011-12-16 | Paper |
| Determination of all tessellation polyhedra with regular polygonal faces | 2011-11-11 | Paper |
| Common unfoldings of polyominoes and polycubes | 2011-11-11 | Paper |
| Computing signed permutations of polygons | 2011-06-17 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Realistic reconfiguration of crystalline (and telecube) robots | 2011-03-02 | Paper |
| Approximating the average stretch factor of geometric graphs | 2010-12-09 | Paper |
| Decomposition of multiple coverings into more parts | 2010-11-08 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| Near-entropy hotlink assignments | 2010-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579416 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579430 | 2010-08-06 | Paper |
| Randomized optimization: a probabilistic analysis | 2010-08-02 | Paper |
| Grid vertex-unfolding orthostacks | 2010-07-27 | Paper |
| Confluently persistent tries for efficient version control | 2010-05-19 | Paper |
| Colorful strips | 2010-04-27 | Paper |
| Matching points with things | 2010-04-27 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries. | 2010-04-20 | Paper |
| Sigma-local graphs | 2010-02-26 | Paper |
| Pricing geometric transportation networks | 2010-02-12 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Algorithmic folding complexity | 2009-12-17 | Paper |
| A polynomial bound for untangling geometric planar graphs | 2009-12-14 | Paper |
| Facility location problems in the plane based on reverse nearest neighbor queries | 2009-11-17 | Paper |
| Highway hull revisited | 2009-11-16 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Linear reconfiguration of cube-style modular robots | 2009-07-27 | Paper |
| Wrapping spheres with flat paper | 2009-06-30 | Paper |
| Small weak epsilon-nets | 2009-06-18 | Paper |
| Dynamic ham-sandwich cuts in the plane | 2009-06-18 | Paper |
| Coloring geometric range spaces | 2009-05-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| Improved approximation bounds for edge dominating set in dense graphs | 2009-03-17 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| Empty region graphs | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves | 2009-01-29 | Paper |
| Optimal location of transportation devices | 2008-09-19 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Confluently Persistent Tries for Efficient Version Control | 2008-07-15 | Paper |
| Computing a high depth point in the plane | 2008-05-28 | Paper |
| Linear Reconfiguration of Cube-Style Modular Robots | 2008-05-27 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| Coloring Geometric Range Spaces | 2008-04-15 | Paper |
| Dynamic hotlinks | 2008-04-03 | Paper |
| Grid Vertex-Unfolding Orthostacks | 2008-03-18 | Paper |
| Weighted Ham-Sandwich Cuts | 2008-03-18 | Paper |
| Necklaces, Convolutions, and X + Y | 2008-03-11 | Paper |
| Near-Entropy Hotlink Assignments | 2008-03-11 | Paper |
| Improved Approximation Bounds for Edge Dominating Set in Dense Graphs | 2008-02-21 | Paper |
| Local properties of geometric graphs | 2007-10-19 | Paper |
| Edge-unfolding nested polyhedral bands | 2007-10-19 | Paper |
| Efficient many-to-Many point matching in one dimension | 2007-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3445222 | 2007-06-08 | Paper |
| Geodesic ham-sandwich cuts | 2007-04-26 | Paper |
| Morpion solitaire | 2007-02-13 | Paper |
| Juggling with pattern matching | 2007-02-13 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Geometric restrictions on producible polygonal protein chains | 2006-06-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Covering things with things | 2005-08-02 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| Queaps | 2005-05-13 | Paper |
| Designing small keyboards is hard | 2005-04-06 | Paper |
| Asymmetric communication protocols via hotlink assignments | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736844 | 2004-08-11 | Paper |
| Proximate point searching | 2004-08-06 | Paper |
| The complexity of hyperplane depth in the plane | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425955 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418636 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411399 | 2003-07-08 | Paper |
| Interlocked open and closed linkages with few joints. | 2003-07-01 | Paper |
| Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. | 2003-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796193 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547801 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952599 | 2000-05-10 | Paper |
