An Approximation Scheme for Terrain Guarding. - Matt Gibson 001; Gaurav Kanade; Erik Krohn; Kasturi R. Varadarajan (APPROX-RANDOM, 2009)

Quasi-Polynomial Time Approximation Schemes for Target Tracking - Matt Gibson 001; Gaurav Kanade; Erik Krohn; Kasturi R. Varadarajan (CoRR, 2009)

The Complexity of Guarding Terrains - James King 001; Erik Krohn (CoRR, 2009)

On Metric Clustering to Minimize the Sum of Radii. - Matt Gibson 001; Gaurav Kanade; Erik Krohn; Imran A. Pirwani; Kasturi R. Varadarajan (Algorithmica, 2010)

Improved Approximations for Guarding 1.5-Dimensional Terrains. - Khaled M. Elbassioni; Erik Krohn; Domagoj Matijevic; Julián Mestre; Domagoj Severdija (Algorithmica, 2011)

Terrain Guarding is NP-Hard. - James King 001; Erik Krohn (SIAM J. Comput., 2011)

The Complexity of Guarding Monotone Polygons. - Erik Krohn; Bengt J. Nilsson (CCCG, 2012)

On Clustering to Minimize the Sum of Radii. - Matt Gibson 001; Gaurav Kanade; Erik Krohn; Imran A. Pirwani; Kasturi R. Varadarajan (SIAM J. Comput., 2012)

Approximate Guarding of Monotone and Rectilinear Polygons. - Erik Krohn; Bengt J. Nilsson (Algorithmica, 2013)

On the VC-Dimension of Visibility in Monotone Polygons. - Matt Gibson 001; Erik Krohn; Qing Wang 013 (CCCG, 2014)

Guarding Terrains via Local Search. - Matt Gibson 001; Gaurav Kanade; Erik Krohn; Kasturi R. Varadarajan (J. Comput. Geom., 2014)

A Characterization of Visibility Graphs for Pseudo-polygons. - Matt Gibson 001; Erik Krohn; Qing Wang 013 (ESA, 2015)

The VC-Dimension of Visibility on the Boundary of a Simple Polygon. - Matt Gibson 001; Erik Krohn; Qing Wang 013 (ISAAC, 2015)

Guarding Monotone Polygons with Half-Guards. - Matt Gibson 001; Erik Krohn; Matthew Rayford (CCCG, 2017)

A Note on Guarding Staircase Polygons. - Matt Gibson 001; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Pawel Zylinski (CCCG, 2019)

The VC-dimension of visibility on the boundary of monotone polygons. - Matt Gibson 001; Erik Krohn; Qing Wang 013 (Comput. Geom., 2019)

Terrain Visibility Graphs: Persistence Is Not Enough. - Safwa Ameer; Matt Gibson-Lopez; Erik Krohn; Sean Soderman; Qing Wang 013 (SoCG, 2020)

Opposing Half Guards. - Erik Krohn; Bengt J. Nilsson; Christiane Schmidt 001 (CCCG, 2022)

Half-Guarding Weakly-Visible Polygons and Terrains. - Nandhana Duraisamy; Hannah Miller Hillberg; Ramesh K. Jallu; Erik Krohn; Anil Maheshwari; Subhas C. Nandy; Alex Pahlow (FSTTCS, 2022)

On Vertex Guarding Staircase Polygons. - Matt Gibson-Lopez; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Sean Soderman; Pawel Zylinski (LATIN, 2022)

On the Complexity of Half-Guarding Monotone Polygons. - Hannah Miller Hillberg; Erik Krohn; Alex Pahlow (LATIN, 2022)

On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction. - Safwa Ameer; Matt Gibson-Lopez; Erik Krohn; Qing Wang 013 (SWAT, 2022)

On Half Guarding Polygons. - Erik Krohn; Alex Pahlow; Zhongxiu Yang (COCOA (1), 2023)

Minimum k-Hop Dominating Sets in Grid Graphs. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (CoRR, 2023)

Guarding Polyominoes Under k-Hop Visibility. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (Algorithmica, 2025)