F. Bruce Shepherd

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.

[BibT_eX]

[DOI]

Guyslain Naves

Henry Xia

Math. Program., February, 2023

A knapsack intersection hierarchy.

[BibT_eX]

[DOI]

Adam Jozefiak

Noah Weninger

Oper. Res. Lett., January, 2023

Diversity Embeddings and the Hypergraph Sparsest Cut.

[BibT_eX]

[DOI]

Adam D. Jozefiak

CoRR, 2023

Cut-Sufficient Directed 2-Commodity Multiflow Topologies.

[BibT_eX]

[DOI]

Joseph Poremba

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

When Do Gomory-Hu Subtrees Exist?

[BibT_eX]

[DOI]

Guyslain Naves

SIAM J. Discret. Math., 2022

A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees.

[BibT_eX]

[DOI]

Adam Jozefiak

Noah Weninger

CoRR, 2022

2021

Maximum edge-disjoint paths in planar graphs with congestion 2.

[BibT_eX]

[DOI]

Loïc Seguin-Charbonneau

Math. Program., 2021

Beyond Submodular Maximization via One-Sided Smoothness.

[BibT_eX]

[DOI]

Mehrdad Ghadiri

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Empirical Core of the Multicommodity Flow Game Without Side Payments.

[BibT_eX]

[DOI]

Coulter Beeson

CoRR, 2020

2019

Beyond Submodular Maximization.

[BibT_eX]

[DOI]

Mehrdad Ghadiri

CoRR, 2019

Multivariate Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Multi-Agent Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2018

2017

The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems.

[BibT_eX]

[DOI]

Adrian R. Vetta

Theory Comput., 2017

2016

Multi-Agent and Multivariate Submodular Optimization.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Shortest Path Versus Multihub Routing in Networks With Uncertain Demand.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.

[BibT_eX]

[DOI]

Adrian Vetta

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Approximability of Robust Network Design.

[BibT_eX]

[DOI]

Neil Olver

Math. Oper. Res., 2014

Co-Location-Resistant Clouds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

The All-or-Nothing Multicommodity Flow Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Flow-cut gaps for integer and fractional multiflows.

[BibT_eX]

[DOI]

Christophe Weibel

J. Comb. Theory B, 2013

The VPN Conjecture Is True.

[BibT_eX]

[DOI]

Navin Goyal

Neil Olver

J. ACM, 2013

Tight bounds for online vector bin packing.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Shortest path versus multi-hub routing in networks with uncertain demand.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Maximum Edge-Disjoint Paths in k-Sums of Graphs.

[BibT_eX]

[DOI]

Guyslain Naves

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Buy-at-Bulk Network Design with Protection.

[BibT_eX]

[DOI]

Spyridon Antonakopoulos

Lisa Zhang

Math. Oper. Res., 2011

Strategic network formation through peering and service agreements.

[BibT_eX]

[DOI]

Elliot Anshelevich

Games Econ. Behav., 2011

Dynamic vs. Oblivious Routing in Network Design.

[BibT_eX]

[DOI]

Navin Goyal

Neil Olver

Algorithmica, 2011

2009

Edge-Disjoint Paths in Planar Graphs with Constant Congestion.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

A Note on Multiflows and Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2009

2008

Approximate Integer Decompositions for Undirected Network Design Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Single-Sink Multicommodity Flow with Side Constraints.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Multicommodity demand flow in a tree and packing integer programs.

[BibT_eX]

[DOI]

Marcelo Mydlarz

ACM Trans. Algorithms, 2007

Hardness of robust network design.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

Maria Grazia Scutellà

Networks, 2007

The Demand-Matching Problem.

[BibT_eX]

[DOI]

Adrian Vetta

Math. Oper. Res., 2007

Degree-constrained network flows.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Island hopping and path colouring with applications to WDM network design.

[BibT_eX]

[DOI]

Andrew McGregor

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.

[BibT_eX]

[DOI]

Theory Comput., 2006

Design tools for transparent optical networks.

[BibT_eX]

[DOI]

Bell Labs Tech. J., 2006

