On the public citation graph
Dividing a Graph into Triconnected Components
0 signed · 765 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.1109/tct.1969.1082941openalex-snapshot
Methods for Investigating Connectivity of Large Graphs
inferredcites →https://doi.org/10.1109/tct.1970.1083101openalex-snapshot
A new planarity test based on 3-connectivity
inferredcites →https://doi.org/10.1109/tct.1971.1083313openalex-snapshot
Decomposition of a graph into compactly connected two-terminal subgraphs
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1215/s0012-7094-37-00336-3openalex-snapshot
A structural characterization of planar combinatorial graphs
inferredcites →https://doi.org/10.2307/2314099openalex-snapshot
Finite Graphs and Networks, An Introduction with Applications.
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/(sici)1097-0037(199909)34:2<81::aid-net1>3.0.co;2-popenalex-snapshot
Optimal tree 3-spanners in directed path graphs
inferred← citeshttps://doi.org/10.1002/9783527628025.ch16openalex-snapshot
Isomorphism and Factorization – Classical and Quantum Algorithms
inferred← citeshttps://doi.org/10.1002/cta.3781openalex-snapshot
A better SPQR‐tree decomposition of electrical circuits containing multiports and its application to wave digital emulation
inferred← citeshttps://doi.org/10.1002/ecjc.4430750501openalex-snapshot
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex‐ and edge‐weights on the exterior window
inferred← citeshttps://doi.org/10.1002/ett.4460110203openalex-snapshot
Measuring the Survivability of a Network: Connectivity and Rest‐Connectivity
inferred← citeshttps://doi.org/10.1002/jgt.20405openalex-snapshot
A structure theorem for graphs with no cycle with a unique chord and its consequences
inferred← citeshttps://doi.org/10.1002/jgt.21635openalex-snapshot
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
inferred← citeshttps://doi.org/10.1002/jgt.23121openalex-snapshot
A more accurate view of the Flat Wall Theorem
inferred← citeshttps://doi.org/10.1002/jgt.3190190408openalex-snapshot
On the existence of special depth first search trees
inferred← citeshttps://doi.org/10.1002/jgt.3190200303openalex-snapshot
Hamiltonicity of 5‐Connected Toroidal Triangulations
inferred← citeshttps://doi.org/10.1002/net.10034openalex-snapshot
Source location problems considering vertex‐connectivity and edge‐connectivity simultaneously
inferred← citeshttps://doi.org/10.1002/net.10113openalex-snapshot
Low‐connectivity network design on series‐parallel graphs
inferred← citeshttps://doi.org/10.1002/net.20099openalex-snapshot
The multiroute maximum flow problem revisited
inferred← citeshttps://doi.org/10.1002/net.3230130107openalex-snapshot
Network reliability and the factoring theorem
inferred← citeshttps://doi.org/10.1002/net.3230140402openalex-snapshot
Network reliability and acyclic orientations
inferred← citeshttps://doi.org/10.1002/net.3230150204openalex-snapshot
A factoring algorithm using polygon‐to‐chain reductions for computing K‐terminal network reliability
inferred← citeshttps://doi.org/10.1002/net.3230170109openalex-snapshot
Forbidden subgraphs and graph decomposition
inferred← citeshttps://doi.org/10.1002/net.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
inferred← citeshttps://doi.org/10.1002/net.3230190203openalex-snapshot
Triconnected decomposition for computing K‐terminal network reliability
inferred← citeshttps://doi.org/10.1002/net.3230230307openalex-snapshot
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
inferred← citeshttps://doi.org/10.1002/net.3230230604openalex-snapshot
Finding all minimum‐size separating vertex sets in a graph
inferred← citeshttps://doi.org/10.1002/net.3230250206openalex-snapshot
Thirty‐five‐point rectilinear steiner minimal trees in a day
inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1006/jagm.1997.0894openalex-snapshot
Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1998.0943openalex-snapshot
A Randomized Parallel Algorithm for Planar Graph Isomorphism
inferred← citeshttps://doi.org/10.1006/jctb.2002.2076openalex-snapshot
Sewing Ribbons on Graphs in Space
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1514openalex-snapshot
A SimpleO(logN) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
inferred← citeshttps://doi.org/10.1006/jsco.2000.0402openalex-snapshot
Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD
inferred← citeshttps://doi.org/10.1006/jsco.2000.0403openalex-snapshot
Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms
inferred← citeshttps://doi.org/10.1007/10692760_26openalex-snapshot
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
inferred← citeshttps://doi.org/10.1007/11533719_88openalex-snapshot
Approximating the Longest Cycle Problem on Graphs with Bounded Degree
inferred← citeshttps://doi.org/10.1007/11618058_27openalex-snapshot
Convex Drawings of Plane Graphs of Minimum Outer Apices
inferred← citeshttps://doi.org/10.1007/11758471_26openalex-snapshot
Distance Approximating Trees: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/11940128_15openalex-snapshot
Convex Grid Drawings of Plane Graphs with Rectangular Contours
inferred← citeshttps://doi.org/10.1007/11963271_16openalex-snapshot
Uniquely Localizable Networks with Few Anchors
inferred← citeshttps://doi.org/10.1007/3-540-10704-5_6openalex-snapshot
Canonical decompositions of symmetric submodular systems
inferred← citeshttps://doi.org/10.1007/3-540-10704-5_8openalex-snapshot
Combinatorial problems on series-parallel graphs
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_114openalex-snapshot
Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_71openalex-snapshot
Hierarchical planarity testing algorithms
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_27openalex-snapshot
NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_23openalex-snapshot
Rectangular Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_29openalex-snapshot
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets
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-44985-x_25openalex-snapshot
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
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-45471-3_25openalex-snapshot
Δ-List Vertex Coloring in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_52openalex-snapshot
Bend Minimization in Orthogonal Drawings Using Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
inferred← citeshttps://doi.org/10.1007/3-540-47997-x_12openalex-snapshot
Automated Geometry Diagram Construction and Engineering Geometry
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_27openalex-snapshot
Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)
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-50517-2_71openalex-snapshot
Extending planar graph algorithms to K 3,3-free graphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_37openalex-snapshot
DFS tree construction: Algorithms and characterizations
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_5openalex-snapshot
A framework for parallel graph algorithm design
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_44openalex-snapshot
Algorithms for square roots of graphs
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_20openalex-snapshot
Fully dynamic 2-edge-connectivity in 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-56279-6_55openalex-snapshot
The k-edge-connectivity augmentation problem of weighted graphs
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_44openalex-snapshot
The 3-edge-components and a structural description of all 3-edge-cuts in a graph
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_64openalex-snapshot
Problems on pairs of trees and the four colour problem of planar 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-57899-4_70openalex-snapshot
A more compact visibility representation
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_143openalex-snapshot
Batch dynamic algorithms for two graph problems
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_358openalex-snapshot
On drawing a graph convexly in the plane (extended abstract)
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-59408-6_64openalex-snapshot
Embedding graphs in the torus in linear time
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-61228-9_88openalex-snapshot
The use of tree transducers to compute translations between graph algebras
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_134openalex-snapshot
Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs
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/3-540-63938-1_74openalex-snapshot
GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends
inferred← citeshttps://doi.org/10.1007/978-0-8176-8364-1_3openalex-snapshot
Groups, Actions, and Symmetry
inferred← citeshttps://doi.org/10.1007/978-0-8176-8364-1_5openalex-snapshot
Combinatorial Configurations
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-030-04414-5_34openalex-snapshot
Bend-Minimum Orthogonal Drawings in Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_25openalex-snapshot
On the Parameterized Complexity of Edge-Linked Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_40openalex-snapshot
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity
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_28openalex-snapshot
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_9openalex-snapshot
Graph Isomorphism Restricted by Lists
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_23openalex-snapshot
Globally Rigid Augmentation of Minimally Rigid Graphs in $$\mathbb {R}^2$$
inferred← citeshttps://doi.org/10.1007/978-3-030-77961-0_41openalex-snapshot
Fast and Accurate Determination of Graph Node Connectivity Leveraging Approximate Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_6openalex-snapshot
Recognizing and Embedding Simple Optimal 2-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_11openalex-snapshot
Pathlength of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_12openalex-snapshot
Rectilinear Planarity of Partial 2-Trees
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-34347-6_31openalex-snapshot
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-36911-7_12openalex-snapshot
Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_4openalex-snapshot
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
inferred← citeshttps://doi.org/10.1007/978-3-031-53499-7_23openalex-snapshot
New Seeding Strategies for the Influence Maximization Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_1openalex-snapshot
Empirical Research on Petri Nets
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-08016-1_10openalex-snapshot
Monotone Grid Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_2openalex-snapshot
Tangles and Connectivity in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_25openalex-snapshot
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_37openalex-snapshot
NodeTrix Planarity Testing with Small Clusters
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_12openalex-snapshot
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_34openalex-snapshot
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_16openalex-snapshot
A Parameterized Algorithm for Upward Planarity Testing
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-30582-8_3openalex-snapshot
On the Load-Balanced Demand Points Assignment Problem in Large-Scale Wireless LANs
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_10openalex-snapshot
Algorithms for Graph Rigidity and Scene Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_29openalex-snapshot
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_13openalex-snapshot
Fast Distributed Computation of Cuts Via Random Circulations
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_14openalex-snapshot
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_58openalex-snapshot
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_23openalex-snapshot
Optimal Edge Deletions for Signed Graph Balancing
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-77120-3_62openalex-snapshot
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
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-540-85758-7_10openalex-snapshot
The Refined Process Structure Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-89652-4_11openalex-snapshot
Automatic Workflow Graph Refactoring and Completion
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_66openalex-snapshot
Finding Long Paths, Cycles and Circuits
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_26openalex-snapshot
Parameterized Graph Cleaning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_15openalex-snapshot
Topological Morphing of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_5openalex-snapshot
Crossing and Weighted Crossing Number of Near-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02538-9_6openalex-snapshot
Algorithm Engineering: Concepts and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_25openalex-snapshot
On the Hardness and Approximability of Planar Biconnectivity Augmentation
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_27openalex-snapshot
On the Complexity of Matroid Isomorphism Problems
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-03456-5_22openalex-snapshot
Algorithm Engineering – An Attempt at a Definition
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_77openalex-snapshot
Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13580-4_7openalex-snapshot
Rigid and Globally Rigid Graphs with Pinned Vertices
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_62openalex-snapshot
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_1openalex-snapshot
Progress on Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15543-7_6openalex-snapshot
Semantic Business Process Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-16934-2_29openalex-snapshot
The Biconnected Verification of Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_32openalex-snapshot
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_23openalex-snapshot
Flows in One-Crossing-Minor-Free Graphs
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-20877-5_36openalex-snapshot
Some Tractable Win-Lose Games
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_11openalex-snapshot
A Tighter Insertion-Based Approximation of the Crossing Number
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-27848-8_654-1openalex-snapshot
Symmetric Graph Drawing
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-31594-7_66openalex-snapshot
Certifying 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_29openalex-snapshot
Fáry’s Theorem for 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_8openalex-snapshot
Connectivity and Depth First Search
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-642-40313-2_67openalex-snapshot
A Planarity Test via Construction Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-74135-7_12openalex-snapshot
Hierarchische Zerlegung von Graphen mit zwei ausgezeichneten Knoten mit Anwendungen bei der Synthese und Analyse von MOS-Schaltungen
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_38openalex-snapshot
Representation and Extraction of Shape Features in a Solid Model
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_41openalex-snapshot
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_48openalex-snapshot
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
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-46981-1_48openalex-snapshot
Robust Monitor Assignment for Large Scale Sensor Network Tomography
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_58openalex-snapshot
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_76openalex-snapshot
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-662-55862-1_3openalex-snapshot
Log- and Model-Based Techniques for Security-Sensitive Tackling of Obstructed Workflow Executions
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_20openalex-snapshot
The Multiresolution Analysis of Flow Graphs
inferred← citeshttps://doi.org/10.1007/bf00123965openalex-snapshot
Graph-based recognition of morphological features
inferred← citeshttps://doi.org/10.1007/bf00124066openalex-snapshot
Graph-based extraction of two-connected morphological features from boundary representations
inferred← citeshttps://doi.org/10.1007/bf01098276openalex-snapshot
Testing planar pictures for isomorphism in linear time
inferred← citeshttps://doi.org/10.1007/bf01190896openalex-snapshot
A linear algorithm for the all-bidirectional-edges problem on planar graphs
inferred← citeshttps://doi.org/10.1007/bf01191205openalex-snapshot
A new graph triconnectivity algorithm and its parallelization
inferred← citeshttps://doi.org/10.1007/bf01200908openalex-snapshot
Projective plane and M�bius band obstructions
inferred← citeshttps://doi.org/10.1007/bf01202787openalex-snapshot
Decomposition of 3-connected graphs
inferred← citeshttps://doi.org/10.1007/bf01758776openalex-snapshot
A linear-time algorithm for finding an ambitus
inferred← citeshttps://doi.org/10.1007/bf01840379openalex-snapshot
On the complexity of embedding planar graphs to minimize certain distance measures
inferred← citeshttps://doi.org/10.1007/bf01961541openalex-snapshot
On-Line Maintenance of Triconnected Components with SPQR-Trees
inferred← citeshttps://doi.org/10.1007/bf02060472openalex-snapshot
Locating facilities which interact: Some solvable cases
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/bf02187912openalex-snapshot
Establishing order in planar subdivisions
inferred← citeshttps://doi.org/10.1007/bf02948786openalex-snapshot
Orthogonal drawings of graphs for the automation of VLSI circuit design
inferred← citeshttps://doi.org/10.1007/bf03167564openalex-snapshot
A linear time algorithm for computing 3-edge-connected components in a multigraph
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/bfb0017421openalex-snapshot
Recognizing edge replacement graph languages in cubic time
inferred← citeshttps://doi.org/10.1007/bfb0023845openalex-snapshot
Even induced cycles in planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
inferred← citeshttps://doi.org/10.1007/bfb0035771openalex-snapshot
Finding triconnected components by local replacements
inferred← citeshttps://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
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/pl00009419openalex-snapshot
Resolvable Representation of Polyhedra
inferred← citeshttps://doi.org/10.1007/s00224-005-1269-4openalex-snapshot
A Simple 3-Edge-Connected Component Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-010-9260-0openalex-snapshot
On the Complexity of Matroid Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/s00236-011-0137-8openalex-snapshot
Connectivity of workflow nets: the foundations of stepwise verification
showing the first 200 of 757 · page through all 757
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.