| Publication | Date of Publication | Type |
|---|
Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
Graphs and Combinatorics | 2025-01-13 | Paper |
Connectivity and stochastic robustness of synchronized multi-drone systems
Discrete Applied Mathematics | 2024-04-02 | Paper |
Separability, boxicity, and partial orders
Order | 2023-12-19 | Paper |
Extremal problems on ray sensor configurations
Discrete Applied Mathematics | 2023-04-17 | Paper |
| Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards | 2022-08-26 | Paper |
| Failure and communication in a synchronized multi-drone system | 2022-03-24 | Paper |
On the robustness of a synchronized multi-robot system
Journal of Combinatorial Optimization | 2020-04-27 | Paper |
Permutations in two dimensions that maximally separate neighbors
The Electronic Journal of Combinatorics | 2019-04-30 | Paper |
Permutations in two dimensions that maximally separate neighbors
The Electronic Journal of Combinatorics | 2019-04-30 | Paper |
Computing the \(k\)-resilience of a synchronized multi-robot system
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
| scientific article; zbMATH DE number 6876078 (Why is no real title available?) | 2018-05-29 | Paper |
On the barrier graph of an arrangement of ray sensors
Discrete Applied Mathematics | 2017-05-12 | Paper |
| Resilience of a synchronized multi-agent system | 2016-04-29 | Paper |
Embedding the double circle in a square grid of minimum size
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
| Drawing the double circle on a grid of minimum size | 2013-05-29 | Paper |
Fitting a two-joint orthogonal chain to a point set
Computational Geometry | 2011-01-21 | Paper |
Hausdorff approximation of 3D convex polytopes
Information Processing Letters | 2010-04-19 | Paper |
On finding a widest empty 1-corner corridor
Information Processing Letters | 2010-01-18 | Paper |
Rectilinear Approximation of a Set of Points in the Plane
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Weighted Rectilinear Approximation of Points in the Plane
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
Locating an obnoxious plane
European Journal of Operational Research | 2006-06-30 | Paper |
Hausdorff approximation of convex polygons
Computational Geometry | 2005-11-07 | Paper |
FAST PURSUIT OF MOBILE NODES USING TPR TREES
International Journal of Foundations of Computer Science | 2005-04-18 | Paper |
Linear time approximation of 3D convex polytopes
Computational Geometry | 2003-03-10 | Paper |
EFFICIENT APPROXIMATION OF CONVEX POLYGONS
International Journal of Computational Geometry & Applications | 2001-12-09 | Paper |
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
Journal of Algorithms | 2000-02-06 | Paper |
A special case of Mahler's conjecture
Discrete & Computational Geometry | 1999-01-13 | Paper |
On computing connected components of line segments
IEEE Transactions on Computers | 1995-01-01 | Paper |
GENERALIZED INTERSECTION SEARCHING PROBLEMS
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
Rainbow ortho-convex 4-sets in k-colored point sets
(available as arXiv preprint) | N/A | Paper |
