| Publication | Date of Publication | Type |
|---|
| Sorting under partial (interval order) information | 2024-11-22 | Paper |
| On the power of bounded asynchrony: convergence by autonomous robots with limited visibility | 2024-09-10 | Paper |
| Preprocessing imprecise points for the Pareto front | 2024-07-19 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | Paper |
| Minimum Scan Cover and Variants: Theory and Experiments | 2024-04-14 | Paper |
| Separating Bounded and Unbounded Asynchrony for Autonomous Robots | 2024-03-26 | Paper |
| Forming tile shapes with simple robots | 2024-02-09 | Paper |
| Dots & Polygons (Media Exposition) | 2023-11-02 | Paper |
| Designing art galleries (Media Exposition) | 2023-11-02 | Paper |
| Turning machines | 2023-10-27 | Paper |
| Dots & Boxes Is PSPACE-Complete | 2023-08-08 | Paper |
| Minimum scan cover and variants -- theory and experiments | 2023-06-23 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5057207 | 2022-12-15 | Paper |
| Convex partial transversals of planar regions | 2022-07-21 | Paper |
| Preprocessing Ambiguous Imprecise Points | 2022-07-18 | Paper |
| Embedding ray intersection graphs and global curve simplification | 2022-07-01 | Paper |
| Fragile complexity of comparison-based algorithms | 2022-05-11 | Paper |
| Global Curve Simplification | 2022-05-11 | Paper |
| Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings | 2021-11-15 | Paper |
| Shape recognition by a finite automaton robot | 2021-08-04 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| Non-crossing geometric Steiner arborescences | 2020-11-25 | Paper |
| An optimal algorithm to compute the inverse beacon attraction region | 2020-08-18 | Paper |
| Self-approaching paths in simple polygons | 2020-04-22 | Paper |
| Most vital segment barriers | 2020-01-16 | Paper |
| Approximating \((k,\ell)\)-center clustering for curves | 2019-10-15 | Paper |
| Theoretical analysis of beaconless geocast protocols in 1D | 2019-09-18 | Paper |
| Region-based approximation algorithms for visibility between imprecise locations | 2019-09-12 | Paper |
| Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) | 2019-05-21 | Paper |
| The painter's problem: covering a grid with colored connected polygons | 2019-02-20 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| Forming tile shapes with simple robots | 2018-11-08 | Paper |
| Self-approaching paths in simple polygons | 2018-08-13 | Paper |
| Mapping polygons to the grid with small Hausdorff and Fréchet distance | 2018-03-02 | Paper |
| Homotopy measures for representative trajectories | 2018-03-02 | Paper |
| On the complexity of minimum-link path problems | 2018-01-30 | Paper |
| Trajectory grouping structure under geodesic distance | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978407 | 2017-04-24 | Paper |
| Gabriel triangulations and angle-monotone graphs: local routing and recognition | 2017-02-21 | Paper |
| On minimizing crossings in storyline visualizations | 2017-02-10 | Paper |
| Optimizing airspace closure with respect to politicians' egos | 2015-05-26 | Paper |
| Scandinavian thins on top of cake: new and improved algorithms for stacking and packing | 2015-01-21 | Paper |
| Beacon-based algorithms for geometric routing | 2013-08-12 | Paper |
| Simple wriggling is hard unless you are a fat hippo | 2012-12-06 | Paper |
