| 2021 | IPCO | A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. | Robert D. Carr, Neil Simonetti |
| 2009 | SPAA | Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory. | James E. Levy, Anand Ganti, Cynthia A. Phillips, Benjamin R. Hamlet, Andrew J. Landahl, Thomas M. Gurrieri, Robert D. Carr, Malcolm S. Carroll |
| 2007 | SODA | Compacting cuts: a new linear formulation for minimum cut. | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
| 2002 | GECCO | Alignment Of Protein Structures With A Memetic Evolutionary Algorithm. | Robert D. Carr, William E. Hart, Natalio Krasnogor, Jonathan D. Hirst, Edmund K. Burke, James Smith |
| 2001 | RECOMB | 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. | Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail |
| 2000 | ESA | A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |
| 2000 | SODA | On the red-blue set cover problem. | Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe |
| 2000 | SODA | Strengthening integrality gaps for capacitated network design and covering problems. | Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips |
| 2000 | SODA | Towards a 4/3 approximation for the asymmetric traveling salesman problem. | Robert D. Carr, Santosh S. Vempala, Jacques Mandler |
| 2000 | STOC | Randomized metarounding (extended abstract). | Robert D. Carr, Santosh S. Vempala |
| 1995 | IPCO | Separating Clique Tree and Bipartition Inequalities in Polynominal Time. | Robert D. Carr |