| * | 2007 |
|---|
| 24 | EE | David Hartvigsen,
Yanjun Li:
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).
IPCO 2007: 43-52 |
| 23 | EE | David Hartvigsen:
Maximum Cardinality 1-Restricted Simple 2-Matchings.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 22 | EE | David Hartvigsen:
Finding maximum square-free 2-matchings in bipartite graphs.
J. Comb. Theory, Ser. B 96(5): 693-705 (2006) |
| 21 | EE | David Hartvigsen,
Pavol Hell,
Jácint Szabó:
The k-piece packing problem.
Journal of Graph Theory 52(4): 267-293 (2006) |
| 2005 |
|---|
| 20 | EE | David Hartvigsen:
The S-digraph optimization problem and the greedy algorithm.
Discrete Optimization 2(4): 320-334 (2005) |
| 19 | EE | David Hartvigsen:
Representing the strengths and directions of pairwise comparisons.
European Journal of Operational Research 163(2): 357-369 (2005) |
| 2004 |
|---|
| 18 | EE | David Hartvigsen:
1-restricted Simple 2-matchings: (Extended Abstract).
Electronic Notes in Discrete Mathematics 18: 145-149 (2004) |
| 17 | EE | David Hartvigsen:
Book review.
Oper. Res. Lett. 32(4): 391-392 (2004) |
| 2003 |
|---|
| 16 | EE | David Hartvigsen:
Characterizing the Flow Equivalent Trees of a Network.
Discrete Applied Mathematics 128(2-3): 387-394 (2003) |
| 2001 |
|---|
| 15 | | David Hartvigsen:
A strongly polynomial time algorithm for a constrained submodular optimization problem.
Discrete Applied Mathematics 113(2-3): 183-194 (2001) |
| 14 | EE | David Hartvigsen:
Compact Representations of Cuts.
SIAM J. Discrete Math. 14(1): 49-66 (2001) |
| 1999 |
|---|
| 13 | EE | David Hartvigsen:
The Square-Free 2-Factor Problem in Bipartite Graphs.
IPCO 1999: 234-241 |
| 12 | EE | Robert F. Easley,
David Hartvigsen:
Crossing properties of multiterminal cuts.
Networks 34(3): 215-220 (1999) |
| 1998 |
|---|
| 11 | EE | David Hartvigsen:
The Planar Multiterminal Cut Problem.
Discrete Applied Mathematics 85(3): 203-222 (1998) |
| 1996 |
|---|
| 10 | EE | David Hartvigsen:
A Submodular Optimization Problem with Side Constraints.
IPCO 1996: 249-259 |
| 1995 |
|---|
| 9 | EE | David Hartvigsen:
Generalized Max Flows and Augmenting Paths.
IPCO 1995: 185-197 |
| 8 | EE | David Hartvigsen:
Generalizing the all-pairs min cut problem.
Discrete Mathematics 147(1-3): 151-169 (1995) |
| 1994 |
|---|
| 7 | EE | David Hartvigsen,
Russell Mardon:
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs.
SIAM J. Discrete Math. 7(3): 403-418 (1994) |
| 1993 |
|---|
| 6 | | David Hartvigsen:
Minimum Path Bases.
J. Algorithms 15(1): 125-142 (1993) |
| 5 | EE | David Hartvigsen,
Russell Mardon:
When Do Short Cycles Generate the Cycle Space?
J. Comb. Theory, Ser. B 57(1): 88-99 (1993) |
| 1992 |
|---|
| 4 | EE | David Hartvigsen,
Eitan Zemel:
The Complexity of Lifted Inequalities for the Knapsack Problem.
Discrete Applied Mathematics 39(2): 113-123 (1992) |
| 3 | EE | David Hartvigsen:
Recognizing Voronoi Diagrams with Linear Programming.
INFORMS Journal on Computing 4(4): 369-374 (1992) |
| 1991 |
|---|
| 2 | EE | David Hartvigsen,
Russell Mardon:
Cycle bases from orderings and coverings.
Discrete Mathematics 94(2): 81-94 (1991) |
| 1986 |
|---|
| 1 | EE | Gérard Cornuéjols,
David Hartvigsen:
An extension of matching theory.
J. Comb. Theory, Ser. B 40(3): 285-296 (1986) |
