On the public citation graph

On-line graph algorithms with SPQR-trees

https://doi.org/10.1007/bfb0032061

0 signed · 114 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-19422-3_9openalex-snapshot

Maintenance of transitive closures and transitive reductions of graphs

inferredcites →https://doi.org/10.1007/3-540-19488-6_143openalex-snapshot

A dynamic data structure for planar graph embedding

inferredcites →https://doi.org/10.1007/3-540-51542-9_30openalex-snapshot

Dynamic data structures for series parallel digraphs

inferredcites →https://doi.org/10.1007/bfb0035771openalex-snapshot

Finding triconnected components by local replacements

inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot

A data structure for dynamic trees

inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot

A linear-time algorithm for a special case of disjoint set union

inferredcites →https://doi.org/10.1016/0196-6774(87)90024-1openalex-snapshot

Dynamic orthogonal segment intersection search

inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot

Incremental algorithms for minimal length paths

inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot

Computing an st-numbering

inferredcites →https://doi.org/10.1016/0304-3975(86)90098-8openalex-snapshot

Amortized efficiency of a path retrieval data structure

inferredcites →https://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot

Algorithms for plane representations of acyclic digraphs

inferredcites →https://doi.org/10.1109/sfcs.1988.21972openalex-snapshot

Fully dynamic techniques for point location and transitive closure in planar structures

inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot

Incremental planarity testing

inferredcites →https://doi.org/10.1137/0202012openalex-snapshot

Dividing a Graph into Triconnected Components

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/0217004openalex-snapshot

On the Complexity of Covering Vertices by Faces in a Planar Graph

inferredcites →https://doi.org/10.1137/0218056openalex-snapshot

Fully Dynamic Point Location in a Monotone Subdivision

inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot

Worst-case Analysis of Set Union Algorithms

inferredcites →https://doi.org/10.1145/73833.73839openalex-snapshot

Area requirement and symmetry display in drawing graphs

inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot

Data structures for on-line updating of minimum spanning trees

inferredcites →https://doi.org/10.5555/320176.320177openalex-snapshot

Maintenance of a minimum spanning forest in a dynamic planar graph

inferredcites →https://doi.org/10.5555/320176.320179openalex-snapshot

A data structure for arc insertion and regular path finding

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119272182.ch5openalex-snapshot

Scaffolding Algorithms

inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot

On-line Planar Graph Embedding

inferred← citeshttps://doi.org/10.1006/jagm.2000.1077openalex-snapshot

On Four-Connecting a Triconnected Graph

inferred← citeshttps://doi.org/10.1007/3-540-36151-0_2openalex-snapshot

Maintaining the Mental Map for Circular Drawings

inferred← citeshttps://doi.org/10.1007/3-540-44541-2_8openalex-snapshot

A Linear Time Implementation of SPQR-Trees

inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot

Software Packages

inferred← citeshttps://doi.org/10.1007/3-540-44985-x_6openalex-snapshot

Maintaining Center and Median in Dynamic Trees

inferred← citeshttps://doi.org/10.1007/3-540-45061-0_4openalex-snapshot

The SPQR-Tree Data Structure in Graph Drawing

inferred← citeshttps://doi.org/10.1007/3-540-45253-2_26openalex-snapshot

Simpler and Faster Vertex-Connectivity Augmentation Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_146openalex-snapshot

Maintaining biconnected components of dynamic planar graphs

inferred← citeshttps://doi.org/10.1007/3-540-55121-2_18openalex-snapshot

Dynamic algorithms for shortest paths in planar graphs

inferred← citeshttps://doi.org/10.1007/3-540-55706-7_19openalex-snapshot

Dynamic 2- and 3-connectivity on planar graphs

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_86openalex-snapshot

Fast incremental planarity testing

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_87openalex-snapshot

Maintenance of triconnected components of graphs

inferred← citeshttps://doi.org/10.1007/3-540-56402-0_45openalex-snapshot

On assembly of four-connected graphs

inferred← citeshttps://doi.org/10.1007/3-540-57273-2_42openalex-snapshot

Optimal upward planarity testing of single-source digraphs

inferred← citeshttps://doi.org/10.1007/3-540-57273-2_47openalex-snapshot

Combine and conquer: A general technique for dynamic algorithms

inferred← citeshttps://doi.org/10.1007/3-540-57899-4_43openalex-snapshot

