David Hartvigsen

Publication Activity (10 Years)

Years Active: 1982-2018
Publications (10 Years): 1

Top Topics

Maximum Cardinality

Pattern Recognition

Top Venues

SIAM J. Discret. Math.

Publications

David Hartvigsen
Packing k-Matchings and k-Critical Graphs. SIAM J. Discret. Math. 32 (1) (2018)
David Hartvigsen, Yanjun Li
Polyhedron of triangle-free simple 2-matchings in subcubic graphs. Math. Program. 138 (1-2) (2013)
David Hartvigsen, Yanjun Li
Maximum Cardinality Simple 2-matchings in Subcubic Graphs. SIAM J. Optim. 21 (3) (2011)
David Hartvigsen
Neighbor Systems and the Greedy Algorithm. SIAM J. Discret. Math. 24 (4) (2010)
David Hartvigsen
Optimal electronic musical instruments. Eur. J. Oper. Res. 206 (3) (2010)
David Hartvigsen, Yanjun Li
Polyhedral Results for 1-Restricted Simple 2-Matchings. SIAM J. Optim. 19 (3) (2008)
David Hartvigsen
Maximum Cardinality 1-Restricted Simple 2-Matchings. Electron. J. Comb. 14 (1) (2007)
David Hartvigsen, Yanjun Li
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). IPCO (2007)
David Hartvigsen
Finding maximum square-free 2-matchings in bipartite graphs. J. Comb. Theory, Ser. B 96 (5) (2006)
David Hartvigsen, Pavol Hell, Jácint Szabó
-piece packing problem. J. Graph Theory 52 (4) (2006)
David Hartvigsen
Vote trading in public elections. Math. Soc. Sci. 52 (1) (2006)
David Hartvigsen
Representing the strengths and directions of pairwise comparisons. Eur. J. Oper. Res. 163 (2) (2005)
David Hartvigsen
The S-digraph optimization problem and the greedy algorithm. Discret. Optim. 2 (4) (2005)
David Hartvigsen
Book review. Oper. Res. Lett. 32 (4) (2004)
David Hartvigsen
1-restricted Simple 2-matchings: (Extended Abstract). Electron. Notes Discret. Math. 18 (2004)
David Hartvigsen
Characterizing the Flow Equivalent Trees of a Network. Discret. Appl. Math. 128 (2-3) (2003)
David Hartvigsen
Compact Representations of Cuts. SIAM J. Discret. Math. 14 (1) (2001)
David Hartvigsen
A strongly polynomial time algorithm for a constrained submodular optimization problem. Discret. Appl. Math. 113 (2-3) (2001)
David Hartvigsen
The Square-Free 2-Factor Problem in Bipartite Graphs. IPCO (1999)
Robert F. Easley, David Hartvigsen
Crossing properties of multiterminal cuts. Networks 34 (3) (1999)
David Hartvigsen
The Planar Multiterminal Cut Problem. Discret. Appl. Math. 85 (3) (1998)
David Hartvigsen
A Submodular Optimization Problem with Side Constraints. Math. Oper. Res. 23 (3) (1998)
David Hartvigsen
A Submodular Optimization Problem with Side Constraints. IPCO (1996)
David Hartvigsen
Generalizing the all-pairs min cut problem. Discret. Math. 147 (1-3) (1995)
David Hartvigsen
Generalized Max Flows and Augmenting Paths. IPCO (1995)
David Hartvigsen, François Margot
Multiterminal flows and cuts. Oper. Res. Lett. 17 (5) (1995)
David Hartvigsen, Russell Mardon
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. SIAM J. Discret. Math. 7 (3) (1994)
David Hartvigsen, William R. Pulleyblank
Outer-Facial Graphs and the Traveling Salesman Problem. SIAM J. Optim. 4 (3) (1994)
David Hartvigsen
Minimum Path Bases. J. Algorithms 15 (1) (1993)
David Hartvigsen, Russell Mardon
When Do Short Cycles Generate the Cycle Space? J. Comb. Theory, Ser. B 57 (1) (1993)
David Hartvigsen
Recognizing Voronoi Diagrams with Linear Programming. INFORMS J. Comput. 4 (4) (1992)
David Hartvigsen, Eitan Zemel
The Complexity of Lifted Inequalities for the Knapsack Problem. Discret. Appl. Math. 39 (2) (1992)
David Hartvigsen, Russell Mardon
Cycle bases from orderings and coverings. Discret. Math. 94 (2) (1991)
David Hartvigsen, Russell Mardon
The prism-free planar graphs and their cycles bases. J. Graph Theory 15 (4) (1991)
David Hartvigsen
Path-isomorphic networks. J. Graph Theory 14 (6) (1990)
David Hartvigsen, Eitan Zemel
Is every cycle basis fundamental? J. Graph Theory 13 (1) (1989)
Gérard Cornuéjols, David Hartvigsen
An extension of matching theory. J. Comb. Theory, Ser. B 40 (3) (1986)
Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank
Packing subgraphs in a graph. Oper. Res. Lett. 1 (4) (1982)