David Hartvigsen

627 total citations
33 papers, 335 citations indexed

About

David Hartvigsen is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, David Hartvigsen has authored 33 papers receiving a total of 335 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 8 papers in Electrical and Electronic Engineering. Recurrent topics in David Hartvigsen's work include Advanced Graph Theory Research (22 papers), Complexity and Algorithms in Graphs (17 papers) and Optimization and Search Problems (6 papers). David Hartvigsen is often cited by papers focused on Advanced Graph Theory Research (22 papers), Complexity and Algorithms in Graphs (17 papers) and Optimization and Search Problems (6 papers). David Hartvigsen collaborates with scholars based in United States, Latvia and Canada. David Hartvigsen's co-authors include Gérard Cornuéjols, William R. Pulleyblank, Jerry C. Wei, Eitan Zemel, Yanjun Li, Jácint Szabó, Pavol Hell, François Margot, Robert F. Easley and Donald K. Wagner and has published in prestigious journals such as European Journal of Operational Research, Journal of Business Ethics and Mathematical Programming.

In The Last Decade

David Hartvigsen

29 papers receiving 296 citations

Peers

David Hartvigsen
Shlomi Rubinstein Israel
Toshihiro Fujito Japan
Yuval Filmus Israel
Ewald Speckenmeyer Germany
Naonori Kakimura Japan
Christoph Ambühl Switzerland
Glencora Borradaile United States
Ran Duan United States
Anil Kamath United States
Ariel Kulik Israel
Shlomi Rubinstein Israel
David Hartvigsen
Citations per year, relative to David Hartvigsen David Hartvigsen (= 1×) peers Shlomi Rubinstein

Countries citing papers authored by David Hartvigsen

Since Specialization
Citations

This map shows the geographic impact of David Hartvigsen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David Hartvigsen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Hartvigsen more than expected).

Fields of papers citing papers by David Hartvigsen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David Hartvigsen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David Hartvigsen. The network helps show where David Hartvigsen may publish in the future.

Co-authorship network of co-authors of David Hartvigsen

This figure shows the co-authorship network connecting the top 25 collaborators of David Hartvigsen. A scholar is included among the top collaborators of David Hartvigsen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David Hartvigsen. David Hartvigsen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hartvigsen, David. (2024). Finding triangle‐free 2‐factors in general graphs. Journal of Graph Theory. 106(3). 581–662. 1 indexed citations
2.
Hartvigsen, David & Yanjun Li. (2012). Polyhedron of triangle-free simple 2-matchings in subcubic graphs. Mathematical Programming. 138(1-2). 43–82. 7 indexed citations
3.
Hartvigsen, David. (2007). Maximum Cardinality 1-Restricted Simple 2-Matchings. The Electronic Journal of Combinatorics. 14(1). 1 indexed citations
4.
Hartvigsen, David. (2006). Finding maximum square-free 2-matchings in bipartite graphs. Journal of Combinatorial Theory Series B. 96(5). 693–705. 22 indexed citations
5.
Hartvigsen, David. (2004). 1-restricted Simple 2-matchings. Electronic Notes in Discrete Mathematics. 18. 145–149. 3 indexed citations
6.
Hartvigsen, David. (2001). Compact Representations of Cuts. SIAM Journal on Discrete Mathematics. 14(1). 49–66. 4 indexed citations
7.
Hartvigsen, David. (2001). A strongly polynomial time algorithm for a constrained submodular optimization problem. Discrete Applied Mathematics. 113(2-3). 183–194. 1 indexed citations
8.
Hartvigsen, David, et al.. (1999). The Conference Paper‐Reviewer Assignment Problem*. Decision Sciences. 30(3). 865–876. 43 indexed citations
9.
Hartvigsen, David. (1998). The planar multiterminal cut problem. Discrete Applied Mathematics. 85(3). 203–222. 12 indexed citations
10.
Hartvigsen, David & François Margot. (1995). Multiterminal flows and cuts. Operations Research Letters. 17(5). 201–204. 3 indexed citations
11.
Hartvigsen, David. (1995). Generalizing the all-pairs min cut problem. Discrete Mathematics. 147(1-3). 151–169. 4 indexed citations
12.
Hartvigsen, David & William R. Pulleyblank. (1994). Outer-Facial Graphs and the Traveling Salesman Problem. SIAM Journal on Optimization. 4(3). 676–689. 1 indexed citations
13.
Hartvigsen, David, et al.. (1994). The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. SIAM Journal on Discrete Mathematics. 7(3). 403–418. 26 indexed citations
14.
Hartvigsen, David, et al.. (1993). When Do Short Cycles Generate the Cycle Space?. Journal of Combinatorial Theory Series B. 57(1). 88–99. 8 indexed citations
15.
Hartvigsen, David. (1992). Recognizing Voronoi Diagrams with Linear Programming. INFORMS Journal on Computing. 4(4). 369–374. 15 indexed citations
16.
Hartvigsen, David & Eitan Zemel. (1992). The complexity of lifted inequalities for the knapsack problem. Discrete Applied Mathematics. 39(2). 113–123. 11 indexed citations
17.
Hartvigsen, David, et al.. (1991). Cycle bases from orderings and coverings. Discrete Mathematics. 94(2). 81–94. 4 indexed citations
18.
Hartvigsen, David & Eitan Zemel. (1989). Is every cycle basis fundamental?. Journal of Graph Theory. 13(1). 117–137. 14 indexed citations
19.
Cornuéjols, Gérard & David Hartvigsen. (1986). An extension of matching theory. Journal of Combinatorial Theory Series B. 40(3). 285–296. 42 indexed citations
20.
Cornuéjols, Gérard, David Hartvigsen, & William R. Pulleyblank. (1982). Packing subgraphs in a graph. Operations Research Letters. 1(4). 139–143. 51 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Shlomi Rubinstein Breakdown of academic impact, for papers by Toshihiro Fujito Breakdown of academic impact, for papers by Yuval Filmus Breakdown of academic impact, for papers by Ewald Speckenmeyer Breakdown of academic impact, for papers by Naonori Kakimura Breakdown of academic impact, for papers by Christoph Ambühl Breakdown of academic impact, for papers by Glencora Borradaile Breakdown of academic impact, for papers by Ran Duan Breakdown of academic impact, for papers by Anil Kamath Breakdown of academic impact, for papers by Ariel Kulik
Rankless by CCL
2026