On the public citation graph

https://doi.org/10.4086/toc.2006.v002a007

0 signed · 99 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.1006/jcss.1999.1661openalex-snapshot
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints
inferredcites →https://doi.org/10.1007/3-540-45061-0_34openalex-snapshot
Multicommodity Demand Flow in a Tree
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/s00453-005-1172-zopenalex-snapshot
Combinatorial Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferredcites →https://doi.org/10.1016/s0020-0190(03)00351-xopenalex-snapshot
A note on the greedy algorithm for the unsplittable flow problem
inferredcites →https://doi.org/10.1016/s0022-0000(03)00066-7openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
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.1145/1007352.1007383openalex-snapshot
The all-or-nothing multicommodity flow problem
inferredcites →https://doi.org/10.1145/1290672.1290683openalex-snapshot
Edge-disjoint paths revisited
inferredcites →https://doi.org/10.1201/9781420010749-67openalex-snapshot
Edge-Disjoint Paths and Unsplittable Flow
inferredcites →https://doi.org/10.1287/moor.25.2.255.12228openalex-snapshot
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
inferredcites →https://doi.org/10.5555/545381.545404openalex-snapshot
Improved bounds for the unsplittable flow problem
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.1002/net.20216openalex-snapshot
The fractional congestion bound for efficient edge disjoint routing
inferred← citeshttps://doi.org/10.1002/net.22277openalex-snapshot
The Minimum Clique Routing Problem on Cycles
inferred← citeshttps://doi.org/10.1007/11786986_19openalex-snapshot
Edge Disjoint Paths in Moderately Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_244openalex-snapshot
Multicommodity Flow, Well-linked Terminals and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_15openalex-snapshot
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_19openalex-snapshot
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_20openalex-snapshot
Single-Sink Multicommodity Flow with Side Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_28openalex-snapshot
Approximability of Packing Disjoint Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_29openalex-snapshot
Maximum Bipartite Flow in Networks with Adaptive Channel Width
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_4openalex-snapshot
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
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-19094-0_2openalex-snapshot
The Disjoint Paths Problem: Algorithm and Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_28openalex-snapshot
Maximum Edge-Disjoint Paths in k-Sums of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_47openalex-snapshot
Medial Axis Based Routing Has Constant Load Balancing Factor
inferred← citeshttps://doi.org/10.1007/978-4-431-55756-2_9openalex-snapshot
Some Recent Progress for Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_3openalex-snapshot
Fair $$ k $$-Center Clustering with Minimum Representation Guarantees
inferred← citeshttps://doi.org/10.1007/s00453-007-9129-zopenalex-snapshot
A Note on Multiflows and Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-009-9349-5openalex-snapshot
Approximability of Packing Disjoint Cycles
inferred← citeshttps://doi.org/10.1007/s00453-020-00795-3openalex-snapshot
On Structural Parameterizations of the Edge Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/s00454-023-00552-7openalex-snapshot
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
inferred← citeshttps://doi.org/10.1007/s00493-010-2455-9openalex-snapshot
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
inferred← citeshttps://doi.org/10.1007/s10107-013-0713-5openalex-snapshot
Tree metrics and edge-disjoint $$S$$ S -paths
inferred← citeshttps://doi.org/10.1007/s10107-014-0856-zopenalex-snapshot
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
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.1016/j.dam.2009.03.009openalex-snapshot
Disjoint paths in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.016openalex-snapshot
Finding multiple induced disjoint paths in general graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105836openalex-snapshot
Routing with congestion in acyclic digraphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103715openalex-snapshot
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.005openalex-snapshot
The maximum integer multiterminal flow problem in directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.023openalex-snapshot
Maximum bipartite flow in networks with adaptive channel width
inferred← citeshttps://doi.org/10.1103/prxquantum.3.020342openalex-snapshot
Surface Code Compilation via Edge-Disjoint Paths
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.2012.54openalex-snapshot
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.1109/focs.2013.28openalex-snapshot
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs
inferred← citeshttps://doi.org/10.1109/focs.2014.54openalex-snapshot
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs
inferred← citeshttps://doi.org/10.1109/tcns.2016.2622362openalex-snapshot
Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2036365openalex-snapshot
Replication Routing in DTNs: A Resource Allocation Approach
inferred← citeshttps://doi.org/10.1137/060674442openalex-snapshot
Edge-Disjoint Paths in Planar Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.1137/080715093openalex-snapshot
Edge Disjoint Paths in Moderately Connected Graphs
inferred← citeshttps://doi.org/10.1137/100796820openalex-snapshot
The All-or-Nothing Multicommodity Flow Problem
inferred← citeshttps://doi.org/10.1137/130910464openalex-snapshot
Routing in Undirected Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.1137/130932326openalex-snapshot
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs
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/20m1319401openalex-snapshot
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1137/23m157020xopenalex-snapshot
Packing Cycles in Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.1137/s0895480102419743openalex-snapshot
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
inferred← citeshttps://doi.org/10.1145/1132516.1132621openalex-snapshot
Edge-disjoint paths in Planar graphs with constant congestion
inferred← citeshttps://doi.org/10.1145/1183907.1183908openalex-snapshot
New hardness results for congestion minimization and machine scheduling
inferred← citeshttps://doi.org/10.1145/1183907.1183910openalex-snapshot
Logarithmic hardness of the undirected edge-disjoint paths problem
inferred← citeshttps://doi.org/10.1145/1273340.1273343openalex-snapshot
Multicommodity demand flow in a tree and packing integer programs
inferred← citeshttps://doi.org/10.1145/1282380.1282422openalex-snapshot
DTN routing as a resource allocation problem
inferred← citeshttps://doi.org/10.1145/1282427.1282422openalex-snapshot
DTN routing as a resource allocation problem
inferred← citeshttps://doi.org/10.1145/1290672.1290683openalex-snapshot
Edge-disjoint paths revisited
inferred← citeshttps://doi.org/10.1145/1290672.1290685openalex-snapshot
Approximation algorithms and hardness results for cycle packing problems
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.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/2438645.2438648openalex-snapshot
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
inferred← citeshttps://doi.org/10.1145/2532645openalex-snapshot
A logarithmic approximation for unsplittable flow on line graphs
inferred← citeshttps://doi.org/10.1145/2632951.2632987openalex-snapshot
Load balanced short path routing in large-scale wireless networks using area-preserving maps
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.1145/3355400openalex-snapshot
Algorithms to Approximate Column-sparse Packing Problems
inferred← citeshttps://doi.org/10.1145/3579367openalex-snapshot
Optimized Compiler for Distributed Quantum Computing
inferred← citeshttps://doi.org/10.1184/r1/6619763openalex-snapshot
Routing, Disjoint Paths, and Classification (CMU-PDL-06-109)
inferred← citeshttps://doi.org/10.1201/9781420010749.ch57openalex-snapshot
Edge-Disjoint Paths and Unsplittable Flow
inferred← citeshttps://doi.org/10.1371/journal.pone.0145222openalex-snapshot
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
inferred← citeshttps://doi.org/10.1561/3100000017openalex-snapshot
Combinatorial Optimization of Alternating Current Electric Power Systems
inferred← citeshttps://doi.org/10.4086/toc.2017.v013a020openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2021.v017a006openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.265openalex-snapshot
On Linear Programming Relaxations for Unsplittable Flow in Trees
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.48550/arxiv.1002.3864openalex-snapshot
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
inferred← citeshttps://doi.org/10.48550/arxiv.1107.2554openalex-snapshot
Routing in Undirected Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.48550/arxiv.1208.1272openalex-snapshot
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4897openalex-snapshot
Maximum Edge-Disjoint Paths in $k$-sums of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00627openalex-snapshot
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04300openalex-snapshot
A Note on the Inapproximability of Induced Disjoint Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02724openalex-snapshot
Algorithms to Approximate Column-Sparse Packing Problems
inferred← citeshttps://doi.org/10.5555/1496770.1496847openalex-snapshot
A logarithmic approximation for unsplittable flow on line graphs
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.