| Publication | Date of Publication | Type |
|---|
| On the power of bounded asynchrony: convergence by autonomous robots with limited visibility | 2024-09-10 | Paper |
| A frequency-competitive query strategy for maintaining low collision potential among moving entities | 2024-07-19 | Paper |
| Minimizing query frequency to bound congestion potential for moving entities at a fixed target time | 2024-05-29 | Paper |
| Separating Bounded and Unbounded Asynchrony for Autonomous Robots | 2024-03-26 | Paper |
| Approximate majority analyses using tri-molecular chemical reaction networks | 2024-02-09 | Paper |
| Computing common tangents without a separating line | 2022-12-16 | Paper |
| Minimizing Interference Potential Among Moving Entities | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645644 | 2019-01-10 | Paper |
| Pseudo approximation algorithms, with applications to optimal motion planning | 2018-11-23 | Paper |
| Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons | 2018-11-23 | Paper |
| Swapping colored tokens on graphs | 2018-05-17 | Paper |
| Simplifying analyses of chemical reaction networks for approximate majority | 2018-02-02 | Paper |
| Curvature-bounded traversals of narrow corridors | 2017-10-20 | Paper |
| Kinetic collision detection for simple polygons | 2017-09-29 | Paper |
| Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals | 2017-05-05 | Paper |
| Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors | 2016-12-19 | Paper |
| Minimizing Co-location Potential of Moving Entities | 2016-10-28 | Paper |
| Swapping Colored Tokens on Graphs | 2015-10-30 | Paper |
| On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case | 2015-09-14 | Paper |
| Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501368 | 2015-08-03 | Paper |
| A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS | 2015-04-22 | Paper |
| An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries | 2015-04-16 | Paper |
| Competitive query strategies for minimising the ply of the potential locations of moving points | 2015-02-17 | Paper |
| Computational aspects of M. C. Escher's ribbon patterns | 2015-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934670 | 2014-12-18 | Paper |
| $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability | 2014-10-14 | Paper |
| Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience | 2014-09-18 | Paper |
| On the completeness of a generalized matching problem | 2014-03-14 | Paper |
| Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 | 2013-09-13 | Paper |
| Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems | 2013-08-12 | Paper |
| Input-Thrifty Extrema Testing | 2011-12-16 | Paper |
| Can Nearest Neighbor Searching Be Simple and Always Fast? | 2011-09-16 | Paper |
| Competitive Search in Symmetric Trees | 2011-08-12 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Linear-time certifying algorithms for near-graphical sequences | 2009-12-15 | Paper |
| Finding Nearest Larger Neighbors | 2009-11-12 | Paper |
| Hyperbolic Dovetailing | 2009-10-29 | Paper |
| The projection median of a set of points | 2009-06-18 | Paper |
| Finding curvature-constrained paths that avoid polygonal obstacles | 2009-02-12 | Paper |
| A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths | 2009-01-29 | Paper |
| BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES | 2008-08-26 | Paper |
| On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks | 2008-03-06 | Paper |
| On the Spanning Ratio of Gabriel Graphs and beta-Skeletons | 2007-05-22 | Paper |
| THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION | 2006-09-04 | Paper |
| Equitable subdivisions within polygonal regions | 2006-04-28 | Paper |
| COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN | 2006-03-13 | Paper |
| Restructuring ordered binary trees | 2004-10-01 | Paper |
| KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044349 | 2004-08-11 | Paper |
| Pseudo approximation algorithms with applications to optimal motion planning | 2004-03-11 | Paper |
| Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces | 2003-10-14 | Paper |
| Tight degree bounds for pseudo-triangulations of points | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547811 | 2002-08-21 | Paper |
| Efficient algorithms for centers and medians in interval and circular-arc graphs | 2002-07-01 | Paper |
| Right-triangulated irregular networks | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753927 | 2001-11-11 | Paper |
| Generalizing ham sandwich cuts to equitable subdivisions | 2001-08-16 | Paper |
| COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952654 | 2000-05-10 | Paper |
| Unit disk graph recognition is NP-hard | 1998-04-13 | Paper |
| Determining bar-representability for ordered weighted graphs | 1996-11-04 | Paper |
| Rounding in symmetric matrices and undirected graphs | 1996-10-09 | Paper |
| Parallel construction of binary trees with near optimal weighted path length | 1996-02-20 | Paper |
| A compact piecewise-linear Voronoi diagram for convex sites in the plane | 1996-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327373 | 1995-04-05 | Paper |
| Computing the intersection-depth to polyhedra | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038707 | 1993-05-18 | Paper |
| Algorithms for Degree Constrained Graph Factors of Minimum Deficiency | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028897 | 1993-03-28 | Paper |
| Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures | 1992-09-26 | Paper |
| Quantitative Steinitz's theorems with applications to multifingered grasping | 1992-06-28 | Paper |
| A simple existence criterion for \((g<f)\)-factors | 1990-01-01 | Paper |
| Parallel algorithms for fractional and maximal independent sets in planar graphs | 1990-01-01 | Paper |
| Parallel recognition of complement reducible graphs and cotree construction | 1990-01-01 | Paper |
| Parallel construction of subdivision hierarchies | 1989-01-01 | Paper |
| Establishing order in planar subdivisions | 1988-01-01 | Paper |
| Addition requirements for matrix and transposed matrix products | 1988-01-01 | Paper |
| On Restricted Two-Factors | 1988-01-01 | Paper |
| A note on f-factors in directed and undirected multigraphs | 1986-01-01 | Paper |
| The Ultimate Planar Convex Hull Algorithm? | 1986-01-01 | Paper |
| Packings by Complete Bipartite Graphs | 1986-01-01 | Paper |
| Alphabetic Minimax Trees | 1985-01-01 | Paper |
| Some Graph-Colouring Theorems with Applications to Generalized Connection Networks | 1985-01-01 | Paper |
| A linear algorithm for determining the separation of convex polyhedra | 1985-01-01 | Paper |
| Upper bounds for sorting integers on random access machines | 1984-01-01 | Paper |
| Packings by cliques and by finite families of graphs | 1984-01-01 | Paper |
| Fast detection of polyhedral intersection | 1983-01-01 | Paper |
| On pseudosimilarity in trees | 1983-01-01 | Paper |
| On the Complexity of General Graph Factor Problems | 1983-01-01 | Paper |
| On the shape of a set of points in the plane | 1983-01-01 | Paper |
| Dynamic Voronoi diagrams | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3697033 | 1983-01-01 | Paper |
| Optimal Search in Planar Subdivisions | 1983-01-01 | Paper |
| Polygonal intersection searching | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323309 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957945 | 1982-01-01 | Paper |
| On generalized matching problems | 1981-01-01 | Paper |
| A time-space tradeoff for sorting on non-oblivious machines | 1981-01-01 | Paper |
| Forest embeddings in regular graphs of large girth | 1981-01-01 | Paper |
| A Unified Lower Bound for Selection and Set Partitioning Problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929772 | 1981-01-01 | Paper |
| A note on Delaunay and optimal triangulations | 1980-01-01 | Paper |
| A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910555 | 1980-01-01 | Paper |
| Addition Requirements for Rational Functions | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131000 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127857 | 1972-01-01 | Paper |
