On the public citation graph
st-Ordering the vertices of biconnected graphs
0 signed · 38 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.1007/bf02235391openalex-snapshot
Ein algorithmisches Planaritätskriterium
inferredcites →https://doi.org/10.1007/bf02277216openalex-snapshot
Ein algorithmisches Planaritätskriterium
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5812openalex-snapshot
A self‐stabilizing algorithm for constructing a maximal (σ,τ)‐directed acyclic mixed graph
inferred← citeshttps://doi.org/10.1007/11618058_32openalex-snapshot
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_22openalex-snapshot
Parameterized st-Orientations of Graphs: Algorithms and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_28openalex-snapshot
Optimal st-Orientations for Plane Triangulations
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-80350-5_53openalex-snapshot
An Efficient Distributed Algorithm For st-numbering The Vertices Of A Biconnected Graph
inferred← citeshttps://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferred← citeshttps://doi.org/10.1007/bf02574056openalex-snapshot
A left-first search algorithm for planar graphs
inferred← citeshttps://doi.org/10.1007/s10878-007-9119-8openalex-snapshot
Optimal st-orientations for plane triangulations
inferred← citeshttps://doi.org/10.1016/j.dam.2004.12.001openalex-snapshot
Balanced vertex-orderings of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.01.016openalex-snapshot
A simple test on 2-vertex- and 2-edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.008openalex-snapshot
Simple computation of st-edge- and st-numberings from ear decompositions
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106194openalex-snapshot
A diameter-revealing proof of the Bondy-Lovász lemma
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.06.006openalex-snapshot
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.012openalex-snapshot
Algorithms for computing a parameterized st-orientation
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.032openalex-snapshot
A generalized greedy routing algorithm for 2-connected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.005openalex-snapshot
A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00076-0openalex-snapshot
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
inferred← citeshttps://doi.org/10.1080/17445760701536134openalex-snapshot
A self-stabilizing algorithm for the st-order problem
inferred← citeshttps://doi.org/10.1109/31.1746openalex-snapshot
Planar embedding: linear-time algorithms for vertex placement and edge orderings
inferred← citeshttps://doi.org/10.1109/43.21845openalex-snapshot
O(n/sup 2/) algorithms for graph planarization
inferred← citeshttps://doi.org/10.1109/candar.2018.00012openalex-snapshot
A Self-Stabilizing Algorithm for Constructing a Maximal (2,2)-Directed Acyclic Mixed Graph
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00219openalex-snapshot
A Self-Stabilizing Algorithm for Constructing ST-Reachable Directed Acyclic Graph When lS| ≤ 2 and |T| ≤ 2
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.56openalex-snapshot
A Self-Stabilizing Algorithm for Constructing (1,1)-Maximal Directed Acyclic Graph
inferred← citeshttps://doi.org/10.1137/110848311openalex-snapshot
Contractions, Removals, and Certifying 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.15803/ijnc.8.1_53openalex-snapshot
A Self-Stabilizing Algorithm for Constructing a Maximal (1,1)-Directed Acyclic Mixed Graph
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.1965openalex-snapshot
Listing All st-Orientations
inferred← citeshttps://doi.org/10.17169/refubium-18086openalex-snapshot
Structure and constructions of 3-connected graphs
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.1209.0700openalex-snapshot
A Simple Test on 2-Vertex- and 2-Edge-Connectivity
inferred← citeshttps://doi.org/10.7155/jgaa.00210openalex-snapshot
Applications of Parameterized st-Orientations
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.