On the public citation graph

Output-Sensitive Reporting of Disjoint Paths

https://doi.org/10.1007/pl00009264
0 signed · 60 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 points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1007/0-387-29026-5_2openalex-snapshot
Topology Control in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1007/10692760_25openalex-snapshot
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/11604686_28openalex-snapshot
Finding Disjoint Paths on Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/11786986_36openalex-snapshot
Nearly Optimal Visibility Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_27openalex-snapshot
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_32openalex-snapshot
Drawing Planar Graphs with Few Segments on a Polynomial Grid
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_12openalex-snapshot
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_11openalex-snapshot
Strictly-Convex Drawings of 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_8openalex-snapshot
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_17openalex-snapshot
Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
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-55911-7_6openalex-snapshot
Multi-interval Pairwise Compatibility 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-31843-9_8openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_29openalex-snapshot
On Representation of Planar Graphs by Segments
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_40openalex-snapshot
Schnyder Woods and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_16openalex-snapshot
Leftist Canonical Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_25openalex-snapshot
Schnyder Greedy Routing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_21openalex-snapshot
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
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-45043-3_19openalex-snapshot
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_80openalex-snapshot
The Mondshein Sequence
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_61openalex-snapshot
Monotone Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_25openalex-snapshot
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_26openalex-snapshot
(t, s)-Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/bfb0045110openalex-snapshot
Independent spanning trees of chordal rings
inferred← citeshttps://doi.org/10.1007/s00026-024-00729-8openalex-snapshot
Grand-Schnyder Woods
inferred← citeshttps://doi.org/10.1007/s00453-006-0177-6openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9682-yopenalex-snapshot
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s10878-011-9390-6openalex-snapshot
Minimum-segment convex drawings of 3-connected cubic plane graphs
inferred← citeshttps://doi.org/10.1007/s11083-007-9075-zopenalex-snapshot
Orthogonal Surfaces and Their CP-Orders
inferred← citeshttps://doi.org/10.1016/j.disc.2004.01.021openalex-snapshot
A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114282openalex-snapshot
Structural parameters of Schnyder woods
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.02.010openalex-snapshot
On simultaneous straight-line grid embedding of a planar graph and its dual
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.12.004openalex-snapshot
Monotone drawings of graphs with few directions
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.tcs.2012.09.025openalex-snapshot
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.017openalex-snapshot
A simple routing algorithm based on Schnyder coordinates
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.034openalex-snapshot
Lower and upper bounds for long induced paths in 3-connected planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114290openalex-snapshot
Convex grid drawings of planar graphs with constant edge-vertex resolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115551openalex-snapshot
Toward Grünbaum’s conjecture bounding vertices of degree 4
inferred← citeshttps://doi.org/10.1109/iccima.2007.143openalex-snapshot
Optimal Decomposition Level of Discrete Wavelet Transform for Pixel Based Fusion of Multi - Focused Images
inferred← citeshttps://doi.org/10.1109/iccima.2007.318openalex-snapshot
Face Recognition Using Multi-Resolution Transform
inferred← citeshttps://doi.org/10.1109/iisa.2015.7388003openalex-snapshot
Monotone drawings of graphs with few directions
inferred← citeshttps://doi.org/10.1109/twc.2009.12.090073openalex-snapshot
LTRT: An efficient and reliable topology control algorithm for ad-hoc networks
inferred← citeshttps://doi.org/10.1137/060651811openalex-snapshot
Nearly Optimal Visibility Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1137/15m1030030openalex-snapshot
Mondshein Sequences (a.k.a. (2,1)-Orders)
inferred← citeshttps://doi.org/10.1142/s1469026809002552openalex-snapshot
CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
inferred← citeshttps://doi.org/10.1142/s179383091550007xopenalex-snapshot
Straight-line monotone grid drawings of series–parallel graphs
inferred← citeshttps://doi.org/10.1145/1023720.1023747openalex-snapshot
FLSS
inferred← citeshttps://doi.org/10.1145/1361192.1361196openalex-snapshot
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
inferred← citeshttps://doi.org/10.1145/3592445openalex-snapshot
Efficient Embeddings in Exact Arithmetic
inferred← citeshttps://doi.org/10.1155/2012/235374openalex-snapshot
Interference-Aware Fault-Tolerant Energy Spanner in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1201/b15385-9openalex-snapshot
- Planar Straight-Line Drawing Algorithms
inferred← citeshttps://doi.org/10.1587/transfun.2024dmp0012openalex-snapshot
(t, s)-Completely Independent Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot
A Survey on Small-Area Planar Graph Drawing
inferred← citeshttps://doi.org/10.5555/2133036.2133151openalex-snapshot
On succinct convex greedy drawing of 3-connected plane graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00219openalex-snapshot
More Canonical Ordering
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.