Person:1103513: Difference between revisions

From MaRDI portal
Person:1103513
m AuthorDisambiguator moved page Person:221671 to David B. Hartvigsen: Duplicate
m AuthorDisambiguator moved page David B. Hartvigsen to David B. Hartvigsen: Duplicate
 
(No difference)

Latest revision as of 11:03, 9 December 2023

Available identifiers

zbMath Open hartvigsen.david-bMaRDI QIDQ1103513

List of research outcomes

PublicationDate of PublicationType
Generalized max flows and augmenting paths2022-08-30Paper
A submodular optimization problem with side constraints2019-01-11Paper
Packing $k$-Matchings and $k$-Critical Graphs2018-02-07Paper
Polyhedron of triangle-free simple 2-matchings in subcubic graphs2013-05-06Paper
Maximum Cardinality Simple 2-matchings in Subcubic Graphs2012-01-09Paper
Neighbor Systems and the Greedy Algorithm2011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q29996522011-05-16Paper
Optimal electronic musical instruments2010-06-11Paper
Polyhedral Results for 1-Restricted Simple 2-Matchings2009-08-20Paper
The \(S\)-digraph optimization problem and the greedy algorithm2009-06-02Paper
The Action Gambler and Equal-Sized Wagering2009-04-14Paper
Maximum cardinality 1-restricted simple 2-matchings2009-04-07Paper
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)2007-11-29Paper
Vote trading in public elections2006-12-07Paper
The k‐piece packing problem2006-09-06Paper
Finding maximum square-free 2-matchings in bipartite graphs2006-08-16Paper
https://portal.mardi4nfdi.de/entity/Q57085032005-11-18Paper
Representing the strengths and directions of pairwise comparisons2005-02-09Paper
Characterizing the flow equivalent trees of a network2003-06-10Paper
https://portal.mardi4nfdi.de/entity/Q27661052002-01-27Paper
A Submodular Optimization Problem with Side Constraints2001-11-26Paper
Compact Representations of Cuts2001-03-19Paper
A strongly polynomial time algorithm for a constrained submodular optimization problem2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42637151999-09-22Paper
The planar multiterminal cut problem1998-08-20Paper
Multiterminal flows and cuts1996-10-20Paper
Generalizing the all-pairs min cut problem1996-03-24Paper
Outer-Facial Graphs and the Traveling Salesman Problem1995-05-09Paper
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs1994-10-24Paper
Minimum Path Bases1994-03-27Paper
Recognizing Voronoi Diagrams with Linear Programming1993-02-25Paper
The complexity of lifted inequalities for the knapsack problem1993-01-17Paper
When do short cycles generate the cycle space?1993-01-01Paper
Cycle bases from orderings and coverings1992-06-28Paper
The prism-free planar graphs and their cycles bases1992-06-26Paper
Path-isomorphic networks1990-01-01Paper
Is every cycle basis fundamental?1989-01-01Paper
Recognizing max-flow min-cut path matrices1988-01-01Paper
An extension of matching theory1986-01-01Paper
Packing subgraphs in a graph1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: David B. Hartvigsen