David Hartvigsen

According to our database1, David Hartvigsen authored at least 37 papers between 1982 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Packing k-Matchings and k-Critical Graphs.
SIAM J. Discret. Math., 2018

2013
Polyhedron of triangle-free simple 2-matchings in subcubic graphs.
Math. Program., 2013

2011
Maximum Cardinality Simple 2-matchings in Subcubic Graphs.
SIAM J. Optim., 2011

2010
Neighbor Systems and the Greedy Algorithm.
SIAM J. Discret. Math., 2010

Optimal electronic musical instruments.
Eur. J. Oper. Res., 2010

2008
Polyhedral Results for 1-Restricted Simple 2-Matchings.
SIAM J. Optim., 2008

2007
Maximum Cardinality 1-Restricted Simple 2-Matchings.
Electron. J. Comb., 2007

Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Vote trading in public elections.
Math. Soc. Sci., 2006

The <i>k</i>-piece packing problem.
J. Graph Theory, 2006

Finding maximum square-free 2-matchings in bipartite graphs.
J. Comb. Theory B, 2006

2005
Representing the strengths and directions of pairwise comparisons.
Eur. J. Oper. Res., 2005

The S-digraph optimization problem and the greedy algorithm.
Discret. Optim., 2005

2004
Book review.
Oper. Res. Lett., 2004

1-restricted Simple 2-matchings: (Extended Abstract).
Electron. Notes Discret. Math., 2004

2003
Characterizing the Flow Equivalent Trees of a Network.
Discret. Appl. Math., 2003

2001
Compact Representations of Cuts.
SIAM J. Discret. Math., 2001

A strongly polynomial time algorithm for a constrained submodular optimization problem.
Discret. Appl. Math., 2001

1999
Crossing properties of multiterminal cuts.
Networks, 1999

The Square-Free 2-Factor Problem in Bipartite Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
A Submodular Optimization Problem with Side Constraints.
Math. Oper. Res., 1998

The Planar Multiterminal Cut Problem.
Discret. Appl. Math., 1998

1995
Multiterminal flows and cuts.
Oper. Res. Lett., 1995

Generalizing the all-pairs min cut problem.
Discret. Math., 1995

Generalized Max Flows and Augmenting Paths.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Outer-Facial Graphs and the Traveling Salesman Problem.
SIAM J. Optim., 1994

The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs.
SIAM J. Discret. Math., 1994

1993
When Do Short Cycles Generate the Cycle Space?
J. Comb. Theory B, 1993

Minimum Path Bases.
J. Algorithms, 1993

1992
Recognizing Voronoi Diagrams with Linear Programming.
INFORMS J. Comput., 1992

The Complexity of Lifted Inequalities for the Knapsack Problem.
Discret. Appl. Math., 1992

1991
The prism-free planar graphs and their cycles bases.
J. Graph Theory, 1991

Cycle bases from orderings and coverings.
Discret. Math., 1991

1990
Path-isomorphic networks.
J. Graph Theory, 1990

1989
Is every cycle basis fundamental?
J. Graph Theory, 1989

1986
An extension of matching theory.
J. Comb. Theory B, 1986

1982
Packing subgraphs in a graph.
Oper. Res. Lett., 1982


  Loading...