- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j29 |      | David Hartvigsen, Yanjun Li: Polyhedron of triangle-free simple 2-matchings in subcubic graphs. Math. Program. 138(1-2): 43-82 (2013) |
| 2011 | ||
| j28 | | David Hartvigsen, Yanjun Li: Maximum Cardinality Simple 2-matchings in Subcubic Graphs. SIAM Journal on Optimization 21(3): 1027-1045 (2011) |
| 2010 | ||
| j27 | | David Hartvigsen: Optimal electronic musical instruments. European Journal of Operational Research 206(3): 614-622 (2010) |
| j26 | | David Hartvigsen: Neighbor Systems and the Greedy Algorithm. SIAM J. Discrete Math. 24(4): 1638-1661 (2010) |
| 2008 | ||
| j25 | | David Hartvigsen, Yanjun Li: Polyhedral Results for 1-Restricted Simple 2-Matchings. SIAM Journal on Optimization 19(3): 1131-1149 (2008) |
| 2007 | ||
| j24 | | David Hartvigsen: Maximum Cardinality 1-Restricted Simple 2-Matchings. Electr. J. Comb. 14(1) (2007) |
| c4 | | |
| 2006 | ||
| j23 | | David Hartvigsen: Finding maximum square-free 2-matchings in bipartite graphs. J. Comb. Theory, Ser. B 96(5): 693-705 (2006) |
| j22 | | David Hartvigsen, Pavol Hell, Jácint Szabó: The k-piece packing problem. Journal of Graph Theory 52(4): 267-293 (2006) |
| j21 | | David Hartvigsen: Vote trading in public elections. Mathematical Social Sciences 52(1): 31-48 (2006) |
| 2005 | ||
| j20 | | David Hartvigsen: The S-digraph optimization problem and the greedy algorithm. Discrete Optimization 2(4): 320-334 (2005) |
| j19 | | David Hartvigsen: Representing the strengths and directions of pairwise comparisons. European Journal of Operational Research 163(2): 357-369 (2005) |
| 2004 | ||
| j18 | | David Hartvigsen: 1-restricted Simple 2-matchings: (Extended Abstract). Electronic Notes in Discrete Mathematics 18: 145-149 (2004) |
| j17 | | |
| 2003 | ||
| j16 | | David Hartvigsen: Characterizing the Flow Equivalent Trees of a Network. Discrete Applied Mathematics 128(2-3): 387-394 (2003) |
| 2001 | ||
| j15 | | David Hartvigsen: A strongly polynomial time algorithm for a constrained submodular optimization problem. Discrete Applied Mathematics 113(2-3): 183-194 (2001) |
| j14 | | |
| 1999 | ||
| j13 | | Robert F. Easley, David Hartvigsen: Crossing properties of multiterminal cuts. Networks 34(3): 215-220 (1999) |
| c3 | | |
| 1998 | ||
| j12 | | David Hartvigsen: The Planar Multiterminal Cut Problem. Discrete Applied Mathematics 85(3): 203-222 (1998) |
| 1996 | ||
| c2 | | |
| 1995 | ||
| j11 | | David Hartvigsen: Generalizing the all-pairs min cut problem. Discrete Mathematics 147(1-3): 151-169 (1995) |
| c1 | | |
| 1994 | ||
| j10 | | 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 | ||
| j9 | | |
| j8 | | David Hartvigsen, Russell Mardon: When Do Short Cycles Generate the Cycle Space? J. Comb. Theory, Ser. B 57(1): 88-99 (1993) |
| 1992 | ||
| j7 | | David Hartvigsen, Eitan Zemel: The Complexity of Lifted Inequalities for the Knapsack Problem. Discrete Applied Mathematics 39(2): 113-123 (1992) |
| j6 | | David Hartvigsen: Recognizing Voronoi Diagrams with Linear Programming. INFORMS Journal on Computing 4(4): 369-374 (1992) |
| 1991 | ||
| j5 | | David Hartvigsen, Russell Mardon: Cycle bases from orderings and coverings. Discrete Mathematics 94(2): 81-94 (1991) |
| j4 | | David Hartvigsen, Russell Mardon: The prism-free planar graphs and their cycles bases. Journal of Graph Theory 15(4): 431-441 (1991) |
| 1990 | ||
| j3 | | |
| 1989 | ||
| j2 | | David Hartvigsen, Eitan Zemel: Is every cycle basis fundamental? Journal of Graph Theory 13(1): 117-137 (1989) |
| 1986 | ||
| j1 | | Gérard Cornuéjols, David Hartvigsen: An extension of matching theory. J. Comb. Theory, Ser. B 40(3): 285-296 (1986) |
| 1 | Gérard Cornuéjols | |
| 2 | Robert F. Easley | |
| 3 | Pavol Hell | |
| 4 | Yanjun Li | |
| 5 | Russell Mardon | |
| 6 | Jácint Szabó | |
| 7 | Eitan Zemel |
Colors in the list of coauthors
Last update Sat May 25 11:56:42 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page