On the public citation graph

Galleries need fewer mobile guards: A variation on Chv�tal's theorem

0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-6686-7_26openalex-snapshot
Games, Graphs, and Galleries
inferredcites →https://doi.org/10.1007/bf01918136openalex-snapshot
An alternate proof of the rectilinear art gallery theorem
inferredcites →https://doi.org/10.1016/0095-8956(75)90061-1openalex-snapshot
A combinatorial theorem in plane geometry
inferredcites →https://doi.org/10.1016/0095-8956(78)90059-xopenalex-snapshot
A short proof of Chvátal's Watchman Theorem
inferredcites →https://doi.org/10.1017/cbo9780511779534openalex-snapshot
Graphs, Surfaces and Homology
inferredcites →https://doi.org/10.1137/0604020openalex-snapshot
Traditional Galleries Require Fewer Watchmen

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11751540_16openalex-snapshot
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
inferred← citeshttps://doi.org/10.1007/978-1-4419-8420-3_2openalex-snapshot
Region-Guarding Problem in 3-D Areas
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_2openalex-snapshot
Guarding Quadrangulations and Stacked Triangulations with Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_34openalex-snapshot
Guarding Disjoint Orthogonal Polygons in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_59openalex-snapshot
On Some City Guarding Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_9openalex-snapshot
Improved Bounds for Wireless Localization
inferred← citeshttps://doi.org/10.1007/978-3-642-11278-2_1openalex-snapshot
Information Acquisition in the Exploration of Random Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_3openalex-snapshot
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_5openalex-snapshot
Open Guard Edges and Edge Guards in Simple Polygons
inferred← citeshttps://doi.org/10.1007/bf00147413openalex-snapshot
Covering and guarding polygons using L k -sets
inferred← citeshttps://doi.org/10.1007/bf02239742openalex-snapshot
Hiding people in polygons
inferred← citeshttps://doi.org/10.1007/bf02573990openalex-snapshot
On the number of guard edges of a polygon
inferred← citeshttps://doi.org/10.1007/s00373-017-1802-7openalex-snapshot
Total Dominating Sets in Maximal Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-02004-zopenalex-snapshot
Improved Bounds for Guarding Plane Graphs with Edges
inferred← citeshttps://doi.org/10.1007/s00453-018-0433-6openalex-snapshot
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
inferred← citeshttps://doi.org/10.1007/s10514-019-09833-8openalex-snapshot
Adaptive target tracking with a mixed team of static and mobile guards: deployment and activation strategies
inferred← citeshttps://doi.org/10.1007/s10878-019-00427-9openalex-snapshot
Semipaired domination in maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.11.002openalex-snapshot
Cooperative mobile guards in grids
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.07.002openalex-snapshot
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.02.007openalex-snapshot
Normal art galleries: Wall in – all in
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101859openalex-snapshot
Edge guards for polyhedra in three-space
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102230openalex-snapshot
City guarding with cameras of bounded field of view
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.004openalex-snapshot
Approximation algorithms for art gallery problems in polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.040openalex-snapshot
Distance domination, guarding and covering of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.029openalex-snapshot
Convex dominating sets in maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112179openalex-snapshot
Total domination in plane triangulations
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.014openalex-snapshot
Combinatorial bounds on paired and multiple domination in triangulations
inferred← citeshttps://doi.org/10.1016/j.robot.2012.08.013openalex-snapshot
Visiting convex regions in a polygonal map
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.012openalex-snapshot
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
inferred← citeshttps://doi.org/10.1016/s0734-189x(84)80041-9openalex-snapshot
Stationing guards in rectilinear art galleries
inferred← citeshttps://doi.org/10.1016/s0925-7721(03)00039-7openalex-snapshot
Art gallery theorems for guarded guards
inferred← citeshttps://doi.org/10.1017/9781108592376.015openalex-snapshot
Covering geometric domains
inferred← citeshttps://doi.org/10.1109/5.163407openalex-snapshot
Recent results in art galleries (geometry)
inferred← citeshttps://doi.org/10.1109/aiccsa.2006.205195openalex-snapshot
On the Optimal Deployment of Heterogeneous Sensing Devices
inferred← citeshttps://doi.org/10.1109/dssns.2006.15openalex-snapshot
SensDep: A Design Tool for the Deployment of Heterogeneous Sensing Devices
inferred← citeshttps://doi.org/10.1109/icra.2017.7989102openalex-snapshot
Hybrid system for target tracking in triangulation graphs
inferred← citeshttps://doi.org/10.1109/icra48891.2023.10161532openalex-snapshot
Relay Pursuit for Multirobot Target Tracking on Tile Graphs
inferred← citeshttps://doi.org/10.1109/iros.2016.7759094openalex-snapshot
Target tracking on triangulation graphs
inferred← citeshttps://doi.org/10.1109/iros51168.2021.9636581openalex-snapshot
Roadmap for Visibility-based Target Tracking: Iterative Construction and Motion Strategy
inferred← citeshttps://doi.org/10.1109/ita.2013.6502995openalex-snapshot
Control recognition bounds for visual learning and exploration
inferred← citeshttps://doi.org/10.1109/jiot.2024.3494692openalex-snapshot
Novel Computationally Efficient Multiple Access-Point/Router Deployment Approach for Full Line of Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Fields of Interest
inferred← citeshttps://doi.org/10.1109/jsen.2021.3107416openalex-snapshot
Novel Optimal Multisensor Placement for Indoor Rectilinear Line-of-Sight Coverage
inferred← citeshttps://doi.org/10.1109/lra.2017.2714980openalex-snapshot
Visibility-Based Target-Tracking Game: Bounds and Tracking Strategies
inferred← citeshttps://doi.org/10.1109/mrs60187.2023.10416773openalex-snapshot
From Distributed Coverage to Multi-agent Target Tracking
inferred← citeshttps://doi.org/10.1109/tit.1986.1057165openalex-snapshot
Computational complexity of art gallery problems
inferred← citeshttps://doi.org/10.1109/tro.2011.2169619openalex-snapshot
On Optimizing Autonomous Pipeline Inspection
inferred← citeshttps://doi.org/10.1145/10515.10518openalex-snapshot
Optimum watchman routes
inferred← citeshttps://doi.org/10.1145/1364901.1364950openalex-snapshot
Guarding curvilinear art galleries with edge or mobile guards
inferred← citeshttps://doi.org/10.1155/2007/54731openalex-snapshot
Optimal and Approximate Approaches for Deployment of Heterogeneous Sensing Devices
inferred← citeshttps://doi.org/10.3233/fi-2011-572openalex-snapshot
Rainbow Induced Subgraphs in Proper Vertex Colorings
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1917openalex-snapshot
Normal art galleries: wall in - all in
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1346openalex-snapshot
Fast Approximation Algorithms for Art Gallery Problems in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1803openalex-snapshot
Hidden Mobile Guards in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2043openalex-snapshot
Distance domination, guarding and vertex cover for maximal outerplanar graph
inferred← citeshttps://doi.org/10.48550/arxiv.1611.04648openalex-snapshot
Towards a Framework for Tracking Multiple Targets: Hybrid Systems meets Computational Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1611.05092openalex-snapshot
Partitioning Strategies and Task Allocation for Target-tracking with Multiple Guards in Polygonal Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1804.07150openalex-snapshot
Improved Bounds for Guarding Plane Graphs with Edges
inferred← citeshttps://doi.org/10.48550/arxiv.1807.08350openalex-snapshot
Tracking Mobile Intruders in an Art Gallery: Guard Deployment Strategies, Fundamental Limitations, and Performance Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.2006.13722openalex-snapshot
Guarding Quadrangulations and Stacked Triangulations with Edges
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06052openalex-snapshot
City Guarding with Limited Field of View
inferred← citeshttps://doi.org/10.5555/1460047.1460081openalex-snapshot
Impact of heterogeneity on the deployment of sensor networks
inferred← citeshttps://doi.org/10.5860/choice.47-3220openalex-snapshot
How to guard an art gallery and other discrete mathematical adventures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.