The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert D. Carr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Loup Faulon, Shawn Martin, Robert D. Carr
    Dynamical Robustness in Gene Regulatory Networks. [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:626-627 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:132-142 [Conf]
  3. Robert Carr, William Hart, Natalio Krasnogor, Jonathan D. Hirst, Edmund K. Burke, James Smith
    Alignment Of Protein Structures With A Memetic Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP]
    GECCO, 2002, pp:1027-1034 [Conf]
  4. Robert D. Carr
    Separating Clique Tree and Bipartition Inequalities in Polynominal Time. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:40-49 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:193-202 [Conf]
  6. Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe
    On the red-blue set cover problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:345-353 [Conf]
  7. Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips
    Strengthening integrality gaps for capacitated network design and covering problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:106-115 [Conf]
  8. Robert D. Carr, Santosh Vempala, Jacques Mandler
    Towards a 4/3 approximation for the asymmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:116-125 [Conf]
  9. Robert D. Carr, Santosh Vempala
    Randomized metarounding (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:58-62 [Conf]
  10. Robert D. Carr, Giuseppe Lancia
    Compact optimization can outperform separation: A case study in structural proteomics. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:3, pp:221-233 [Journal]
  11. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:1, pp:27-52 [Journal]
  12. Jean-Loup Faulon, Michael J. Collins, Robert D. Carr
    The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Modeling, 2004, v:44, n:2, pp:427-436 [Journal]
  13. Robert D. Carr
    Some Results on Node Lifting of TSP Inequalities. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:4, pp:395-414 [Journal]
  14. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:3, pp:317-326 [Journal]
  15. Robert D. Carr
    Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:1, pp:80-91 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:107, n:1-2, pp:337-356 [Journal]
  17. Robert D. Carr, Santosh Vempala
    On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:3, pp:569-587 [Journal]
  18. Robert D. Carr, Giuseppe Lancia
    Compact vs. exponential-size LP relaxations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:1, pp:57-65 [Journal]
  19. Robert D. Carr, Ojas Parekh
    A 1/2-integral relaxation for the A-matching problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:445-450 [Journal]
  20. Robert D. Carr, Santosh Vempala
    Randomized metarounding. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:343-352 [Journal]
  21. Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
    Compacting cuts: a new linear formulation for minimum cut. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:43-52 [Conf]

  22. Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory. [Citation Graph (, )][DBLP]


Search in 0.720secs, Finished in 0.721secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002