default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Hartvigsen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j34]David Hartvigsen:
Packing k-Matchings and k-Critical Graphs. SIAM J. Discret. Math. 32(1): 320-351 (2018)- 2013
- [j33]David Hartvigsen, Yanjun Li:
Polyhedron of triangle-free simple 2-matchings in subcubic graphs. Math. Program. 138(1-2): 43-82 (2013) - 2011
- [j32]David Hartvigsen, Yanjun Li:
Maximum Cardinality Simple 2-matchings in Subcubic Graphs. SIAM J. Optim. 21(3): 1027-1045 (2011) - 2010
- [j31]David Hartvigsen:
Optimal electronic musical instruments. Eur. J. Oper. Res. 206(3): 614-622 (2010) - [j30]David Hartvigsen:
Neighbor Systems and the Greedy Algorithm. SIAM J. Discret. Math. 24(4): 1638-1661 (2010)
2000 – 2009
- 2008
- [j29]David Hartvigsen, Yanjun Li:
Polyhedral Results for 1-Restricted Simple 2-Matchings. SIAM J. Optim. 19(3): 1131-1149 (2008) - 2007
- [j28]David Hartvigsen:
Maximum Cardinality 1-Restricted Simple 2-Matchings. Electron. J. Comb. 14(1) (2007) - [c4]David Hartvigsen, Yanjun Li:
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). IPCO 2007: 43-52 - 2006
- [j27]David Hartvigsen:
Finding maximum square-free 2-matchings in bipartite graphs. J. Comb. Theory B 96(5): 693-705 (2006) - [j26]David Hartvigsen, Pavol Hell, Jácint Szabó:
The k-piece packing problem. J. Graph Theory 52(4): 267-293 (2006) - [j25]David Hartvigsen:
Vote trading in public elections. Math. Soc. Sci. 52(1): 31-48 (2006) - 2005
- [j24]David Hartvigsen:
The S-digraph optimization problem and the greedy algorithm. Discret. Optim. 2(4): 320-334 (2005) - [j23]David Hartvigsen:
Representing the strengths and directions of pairwise comparisons. Eur. J. Oper. Res. 163(2): 357-369 (2005) - 2004
- [j22]David Hartvigsen:
1-restricted Simple 2-matchings: (Extended Abstract). Electron. Notes Discret. Math. 18: 145-149 (2004) - [j21]David Hartvigsen:
Book review. Oper. Res. Lett. 32(4): 391-392 (2004) - 2003
- [j20]David Hartvigsen:
Characterizing the Flow Equivalent Trees of a Network. Discret. Appl. Math. 128(2-3): 387-394 (2003) - 2001
- [j19]David Hartvigsen:
A strongly polynomial time algorithm for a constrained submodular optimization problem. Discret. Appl. Math. 113(2-3): 183-194 (2001) - [j18]David Hartvigsen:
Compact Representations of Cuts. SIAM J. Discret. Math. 14(1): 49-66 (2001)
1990 – 1999
- 1999
- [j17]Robert F. Easley, David Hartvigsen:
Crossing properties of multiterminal cuts. Networks 34(3): 215-220 (1999) - [c3]David Hartvigsen:
The Square-Free 2-Factor Problem in Bipartite Graphs. IPCO 1999: 234-241 - 1998
- [j16]David Hartvigsen:
The Planar Multiterminal Cut Problem. Discret. Appl. Math. 85(3): 203-222 (1998) - [j15]David Hartvigsen:
A Submodular Optimization Problem with Side Constraints. Math. Oper. Res. 23(3): 661-679 (1998) - 1996
- [c2]David Hartvigsen:
A Submodular Optimization Problem with Side Constraints. IPCO 1996: 249-259 - 1995
- [j14]David Hartvigsen:
Generalizing the all-pairs min cut problem. Discret. Math. 147(1-3): 151-169 (1995) - [j13]David Hartvigsen, François Margot:
Multiterminal flows and cuts. Oper. Res. Lett. 17(5): 201-204 (1995) - [c1]David Hartvigsen:
Generalized Max Flows and Augmenting Paths. IPCO 1995: 185-197 - 1994
- [j12]David Hartvigsen, Russell Mardon:
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. SIAM J. Discret. Math. 7(3): 403-418 (1994) - [j11]David Hartvigsen, William R. Pulleyblank:
Outer-Facial Graphs and the Traveling Salesman Problem. SIAM J. Optim. 4(3): 676-689 (1994) - 1993
- [j10]David Hartvigsen:
Minimum Path Bases. J. Algorithms 15(1): 125-142 (1993) - [j9]David Hartvigsen, Russell Mardon:
When Do Short Cycles Generate the Cycle Space? J. Comb. Theory B 57(1): 88-99 (1993) - 1992
- [j8]David Hartvigsen, Eitan Zemel:
The Complexity of Lifted Inequalities for the Knapsack Problem. Discret. Appl. Math. 39(2): 113-123 (1992) - [j7]David Hartvigsen:
Recognizing Voronoi Diagrams with Linear Programming. INFORMS J. Comput. 4(4): 369-374 (1992) - 1991
- [j6]David Hartvigsen, Russell Mardon:
Cycle bases from orderings and coverings. Discret. Math. 94(2): 81-94 (1991) - [j5]David Hartvigsen, Russell Mardon:
The prism-free planar graphs and their cycles bases. J. Graph Theory 15(4): 431-441 (1991) - 1990
- [j4]David Hartvigsen:
Path-isomorphic networks. J. Graph Theory 14(6): 709-722 (1990)
1980 – 1989
- 1989
- [j3]David Hartvigsen, Eitan Zemel:
Is every cycle basis fundamental? J. Graph Theory 13(1): 117-137 (1989) - 1986
- [j2]Gérard Cornuéjols, David Hartvigsen:
An extension of matching theory. J. Comb. Theory B 40(3): 285-296 (1986) - 1982
- [j1]Gérard Cornuéjols, David Hartvigsen, William R. Pulleyblank:
Packing subgraphs in a graph. Oper. Res. Lett. 1(4): 139-143 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
