| Publication | Date of Publication | Type |
|---|
| Polylogarithmic approximations for the capacitated single-sink confluent flow problem | 2025-08-05 | Paper |
Cut-sufficient directed 2-commodity multiflow topologies
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
A knapsack intersection hierarchy
Operations Research Letters | 2023-06-27 | Paper |
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Multi-agent submodular optimization
(available as arXiv preprint) | 2021-08-04 | Paper |
Maximum edge-disjoint paths in planar graphs with congestion 2
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
Theory of Computing | 2018-01-10 | Paper |
Single-Sink Multicommodity Flow with Side Constraints
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Edge-disjoint paths in planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Approximability of robust network design
Mathematics of Operations Research | 2014-07-11 | Paper |
| Approximability of robust network design | 2014-05-22 | Paper |
Flow-cut gaps for integer and fractional multiflows
(available as arXiv preprint) | 2014-05-22 | Paper |
The VPN conjecture is true
Journal of the ACM | 2014-02-17 | Paper |
The all-or-nothing multicommodity flow problem
SIAM Journal on Computing | 2013-11-14 | Paper |
Maximum edge-disjoint paths in \(k\)-sums of graphs
Automata, Languages, and Programming | 2013-08-06 | Paper |
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
Topology-aware VM migration in bandwidth oversubscribed datacenter networks
Automata, Languages, and Programming | 2012-11-01 | Paper |
Strategic network formation through peering and service agreements
Games and Economic Behavior | 2011-10-12 | Paper |
Dynamic vs. oblivious routing in network design
Algorithmica | 2011-08-16 | Paper |
scientific article; zbMATH DE number 5899246 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The all-or-nothing multicommodity flow problem
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Edge-disjoint paths in planar graphs with constant congestion
SIAM Journal on Computing | 2010-03-17 | Paper |
Approximate integer decompositions for undirected network design problems
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Dynamic vs. oblivious routing in network design
Lecture Notes in Computer Science | 2009-10-29 | Paper |
A note on multiflows and treewidth
Algorithmica | 2009-08-27 | Paper |
| scientific article; zbMATH DE number 5485556 (Why is no real title available?) | 2009-01-05 | Paper |
The Demand-Matching Problem
Mathematics of Operations Research | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 2246594 (Why is no real title available?) | 2006-01-13 | Paper |
Directed Network Design with Orientation Constraints
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
| scientific article; zbMATH DE number 2038727 (Why is no real title available?) | 2004-02-08 | Paper |
Reserving resilient capacity in a network
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
| The theta body and imperfection | 2001-01-01 | Paper |
Strong orientations without even directed circuits
Discrete Mathematics | 2000-11-02 | Paper |
| scientific article; zbMATH DE number 1445363 (Why is no real title available?) | 2000-10-23 | Paper |
| scientific article; zbMATH DE number 1263275 (Why is no real title available?) | 2000-10-10 | Paper |
The Graphs with All Subgraphs T-Perfect
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Face extensions in planar cubic graphs
Discrete Mathematics | 1998-04-01 | Paper |
The Gallai-Younger conjecture for planar graphs
Combinatorica | 1998-01-07 | Paper |
Applying Lehman's theorems to packing problems
Mathematical Programming. Series A. Series B | 1996-09-18 | Paper |
| Subdivisions and the chromatic index ofr-graphs | 1996-07-23 | Paper |
Note on a conjecture of Toft
Combinatorica | 1996-02-08 | Paper |
Near-perfect matrices
Mathematical Programming. Series A. Series B | 1994-10-10 | Paper |
A note on clutter partitions
Operations Research Letters | 1994-09-05 | Paper |
Hamiltonicity in claw-free graphs
Journal of Combinatorial Theory. Series B | 1992-06-28 | Paper |
