On the public citation graph
Contiguous Search in the Hypercube for Capturing an Intruder
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1064openalex-snapshot
The Vertex Separation and Search Number of a Graph
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.1145/42267.42268openalex-snapshot
The complexity of searching a graph
inferredcites →https://doi.org/10.1145/564870.564906openalex-snapshot
Capture of an intruder by mobile agents
inferredcites →https://doi.org/10.20381/ruor-9734openalex-snapshot
Contiguous search by mobile agents in cube networks and chordal rings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11604655_17openalex-snapshot
Cleaning an Arbitrary Regular Network with Mobile Agents
inferred← citeshttps://doi.org/10.1007/11753728_58openalex-snapshot
Capturing an Intruder in the Pyramid
inferred← citeshttps://doi.org/10.1007/11780823_7openalex-snapshot
Distributed Chasing of Network Intruders by Mobile Agents
inferred← citeshttps://doi.org/10.1007/11945918_23openalex-snapshot
Capturing an Intruder in Product Networks
inferred← citeshttps://doi.org/10.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_22openalex-snapshot
Mixed Search Number of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_21openalex-snapshot
Web Marshals Fighting Curly Link Farms
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_22openalex-snapshot
Intruder Capture in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_6openalex-snapshot
Graph Searching with Advice
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_29openalex-snapshot
Mixed Search Number and Linear-Width of Interval and Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_30openalex-snapshot
The Cost of Monotonicity in Distributed Graph Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_39openalex-snapshot
A Self-stabilizing Algorithm for Graph Searching in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_27openalex-snapshot
Pathwidth and Searching in Parameterized Threshold Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_30openalex-snapshot
Connected Searching of Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_16openalex-snapshot
Exclusive Graph Searching
inferred← citeshttps://doi.org/10.1007/s00224-008-9116-zopenalex-snapshot
Contiguous Search Problem in Sierpiński Graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.013openalex-snapshot
Capturing an intruder in product networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.004openalex-snapshot
Distributed chasing of network intruders
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.020openalex-snapshot
Graph searching with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.017openalex-snapshot
Connected searching of weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.039openalex-snapshot
Finding small-width connected path decompositions in polynomial time
inferred← citeshttps://doi.org/10.1109/iccgi.2007.43openalex-snapshot
On the Complexity of Decontaminating an Hexagonal Mesh Network
inferred← citeshttps://doi.org/10.1109/icis.2007.87openalex-snapshot
Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639545openalex-snapshot
Decontamination of chordal rings and tori
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639553openalex-snapshot
Network decontamination with local immunization
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160996openalex-snapshot
A general approach to toroidal mesh decontamination with local immunity
inferred← citeshttps://doi.org/10.1109/tpds.2008.108openalex-snapshot
Detecting Threats in Star Graphs
inferred← citeshttps://doi.org/10.1142/s0129054107004784openalex-snapshot
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
inferred← citeshttps://doi.org/10.1142/s0129054107004838openalex-snapshot
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
inferred← citeshttps://doi.org/10.20381/ruor-18976openalex-snapshot
Best effort decontamination of networks
inferred← citeshttps://doi.org/10.22215/etd/2005-10780openalex-snapshot
Intruder capture by mobile agents in mesh topologies
inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot
Using mobile agents for black hole search with tokens in multi networks
inferred← citeshttps://doi.org/10.5555/1898699.1898772openalex-snapshot
Decontamination of chordal rings and tori
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.