| Publication | Date of Publication | Type |
|---|
Sorting under partial (interval order) information
Journal of Computational Geometry | 2024-11-22 | Paper |
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
Distributed Computing | 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
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Separating Bounded and Unbounded Asynchrony for Autonomous Robots
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Forming tile shapes with simple robots
Natural Computing | 2024-02-09 | Paper |
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology | 2023-12-16 | Paper |
Dots & Polygons (Media Exposition)
(available as arXiv preprint) | 2023-11-02 | Paper |
| Designing art galleries (Media Exposition) | 2023-11-02 | Paper |
| Turning machines | 2023-10-27 | Paper |
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Dots & Boxes Is PSPACE-Complete
(available as arXiv preprint) | 2023-08-08 | Paper |
Minimum scan cover and variants -- theory and experiments
(available as arXiv preprint) | 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 |
scientific article; zbMATH DE number 7633284 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-15 | Paper |
Convex partial transversals of planar regions
(available as arXiv preprint) | 2022-07-21 | Paper |
Preprocessing Ambiguous Imprecise Points
(available as arXiv preprint) | 2022-07-18 | Paper |
Embedding ray intersection graphs and global curve simplification
(available as arXiv preprint) | 2022-07-01 | Paper |
Fragile complexity of comparison-based algorithms
(available as arXiv preprint) | 2022-05-11 | Paper |
Global Curve Simplification
(available as arXiv preprint) | 2022-05-11 | Paper |
Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings
Lecture Notes in Computer Science | 2021-11-15 | Paper |
| Shape recognition by a finite automaton robot | 2021-08-04 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
| Non-crossing geometric Steiner arborescences | 2020-11-25 | Paper |
An optimal algorithm to compute the inverse beacon attraction region
(available as arXiv preprint) | 2020-08-18 | Paper |
Self-approaching paths in simple polygons
Computational Geometry | 2020-04-22 | Paper |
Most vital segment barriers
(available as arXiv preprint) | 2020-01-16 | Paper |
Approximating \((k,\ell)\)-center clustering for curves
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Theoretical analysis of beaconless geocast protocols in 1D
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Region-based approximation algorithms for visibility between imprecise locations
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
Algorithmica | 2019-05-21 | Paper |
The painter's problem: covering a grid with colored connected polygons
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 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
(available as arXiv preprint) | 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 |
scientific article; zbMATH DE number 6707504 (Why is no real title available?)
(available as arXiv preprint) | 2017-04-24 | Paper |
Gabriel triangulations and angle-monotone graphs: local routing and recognition
Lecture Notes in Computer Science | 2017-02-21 | Paper |
On minimizing crossings in storyline visualizations
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Optimizing airspace closure with respect to politicians' egos
Theoretical Computer Science | 2015-05-26 | Paper |
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Theory of Computing Systems | 2015-01-21 | Paper |
Beacon-based algorithms for geometric routing
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Simple wriggling is hard unless you are a fat hippo
Theory of Computing Systems | 2012-12-06 | Paper |
