Guarding Polyominoes Under k-Hop Visibility.
Algorithmica, April, 2025
Minimum k-Hop Dominating Sets in Grid Graphs.
CoRR, 2023
On Half Guarding Polygons.
Proceedings of the Combinatorial Optimization and Applications, 2023
On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
On the Complexity of Half-Guarding Monotone Polygons.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022
On Vertex Guarding Staircase Polygons.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022
Half-Guarding Weakly-Visible Polygons and Terrains.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Terrain Visibility Graphs: Persistence Is Not Enough.
Proceedings of the 36th International Symposium on Computational Geometry, 2020
The VC-dimension of visibility on the boundary of monotone polygons.
Comput. Geom., 2019
A Note on Guarding Staircase Polygons.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019
Guarding Monotone Polygons with Half-Guards.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
The VC-Dimension of Visibility on the Boundary of a Simple Polygon.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
A Characterization of Visibility Graphs for Pseudo-polygons.
Proceedings of the Algorithms - ESA 2015, 2015
Guarding Terrains via Local Search.
J. Comput. Geom., 2014
On the VC-Dimension of Visibility in Monotone Polygons.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Approximate Guarding of Monotone and Rectilinear Polygons.
Algorithmica, 2013
On Clustering to Minimize the Sum of Radii.
SIAM J. Comput., 2012
The Complexity of Guarding Monotone Polygons.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
Terrain Guarding is NP-Hard.
SIAM J. Comput., 2011
Improved Approximations for Guarding 1.5-Dimensional Terrains.
Algorithmica, 2011
On Metric Clustering to Minimize the Sum of Radii.
Algorithmica, 2010
The Complexity of Guarding Terrains
CoRR, 2009
Quasi-Polynomial Time Approximation Schemes for Target Tracking
CoRR, 2009
An Approximation Scheme for Terrain Guarding.
Proceedings of the Approximation, 2009