| Extensions of matching theory D Hartvigsen | 153 | 1984 |
| Packing subgraphs in a graph G Cornuéjols, D Hartvigsen, W Pulleyblank Operations Research Letters 1 (4), 139-143, 1982 | 105 | 1982 |
| The conference paper‐reviewer assignment problem D Hartvigsen, JC Wei, R Czuchlewski Decision Sciences 30 (3), 865-876, 1999 | 99 | 1999 |
| The all-pairs min cut problem and the minimum cycle basis problem on planar graphs D Hartvigsen, R Mardon SIAM Journal on Discrete Mathematics 7 (3), 403-418, 1994 | 68 | 1994 |
| An extension of matching theory G Cornuéjols, D Hartvigsen Journal of Combinatorial Theory, Series B 40 (3), 285-296, 1986 | 61 | 1986 |
| Finding maximum square-free 2-matchings in bipartite graphs D Hartvigsen Journal of Combinatorial Theory, Series B 96 (5), 693-705, 2006 | 48 | 2006 |
| Recognizing Voronoi diagrams with linear programming D Hartvigsen ORSA Journal on Computing 4 (4), 369-374, 1992 | 47 | 1992 |
| The square-free 2-factor problem in bipartite graphs D Hartvigsen International Conference on Integer Programming and Combinatorial …, 1999 | 45 | 1999 |
| The planar multiterminal cut problem D Hartvigsen Discrete Applied Mathematics 85 (3), 203-222, 1998 | 34 | 1998 |
| Is every cycle basis fundamental? D Hartvigsen, E Zemel Journal of Graph Theory 13 (1), 117-137, 1989 | 31 | 1989 |
| The complexity of lifted inequalities for the knapsack problem D Hartvigsen, E Zemel Discrete Applied Mathematics 39 (2), 113-123, 1992 | 29 | 1992 |
| The k‐piece packing problem D Hartvigsen, P Hell, J Szabó Journal of Graph Theory 52 (4), 267-293, 2006 | 27 | 2006 |
| Simquick, Process Simulation With Excel D Hartvigsen Prentice-Hall, Inc., 2004 | 24 | 2004 |
| Maximum cardinality simple 2-matchings in subcubic graphs D Hartvigsen, Y Li SIAM Journal on Optimization 21 (3), 1027-1045, 2011 | 21 | 2011 |
| Polyhedron of triangle-free simple 2-matchings in subcubic graphs D Hartvigsen, Y Li Mathematical Programming 138, 43-82, 2013 | 19 | 2013 |
| Vote trading in public elections D Hartvigsen Mathematical Social Sciences 52 (1), 31-48, 2006 | 19 | 2006 |
| Representing the strengths and directions of pairwise comparisons D Hartvigsen European Journal of Operational Research 163 (2), 357-369, 2005 | 19 | 2005 |
| Minimum path bases D Hartvigsen Journal of Algorithms 15 (1), 125-142, 1993 | 19 | 1993 |
| When do short cycles generate the cycle space? D Hartvigsen, R Mardon Journal of Combinatorial Theory, Series B 57 (1), 88-99, 1993 | 19 | 1993 |
| The manipulation of voting systems D Hartvigsen Journal of business ethics 80, 13-21, 2008 | 14 | 2008 |
