Erik Krohn

Orcid: 0000-0002-5832-8135

According to our database1, Erik Krohn authored at least 25 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Guarding Polyominoes Under k-Hop Visibility.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Minimum k-Hop Dominating Sets in Grid Graphs.
CoRR, 2023

On Half Guarding Polygons.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
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

Opposing Half Guards.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2020
Terrain Visibility Graphs: Persistence Is Not Enough.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
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

2017
Guarding Monotone Polygons with Half-Guards.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2015
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

2014
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

2013
Approximate Guarding of Monotone and Rectilinear Polygons.
Algorithmica, 2013

2012
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

2011
Terrain Guarding is NP-Hard.
SIAM J. Comput., 2011

Improved Approximations for Guarding 1.5-Dimensional Terrains.
Algorithmica, 2011

2010
On Metric Clustering to Minimize the Sum of Radii.
Algorithmica, 2010

2009
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


  Loading...