On the public citation graph

Separator Based Sparsification

0 signed · 53 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/3-540-55706-7_19openalex-snapshot
Dynamic 2- and 3-connectivity on planar graphs
inferredcites →https://doi.org/10.1007/3-540-55706-7_20openalex-snapshot
Fully dynamic 2-edge-connectivity in planar graphs
inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferredcites →https://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1109/sfcs.1992.267819openalex-snapshot
Fully dynamic biconnectivity in graphs
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/129712.129761openalex-snapshot
Fully dynamic planarity testing (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129762openalex-snapshot
Planar separators and parallel polygon triangulation (preliminary version)
inferredcites →https://doi.org/10.1145/167088.167159openalex-snapshot
Separator based sparsification for dynamic planar graph algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1007/10719839_22openalex-snapshot
Multi-parameter Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_12openalex-snapshot
Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_15openalex-snapshot
Dynamically switching vertices in planar graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_155openalex-snapshot
Fully Dynamic Higher Connectivity for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_157openalex-snapshot
Fully Dynamic Planarity Testing
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_155openalex-snapshot
Fully Dynamic Higher Connectivity for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_157openalex-snapshot
Fully Dynamic Planarity Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_15openalex-snapshot
Maintaining Triconnected Components Under Node Expansion
inferred← citeshttps://doi.org/10.1007/pl00009227openalex-snapshot
Maintaining Regular Properties Dynamically in k-Terminal Graphs
inferred← citeshttps://doi.org/10.1007/s00224-016-9709-xopenalex-snapshot
Optimal Decremental Connectivity in Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00224-017-9768-7openalex-snapshot
Dynamic Planar Embeddings of Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/s004530010032openalex-snapshot
Dynamically Switching Vertices in Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.005openalex-snapshot
Maintaining dynamic minimum spanning trees: An experimental study
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.09.001openalex-snapshot
Sublinear separators, fragility and subexponential expansion
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104805openalex-snapshot
Constant-time dynamic weight approximation for minimum spanning forest
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.008openalex-snapshot
Single-source shortest paths and strong connectivity in dynamic planar graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00638-2openalex-snapshot
Decomposable multi-parameter matroid optimization problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00109openalex-snapshot
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00105openalex-snapshot
Dynamic treewidth
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743510openalex-snapshot
Parametric and kinetic minimum spanning trees
inferred← citeshttps://doi.org/10.1137/090759112openalex-snapshot
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch167openalex-snapshot
Massively Parallel Computation on Embedded Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977585.ch28openalex-snapshot
Splay Top Trees
inferred← citeshttps://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/s0097539794272582openalex-snapshot
Dynamic 2-Connectivity with Backtracking
inferred← citeshttps://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/3055399.3055480openalex-snapshot
Decremental single-source reachability in planar digraphs
inferred← citeshttps://doi.org/10.1145/320211.320215openalex-snapshot
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
inferred← citeshttps://doi.org/10.1145/3239560openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.1145/3357713.3384249openalex-snapshot
Fully-dynamic planarity testing in polylogarithmic time
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.1145/3715884openalex-snapshot
Maintaining CMSO 2 properties on dynamic structures with bounded feedback vertex number
inferred← citeshttps://doi.org/10.1145/945394.945403openalex-snapshot
An Experimental Study of Dynamic Algorithms for Transitive Closure
inferred← citeshttps://doi.org/10.1201/b16132-52openalex-snapshot
Triangulations
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.240openalex-snapshot
Finding All Maximal Subsequences with Hereditary Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1904.05066openalex-snapshot
Minimum Spanning Trees in Weakly Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2107.06232openalex-snapshot
Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0207082openalex-snapshot
Dynamic Generators of Topologically Embedded Graphs
inferred← citeshttps://doi.org/10.5555/1496770.1496788openalex-snapshot
Linear-time algorithms for geometric graphs with sublinearly many crossings
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.