Search the dblp DataBase

Publications of Author

1. Gruia Calinescu, Cristina G. Fernandes
   Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. [Citation Graph (0, 0)][DBLP]
   COCOON, 1996, pp:152-161 [Conf]
   
2. Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
   Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
   IPCO, 1998, pp:137-152 [Conf]
   
3. Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
   A Better Approximation Algorithm for Finding Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
   SODA, 1996, pp:16-25 [Conf]
   
4. Cristina G. Fernandes
   A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   SODA, 1997, pp:629-638 [Conf]
   
5. Cristina G. Fernandes, Till Nierhoff
   The UPS Problem. [Citation Graph (0, 0)][DBLP]
   STACS, 2001, pp:238-246 [Conf]
   
6. José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
   Approximating Rational Objectives Is as Easy as Approximating Linear Ones. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:351-362 [Conf]
   
7. Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
   Reaction Motifs in Metabolic Networks. [Citation Graph (0, 0)][DBLP]
   WABI, 2005, pp:178-191 [Conf]
   
8. John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina
   Lempel, Even, and Cederbaum Planarity Method. [Citation Graph (0, 0)][DBLP]
   WEA, 2004, pp:129-144 [Conf]
   
9. Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky
   A New Approximation Algorithm for Finding Heavy Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:36, n:2, pp:179-205 [Journal]
   
10. Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
    A Better Approximation Algorithm for Finding Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:269-302 [Journal]
    
11. Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
    Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:333-359 [Journal]
    
12. Cristina G. Fernandes
    A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:105-124 [Journal]
    
13. Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel
    From monomials to words to graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:105, n:2, pp:185-206 [Journal]
    
14. Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
    Motif Search in Graphs: Application to Metabolic Networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:360-368 [Journal]
    
15. Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira, José Coelho de Pina
    Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:5, pp:195-202 [Journal]
    
16. 
    A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. [Citation Graph (, )][DBLP]
    
    
17. 
    A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Maximum Series-Parallel Subgraph. [Citation Graph (, )][DBLP]
    
    
19. 
    A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem [Citation Graph (, )][DBLP]
    
    
20. 
    Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. [Citation Graph (, )][DBLP]
    
    
21. 
    Repetition-free longest common subsequence. [Citation Graph (, )][DBLP]
    
    
22. 
    On the k-Structure Ratio in Planar and Outerplanar Graphs. [Citation Graph (, )][DBLP]