| Publication | Date of Publication | Type |
|---|
| Cut-sufficient directed 2-commodity multiflow topologies | 2023-11-09 | Paper |
| A knapsack intersection hierarchy | 2023-06-27 | Paper |
| Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators | 2023-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009516 | 2021-08-04 | Paper |
| Maximum edge-disjoint paths in planar graphs with congestion 2 | 2021-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602397 | 2018-01-10 | Paper |
| Single-Sink Multicommodity Flow with Side Constraints | 2017-04-07 | Paper |
| Edge-disjoint paths in Planar graphs with constant congestion | 2014-11-25 | Paper |
| Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2 | 2014-07-30 | Paper |
| Approximability of Robust Network Design | 2014-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417693 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417700 | 2014-05-22 | Paper |
| The VPN Conjecture Is True | 2014-02-17 | Paper |
| The All-or-Nothing Multicommodity Flow Problem | 2013-11-14 | Paper |
| Maximum Edge-Disjoint Paths in k-Sums of Graphs | 2013-08-06 | Paper |
| Flow-cut gaps for integer and fractional multiflows | 2013-04-17 | Paper |
| Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks | 2012-11-01 | Paper |
| Strategic network formation through peering and service agreements | 2011-10-12 | Paper |
| Dynamic vs. oblivious routing in network design | 2011-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002769 | 2011-05-24 | Paper |
| Multicommodity flow, well-linked terminals, and routing problems | 2010-08-16 | Paper |
| The all-or-nothing multicommodity flow problem | 2010-08-15 | Paper |
| Multicommodity demand flow in a tree and packing integer programs | 2010-08-14 | Paper |
| Approximate Integer Decompositions for Undirected Network Design Problems | 2010-03-17 | Paper |
| Edge-Disjoint Paths in Planar Graphs with Constant Congestion | 2010-03-17 | Paper |
| Dynamic vs. oblivious routing in network design | 2009-10-29 | Paper |
| A note on multiflows and treewidth | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549729 | 2009-01-05 | Paper |
| The Demand-Matching Problem | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717957 | 2006-01-13 | Paper |
| Directed Network Design with Orientation Constraints | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449192 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2758341 | 2001-01-01 | Paper |
| Strong orientations without even directed circuits | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952683 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234148 | 2000-10-10 | Paper |
| The Graphs with All Subgraphs T-Perfect | 1998-09-21 | Paper |
| Face extensions in planar cubic graphs | 1998-04-01 | Paper |
| The Gallai-Younger conjecture for planar graphs | 1998-01-07 | Paper |
| Applying Lehman's theorems to packing problems | 1996-09-18 | Paper |
| Subdivisions and the chromatic index ofr-graphs | 1996-07-23 | Paper |
| Note on a conjecture of Toft | 1996-02-08 | Paper |
| Near-perfect matrices | 1994-10-10 | Paper |
| A note on clutter partitions | 1994-09-05 | Paper |
| Hamiltonicity in claw-free graphs | 1992-06-28 | Paper |
