Packing subgraphs in a graph. - Gérard Cornuéjols; David Hartvigsen; William R. Pulleyblank (Oper. Res. Lett., 1982)

An extension of matching theory. - Gérard Cornuéjols; David Hartvigsen (J. Comb. Theory B, 1986)

Is every cycle basis fundamental? - David Hartvigsen; Eitan Zemel (J. Graph Theory, 1989)

Path-isomorphic networks. - David Hartvigsen (J. Graph Theory, 1990)

Cycle bases from orderings and coverings. - David Hartvigsen; Russell Mardon (Discret. Math., 1991)

The prism-free planar graphs and their cycles bases. - David Hartvigsen; Russell Mardon (J. Graph Theory, 1991)

The Complexity of Lifted Inequalities for the Knapsack Problem. - David Hartvigsen; Eitan Zemel (Discret. Appl. Math., 1992)

Recognizing Voronoi Diagrams with Linear Programming. - David Hartvigsen (INFORMS J. Comput., 1992)

Minimum Path Bases. - David Hartvigsen (J. Algorithms, 1993)

When Do Short Cycles Generate the Cycle Space? - David Hartvigsen; Russell Mardon (J. Comb. Theory B, 1993)

The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. - David Hartvigsen; Russell Mardon (SIAM J. Discret. Math., 1994)

Outer-Facial Graphs and the Traveling Salesman Problem. - David Hartvigsen; William R. Pulleyblank (SIAM J. Optim., 1994)

Generalized Max Flows and Augmenting Paths. - David Hartvigsen (IPCO, 1995)

Generalizing the all-pairs min cut problem. - David Hartvigsen (Discret. Math., 1995)

Multiterminal flows and cuts. - David Hartvigsen; François Margot (Oper. Res. Lett., 1995)

The Planar Multiterminal Cut Problem. - David Hartvigsen (Discret. Appl. Math., 1998)

A Submodular Optimization Problem with Side Constraints. - David Hartvigsen (Math. Oper. Res., 1998)

The Square-Free 2-Factor Problem in Bipartite Graphs. - David Hartvigsen (IPCO, 1999)

Crossing properties of multiterminal cuts. - Robert F. Easley; David Hartvigsen (Networks, 1999)

A strongly polynomial time algorithm for a constrained submodular optimization problem. - David Hartvigsen (Discret. Appl. Math., 2001)

Compact Representations of Cuts. - David Hartvigsen (SIAM J. Discret. Math., 2001)

Characterizing the Flow Equivalent Trees of a Network. - David Hartvigsen (Discret. Appl. Math., 2003)

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

Book review. - David Hartvigsen (Oper. Res. Lett., 2004)

The S-digraph optimization problem and the greedy algorithm. - David Hartvigsen (Discret. Optim., 2005)

Representing the strengths and directions of pairwise comparisons. - David Hartvigsen (Eur. J. Oper. Res., 2005)

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

The k-piece packing problem. - David Hartvigsen; Pavol Hell; Jácint Szabó (J. Graph Theory, 2006)

Vote trading in public elections. - David Hartvigsen (Math. Soc. Sci., 2006)

Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). - David Hartvigsen; Yanjun Li (IPCO, 2007)

Maximum Cardinality 1-Restricted Simple 2-Matchings. - David Hartvigsen (Electron. J. Comb., 2007)

Polyhedral Results for 1-Restricted Simple 2-Matchings. - David Hartvigsen; Yanjun Li (SIAM J. Optim., 2008)

Optimal electronic musical instruments. - David Hartvigsen (Eur. J. Oper. Res., 2010)

Neighbor Systems and the Greedy Algorithm. - David Hartvigsen (SIAM J. Discret. Math., 2010)

Maximum Cardinality Simple 2-matchings in Subcubic Graphs. - David Hartvigsen; Yanjun Li (SIAM J. Optim., 2011)

Polyhedron of triangle-free simple 2-matchings in subcubic graphs. - David Hartvigsen; Yanjun Li (Math. Program., 2013)

Packing k-Matchings and k-Critical Graphs. - David Hartvigsen (SIAM J. Discret. Math., 2018)

Finding triangle-free 2-factors in general graphs. - David Hartvigsen (J. Graph Theory, 2024)