On the public citation graph
Graph Reconstruction and Verification
0 signed · 41 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/jcss.2001.1785openalex-snapshot
Distance Realization Problems with Applications to Internet Tomography
inferredcites →https://doi.org/10.1007/0-387-22444-0_4openalex-snapshot
Algorithmic Aspects of Tree Width
inferredcites →https://doi.org/10.1007/11604686_12openalex-snapshot
Network Discovery and Verification
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
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/978-3-642-39206-1_62openalex-snapshot
Graph Reconstruction via Distance Oracles
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_63openalex-snapshot
Near-Linear Query Complexity for Graph Inference
inferredcites →https://doi.org/10.1007/b98891openalex-snapshot
Recent Advances in Algorithms and Combinatorics
inferredcites →https://doi.org/10.1007/bf01275671openalex-snapshot
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
inferredcites →https://doi.org/10.1007/bf02459968openalex-snapshot
An optimal algorithm to reconstruct trees from additive distance data
inferredcites →https://doi.org/10.1016/0022-5193(77)90351-4openalex-snapshot
Additive evolutionary trees
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/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/isvd.2009.26openalex-snapshot
Balancing Graph Voronoi Diagrams
inferredcites →https://doi.org/10.1145/1538902.1538905openalex-snapshot
On the bias of traceroute sampling
inferredcites →https://doi.org/10.1214/088342304000000422openalex-snapshot
Network Tomography: Recent Developments
inferredcites →https://doi.org/10.4230/lipics.stacs.2016.0openalex-snapshot
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.4230/lipics.stacs.2016.5openalex-snapshot
Graph Reconstruction with a Betweenness Oracle
inferredcites →https://doi.org/10.4230/lipics.stacs.2022.4openalex-snapshot
Efficient Measurement of Complex Networks Using Link Queries
inferredcites →https://doi.org/10.5555/644108.644179openalex-snapshot
On the complexity of distance-based evolutionary tree reconstruction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.21143openalex-snapshot
A simple algorithm for graph reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_1openalex-snapshot
Algorithms that Access the Input via Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_2openalex-snapshot
Reconstructing Graphs from Connected Triples
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_24openalex-snapshot
Graph Reconstruction with Connectivity Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_10openalex-snapshot
On the Computational Complexity of Graph Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_8openalex-snapshot
Exact Learning of Weighted Graphs Using Composite Queries
inferred← citeshttps://doi.org/10.1007/s00453-020-00716-4openalex-snapshot
The Inverse Voronoi Problem in Graphs I: Hardness
inferred← citeshttps://doi.org/10.1016/j.comnet.2020.107488openalex-snapshot
An effective node-removal method against P2P botnets
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.006openalex-snapshot
Reconstruction and verification of chordal graphs with a distance oracle
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.008openalex-snapshot
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries
inferred← citeshttps://doi.org/10.1049/iet-com.2018.5286openalex-snapshot
Reconstruction of C&C channel for P2P botnet
inferred← citeshttps://doi.org/10.1109/cac59555.2023.10450736openalex-snapshot
Reconfiguration Scheme Design of DRDES based on Simulated Annealing Algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2022.3205219openalex-snapshot
Distributed Multicast Traffic Engineering for Multi-Domain Software-Defined Networks
inferred← citeshttps://doi.org/10.1145/3409964.3461822openalex-snapshot
Parallel Network Mapping Algorithms
inferred← citeshttps://doi.org/10.33540/1571openalex-snapshot
Geometric similarity measures and their applications
inferred← citeshttps://doi.org/10.3390/e23060771openalex-snapshot
Unifying Node Labels, Features, and Distances for Deep Network Completion
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.3openalex-snapshot
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
inferred← citeshttps://doi.org/10.48550/arxiv.1811.12547openalex-snapshot
The inverse Voronoi problem in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2112.04549openalex-snapshot
A Simple Algorithm for Graph Reconstruction
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.