On the public citation graph
Approximating Average Parameters of Graphs
0 signed · 29 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.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1006/jcss.1997.1385openalex-snapshot
All Pairs Shortest Paths for Graphs with Small Integer Length Edges
inferredcites →https://doi.org/10.1007/11523468_70openalex-snapshot
Facility Location in Sublinear Time
inferredcites →https://doi.org/10.1007/3-540-44676-1_3openalex-snapshot
Exact and Approximate Distances in Graphs — A Survey
inferredcites →https://doi.org/10.1007/978-1-4614-8806-4_7openalex-snapshot
Information and Computation
inferredcites →https://doi.org/10.1007/s00453-001-0078-7openalex-snapshot
Property Testing in Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/s004930050060openalex-snapshot
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1996.548504openalex-snapshot
All pairs almost shortest paths
inferredcites →https://doi.org/10.1137/s0097539702403244openalex-snapshot
Approximating the Minimum Spanning Tree Weight in Sublinear Time
inferredcites →https://doi.org/10.1137/s0097539703436424openalex-snapshot
Tight Bounds for Testing Bipartiteness in General Graphs
inferredcites →https://doi.org/10.1145/1007352.1007443openalex-snapshot
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
inferredcites →https://doi.org/10.1145/301250.301366openalex-snapshot
Sublinear time algorithms for metric space problems
inferredcites →https://doi.org/10.1145/383962.383983openalex-snapshot
Computing almost shortest paths
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11830924_43openalex-snapshot
Distance Approximation in Bounded-Degree and General Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_22openalex-snapshot
On Approximating the Average Distance Between Points
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_4openalex-snapshot
Sublinear Algorithms for Scheduling with Chain Precedence Constraints
inferred← citeshttps://doi.org/10.1007/s00186-025-00898-zopenalex-snapshot
Sublinear time approximation schemes for makespan minimization on parallel machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.040openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.006openalex-snapshot
A sublinear-time approximation scheme for bin packing
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00012openalex-snapshot
Approximate Butterfly Counting in Sublinear Time
inferred← citeshttps://doi.org/10.1109/icra.2011.5980411openalex-snapshot
Approximate characterization of multi-robot swarm “shapes” in sublinear-time
inferred← citeshttps://doi.org/10.1109/qccl65142.2025.11158790openalex-snapshot
Benchmark of the Full and Reduced Effective Resistance Kernel for Molecular Classification
inferred← citeshttps://doi.org/10.1137/1.9781611973730.112openalex-snapshot
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
inferred← citeshttps://doi.org/10.1145/3650030openalex-snapshot
Better Sum Estimation via Weighted Sampling
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.107openalex-snapshot
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
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.