On the public citation graph
Dynamically Switching Vertices in Planar Graphs
0 signed · 59 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/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferredcites →https://doi.org/10.1006/jcss.1995.1076openalex-snapshot
Planar Separators and Parallel Polygon Triangulation
inferredcites →https://doi.org/10.1006/jcss.1996.0002openalex-snapshot
Separator Based Sparsification
inferredcites →https://doi.org/10.1007/3-540-60313-1_142openalex-snapshot
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
inferredcites →https://doi.org/10.1007/3-540-63165-8_214openalex-snapshot
Maintaining minimum spanning trees in dynamic graphs
inferredcites →https://doi.org/10.1007/pl00009186openalex-snapshot
Average-Case Analysis of Dynamic Graph Algorithms
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.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.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar 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.1137/s0097539792226825openalex-snapshot
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
inferredcites →https://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferredcites →https://doi.org/10.1145/195058.195434openalex-snapshot
Improved data structures for fully dynamic biconnectivity
inferredcites →https://doi.org/10.1145/225058.225269openalex-snapshot
Randomized dynamic graph algorithms with polylogarithmic time per operation
inferredcites →https://doi.org/10.1145/264216.264223openalex-snapshot
An empirical study of dynamic graph algorithms
inferredcites →https://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1145/276698.276715openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferredcites →https://doi.org/10.5555/314161.314314openalex-snapshot
Experimental analysis of dynamic minimum spanning tree algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_29openalex-snapshot
Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_3openalex-snapshot
The State of the Art in Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_56openalex-snapshot
Reactive Proximity Data Structures for Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_18openalex-snapshot
New Data Structures for Subgraph Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_28openalex-snapshot
Connectivity Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00947-7openalex-snapshot
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient
inferred← citeshttps://doi.org/10.1007/s00453-022-00978-0openalex-snapshot
Mincut Sensitivity Data Structures for the Insertion of an Edge
inferred← citeshttps://doi.org/10.1007/s10107-014-0762-4openalex-snapshot
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
inferred← citeshttps://doi.org/10.1007/s10559-012-9415-xopenalex-snapshot
Associative version of the Ramalingam algorithm for dynamically updating the shortest-path subgraph after inserting a new edge into a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.004openalex-snapshot
3D geo-graphs: Efficient flip verification for the spherical zoning problem
inferred← citeshttps://doi.org/10.1016/j.na.2005.12.013openalex-snapshot
Hybrid port–Hamiltonian systems: From parameterized incidence matrices to hybrid automata
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30484-6openalex-snapshot
From Dynamic Graphs to Geometric Interconnection Structures of Physical Systems with Variable Topology
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00098openalex-snapshot
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch52openalex-snapshot
Dynamic DFS in Undirected Graphs: breaking the O( m ) barrier
inferred← citeshttps://doi.org/10.1137/1.9781611974782.31openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/1.9781611977073.27openalex-snapshot
Sensitivity Oracles for All-Pairs Mincuts
inferred← citeshttps://doi.org/10.1137/15m1050987openalex-snapshot
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
inferred← citeshttps://doi.org/10.1137/17m114306xopenalex-snapshot
Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier
inferred← citeshttps://doi.org/10.1137/17m1146610openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/s009753970343912xopenalex-snapshot
Dynamic Subgraph Connectivity with Geometric Applications
inferred← citeshttps://doi.org/10.1142/9789812773289_0003openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1145/1806689.1806754openalex-snapshot
Connectivity oracles for failure prone graphs
inferred← citeshttps://doi.org/10.1145/2746539.2746594openalex-snapshot
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
inferred← citeshttps://doi.org/10.1145/2746539.2746609openalex-snapshot
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
inferred← citeshttps://doi.org/10.1145/3490148.3538584openalex-snapshot
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
inferred← citeshttps://doi.org/10.1145/3519935.3520036openalex-snapshot
Tight dynamic problem lower bounds from generalized BMM and OMv
inferred← citeshttps://doi.org/10.1145/509907.509911openalex-snapshot
Dynamic subgraph connectivity with geometric applications
inferred← citeshttps://doi.org/10.1287/opre.1120.1083openalex-snapshot
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
inferred← citeshttps://doi.org/10.3182/20050703-6-cz-1902.00324openalex-snapshot
PHYSICAL SWITCHING SYSTEMS: HYBRID INCIDENCE MATRICES FOR STRUCTURED MODELLING AND ANALYSIS
inferred← citeshttps://doi.org/10.3390/a12030052openalex-snapshot
Space-Efficient Fully Dynamic DFS in Undirected Graphs †
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.102openalex-snapshot
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.65openalex-snapshot
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1128openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4159openalex-snapshot
Connectivity Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.0054openalex-snapshot
Popular conjectures imply strong lower bounds for dynamic problems
inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot
Extreme Distances in Multicolored Point Sets
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.