Guarding Polyominoes under $k$-Hop Visibility

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt

Type: Preprint

Publication Date: 2023-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2308.00334

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Guarding Polyominoes Under k-Hop Visibility	2025	Omrit Filtser Erik Krohn Bengt J. Nilsson Christian Rieck Christiane Schmidt
+	Exact VC-dimension for $L_1$-visibility of points in simple polygons.	2017	Elmar Langetepe S. Lehmann
+	Exact VC-dimension for $L_1$-visibility of points in simple polygons	2017	Elmar Langetepe S. Lehmann
+	A Complexity Dichotomy for Colourful Components Problems on $k$-caterpillars and Small-Degree Planar Graphs	2019	Janka Chlebı́ková Clément Dallard
+	The Parameterized Hardness of the Art Gallery Problem.	2016	Édouard Bonnet Tillmann Miltzow
+	Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries	2014	Frank Hoffmann Klaus Kriegel Max Willert
+	The Parameterized Hardness of Art Gallery Problems	2016	Édouard Bonnet Tillmann Miltzow
+	Orthogonal Terrain Guarding is NP-complete	2017	Édouard Bonnet Panos Giannopoulos
+	$k$-Transmitter Watchman Routes	2022	Bengt J. Nilsson Christiane Schmidt
+	Turning Cliques into Paths to Achieve Planarity	2018	Patrizio Angelini Peter Eades Seok-Hee Hong Karsten Klein Stephen Kobourov Giuseppe Liotta Alfredo Navarra Alessandra Tappini
+	Turning Cliques into Paths to Achieve Planarity.	2018	Patrizio Angelini Peter Eades Seok-Hee Hong Karsten Klein Stephen Kobourov Giuseppe Liotta Alfredo Navarra Alessandra Tappini
+ PDF Chat	Polychromatic Colorings of Plane Graphs	2009	Noga Alon Robert Berke Kevin Buchin Maike Buchin Péter Csorba Saswata Shannigrahi Bettina Speckmann Philipp Zumstein
+	The one-visibility Localization game	2023	Anthony Bonato Trent G. Marbach Michael Molnar JD Nir
+	Edge-intersection graphs of grid paths: the bend-number	2010	Daniel Heldt Kolja Knauer Torsten Ueckerdt
+	Edge-intersection graphs of grid paths: the bend-number	2010	Daniel Heldt Kolja Knauer Torsten Ueckerdt
+ PDF Chat	Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs	2019	Janka Chlebı́ková Clément Dallard
+	Treewidth Bounds for Planar Graphs Using Three-Sided Brambles	2017	Karen L. Collins Brett Christopher Smith
+	Treewidth Bounds for Planar Graphs Using Three-Sided Brambles	2017	Karen L. Collins Brett C. Smith
+	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs	2015	Konrad K. Dabrowski François Dross Matthew Johnson Daniël Paulusma
+	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs	2015	Konrad K. Dabrowski François Dross Matthew Johnson Daniël Paulusma

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors