On the public citation graph
Edge Disjoint Paths in Moderately Connected Graphs
0 signed · 69 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/3-540-56939-1_62openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
inferredcites →https://doi.org/10.1007/3-540-69346-7_12openalex-snapshot
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
inferredcites →https://doi.org/10.1007/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferredcites →https://doi.org/10.1007/bf02579324openalex-snapshot
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
inferredcites →https://doi.org/10.1109/focs.2004.27openalex-snapshot
Edge-Disjoint Paths in Planar Graphs
inferredcites →https://doi.org/10.1109/sfcs.1994.365675openalex-snapshot
On-line admission control and circuit routing for high performance computing and communication
inferredcites →https://doi.org/10.1109/sfcs.1995.492462openalex-snapshot
Disjoint paths in densely embedded graphs
inferredcites →https://doi.org/10.1109/sfcs.1996.548467openalex-snapshot
Short paths in expander graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646130openalex-snapshot
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
inferredcites →https://doi.org/10.1109/sfcs.2005.18openalex-snapshot
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
inferredcites →https://doi.org/10.1109/sfcs.2005.41openalex-snapshot
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
inferredcites →https://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1145/1007352.1007364openalex-snapshot
New hardness results for congestion minimization and machine scheduling
inferredcites →https://doi.org/10.1145/1007352.1007383openalex-snapshot
The all-or-nothing multicommodity flow problem
inferredcites →https://doi.org/10.1145/1007352.1007433openalex-snapshot
Approximate max-integral-flow/min-multicut theorems
inferredcites →https://doi.org/10.1145/1060590.1060618openalex-snapshot
Multicommodity flow, well-linked terminals, and routing problems
inferredcites →https://doi.org/10.1145/1060590.1060632openalex-snapshot
Hardness of the undirected edge-disjoint paths problem
inferredcites →https://doi.org/10.1145/1060590.1060633openalex-snapshot
Hardness of the undirected congestion minimization problem
inferredcites →https://doi.org/10.1145/1132516.1132574openalex-snapshot
Graph partitioning using single commodity flows
inferredcites →https://doi.org/10.1145/1132516.1132592openalex-snapshot
Logarithmic hardness of the directed congestion minimization problem
inferredcites →https://doi.org/10.1145/1132516.1132621openalex-snapshot
Edge-disjoint paths in Planar graphs with constant congestion
inferredcites →https://doi.org/10.1145/1250790.1250816openalex-snapshot
Hardness of routing with congestion in directed graphs
inferredcites →https://doi.org/10.1145/1290672.1290683openalex-snapshot
Edge-disjoint paths revisited
inferredcites →https://doi.org/10.1145/1374376.1374442openalex-snapshot
On partitioning graphs via single commodity flows
inferredcites →https://doi.org/10.1145/195058.195422openalex-snapshot
Random sampling in cut, flow, and network design problems
inferredcites →https://doi.org/10.1145/225058.225075openalex-snapshot
Approximations for the disjoint paths problem in high-diameter planar networks
inferredcites →https://doi.org/10.1145/301250.301262openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferredcites →https://doi.org/10.1145/378580.378586openalex-snapshot
Simple on-line algorithms for the maximum disjoint paths problem
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.1287/moor.24.2.383openalex-snapshot
Random Sampling in Cut, Flow, and Network Design Problems
inferredcites →https://doi.org/10.5555/313651.313820openalex-snapshot
Improved bounds for all optical routing
inferredcites →https://doi.org/10.5555/982792.982846openalex-snapshot
Graph decomposition and a greedy algorithm for edge-disjoint paths
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_10openalex-snapshot
Green Computing Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_2openalex-snapshot
The Disjoint Paths Problem: Algorithm and Structure
inferred← citeshttps://doi.org/10.1007/s10107-017-1199-3openalex-snapshot
New algorithms for maximum disjoint paths based on tree-likeness
inferred← citeshttps://doi.org/10.1007/s11276-014-0823-xopenalex-snapshot
Multipath source routing strategies for video transmission in ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/focs.2010.33openalex-snapshot
Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
inferred← citeshttps://doi.org/10.1109/focs.2010.61openalex-snapshot
Minimum-Cost Network Design with (Dis)economies of Scale
inferred← citeshttps://doi.org/10.1109/focs.2012.54openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.1137/1.9781611973730.19openalex-snapshot
Degree-3 Treewidth Sparsifiers
inferred← citeshttps://doi.org/10.1137/110825959openalex-snapshot
Minimum-Cost Network Design with (Dis)economies of Scale
inferred← citeshttps://doi.org/10.1137/130910464openalex-snapshot
Routing in Undirected Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.1137/16m1091666openalex-snapshot
A General Framework for Graph Sparsification
inferred← citeshttps://doi.org/10.1137/17m1146580openalex-snapshot
New Hardness Results for Routing on Disjoint Paths
inferred← citeshttps://doi.org/10.1137/17m1150694openalex-snapshot
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
inferred← citeshttps://doi.org/10.1137/18m1228591openalex-snapshot
Hallucination Helps: Energy Efficient Virtual Circuit Routing
inferred← citeshttps://doi.org/10.1145/1993636.1993647openalex-snapshot
A general framework for graph sparsification
inferred← citeshttps://doi.org/10.1145/1993636.1993648openalex-snapshot
Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two
inferred← citeshttps://doi.org/10.1145/2213977.2214039openalex-snapshot
On vertex sparsifiers with Steiner nodes
inferred← citeshttps://doi.org/10.1145/2213977.2214040openalex-snapshot
Approximation algorithms and hardness of integral concurrent flow
inferred← citeshttps://doi.org/10.1145/2213977.2214054openalex-snapshot
Routing in undirected graphs with constant congestion
inferred← citeshttps://doi.org/10.1145/2488608.2488645openalex-snapshot
Large-treewidth graph decompositions and applications
inferred← citeshttps://doi.org/10.1145/2591796.2591813openalex-snapshot
Polynomial bounds for the grid-minor theorem
inferred← citeshttps://doi.org/10.1145/2820609openalex-snapshot
Polynomial Bounds for the Grid-Minor Theorem
inferred← citeshttps://doi.org/10.1145/2893472openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.1145/2897518.2897538openalex-snapshot
Improved approximation for node-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1145/2960410openalex-snapshot
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
inferred← citeshttps://doi.org/10.1145/3055399.3055411openalex-snapshot
New hardness results for routing on disjoint paths
inferred← citeshttps://doi.org/10.1145/3188745.3188772openalex-snapshot
Almost polynomial hardness of node-disjoint paths in grids
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.187openalex-snapshot
On Approximating Node-Disjoint Paths in Grids
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.38openalex-snapshot
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2021.74openalex-snapshot
Large Minors in Expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1107.2554openalex-snapshot
Routing in Undirected Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.5555/2634074.2634158openalex-snapshot
Hallucination helps: energy efficient virtual circuit 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.