The SCEAS System
| |||||||

## Search the dblp DataBase
Cristina G. Fernandes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - Cristina G. Fernandes, Till Nierhoff
**The UPS Problem.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:238-246 [Conf] - 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] - Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
**Reaction Motifs in Metabolic Networks.**[Citation Graph (0, 0)][DBLP] WABI, 2005, pp:178-191 [Conf] - 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] - 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] - 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] - 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] - Cristina G. Fernandes
**A Better Approximation Ratio for the Minimum Size**[Citation Graph (0, 0)][DBLP]*k*-Edge-Connected Spanning Subgraph Problem. J. Algorithms, 1998, v:28, n:1, pp:105-124 [Journal] - 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] - 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] - 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] **A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.**[Citation Graph (, )][DBLP]**A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.**[Citation Graph (, )][DBLP]**Maximum Series-Parallel Subgraph.**[Citation Graph (, )][DBLP]**A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem**[Citation Graph (, )][DBLP]**Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.**[Citation Graph (, )][DBLP]**Repetition-free longest common subsequence.**[Citation Graph (, )][DBLP]**On the k-Structure Ratio in Planar and Outerplanar Graphs.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |