On the public citation graph
Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
0 signed · 23 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.1007/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
inferredcites →https://doi.org/10.1007/978-3-030-00256-5_18openalex-snapshot
Temporal Graph Classes: A View Through Temporal Separators
inferredcites →https://doi.org/10.1007/978-3-030-42071-0_6openalex-snapshot
As Time Goes By: Reflections on Treewidth for Temporal Graphs
inferredcites →https://doi.org/10.1007/978-3-030-79987-8_34openalex-snapshot
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
inferredcites →https://doi.org/10.1007/s00453-022-01018-7openalex-snapshot
Edge Exploration of Temporal Graphs
inferredcites →https://doi.org/10.1016/j.ic.2014.12.005openalex-snapshot
Fast collaborative graph exploration
inferredcites →https://doi.org/10.1016/j.ipl.2017.06.010openalex-snapshot
Time and space optimality of rotor-router graph exploration
inferredcites →https://doi.org/10.1016/j.jcss.2019.02.003openalex-snapshot
Temporal flows in temporal networks
inferredcites →https://doi.org/10.1016/j.jcss.2019.07.006openalex-snapshot
The complexity of finding small separators in temporal graphs
inferredcites →https://doi.org/10.1016/j.jcss.2019.08.002openalex-snapshot
Temporal vertex cover with a sliding time window
inferredcites →https://doi.org/10.1016/j.jcss.2021.01.007openalex-snapshot
Deleting edges to restrict the size of an epidemic in temporal networks
inferredcites →https://doi.org/10.1016/j.jcss.2021.03.005openalex-snapshot
Sliding window temporal graph coloring
inferredcites →https://doi.org/10.1016/j.jpdc.2015.06.004openalex-snapshot
Tradeoffs between cost and information for rendezvous and treasure hunt
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot
Graph exploration by a finite automaton
inferredcites →https://doi.org/10.1016/j.tcs.2007.04.023openalex-snapshot
Impossibility of gathering by a set of autonomous mobile robots
inferredcites →https://doi.org/10.1016/j.tcs.2010.11.023openalex-snapshot
Uniform multi-agent deployment on a ring
inferredcites →https://doi.org/10.1080/15427951.2016.1177801openalex-snapshot
An Introduction to Temporal Graphs: An Algorithmic Perspective *
inferredcites →https://doi.org/10.1137/100796534openalex-snapshot
Distributed Computing by Mobile Robots: Gathering
inferredcites →https://doi.org/10.1137/s009753979628292xopenalex-snapshot
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferredcites →https://doi.org/10.1142/s0129054115500288openalex-snapshot
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
inferredcites →https://doi.org/10.1145/1383369.1383373openalex-snapshot
Label-guided graph exploration by a finite automaton
inferredcites →https://doi.org/10.1609/aaai.v36i9.21259openalex-snapshot
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
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.