| 2009 |
|---|
| 20 | EE | Cristina G. Fernandes,
Orlando Lee,
Yoshiko Wakabayashi:
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discrete Applied Mathematics 157(2): 272-279 (2009) |
| 2008 |
|---|
| 19 | EE | Cristina G. Fernandes,
Carlos Ferreira,
Christian Tjandraatmadja,
Yoshiko Wakabayashi:
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.
LATIN 2008: 329-338 |
| 18 | EE | Said Sadique Adi,
Marília D. V. Braga,
Cristina G. Fernandes,
Carlos Eduardo Ferreira,
Fábio Viduani Martinez,
Marie-France Sagot,
Marco A. Stefanes,
Christian Tjandraatmadja,
Yoshiko Wakabayashi:
Repetition-free longest common subsequence.
Electronic Notes in Discrete Mathematics 30: 243-248 (2008) |
| 2007 |
|---|
| 17 | EE | José R. Correa,
Cristina G. Fernandes,
Martín Matamala,
Yoshiko Wakabayashi:
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
WAOA 2007: 184-192 |
| 16 | EE | Paulo Feofiloff,
Cristina G. Fernandes,
Carlos Eduardo Ferreira,
José Coelho de Pina:
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem.
Inf. Process. Lett. 103(5): 195-202 (2007) |
| 2006 |
|---|
| 15 | EE | José R. Correa,
Cristina G. Fernandes,
Yoshiko Wakabayashi:
Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
SWAT 2006: 351-362 |
| 14 | EE | Vincent Lacroix,
Cristina G. Fernandes,
Marie-France Sagot:
Motif Search in Graphs: Application to Metabolic Networks.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 360-368 (2006) |
| 2005 |
|---|
| 13 | EE | Vincent Lacroix,
Cristina G. Fernandes,
Marie-France Sagot:
Reaction Motifs in Metabolic Networks.
WABI 2005: 178-191 |
| 2004 |
|---|
| 12 | EE | John M. Boyer,
Cristina G. Fernandes,
Alexandre Noma,
José Coelho de Pina:
Lempel, Even, and Cederbaum Planarity Method.
WEA 2004: 129-144 |
| 11 | EE | Cristina G. Fernandes,
Edward L. Green,
Arnaldo Mandel:
From monomials to words to graphs.
J. Comb. Theory, Ser. A 105(2): 185-206 (2004) |
| 2003 |
|---|
| 10 | EE | Gruia Calinescu,
Cristina G. Fernandes,
Howard J. Karloff,
Alexander Zelikovsky:
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Algorithmica 36(2): 179-205 (2003) |
| 9 | EE | Gruia Calinescu,
Cristina G. Fernandes,
Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.
J. Algorithms 48(2): 333-359 (2003) |
| 2001 |
|---|
| 8 | EE | Cristina G. Fernandes,
Till Nierhoff:
The UPS Problem.
STACS 2001: 238-246 |
| 7 | EE | Gruia Calinescu,
Cristina G. Fernandes:
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.
Electronic Notes in Discrete Mathematics 7: 194-197 (2001) |
| 1998 |
|---|
| 6 | EE | Gruia Calinescu,
Cristina G. Fernandes,
Bruce A. Reed:
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.
IPCO 1998: 137-152 |
| 5 | | Gruia Calinescu,
Cristina G. Fernandes,
Ulrich Finkler,
Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs.
J. Algorithms 27(2): 269-302 (1998) |
| 4 | | Cristina G. Fernandes:
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem.
J. Algorithms 28(1): 105-124 (1998) |
| 1997 |
|---|
| 3 | | Cristina G. Fernandes:
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem.
SODA 1997: 629-638 |
| 1996 |
|---|
| 2 | | Gruia Calinescu,
Cristina G. Fernandes:
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus.
COCOON 1996: 152-161 |
| 1 | | Gruia Calinescu,
Cristina G. Fernandes,
Ulrich Finkler,
Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs.
SODA 1996: 16-25 |