Average case analysis of fully dynamic connectivity for directed graphs

inferred← citeshttps://doi.org/10.1007/3-540-58218-5_8openalex-snapshot

On triangulating planar graphs under the four-connectivity constraint

inferred← citeshttps://doi.org/10.1007/3-540-59071-4_52openalex-snapshot

On-line convex planarity testing

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_77openalex-snapshot

A linear algorithm for the maximal planar subgraph problem

inferred← citeshttps://doi.org/10.1007/3-540-61332-3_141openalex-snapshot

Output-sensitive reporting of disjoint paths (extended abstract)

inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_15openalex-snapshot

Reaching 3-Connectivity via Edge-Edge Additions

inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_39openalex-snapshot

An SPQR-Tree-Like Embedding Representation for Upward Planarity

inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_27openalex-snapshot

The Rique-Number of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_50openalex-snapshot

Planar Embeddings with Small and Uniform Faces

inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_36openalex-snapshot

Planar L-Drawings of Directed Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_6openalex-snapshot

10 Reasons to Get Interested in Graph Drawing

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_66openalex-snapshot

Certifying 3-Connectivity in Linear Time

inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_12openalex-snapshot

Planar Lombardi Drawings for Subcubic Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_11openalex-snapshot

Balanced Circle Packings for Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_28openalex-snapshot

Planar Octilinear Drawings with One Bend Per Edge

inferred← citeshttps://doi.org/10.1007/bf01758773openalex-snapshot

Maintaining bridge-connected and biconnected components on-line

inferred← citeshttps://doi.org/10.1007/bf01955676openalex-snapshot

Decremental 2- and 3-connectivity on planar graphs

inferred← citeshttps://doi.org/10.1007/bfb0015432openalex-snapshot

Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)

inferred← citeshttps://doi.org/10.1007/pl00009160openalex-snapshot

Combine and Conquer

inferred← citeshttps://doi.org/10.1007/pl00009182openalex-snapshot

On Triangulating Planar Graphs under the Four-Connectivity Constraint

inferred← citeshttps://doi.org/10.1007/pl00009195openalex-snapshot

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line

inferred← citeshttps://doi.org/10.1007/s00236-011-0137-8openalex-snapshot

Connectivity of workflow nets: the foundations of stepwise verification

inferred← citeshttps://doi.org/10.1007/s00453-024-01216-5openalex-snapshot

Extending Partial Representations of Circle Graphs in Near-Linear Time

inferred← citeshttps://doi.org/10.1007/s00454-014-9627-0openalex-snapshot

A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing

inferred← citeshttps://doi.org/10.1016/0012-365x(93)90316-lopenalex-snapshot

On counting planar embeddings

inferred← citeshttps://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot

Incremental algorithms for minimal length paths

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90164-oopenalex-snapshot

Dynamic reachability in planar digraphs with one source and one sink

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90328-qopenalex-snapshot

Dynamic algorithms for shortest paths in planar graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2018.06.002openalex-snapshot

3-connected reduction for regular graph covers

inferred← citeshttps://doi.org/10.1016/j.jctb.2022.05.002openalex-snapshot

Jordan-like characterization of automorphism groups of planar graphs

inferred← citeshttps://doi.org/10.1051/ita/1996300403051openalex-snapshot

Average case analysis of fully dynamic reachability for directed graphs

inferred← citeshttps://doi.org/10.1108/bpmj-11-2018-0319openalex-snapshot

An alternative method for refined process structure trees (RPST)

inferred← citeshttps://doi.org/10.1109/icnp.2017.8117552openalex-snapshot

Preferential link tomography in dynamic networks

inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155406openalex-snapshot

Bound-based Network Tomography for Inferring Interesting Link Metrics

inferred← citeshttps://doi.org/10.1109/istcs.1993.253480openalex-snapshot

Maintaining the 4-edge-connected components of a graph on-line

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185451openalex-snapshot

On-line maintenance of the four-connected components of a graph

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267817openalex-snapshot

On four-connecting a triconnected graph

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot

Sparsification-a technique for speeding up dynamic graph algorithms

inferred← citeshttps://doi.org/10.1109/tcsi.2004.843056openalex-snapshot

Generation of wave digital structures for networks containing multiport elements

inferred← citeshttps://doi.org/10.1109/tnet.2016.2581176openalex-snapshot

Optimal Monitor Assignment for Preferential Link Tomography in Communication Networks

