On the public citation graph
A linear-time algorithm for edge-disjoint paths in planar graphs
0 signed · 70 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.1002/net.3230140204openalex-snapshot
On multicommodity flows in planar graphs
inferredcites →https://doi.org/10.1007/3-540-54945-5_78openalex-snapshot
A faster algorithm for edge-disjoint paths in planar graphs
inferredcites →https://doi.org/10.1007/3-540-57273-2_73openalex-snapshot
A linear-time algorithm for edge-disjoint paths in planar graphs
inferredcites →https://doi.org/10.1007/3-540-57568-5_264openalex-snapshot
Multicommodity flows in even, planar networks
inferredcites →https://doi.org/10.1007/bf00289496openalex-snapshot
Algorithms for routing in planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(81)90120-4openalex-snapshot
Maximum flow in (s,t) planar networks
inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
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(86)90016-7openalex-snapshot
Routing through a generalized switchbox
inferredcites →https://doi.org/10.1016/s0095-8956(81)80012-3openalex-snapshot
Multicommodity flows in planar graphs
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1109/43.46784openalex-snapshot
A linear-time algorithm for routing in a convex grid
inferredcites →https://doi.org/10.1109/tcad.1985.1270099openalex-snapshot
A Linear-Time Routing Algorithm for Convex Grids
inferredcites →https://doi.org/10.1137/0214023openalex-snapshot
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.5555/320176.320230openalex-snapshot
Finding Steiner forests in planar graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0831openalex-snapshot
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1006/jagm.1999.1054openalex-snapshot
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
inferred← citeshttps://doi.org/10.1007/11561071_24openalex-snapshot
An Algorithm for Node-Capacitated Ring Routing
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_44openalex-snapshot
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_6openalex-snapshot
a linear time algorithm for the arc disjoint Menger problem in planar directed graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_19openalex-snapshot
Multiflots et chaînes arête-disjointes
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_14openalex-snapshot
Euclidean Maximum Matchings in the Plane—Local to Global
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_6openalex-snapshot
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_14openalex-snapshot
Online Interval Scheduling with Predictions
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_12openalex-snapshot
Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_4openalex-snapshot
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_36openalex-snapshot
Integral Symmetric 2-Commodity Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_51openalex-snapshot
Maximum Edge-Disjoint Paths Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_17openalex-snapshot
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_16openalex-snapshot
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_19openalex-snapshot
Flussi multi-prodotto e cammini arco-disgiunti
inferred← citeshttps://doi.org/10.1007/s00453-024-01279-4openalex-snapshot
Euclidean Maximum Matchings in the Plane—Local to Global
inferred← citeshttps://doi.org/10.1007/s004530010029openalex-snapshot
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00356-2openalex-snapshot
The order-interval hypergraph of a finite poset and the König property
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.09.009openalex-snapshot
Paths of bounded length and their cuts: Parameterized complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.01.013openalex-snapshot
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103795openalex-snapshot
Online interval scheduling with predictions
inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.015openalex-snapshot
An algorithm for node-capacitated ring routing
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00223-2openalex-snapshot
The edge-disjoint paths problem is NP-complete for series–parallel graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00048-7openalex-snapshot
A software package of algorithms and heuristics for disjoint paths in Planar Networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00133-xopenalex-snapshot
On complexity, representation and approximation of integral multicommodity flows
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814604openalex-snapshot
Edge-disjoint routing in plane switch graphs in linear time
inferred← citeshttps://doi.org/10.1109/tvt.2014.2299550openalex-snapshot
Opportunistic Scheduling and Channel Allocation in MC-MR Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1145/1008731.1008737openalex-snapshot
Edge-disjoint routing in plane switch graphs in linear time
inferred← citeshttps://doi.org/10.1145/1868237.1868241openalex-snapshot
Length-bounded cuts and flows
inferred← citeshttps://doi.org/10.1145/301250.301372openalex-snapshot
Compact grid layouts of multi-level networks
inferred← citeshttps://doi.org/10.1145/3055399.3055453openalex-snapshot
The computational complexity of ball permutations
inferred← citeshttps://doi.org/10.1145/3409804openalex-snapshot
Resilience Bounds of Network Clock Synchronization with Fault Correction
inferred← citeshttps://doi.org/10.18255/1818-1015-2024-3-338-356openalex-snapshot
Some polynomial subclasses of the Eulerian walk problem for a multiple graph
inferred← citeshttps://doi.org/10.3103/s0146411625700348openalex-snapshot
Some Polynomial Subclasses of the Eulerian Walk Problem for a Multiple Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5478openalex-snapshot
Minimum multicuts and Steiner forests for Okamura-Seymour graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09243openalex-snapshot
Computational Complexity of Some Quantum Theories in $1+1$ Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06646openalex-snapshot
The Computational Complexity of Ball Permutations
inferred← citeshttps://doi.org/10.70675/eb8905e0z1a7az4b78zb79bzf22dae971635openalex-snapshot
Flots et chemins contraints : applications aux réseaux de télécommunications
inferred← citeshttps://doi.org/10.7155/jgaa.00610openalex-snapshot
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
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.