| 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 | 230 | 2006 |
| 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, 1417-1431, 2014 | 89 | 2014 |
| 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 | 85 | 1998 |
| 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 | 85* | 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 | 76* | 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 | 50* | 2001 |
| 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 | 44 | 2010 |
| 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 | 40 | 2007 |
| 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 | 34 | 2017 |
| Intersecting longest paths SF De Rezende, CG Fernandes, DM Martin, Y Wakabayashi Discrete Mathematics 313 (12), 1401-1408, 2013 | 32 | 2013 |
| 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 | 30 | 2012 |
| A new approximation algorithm for finding heavy planar subgraphs G Calinescu, CG Fernandes, H Karloff, A Zelikovsky Algorithmica 36 (2), 179-205, 2003 | 29 | 2003 |
| Reaction motifs in metabolic networks V Lacroix, C Fernandes, MF Sagot Algorithms in Bioinformatics (WABI), 178-191, 2005 | 23 | 2005 |
| The envy-free pricing problem, unit-demand markets and connections with the network pricing problem CG Fernandes, CE Ferreira, AJP Franco, RCS Schouery Discrete Optimization 22, 141-161, 2016 | 20 | 2016 |
| 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 | 20 | 2009 |
| Approximating a class of combinatorial problems with rational objective function JR Correa, CG Fernandes, Y Wakabayashi Mathematical programming 124, 255-269, 2010 | 19 | 2010 |
| 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 | 16 | 2008 |
| 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 | 15 | 2010 |
| Improved approximation algorithms for capacitated fault-tolerant k-center CG Fernandes, SP de Paula, LLC Pedrosa Algorithmica 80 (3), 1041-1072, 2018 | 12 | 2018 |
| Selfish square packing CG Fernandes, CE Ferreira, FK Miyazawa, Y Wakabayashi Electronic Notes in Discrete Mathematics 37, 369-374, 2011 | 12 | 2011 |
Yoshiko WakabayashiProfessor of Computer Science, University of São Paulo在 ime.usp.br 的电子邮件经过验证
