On the public citation graph

Network verification via routing table queries

0 signed · 50 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/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/3-540-45322-9openalex-snapshot
Stochastic Algorithms: Foundations and Applications
inferredcites →https://doi.org/10.1007/978-3-540-74871-7_8openalex-snapshot
Approximate Discovery of Random Graphs
inferredcites →https://doi.org/10.1007/978-3-540-75225-7_24openalex-snapshot
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
inferredcites →https://doi.org/10.1007/978-3-642-11440-3_21openalex-snapshot
The Covert Set-Cover Problem with Application to Network Discovery
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1016/0166-218x(95)00106-2openalex-snapshot
Landmarks in graphs
inferredcites →https://doi.org/10.1016/j.artint.2010.02.003openalex-snapshot
Optimal query complexity bounds for finding graphs
inferredcites →https://doi.org/10.1016/j.ipl.2007.02.001openalex-snapshot
Approximability of identifying codes and locating–dominating codes
inferredcites →https://doi.org/10.1016/j.tcs.2005.12.009openalex-snapshot
Exploring networks with traceroute-like probes: Theory and simulations
inferredcites →https://doi.org/10.1016/j.tcs.2010.01.010openalex-snapshot
Discovery of network properties with all-shortest-paths queries
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.055openalex-snapshot
Reconstructing weighted graphs with minimal query complexity
inferredcites →https://doi.org/10.1109/infcom.2000.832534openalex-snapshot
Heuristics for Internet map discovery
inferredcites →https://doi.org/10.1109/tnet.2006.882907openalex-snapshot
Robust Monitoring of Link Delays and Faults in IP Networks
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1147/rd.45.0497openalex-snapshot
On Moore Graphs with Diameters 2 and 3
inferredcites →https://doi.org/10.4153/cmb-1963-001-xopenalex-snapshot
A Characterization of Block-Graphs
inferredcites →https://doi.org/10.5555/1873601.1873652openalex-snapshot
Optimally reconstructing weighted graphs using queries

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-24922-9_6openalex-snapshot
Tracking Routes in Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_3openalex-snapshot
Monitoring the Edges of a Graph Using Distances
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_19openalex-snapshot
Monitoring Edge-Geodetic Sets in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52213-0_3openalex-snapshot
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_31openalex-snapshot
An Algorithm for Monitoring Edge-Geodetic Sets in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_17openalex-snapshot
Network Creation Games with Traceroute-Based Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2openalex-snapshot
Structural Information and Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00236-024-00453-zopenalex-snapshot
Distance-edge-monitoring sets of networks
inferred← citeshttps://doi.org/10.1007/s00453-020-00674-xopenalex-snapshot
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.07.002openalex-snapshot
Monitoring the edges of a graph using distances
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.012openalex-snapshot
On the distance-edge-monitoring numbers of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.020openalex-snapshot
Erdös–Gallai-type problems for distance-edge-monitoring numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.032openalex-snapshot
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.03.015openalex-snapshot
The distance-edge-monitoring numbers of subdivision graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.040openalex-snapshot
Nordhaus–Gaddum-type results for monitoring edge-geodetic number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.020openalex-snapshot
Greediness is not always a vice: Efficient discovery algorithms for assignment problems
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.041openalex-snapshot
Monitoring edge-geodetic sets in graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103528openalex-snapshot
Monitoring the edges of a graph using distances with given girth
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103602openalex-snapshot
Monitoring the edges of product networks using distances
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.006openalex-snapshot
Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.012openalex-snapshot
Tracking routes in communication networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115079openalex-snapshot
Monitoring arc-geodetic sets of oriented graphs
inferred← citeshttps://doi.org/10.1051/ro/2024106openalex-snapshot
Realizability problem of distance-edge-monitoring numbers
inferred← citeshttps://doi.org/10.1142/s0219265922500037openalex-snapshot
Distance-Edge-Monitoring Sets in Hierarchical and Corona Graphs
inferred← citeshttps://doi.org/10.1142/s0219265925500124openalex-snapshot
The Monitoring-Edge-Geodetic Number of Some Planar Networks
inferred← citeshttps://doi.org/10.1142/s0219265925500197openalex-snapshot
On the Distance-Edge-Monitoring Numbers of Strong Product Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.5734137openalex-snapshot
Monitoring the links of a network using $k$-distances
inferred← citeshttps://doi.org/10.2298/yjor230815016kopenalex-snapshot
Integer programming model for distance-edge-monitoring problem
inferred← citeshttps://doi.org/10.3233/fi-242176openalex-snapshot
Perturbation Results for Distance-edge-monitoring Numbers
inferred← citeshttps://doi.org/10.3390/a14020035openalex-snapshot
Network Creation Games with Traceroute-Based Strategies
inferred← citeshttps://doi.org/10.70675/5bd7ecfazbf47z43ccz8f1ez491f21159168openalex-snapshot
On some subgraph optimization problems for networks
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.