On the public citation graph

Concerning the time bounds of existing shortest watchman route algorithms

0 signed · 18 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/3-540-54945-5_60openalex-snapshot

An incremental algorithm for constructing shortest watchman routes

inferredcites →https://doi.org/10.1007/3-540-57568-5_235openalex-snapshot

Finding the shortest watchman route in a simple polygon

inferredcites →https://doi.org/10.1007/3-540-57568-5_236openalex-snapshot

Constructing shortest watchman routes by divide-and-conquer

inferredcites →https://doi.org/10.1007/bf02574671openalex-snapshot

Shortest watchman routes in simple polygons

inferredcites →https://doi.org/10.1016/0020-0190(88)90141-xopenalex-snapshot

Optimum watchman routes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_25openalex-snapshot

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility

inferred← citeshttps://doi.org/10.1007/978-3-540-78157-8_15openalex-snapshot

An Approximate Algorithm for Solving the Watchman Route Problem

inferred← citeshttps://doi.org/10.1007/pl00009467openalex-snapshot

Finding the Shortest Watchman Route in a Simple Polygon

inferred← citeshttps://doi.org/10.1007/s00453-024-01245-0openalex-snapshot

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot

Geometric Shortest Paths and Network Optimization

inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.003openalex-snapshot

Complexity of minimum corridor guarding problems

inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00146-0openalex-snapshot

Fast computation of shortest watchman routes in simple polygons

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00502-1openalex-snapshot

Minimum-link watchman tours

inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00284-9openalex-snapshot

Finding shortest safari routes in simple polygons

inferred← citeshttps://doi.org/10.1080/23799927.2023.2166873openalex-snapshot

A sufficient condition for visibility paths in simple polygons

inferred← citeshttps://doi.org/10.1137/1.9781611973105.60openalex-snapshot

Approximating Watchman Routes

inferred← citeshttps://doi.org/10.1137/s0097539799348670openalex-snapshot

The Polygon Exploration Problem

inferred← citeshttps://doi.org/10.1142/s0218195999000212openalex-snapshot

CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"

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.