Robert D. Carr

2007
20	EE	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh: Compacting cuts: a new linear formulation for minimum cut. SODA 2007: 43-52
2006
19	EE	Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips: Robust optimization of contaminant sensor placement for community water systems. Math. Program. 107(1-2): 337-356 (2006)
18	EE	Robert D. Carr, Ojas Parekh: A 1/2-integral relaxation for the A-matching problem. Oper. Res. Lett. 34(4): 445-450 (2006)
2004
17	EE	Jean-Loup Faulon, Shawn Martin, Robert D. Carr: Dynamical Robustness in Gene Regulatory Networks. CSB 2004: 626-627
16	EE	Robert D. Carr, Giuseppe Lancia: Compact optimization can outperform separation: A case study in structural proteomics. 4OR 2(3): 221-233 (2004)
15	EE	Jean-Loup Faulon, Michael J. Collins, Robert D. Carr: The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences. Journal of Chemical Information and Modeling 44(2): 427-436 (2004)
14	EE	Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz: 1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. Journal of Computational Biology 11(1): 27-52 (2004)
13	EE	Robert D. Carr: Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation. Math. Oper. Res. 29(1): 80-91 (2004)
12	EE	Robert D. Carr, Santosh Vempala: On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. Math. Program. 100(3): 569-587 (2004)
2002
11	EE	Robert D. Carr, Giuseppe Lancia: Compact vs. exponential-size LP relaxations. Oper. Res. Lett. 30(1): 57-65 (2002)
10	EE	Robert D. Carr, Santosh Vempala: Randomized metarounding. Random Struct. Algorithms 20(3): 343-352 (2002)
2001
9	EE	Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail: 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. RECOMB 2001: 193-202
8		Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5(3): 317-326 (2001)
2000
7		Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh: A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. ESA 2000: 132-142
6	EE	Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips: Strengthening integrality gaps for capacitated network design and covering problems. SODA 2000: 106-115
5	EE	Robert D. Carr, Santosh Vempala, Jacques Mandler: Towards a 4/3 approximation for the asymmetric traveling salesman problem. SODA 2000: 116-125
4	EE	Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe: On the red-blue set cover problem. SODA 2000: 345-353
3	EE	Robert D. Carr, Santosh Vempala: Randomized metarounding (extended abstract). STOC 2000: 58-62
2		Robert D. Carr: Some Results on Node Lifting of TSP Inequalities. J. Comb. Optim. 4(4): 395-414 (2000)
1995
1		Robert D. Carr: Separating Clique Tree and Bipartition Inequalities in Polynominal Time. IPCO 1995: 40-49

Coauthor Index

1	Alberto Caprara	[14]
2	Michael J. Collins	[15]
3	Srinivas Doddi	[4]
4	Jean-Loup Faulon	[15] [17]
5	Lisa Fleischer	[6]
6	Toshihiro Fujito	[7] [8]
7	Harvey J. Greenberg	[19]
8	William E. Hart	[19]
9	Sorin Istrail	[9] [14]
10	Goran Konjevod	[4] [7] [8] [19] [20]
11	Giuseppe Lancia	[9] [11] [14] [16]
12	Erik Lauer	[19]
13	Vitus J. Leung	[6]
14	Henry Lin	[19]
15	Greg Little	[20]
16	Jacques Mandler	[5]
17	Madhav V. Marathe	[4]
18	Shawn Martin	[17]
19	Tod Morrison	[19]
20	Venkatesh Natarajan	[20]
21	Ojas Parekh	[7] [8] [18] [20]
22	Cynthia A. Phillips	[6] [19]
23	Santosh Vempala	[3] [5] [10] [12]
24	Brian Walenz	[9] [14]

Colors in the list of coauthors