David Hartvigsen

SIAM J. Discret. Math., 2018

2013

Polyhedron of triangle-free simple 2-matchings in subcubic graphs.

[BibT_eX]

[DOI]

Math. Program., 2013

2011

Maximum Cardinality Simple 2-matchings in Subcubic Graphs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

2010

Neighbor Systems and the Greedy Algorithm.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Optimal electronic musical instruments.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

2008

Polyhedral Results for 1-Restricted Simple 2-Matchings.

[BibT_eX]

[DOI]

SIAM J. Optim., 2008

2007

Maximum Cardinality 1-Restricted Simple 2-Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Vote trading in public elections.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2006

The <i>k</i>-piece packing problem.

[BibT_eX]

[DOI]

Pavol Hell

Jácint Szabó

J. Graph Theory, 2006

Finding maximum square-free 2-matchings in bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

2005

Representing the strengths and directions of pairwise comparisons.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

The S-digraph optimization problem and the greedy algorithm.

[BibT_eX]

[DOI]

Discret. Optim., 2005

2004

Book review.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

1-restricted Simple 2-matchings: (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

2003

Characterizing the Flow Equivalent Trees of a Network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2001

Compact Representations of Cuts.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

A strongly polynomial time algorithm for a constrained submodular optimization problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

1999

Crossing properties of multiterminal cuts.

[BibT_eX]

[DOI]

Robert F. Easley

Networks, 1999

The Square-Free 2-Factor Problem in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

A Submodular Optimization Problem with Side Constraints.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

The Planar Multiterminal Cut Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1995

Multiterminal flows and cuts.

[BibT_eX]

[DOI]

François Margot

Oper. Res. Lett., 1995

Generalizing the all-pairs min cut problem.

[BibT_eX]

[DOI]

Discret. Math., 1995

Generalized Max Flows and Augmenting Paths.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Outer-Facial Graphs and the Traveling Salesman Problem.

[BibT_eX]

[DOI]

William R. Pulleyblank

SIAM J. Optim., 1994

The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

1993

When Do Short Cycles Generate the Cycle Space?

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Minimum Path Bases.

[BibT_eX]

[DOI]

J. Algorithms, 1993

1992

Recognizing Voronoi Diagrams with Linear Programming.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

The Complexity of Lifted Inequalities for the Knapsack Problem.

[BibT_eX]

[DOI]

Eitan Zemel

Discret. Appl. Math., 1992

1991

The prism-free planar graphs and their cycles bases.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Cycle bases from orderings and coverings.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

Path-isomorphic networks.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1989

Is every cycle basis fundamental?

[BibT_eX]

[DOI]

Eitan Zemel

J. Graph Theory, 1989

1986

An extension of matching theory.

[BibT_eX]

[DOI]

Gérard Cornuéjols

J. Comb. Theory B, 1986

1982

Packing subgraphs in a graph.

[BibT_eX]

[DOI]

Gérard Cornuéjols