On the public citation graph

Algorithms for routing in planar graphs

https://doi.org/10.1007/bf00289496
0 signed · 47 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 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/978-3-642-68402-9_18openalex-snapshot
Provably Good Channel Routing Algorithms
inferredcites →https://doi.org/10.1007/bf02579432openalex-snapshot
Disjoint paths in a rectilinear grid
inferredcites →https://doi.org/10.1007/bfb0015758openalex-snapshot
Routing through a generalized switchbox
inferredcites →https://doi.org/10.1016/0095-8956(85)90046-2openalex-snapshot
Edge-disjoint paths in planar graphs
inferredcites →https://doi.org/10.1016/s0095-8956(81)80012-3openalex-snapshot
Multicommodity flows in planar graphs
inferredcites →https://doi.org/10.1109/tc.1984.1676459openalex-snapshot
Optimal Three-Layer Channel Routing
inferredcites →https://doi.org/10.1109/tcad.1985.1270091openalex-snapshot
Remarks as Outgoing Editor
inferredcites →https://doi.org/10.1145/4904.4994openalex-snapshot
Routing through a rectangle
inferredcites →https://doi.org/10.22028/d291-26447openalex-snapshot
Four results on the complexity of VLSI computations

What points at this work

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

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-45655-4_8openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_51openalex-snapshot
Short wire routing in convex grids
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_78openalex-snapshot
A faster algorithm for edge-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_73openalex-snapshot
A linear-time algorithm for edge-disjoint paths in planar graphs
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-540-71844-4_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
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-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/bf01185338openalex-snapshot
Parity conditions in homotopic knock-knee routing
inferred← citeshttps://doi.org/10.1007/bf01294465openalex-snapshot
A linear-time algorithm for edge-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0039593openalex-snapshot
On local routing of two-terminal nets
inferred← citeshttps://doi.org/10.1007/s11128-023-04120-zopenalex-snapshot
Quantum routing in planar graph using perfect state transfer
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90136-zopenalex-snapshot
Edge-disjoint paths in a grid bounded by two nested rectangles
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90059-lopenalex-snapshot
Variable-priority queue and doughnut routing
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/s0167-5060(08)70208-5openalex-snapshot
Chapter 5 Routing
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80112-4openalex-snapshot
Chapter 8 VLSI network design
inferred← citeshttps://doi.org/10.1109/31.81856openalex-snapshot
Wirability of knock-knee layouts with 45 degrees wires
inferred← citeshttps://doi.org/10.1109/43.46784openalex-snapshot
A linear-time algorithm for routing in a convex grid
inferred← citeshttps://doi.org/10.1109/glsv.1992.218351openalex-snapshot
An algorithm for embedding a class of non-even routing problems in even routing problems
inferred← citeshttps://doi.org/10.1109/glsv.1992.218352openalex-snapshot
Routing in a rectangle with k-ary overlap
inferred← citeshttps://doi.org/10.1109/iscas.1991.176251openalex-snapshot
Routing in rectilinear polygons
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/ssci.2018.8628683openalex-snapshot
A Survey on Graph-based Systems in Manufacturing Processes
inferred← citeshttps://doi.org/10.1137/070703041openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1137/s0097539789162109openalex-snapshot
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
inferred← citeshttps://doi.org/10.1145/1008731.1008737openalex-snapshot
Edge-disjoint routing in plane switch graphs in linear time
inferred← citeshttps://doi.org/10.1155/1998/14757openalex-snapshot
On Ensuring Multilayer Wirability by Stretching Layouts
inferred← citeshttps://doi.org/10.23919/ifipnetworking.2018.8696560openalex-snapshot
Waypoint Routing in Special Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00055openalex-snapshot
Charting the Complexity Landscape of Waypoint Routing
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.