David Hartvigsen

Available identifiers

zbMath Open hartvigsen.david-bMaRDI QIDQ1103513

List of research outcomes

Publication	Date of Publication	Type
Finding triangle-free 2-factors in general graphs	2024-05-15	Paper
Generalized max flows and augmenting paths	2022-08-30	Paper
A submodular optimization problem with side constraints	2019-01-11	Paper
Packing $k$-Matchings and $k$-Critical Graphs	2018-02-07	Paper
Polyhedron of triangle-free simple 2-matchings in subcubic graphs	2013-05-06	Paper
Maximum Cardinality Simple 2-matchings in Subcubic Graphs	2012-01-09	Paper
Neighbor Systems and the Greedy Algorithm	2011-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q2999652	2011-05-16	Paper
Optimal electronic musical instruments	2010-06-11	Paper
Polyhedral Results for 1-Restricted Simple 2-Matchings	2009-08-20	Paper
The \(S\)-digraph optimization problem and the greedy algorithm	2009-06-02	Paper
The Action Gambler and Equal-Sized Wagering	2009-04-14	Paper
Maximum cardinality 1-restricted simple 2-matchings	2009-04-07	Paper
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)	2007-11-29	Paper
Vote trading in public elections	2006-12-07	Paper
The k‐piece packing problem	2006-09-06	Paper
Finding maximum square-free 2-matchings in bipartite graphs	2006-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q5708503	2005-11-18	Paper
Representing the strengths and directions of pairwise comparisons	2005-02-09	Paper
Characterizing the flow equivalent trees of a network	2003-06-10	Paper
Crossing properties of multiterminal cuts	2002-01-27	Paper
A submodular optimization problem with side constraints	2001-11-26	Paper
Compact representations of cuts	2001-03-19	Paper
A strongly polynomial time algorithm for a constrained submodular optimization problem	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4263715	1999-09-22	Paper
The planar multiterminal cut problem	1998-08-20	Paper
Multiterminal flows and cuts	1996-10-20	Paper
Generalizing the all-pairs min cut problem	1996-03-24	Paper
Outer-Facial Graphs and the Traveling Salesman Problem	1995-05-09	Paper
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs	1994-10-24	Paper
Minimum Path Bases	1994-03-27	Paper
Recognizing Voronoi Diagrams with Linear Programming	1993-02-25	Paper
The complexity of lifted inequalities for the knapsack problem	1993-01-17	Paper
When do short cycles generate the cycle space?	1993-01-01	Paper
Cycle bases from orderings and coverings	1992-06-28	Paper
The prism-free planar graphs and their cycles bases	1992-06-26	Paper
Path-isomorphic networks	1990-01-01	Paper
Is every cycle basis fundamental?	1989-01-01	Paper
Recognizing max-flow min-cut path matrices	1988-01-01	Paper
An extension of matching theory	1986-01-01	Paper
Packing subgraphs in a graph	1982-01-01	Paper

Research outcomes over time

This page was built for person: David Hartvigsen