Cristina G. Fernandes

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi: Intersecting longest paths. Discrete Mathematics 313(11): 1401-1408 (2013)

Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky: Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012)

Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa: A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM 2012: 146-157

Cristina G. Fernandes, Rafael C. S. Schouery: Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. ISCO 2012: 439-450

Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes: Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59(1): 1-2 (2011)

Cristina G. Fernandes, Maya Stein: Stability in geodesics for memoryless binary long-lived consensus. Electronic Notes in Discrete Mathematics 37: 351-356 (2011)

Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi: Selfish Square Packing. Electronic Notes in Discrete Mathematics 37: 369-374 (2011)

Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi: Intersection of Longest Paths in a Graph. Electronic Notes in Discrete Mathematics 38: 743-748 (2011)

Cristina G. Fernandes, Maya Stein: Geodesic stability for memoryless binary long-lived consensus. CoRR abs/1102.4100 (2011)

Cristina G. Fernandes, Robin Thomas: Edge-coloring series-parallel multigraphs. CoRR abs/1107.5370 (2011)

Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa: Squared Metric Facility Location Problem. CoRR abs/1111.1672 (2011)

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. Discrete Applied Mathematics 158(12): 1315-1324 (2010)

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2): 255-269 (2010)

Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina: A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem. CoRR abs/1004.1437 (2010)

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)

Hammurabi Mendes, Cristina G. Fernandes: A Concurrent Implementation of Skip Graphs. Electronic Notes in Discrete Mathematics 35: 263-268 (2009)

Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul: Maximum Series-Parallel Subgraph. WG 2009: 54-65

Gruia Calinescu, Cristina G. Fernandes: On the k-Structure Ratio in Planar and Outerplanar Graphs. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)

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)

Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338

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)

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

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)

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT 2006: 351-362

Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot: Reaction Motifs in Metabolic Networks. WABI 2005: 178-191

Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel: From monomials to words to graphs. J. Comb. Theory, Ser. A 105(2): 185-206 (2004)

John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina: Lempel, Even, and Cederbaum Planarity Method. WEA 2004: 129-144

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)

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)

Gruia Calinescu, Cristina G. Fernandes, Ion I. Mandoiu, Alexander Olshevsky, K. Yang, Alexander Zelikovsky: Primal-dual algorithms for QoS multimedia multicast. GLOBECOM 2003: 3631-3635

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)

Cristina G. Fernandes, Till Nierhoff: The UPS Problem. STACS 2001: 238-246

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)

Cristina G. Fernandes: A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. J. Algorithms 28(1): 105-124 (1998)

Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152

Cristina G. Fernandes: A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. SODA 1997: 629-638

Gruia Calinescu, Cristina G. Fernandes: Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161

Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25