On the public citation graph
On-Line Maintenance of Triconnected Components with SPQR-Trees
0 signed · 163 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.1996.0044openalex-snapshot
On-line Planar Graph Embedding
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-55719-9_87openalex-snapshot
Maintenance of triconnected components of graphs
inferredcites →https://doi.org/10.1007/bf01758773openalex-snapshot
Maintaining bridge-connected and biconnected components on-line
inferredcites →https://doi.org/10.1007/bfb0035771openalex-snapshot
Finding triconnected components by local replacements
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.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.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4821442openalex-extracted
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1002/widm.1081openalex-snapshot
Methods and techniques for discovering taxonomies of behavioral process models
inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1077openalex-snapshot
On Four-Connecting a Triconnected Graph
inferred← citeshttps://doi.org/10.1007/11618058_21openalex-snapshot
Non-planar Core Reduction of Graphs
inferred← citeshttps://doi.org/10.1007/11618058_27openalex-snapshot
Convex Drawings of Plane Graphs of Minimum Outer Apices
inferred← citeshttps://doi.org/10.1007/11764298_28openalex-snapshot
Experiments on Exact Crossing Minimization Using Column Generation
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_49openalex-snapshot
Crossing Minimization for Symmetries
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_20openalex-snapshot
Authenticated Data Structures for Graph and Geometric Searching
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_21openalex-snapshot
Fractal Merkle Tree Representation and Traversal
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-44968-x_12openalex-snapshot
Hierarchical Topological Inference on Planar Disc Maps
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-45848-4_16openalex-snapshot
Drawing Graphs Symmetrically in Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_30openalex-snapshot
Finding Planar Geometric Automorphisms in Planar Graphs
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-61332-3_141openalex-snapshot
Output-sensitive reporting of disjoint paths (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
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-030-60440-0_27openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_10openalex-snapshot
Unit-length Rectangular Drawings of Graphs
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/978-3-031-34347-6_18openalex-snapshot
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_6openalex-snapshot
Parameterized Complexity of Simultaneous Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_20openalex-snapshot
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_7openalex-snapshot
A Linear-Time Algorithm for Testing Outer-1-Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_41openalex-snapshot
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13102-3_77openalex-snapshot
End-User Service Distribution for Efficient Inter-Domain Execution
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_4openalex-snapshot
Orthogonal Graph Drawing with Inflexible Edges
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_9openalex-snapshot
Special Classes of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_41openalex-snapshot
Simultaneous Orthogonal Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_6openalex-snapshot
Multi-interval Pairwise Compatibility Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_4openalex-snapshot
Hierarchical Partial Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_8openalex-snapshot
Faster Network Algorithms Based on Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_22openalex-snapshot
Drawing Series-Parallel Graphs on Restricted Integer 3D Grids
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_24openalex-snapshot
Graph Embedding with Minimum Depth and Maximum External Face
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_31openalex-snapshot
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_23openalex-snapshot
Fixed-Parameter Tractable Algorithms for Testing Upward Planarity
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_18openalex-snapshot
Algorithms for the Hypergraph and the Minor Crossing Number Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_18openalex-snapshot
Optimization and Recognition for K 5-minor Free Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_29openalex-snapshot
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
inferred← citeshttps://doi.org/10.1007/978-3-642-03848-8_16openalex-snapshot
The Triconnected Abstraction of Process Models
inferred← citeshttps://doi.org/10.1007/978-3-642-05148-7_23openalex-snapshot
Unveiling Hidden Unstructured Regions in Process Models
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_92openalex-snapshot
Upward Star-Shaped Polyhedral Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_34openalex-snapshot
DAGmaps and ε-Visibility Representations of DAGs
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_6openalex-snapshot
Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_2openalex-snapshot
Monotone Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_9openalex-snapshot
Orthogonal Graph Drawing with Flexibility Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_22openalex-snapshot
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-19589-1_2openalex-snapshot
Simplified Computation and Generalization of the Refined Process Structure Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_10openalex-snapshot
Advances in the Planarization Method: Effective Multiple Edge Insertions
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_4openalex-snapshot
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_4openalex-snapshot
Disconnectivity and Relative Positions in Simultaneous Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_8openalex-snapshot
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_59openalex-snapshot
Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_16openalex-snapshot
Optimal Orthogonal Graph Drawing with Convex Bend Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_33openalex-snapshot
TESTING MUTUAL DUALITY OF PLANAR GRAPHS
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_37openalex-snapshot
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_5openalex-snapshot
Algorithms for 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_7openalex-snapshot
$$\textit{\textbf{k}}$$-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_10openalex-snapshot
Ranking and Unranking of the Planar Embeddings of a Planar Graph
inferred← citeshttps://doi.org/10.1007/s00224-005-1256-9openalex-snapshot
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
inferred← citeshttps://doi.org/10.1007/s00224-015-9645-1openalex-snapshot
Counting the Number of Perfect Matchings in K 5-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00446-023-00455-zopenalex-snapshot
Near-optimal distributed computation of small vertex cuts
inferred← citeshttps://doi.org/10.1007/s00453-003-1055-0openalex-snapshot
Disk Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-009-9355-7openalex-snapshot
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
inferred← citeshttps://doi.org/10.1007/s00453-011-9570-xopenalex-snapshot
Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
inferred← citeshttps://doi.org/10.1007/s00453-012-9705-8openalex-snapshot
Orthogonal Graph Drawing with Flexibility Constraints
inferred← citeshttps://doi.org/10.1007/s00453-013-9790-3openalex-snapshot
Monotone Drawings of Graphs with Fixed Embedding
inferred← citeshttps://doi.org/10.1007/s00453-014-9890-8openalex-snapshot
A Linear-Time Algorithm for Testing Outer-1-Planarity
inferred← citeshttps://doi.org/10.1007/s00453-018-0510-xopenalex-snapshot
Characterizing and Recognizing 4-Map Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0530-6openalex-snapshot
Hierarchical Partial Planarity
inferred← citeshttps://doi.org/10.1007/s00453-023-01111-5openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
inferred← citeshttps://doi.org/10.1007/s00454-021-00285-5openalex-snapshot
Unavoidable Minors for Graphs with Large $$\ell _p$$-Dimension
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.07.005openalex-snapshot
A Kuratowski-type theorem for planarity of partially embedded graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.001openalex-snapshot
Relaxing the constraints of clustered planarity
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.02.002openalex-snapshot
Disconnectivity and relative positions in simultaneous embeddings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.03.001openalex-snapshot
Orthogonal graph drawing with inflexible edges
inferred← citeshttps://doi.org/10.1016/j.dam.2011.05.007openalex-snapshot
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.078openalex-snapshot
Non-planar core reduction of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114815openalex-snapshot
The flip graph on planar layouts of a planar tanglegram is almost a hypercube
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.006openalex-snapshot
A branch-and-cut approach to the crossing number problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.12.002openalex-snapshot
Linear-time recognition of map graphs with outerplanar witness
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.03.005openalex-snapshot
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.015openalex-snapshot
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.039openalex-snapshot
Simpler algorithms for testing two-page book embedding of partitioned graphs
inferred← citeshttps://doi.org/10.1023/b:tels.0000029044.31054.5aopenalex-snapshot
A Simulation-Based Method for Predicting Connectivity in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1101/2025.07.05.662656openalex-snapshot
An Efficient Graph Algorithm for Diploid Local Ancestry Inference
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/apvis.2007.329275openalex-snapshot
Efficiently drawing a significant spanning tree of a directed graph
inferred← citeshttps://doi.org/10.1109/ccc.2014.15openalex-snapshot
Counting the Number of Perfect Matchings in K5-Free Graphs
inferred← citeshttps://doi.org/10.1109/imis.2013.154openalex-snapshot
On the Characterization of Collaborative Mobile Services for the Internet of Things
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205000openalex-snapshot
Generation of wave digital structures for connection networks containing ideal transformers
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814603openalex-snapshot
Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design]
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.2642185openalex-snapshot
Robust and Efficient Monitor Placement for Network Tomography in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2790961openalex-snapshot
Graph Thumbnails: Identifying and Comparing Multiple Graphs at a Glance
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.9781611975994.146openalex-snapshot
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
inferred← citeshttps://doi.org/10.1137/17m1146610openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/18m122162xopenalex-snapshot
Minor-Closed Graph Classes with Bounded Layered Pathwidth
inferred← citeshttps://doi.org/10.1137/23m1564845openalex-snapshot
Space Complexity of Vertex Connectivity Oracles
inferred← citeshttps://doi.org/10.1137/s009753970037775xopenalex-snapshot
Common-Face Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0097539794272582openalex-snapshot
Dynamic 2-Connectivity with Backtracking
inferred← citeshttps://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
inferred← citeshttps://doi.org/10.1137/s0097539799354321openalex-snapshot
Finding Double Euler Trails of Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1142/s0129054106004285openalex-snapshot
TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
inferred← citeshttps://doi.org/10.1142/s0129054106004297openalex-snapshot
CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
inferred← citeshttps://doi.org/10.1142/s179383091550007xopenalex-snapshot
Straight-line monotone grid drawings of series–parallel graphs
inferred← citeshttps://doi.org/10.1145/1086642.1086643openalex-snapshot
Efficient subtyping tests with PQ-encoding
inferred← citeshttps://doi.org/10.1145/1498698.1564504openalex-snapshot
Experiments on exact crossing minimization using column generation
inferred← citeshttps://doi.org/10.1145/1998196.1998214openalex-snapshot
A kuratowski-type theorem for planarity of partially embedded graphs
inferred← citeshttps://doi.org/10.1145/2738054openalex-snapshot
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
inferred← citeshttps://doi.org/10.1145/2838736openalex-snapshot
Optimal Orthogonal Graph Drawing with Convex Bend Costs
inferred← citeshttps://doi.org/10.1145/3357713.3384235openalex-snapshot
Three-in-a-tree in near linear time
inferred← citeshttps://doi.org/10.1145/3357713.3384249openalex-snapshot
Fully-dynamic planarity testing in polylogarithmic time
inferred← citeshttps://doi.org/10.1145/3519935.3519945openalex-snapshot
Optimal vertex connectivity oracles
inferred← citeshttps://doi.org/10.1145/3607474openalex-snapshot
Synchronized Planarity with Applications to Constrained Planarity Problems
inferred← citeshttps://doi.org/10.1145/3618260.3649729openalex-snapshot
Connectivity Labeling and Routing with Multiple Vertex Failures
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/s13059-019-1791-3openalex-snapshot
MetaCarvel: linking assembly graph motifs to biological variants
inferred← citeshttps://doi.org/10.1201/b15385-20openalex-snapshot
- The Open Graph Drawing Framework (OGDF)
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21752openalex-snapshot
Generalized Longest Path Problems
inferred← citeshttps://doi.org/10.20868/upm.thesis.21983openalex-snapshot
Contribution to flexible service coordination in mobile prosumer environments
inferred← citeshttps://doi.org/10.25911/5d626e1abd90eopenalex-snapshot
Recursive Algorithms for Generation of Planar Graphs
inferred← citeshttps://doi.org/10.4018/ijdwm.2016010101openalex-snapshot
Enabling Efficient Service Distribution using Process Model Transformations
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2903openalex-snapshot
Disconnectivity and Relative Positions in Simultaneous Embeddings
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4997openalex-snapshot
Optimal Orthogonal Graph Drawing with Convex Bend Costs
inferred← citeshttps://doi.org/10.48550/arxiv.1207.3934openalex-snapshot
Relaxing the Constraints of Clustered Planarity
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2978openalex-snapshot
Graphs with Plane Outside-Obstacle Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1608.08427openalex-snapshot
Simultaneous Orthogonal Planarity
inferred← citeshttps://doi.org/10.5281/zenodo.5702749openalex-snapshot
On application of structural decomposition for process model abstraction
inferred← citeshttps://doi.org/10.5555/1496770.1496812openalex-snapshot
Inserting a vertex into a planar graph
inferred← citeshttps://doi.org/10.5614/ejgta.2019.7.1.11openalex-snapshot
Maximum cycle packing using SPR-trees
inferred← citeshttps://doi.org/10.5753/wtf.2016.22873openalex-snapshot
Utilização da Árvore SPQR para um Cálculo Mais Eficiente das Medidas de Conectividade Baseadas em Cortes de Vértices
inferred← citeshttps://doi.org/10.70675/a4bbf0d8z2807z4cffz8f7dze598b2ca4324openalex-snapshot
Time-continuous power-balanced simulation of nonlinear audio circuits : realtime processing framework and aliasing rejection
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.00168openalex-snapshot
Using a Significant Spanning Tree to Draw a Directed Graph
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.