2005

Multicommodity flow, well-linked terminals, and routing problems.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Content distribution for seamless transmission.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Andreas Constantinides

Dan Rubenstein

Angelos Stavrou

SIGMETRICS Perform. Evaluation Rev., 2004

Lighting fibers in a dark network.

[BibT_eX]

[DOI]

Adrian Vetta

IEEE J. Sel. Areas Commun., 2004

Edge-Disjoint Paths in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Bipartite Domination and Simultaneous Matroid Covers.

[BibT_eX]

[DOI]

C. W. Ko

SIAM J. Discret. Math., 2003

Reserving resilient capacity for a single commodity with upper-bound constraints.

[BibT_eX]

[DOI]

Graham R. Brightwell

Gianpaolo Oriolo

Networks, 2003

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Multicommodity Demand Flow in a Tree.

[BibT_eX]

[DOI]

Marcelo Mydlarz

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

The stable paths problem and interdomain routing.

[BibT_eX]

[DOI]

Timothy Griffin

IEEE/ACM Trans. Netw., 2002

Foreword.

[BibT_eX]

[DOI]

Andrew R. Conn

Math. Program., 2002

Node-Capacitated Ring Routing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

Route oscillations in I-BGP with route reflection.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Clustering and Server Selection using Passive Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001

Reserving Resilient Capacity in a Network.

[BibT_eX]

[DOI]

Graham R. Brightwell

Gianpaolo Oriolo

SIAM J. Discret. Math., 2001

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.

[BibT_eX]

[DOI]

Lisa Zhang

Discret. Appl. Math., 2001

2000

Directed network design with orientation constraints.

[BibT_eX]

[DOI]

Joseph Naor

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Policy Disputes in Path-Vector Protocols.

[BibT_eX]

[DOI]

Timothy Griffin

Proceedings of the Seventh Annual International Conference on Network Protocols, 1999

1998

The Graphs with All Subgraphs T-Perfect.

[BibT_eX]

[DOI]

A. M. H. Gerards

SIAM J. Discret. Math., 1998

Face extensions in planar cubic graphs.

[BibT_eX]

[DOI]

Kyriakos Kilakos

Discret. Math., 1998

Strong orientations without even directed circuits.

[BibT_eX]

[DOI]

A. M. H. Gerards

Discret. Math., 1998

1996

Subdivisions and the chromatic index of <i>r</i>-graphs.

[BibT_eX]

[DOI]

Kyriakos Kilakos

J. Graph Theory, 1996

Excluding Minors in Cubic Graphs.

[BibT_eX]

[DOI]

Kyriakos Kilakos

Comb. Probab. Comput., 1996

The Gallai-Younger Conjecture for Planar Graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Comb., 1996

1995

Applying Lehman's theorems to packing problems.

[BibT_eX]

[DOI]

Math. Program., 1995

Right angle free subsets in the plane.

[BibT_eX]

[DOI]

B. Gamble

William R. Pulleyblank

Bruce A. Reed

Graphs Comb., 1995

Note on a Conjecture of Toft.

[BibT_eX]

[DOI]

Tommy R. Jensen

Comb., 1995

1994

A note on clutter partitions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

Near-perfect matrices.

[BibT_eX]

[DOI]

Math. Program., 1994

Induced Circuits in Planar Graphs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

Bruce A. Reed

Alexander Schrijver

J. Comb. Theory B, 1994

1993

Formulations for the stable set polytope of a claw-free graph.

[BibT_eX]

William R. Pulleyblank

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Non-Interfering Network Flows.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

1991

Hamiltonicity in claw-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

1989

Domination in graphs with minimum degree two.

[BibT_eX]

[DOI]

William McCuaig

J. Graph Theory, 1989

1986

Domination parameters for the bishops graph.

[BibT_eX]

[DOI]

Ernest J. Cockayne

B. Gamble

Discret. Math., 1986

1985

An upper bound for the <i>k</i>-domination number of a graph.

[BibT_eX]

[DOI]

Ernest J. Cockayne

B. Gamble