dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Cristina G. Fernandes Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky: Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012)
2011
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo 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)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Maya Stein: Geodesic stability for memoryless binary long-lived consensus CoRR abs/1102.4100: (2011)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Robin Thomas: Edge-coloring series-parallel multigraphs CoRR abs/1107.5370: (2011)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa: Squared Metric Facility Location Problem CoRR abs/1111.1672: (2011)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Maya Stein: Stability in geodesics for memoryless binary long-lived consensus. Electronic Notes in Discrete Mathematics 37: 351-356 (2011)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi: Selfish Square Packing. Electronic Notes in Discrete Mathematics 37: 369-374 (2011)
2010
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSaid 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)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé 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)
2009
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul: Maximum Series-Parallel Subgraph. WG 2009: 54-65
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina 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)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHammurabi Mendes, Cristina G. Fernandes: A Concurrent Implementation of Skip Graphs. Electronic Notes in Discrete Mathematics 35: 263-268 (2009)
2008
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes: On the k-Structure Ratio in Planar and Outerplanar Graphs. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSaid 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT 2006: 351-362
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVincent 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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVincent Lacroix, Cristina G. Fernandes, Marie-France Sagot: Reaction Motifs in Metabolic Networks. WABI 2005: 178-191
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina: Lempel, Even, and Cederbaum Planarity Method. WEA 2004: 129-144
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Edward L. Green, Arnaldo Mandel: From monomials to words to graphs. J. Comb. Theory, Ser. A 105(2): 185-206 (2004)
2003
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky: A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia 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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes, Till Nierhoff: The UPS Problem. STACS 2001: 238-246
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27(2): 269-302 (1998)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes: A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem. J. Algorithms 28(1): 105-124 (1998)
1997
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCristina G. Fernandes: A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. SODA 1997: 629-638
1996
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes: Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25

Coauthor Index

1Said Sadique Adi [18] [25]
2Claudson F. Bornstein [32]
3John M. Boyer [12]
4Marília D. V. Braga [18] [25]
5Gruia Calinescu [1] [2] [5] [6] [7] [9] [10] [19] [23] [33]
6José R. Correa [15] [17] [24]
7Paulo Feofiloff [16] [26]
8Carlos Eduardo Ferreira [16] [18] [20] [25] [26] [27]
9Ulrich Finkler [1] [5]
10Edward L. Green [11]
11Howard J. Karloff [1] [5] [10]
12Hemanshu Kaul [23] [33]
13Eduardo Sany Laber [32]
14Vincent Lacroix [13] [14]
15Orlando Lee [22]
16Arnaldo Mandel [11]
17Fábio Viduani Martinez [18] [25]
18Martín Matamala [17]
19Luis A. A. Meira [29]
20Hammurabi Mendes [21]
21Flávio Keidi Miyazawa (Flavio Keidi Miyazawa) [27] [29]
22Till Nierhoff [8]
23Alexandre Noma [12]
24Lehilton L. C. Pedrosa [29]
25José Coelho de Pina [12] [16] [26]
26Bruce A. Reed [6] [9]
27Marie-France Sagot [13] [14] [18] [25]
28Marco A. Stefanes [18] [25]
29Maya Jakobine Stein (Maya Stein) [28] [31]
30Robin Thomas [30]
31Christian Tjandraatmadja [18] [20] [25]
32Yoshiko Wakabayashi [15] [17] [18] [20] [22] [24] [25] [27]
33Alexander Zelikovsky [10] [33]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page