On the public citation graph
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
0 signed · 61 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.1002/rsa.20462openalex-snapshot
Finding cycles and trees in sublinear time
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_6openalex-snapshot
Fast Distributed Approximations in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_48openalex-snapshot
Testing Outerplanarity of Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_45openalex-snapshot
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_60openalex-snapshot
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
inferredcites →https://doi.org/10.1016/j.aim.2009.10.018openalex-snapshot
Every minor-closed property of sparse graphs is testable
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/j.jfa.2008.01.010openalex-snapshot
L2 -spectral invariants and convergent sequences of finite graphs
inferredcites →https://doi.org/10.1109/focs.2009.77openalex-snapshot
Local Graph Partitions for Approximation and Testing
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-snapshot
Decomposition of Finite Graphs Into Forests
inferredcites →https://doi.org/10.1137/070681831openalex-snapshot
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
inferredcites →https://doi.org/10.1142/s0129054106004248openalex-snapshot
TRÉMAUX TREES AND PLANARITY
inferredcites →https://doi.org/10.1145/100216.100254openalex-snapshot
A separator theorem for graphs with an excluded minor and its applications
inferredcites →https://doi.org/10.1145/1328911.1328916openalex-snapshot
Randomized minimum spanning tree algorithms using exponentially fewer random bits
inferredcites →https://doi.org/10.1145/1993636.1993726openalex-snapshot
Every property of hyperfinite graphs is testable
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
inferredcites →https://doi.org/10.2748/tmj/1178243286openalex-snapshot
Weighted sums of certain dependent random variables
inferredcites →https://doi.org/10.7155/jgaa.00091openalex-snapshot
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
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-319-69084-1_13openalex-snapshot
Robust Routing Made Easy
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_8openalex-snapshot
A General Lower Bound for Collaborative Tree Exploration
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_7openalex-snapshot
Sublinear-Time Algorithms for Approximating Graph Parameters
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_4openalex-snapshot
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_54openalex-snapshot
Runtime Monitoring with Union-Find Structures
inferred← citeshttps://doi.org/10.1007/978-981-13-3059-9_8openalex-snapshot
Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis
inferred← citeshttps://doi.org/10.1007/s00037-019-00191-6openalex-snapshot
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
inferred← citeshttps://doi.org/10.1007/s00446-020-00382-3openalex-snapshot
Property Testing of Planarity in the CONGEST model
inferred← citeshttps://doi.org/10.1007/s00453-014-9897-1openalex-snapshot
Testing Outerplanarity of Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00612-6openalex-snapshot
Local Algorithms for Sparse Spanning Graphs
inferred← citeshttps://doi.org/10.1007/s12626-019-00051-3openalex-snapshot
Hyperfiniteness of Real-World Networks
inferred← citeshttps://doi.org/10.1007/s12626-019-00054-0openalex-snapshot
What Graph Properties Are Constant-Time Testable?
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.004openalex-snapshot
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.021openalex-snapshot
The nearest colored node in a tree
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1109/focs.2018.00055openalex-snapshot
Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00034openalex-snapshot
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes
inferred← citeshttps://doi.org/10.1109/tnet.2023.3283184openalex-snapshot
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults
inferred← citeshttps://doi.org/10.1137/1.9781611975031.136openalex-snapshot
Testing Bounded Arboricity
inferred← citeshttps://doi.org/10.1137/1.9781611977073.69openalex-snapshot
The complexity of testing all properties of planar graphs, and the role of isomorphism
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch167openalex-snapshot
Massively Parallel Computation on Embedded Planar Graphs
inferred← citeshttps://doi.org/10.1137/19m1245463openalex-snapshot
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1137/20m1312824openalex-snapshot
Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs
inferred← citeshttps://doi.org/10.1145/3219819.3220119openalex-snapshot
Approximating the Spectrum of a Graph
inferred← citeshttps://doi.org/10.1145/3313276.3316330openalex-snapshot
Random walks and forbidden minors II
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.61openalex-snapshot
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.87openalex-snapshot
A Centralized Local Algorithm for the Sparse Spanning Graph Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1703.05418openalex-snapshot
A Local Algorithm for the Sparse Spanning Graph Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1904.01055openalex-snapshot
Random walks and forbidden minors II: A $\text{poly}(d\varepsilon^{-1})$-query tester for minor-closed properties of bounded-degree graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1909.09984openalex-snapshot
On the Characterization of $1$-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00556openalex-snapshot
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes
inferred← citeshttps://doi.org/10.7916/d8-fs41-c774openalex-snapshot
Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings
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.