David Hartvigsen

39 papers B 4Journal 35

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