default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Krohn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Omrit Filtser
, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Guarding Polyominoes Under k-Hop Visibility. LATIN (1) 2024: 288-302- 2023
- [c18]Erik Krohn, Alex Pahlow, Zhongxiu Yang:
On Half Guarding Polygons. COCOA (1) 2023: 330-353 - [i7]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Minimum k-Hop Dominating Sets in Grid Graphs. CoRR abs/2308.00334 (2023) - 2022
- [c17]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CCCG 2022: 219-226 - [c16]Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS 2022: 18:1-18:17 - [c15]Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski:
On Vertex Guarding Staircase Polygons. LATIN 2022: 746-760 - [c14]Hannah Miller Hillberg, Erik Krohn, Alex Pahlow:
On the Complexity of Half-Guarding Monotone Polygons. LATIN 2022: 761-777 - [c13]Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Qing Wang:
On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction. SWAT 2022: 7:1-7:13 - [i6]Hannah Miller Hillberg, Erik Krohn, Alex Pahlow:
On the Complexity of Half-Guarding Monotone Polygons. CoRR abs/2204.13143 (2022) - [i5]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CoRR abs/2207.04474 (2022) - 2020
- [c12]Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, Qing Wang:
Terrain Visibility Graphs: Persistence Is Not Enough. SoCG 2020: 6:1-6:13 - [i4]Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, Qing Wang:
Terrain Visibility Graphs: Persistence is Not Enough. CoRR abs/2004.00750 (2020)
2010 – 2019
- 2019
- [j7]Matt Gibson, Erik Krohn, Qing Wang:
The VC-dimension of visibility on the boundary of monotone polygons. Comput. Geom. 77: 62-72 (2019) - [c11]Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski:
A Note on Guarding Staircase Polygons. CCCG 2019: 105-109 - 2017
- [c10]Matt Gibson, Erik Krohn, Matthew Rayford:
Guarding Monotone Polygons with Half-Guards. CCCG 2017: 168-173 - 2015
- [c9]Matt Gibson, Erik Krohn, Qing Wang:
A Characterization of Visibility Graphs for Pseudo-polygons. ESA 2015: 607-618 - [c8]Matt Gibson, Erik Krohn, Qing Wang:
The VC-Dimension of Visibility on the Boundary of a Simple Polygon. ISAAC 2015: 541-551 - [i3]Matt Gibson, Erik Krohn, Qing Wang:
A Characterization of Visibility Graphs for Pseudo-Polygons. CoRR abs/1504.06350 (2015) - 2014
- [j6]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
Guarding Terrains via Local Search. J. Comput. Geom. 5(1): 168-178 (2014) - [c7]Matt Gibson, Erik Krohn, Qing Wang:
On the VC-Dimension of Visibility in Monotone Polygons. CCCG 2014 - 2013
- [j5]Erik Krohn, Bengt J. Nilsson:
Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66(3): 564-594 (2013) - 2012
- [j4]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Clustering to Minimize the Sum of Radii. SIAM J. Comput. 41(1): 47-60 (2012) - [c6]Erik Krohn, Bengt J. Nilsson:
The Complexity of Guarding Monotone Polygons. CCCG 2012: 167-172 - 2011
- [j3]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011) - [j2]James King, Erik Krohn:
Terrain Guarding is NP-Hard. SIAM J. Comput. 40(5): 1316-1339 (2011) - 2010
- [j1]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. Algorithmica 57(3): 484-498 (2010) - [c5]James King, Erik Krohn:
Terrain Guarding is NP-Hard. SODA 2010: 1580-1593
2000 – 2009
- 2009
- [c4]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
An Approximation Scheme for Terrain Guarding. APPROX-RANDOM 2009: 140-148 - [c3]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371 - [i2]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
Quasi-Polynomial Time Approximation Schemes for Target Tracking. CoRR abs/0907.1080 (2009) - [i1]James King, Erik Krohn:
The Complexity of Guarding Terrains. CoRR abs/0907.1280 (2009) - 2008
- [c2]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On clustering to minimize the sum of radii. SODA 2008: 819-825 - [c1]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. SWAT 2008: 282-293
Coauthor Index
aka: Matt Gibson-Lopez
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