inferred← citeshttps://doi.org/10.1109/tnet.2019.2931047openalex-snapshot

Preferential Link Tomography in Dynamic Networks

inferred← citeshttps://doi.org/10.1109/tnet.2022.3180631openalex-snapshot

Bound-Based Network Tomography for Inferring Interesting Path Metrics

inferred← citeshttps://doi.org/10.1137/1.9781611975482.37openalex-snapshot

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time

inferred← citeshttps://doi.org/10.1137/1.9781611975994.146openalex-snapshot

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

inferred← citeshttps://doi.org/10.1137/1.9781611976465.165openalex-snapshot

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees

inferred← citeshttps://doi.org/10.1137/s009753970037775xopenalex-snapshot

Common-Face Embeddings of Planar Graphs

inferred← citeshttps://doi.org/10.1137/s0097539793257770openalex-snapshot

Maintenance of 2- and 3-Edge-Connected Components of Graphs II

inferred← citeshttps://doi.org/10.1137/s0097539794279626openalex-snapshot

Optimal Upward Planarity Testing of Single-Source Digraphs

inferred← citeshttps://doi.org/10.1137/s0097539794280736openalex-snapshot

On-Line Planarity Testing

inferred← citeshttps://doi.org/10.1137/s0895480197328771openalex-snapshot

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

inferred← citeshttps://doi.org/10.1145/103418.103454openalex-snapshot

Fully dynamic algorithms for edge connectivity problems

inferred← citeshttps://doi.org/10.1145/1086642.1086643openalex-snapshot

Efficient subtyping tests with PQ-encoding

inferred← citeshttps://doi.org/10.1145/1103963.1103966openalex-snapshot

Maintaining information in fully dynamic trees with top trees

inferred← citeshttps://doi.org/10.1145/129712.129761openalex-snapshot

Fully dynamic planarity testing (extended abstract)

inferred← citeshttps://doi.org/10.1145/167088.167152openalex-snapshot

Reinventing the wheel

inferred← citeshttps://doi.org/10.1145/1810959.1811030openalex-snapshot

Steinitz theorems for orthogonal polyhedra

inferred← citeshttps://doi.org/10.1145/195058.195439openalex-snapshot

Alpha-algorithms for incremental planarity testing (preliminary version)

inferred← citeshttps://doi.org/10.1145/2462356.2462370openalex-snapshot

The graphs of planar soap bubbles

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/3044713openalex-snapshot

An Indexing Framework for Queries on Probabilistic Graphs

inferred← citeshttps://doi.org/10.1145/504282.504290openalex-snapshot

Efficient subtyping tests with PQ-encoding

inferred← citeshttps://doi.org/10.1145/504311.504290openalex-snapshot

Efficient subtyping tests with PQ-encoding

inferred← citeshttps://doi.org/10.1186/1471-2105-15-s9-s9openalex-snapshot

ILP-based maximum likelihood genome scaffolding

inferred← citeshttps://doi.org/10.17169/refubium-18086openalex-snapshot

Structure and constructions of 3-connected graphs

inferred← citeshttps://doi.org/10.20382/jocg.v5i1a10openalex-snapshot

Steinitz theorems for simple orthogonal polyhedra

inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.19openalex-snapshot

Computing k-Modal Embeddings of Planar Digraphs

inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.71openalex-snapshot

Determining 4-Edge-Connected Components in Linear Time

inferred← citeshttps://doi.org/10.48550/arxiv.1011.6187openalex-snapshot

Contractions, Removals and How to Certify 3-Connectivity in Linear Time

inferred← citeshttps://doi.org/10.48550/arxiv.1607.02346openalex-snapshot

Strengthening Hardness Results to 3-Connected Planar Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1608.08427openalex-snapshot

Simultaneous Orthogonal Planarity

inferred← citeshttps://doi.org/10.48550/arxiv.1609.04606openalex-snapshot

C-Planarity of Overlapping Clusterings Including Unions of Two Partitions

inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot

Planarizing Graphs - A Survey and Annotated Bibliography

inferred← citeshttps://doi.org/10.7155/jgaa.00094openalex-snapshot

Algorithm and Experiments in Testing Planar Graphs for Isomorphism

inferred← citeshttps://doi.org/10.7155/jgaa.00369openalex-snapshot

Planar Octilinear Drawings with One Bend Per Edge

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.