Cristina G. Fernandes
Cristina G. Fernandes
Professor of Computer Science, University of Sao Paulo, Brazil
Verified email at ime.usp.br
Title
Cited by
Cited by
Year
Motif search in graphs: application to metabolic networks
V Lacroix, CG Fernandes, MF Sagot
IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 (4), 360-368, 2006
2002006
A better approximation algorithm for finding planar subgraphs
G Călinescu, CG Fernandes, U Finkler, H Karloff
Journal of Algorithms (See also Proceedings of the Seventh Annual ACM-SIAM …, 1998
721998
Multicuts in unweighted graphs with bounded degree and bounded tree-width
G Călinescu, C Fernandes, B Reed
Integer Programming and Combinatorial Optimization (IPCO), 137-152, 1998
69*1998
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
CG Fernandes
Journal of Algorithms (See also Proceedings of the Eighth Annual ACM-SIAM …, 1998
56*1998
Uma introduçao sucinta a algoritmos de aproximaçao
MH Carvalho, MR Cerioli, R Dahab, P Feofiloff, CG Fernandes, ...
Publicações Matemáticas do IMPA, 2001
53*2001
A MILP model for an extended version of the Flexible Job Shop Problem
EG Birgin, P Feofiloff, CG Fernandes, EL De Melo, MTI Oshiro, ...
Optimization Letters 8 (4), 1417-1431, 2014
412014
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
P Feofiloff, CG Fernandes, CE Ferreira, JC de Pina
Information Processing Letters 103 (5), 195-202, 2007
332007
Repetition-free longest common subsequence
SS Adi, MDV Braga, CG Fernandes, CE Ferreira, FV Martinez, MF Sagot, ...
Discrete Applied Mathematics 158 (12), 1315-1324, 2010
292010
Intersecting longest paths
SF de Rezende, CG Fernandes, DM Martin, Y Wakabayashi
Discrete Mathematics 313 (12), 1401-1408, 2013
212013
A new approximation algorithm for finding heavy planar subgraphs
G Calinescu, CG Fernandes, H Karloff, A Zelikovsky
Algorithmica 36 (2), 179-205, 2003
212003
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
CG Fernandes, O Lee, Y Wakabayashi
Discrete Applied Mathematics 157 (2), 272-279, 2009
192009
Reaction motifs in metabolic networks
V Lacroix, C Fernandes, MF Sagot
Algorithms in Bioinformatics (WABI), 178-191, 2005
192005
Nonempty intersection of longest paths in series–parallel graphs
G Chen, J Ehrenmüller, CG Fernandes, CG Heise, S Shan, P Yang, ...
Discrete Mathematics 340 (3), 287-304, 2017
182017
Approximating a class of combinatorial problems with rational objective function
JR Correa, CG Fernandes, Y Wakabayashi
Mathematical programming 124 (1-2), 255-269, 2010
182010
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems
CG Fernandes, LAA Meira, FK Miyazawa, LLC Pedrosa
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
172012
A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem.
CG Fernandes
SODA, 629-638, 1997
171997
A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem
P Feofiloff, CG Fernandes, CE Ferreira, JC De Pina
arXiv preprint arXiv:1004.1437, 2010
152010
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
J Correa, C Fernandes, M Matamala, Y Wakabayashi
Approximation and Online Algorithms (WAOA), 184-192, 2008
152008
Selfish square packing
CG Fernandes, CE Ferreira, FK Miyazawa, Y Wakabayashi
Electronic Notes in Discrete Mathematics 37, 369-374, 2011
122011
A polyhedral investigation of the LCS problem and a repetition-free variant
C Fernandes, C Ferreira, C Tjandraatmadja, Y Wakabayashi
LATIN 2008: Theoretical Informatics, 329-338, 2008
92008
The system can't perform the operation now. Try again later.
Articles 1–20