Robert D. Carr

1.4k total citations
36 papers, 750 citations indexed

About

Robert D. Carr is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Civil and Structural Engineering. According to data from OpenAlex, Robert D. Carr has authored 36 papers receiving a total of 750 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 13 papers in Industrial and Manufacturing Engineering and 7 papers in Civil and Structural Engineering. Recurrent topics in Robert D. Carr's work include Complexity and Algorithms in Graphs (14 papers), Vehicle Routing Optimization Methods (12 papers) and Advanced Graph Theory Research (12 papers). Robert D. Carr is often cited by papers focused on Complexity and Algorithms in Graphs (14 papers), Vehicle Routing Optimization Methods (12 papers) and Advanced Graph Theory Research (12 papers). Robert D. Carr collaborates with scholars based in United States, Italy and Canada. Robert D. Carr's co-authors include Santosh Vempala, Giuseppe Lancia, Brian P. Walenz, Sorin Istrail, Goran Konjevod, William E. Hart, Jean‐Loup Faulon, Cynthia A. Phillips, Michael J. Collins and Madhav Marathe and has published in prestigious journals such as Physica A Statistical Mechanics and its Applications, Mathematical Programming and Mathematics of Operations Research.

In The Last Decade

Robert D. Carr

34 papers receiving 704 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Robert D. Carr United States 16 230 192 149 137 121 36 750
Lili Li China 14 88 0.4× 44 0.2× 161 1.1× 53 0.4× 154 1.3× 61 664
Jun Huan United States 16 166 0.7× 165 0.9× 19 0.1× 70 0.5× 277 2.3× 53 694
Lishan Kang China 12 175 0.8× 46 0.2× 16 0.1× 46 0.3× 386 3.2× 75 610
Jingbo Zhou China 18 395 1.7× 343 1.8× 10 0.1× 73 0.5× 366 3.0× 75 1.2k
Weifan Wang China 20 918 4.0× 33 0.2× 46 0.3× 88 0.6× 64 0.5× 112 1.3k
Iffat A. Gheyas United Kingdom 7 85 0.4× 86 0.4× 24 0.2× 68 0.5× 364 3.0× 12 753
Georges R. Harik United States 6 372 1.6× 65 0.3× 52 0.3× 42 0.3× 643 5.3× 6 849
Thomas Bousonville Germany 4 117 0.5× 24 0.1× 48 0.3× 34 0.2× 207 1.7× 9 612
Wenjia Wang China 13 73 0.3× 129 0.7× 21 0.1× 11 0.1× 104 0.9× 61 500

Countries citing papers authored by Robert D. Carr

Since Specialization
Citations

This map shows the geographic impact of Robert D. Carr'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 Robert D. Carr with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert D. Carr more than expected).

Fields of papers citing papers by Robert D. Carr

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert D. Carr. 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 Robert D. Carr. The network helps show where Robert D. Carr may publish in the future.

Co-authorship network of co-authors of Robert D. Carr

This figure shows the co-authorship network connecting the top 25 collaborators of Robert D. Carr. A scholar is included among the top collaborators of Robert D. Carr 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 Robert D. Carr. Robert D. Carr 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.
Witzel, Wayne, et al.. (2023). Verifying quantum phase estimation using an expressive theorem-proving assistant. Physical review. A. 108(5).
2.
Carr, Robert D., et al.. (2022). A new integer programming formulation of the graphical traveling salesman problem. Mathematical Programming. 197(2). 877–902. 5 indexed citations
3.
Carr, Robert D., et al.. (2022). Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. Discrete Optimization. 47. 100746–100746. 1 indexed citations
4.
Boyd, Sylvia & Robert D. Carr. (2011). Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discrete Optimization. 8(4). 525–539. 12 indexed citations
5.
Murray, Regan, William E. Hart, Cynthia A. Phillips, et al.. (2009). US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water. INFORMS Journal on Applied Analytics. 39(1). 57–68. 17 indexed citations
6.
Berry, Jonathan W., et al.. (2008). On the Placement of Imperfect Sensors in Municipal Water Networks. 1–13. 15 indexed citations
7.
Carr, Robert D., Goran Konjevod, Greg Little, Venkatesh Natarajan, & Ojas Parekh. (2007). Compacting cuts: a new linear formulation for minimum cut. Symposium on Discrete Algorithms. 43–52. 5 indexed citations
8.
Berry, Jonathan W., Robert D. Carr, William E. Hart, & Cynthia A. Phillips. (2007). Scalable Water Network Sensor Placement via Aggregation. World Environmental and Water Resources Congress 2007. 122. 1–11. 8 indexed citations
9.
Balas, Egon, et al.. (2006). New facets of the STS polytope generated from known facets of the ATS polytope. Discrete Optimization. 3(1). 3–19. 2 indexed citations
10.
Carr, Robert D., Harvey J. Greenberg, William E. Hart, et al.. (2005). Robust optimization of contaminant sensor placement for community water systems. Mathematical Programming. 107(1-2). 337–356. 62 indexed citations
11.
Carr, Robert D. & Ojas Parekh. (2005). A -integral relaxation for the A-matching problem. Operations Research Letters. 34(4). 445–450. 1 indexed citations
12.
Caprara, Alberto, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, & Brian P. Walenz. (2004). 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. Journal of Computational Biology. 11(1). 27–52. 88 indexed citations
13.
Carr, Robert D. & Giuseppe Lancia. (2004). Compact optimization can outperform separation: A case study in structural proteomics. 4OR. 2(3). 221–233. 9 indexed citations
14.
Carr, Robert D., Toshihiro Fujito, Goran Konjevod, & Ojas Parekh. (2001). A $${{10}}$$-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. Journal of Combinatorial Optimization. 5(3). 317–326. 21 indexed citations
15.
Carr, Robert D. & Santosh Vempala. (2000). Towards a 4/3 approximation for the asymmetric traveling salesman problem. Symposium on Discrete Algorithms. 116–125. 22 indexed citations
16.
Carr, Robert D., et al.. (2000). On the red-blue set cover problem. Symposium on Discrete Algorithms. 345–353. 78 indexed citations
17.
Carr, Robert D.. (2000). Some Results on Node Lifting of TSP Inequalities. Journal of Combinatorial Optimization. 4(4). 395–414. 1 indexed citations
18.
Carr, Robert D. & Santosh Vempala. (1999). Towards a 4/3 Approximation for the Asymmetric Traveling Salesman Problem. University of North Texas Digital Library (University of North Texas). 6 indexed citations
19.
Boyd, Sylvia & Robert D. Carr. (1999). A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Mathematical Programming. 86(3). 499–499. 4 indexed citations
20.
Carr, Robert D.. (1997). Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. Mathematics of Operations Research. 22(2). 257–265. 13 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

Rankless by CCL
2026