Publications:

Books and book chapters

C.G. Fernandes e J.C. Pina Jr., Convite à Geometria Computacional, Jornadas de Atualização em Informática, cap. 7, 2009. Site do capítulo.
G. Calinescu and C.G. Fernandes, Maximum Planar Subgraph (Chapter 56). In: Teofilo F. Gonzalez. (Org.). Handbook of Approximation Algorithms And Metaheuristics. 1 ed. Boca Raton: Chapman and Hall/CRC Press, 2007, v. 10.
M.H. Carvalho, M.R. Cerioli, R. Dahab, P. Feofiloff, C.G. Fernandes, C.E. Ferreira, K.S. Guimarães, F.K. Miyazawa, J.C. Pina Jr., J. Soares, Y. Wakabayashi, Uma Introdução Sucinta a Algoritmos de Aproximação, Publicações Matemáticas do IMPA, 2001.

Journals

G. Calinescu, C.G. Fernandes, Hemanshu Kaul, and A. Zelikovsky, "Maximum Series-Parallel Subgraph", Algorithmica: Volume 63, Issue 1 (2012), Page 137-157.
doi:10.1007/s00453-011-9523-4
E.S. Laber, C.F. Bornstein, and C.G. Fernandes, "Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)". Algorithmica 59(1): 1-2 (2011).
J.R. Correa, C.G. Fernandes and Y. Wakabayashi, "Approximating a Class of Combinatorial Problems with Rational Objective Function", Mathematical Programming B, Volume 124, Numbers 1-2, 255-269, 2010.
S.S. Adi, M.D.V. Braga, C.G. Fernandes, C.E. Ferreira, F.H.V. Martinez, M.-F. Sagot, M.A. Stefanes, C. Tjandraatmadja, and Y. Wakabayashi, "Repetition-free longest common subsequence", Discrete Applied Mathematics 185 (2010), 1315-1324.
C.G. Fernandes, O. Lee and Y. Wakabayashi, "The Minimum Cycle Cover and the Chinese Postman Problems on Mixed Graphs with Bounded Tree-Width", Discrete Applied Mathematics 157 (2009), pp. 272-279.
G. Calinescu and C.G. Fernandes, "On the k-Structure Ratio in Planar and Outerplanar Graphs", Discrete Mathematics and Theoretical Computer Science, Vol 10, 135-148, No 3 (2008).
P. Feofiloff, C.G. Fernandes, C.E. Ferreira and J.C. Pina, "Primal-Dual Approximation Algorithms for the Prize-Collecting Steiner Tree Problem", Information Processing Letters, 103(5), 195-202, 2007. [ps.gz]
C.G. Fernandes, V. Lacroix and M.-F. Sagot, "Motif Search in Graphs: Application to Metabolic Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 3, No. 4, pp. 360-368, 2006.
C.G. Fernandes, E. Green and A. Mandel, "From Monomials to Words to Graphs", Journal of Combinatorial Theory Series A, 105 (2004) 185-206. Available at the arXiv.org e-Print archive. [ps.gz]
G. Calinescu, C.G. Fernandes and B. Reed, "Multicuts in Unweighted Graphs and Digraphs with Bounded Degree and Bounded Tree-Width", Journal of Algorithms 48 (2), 333-359 (2003). [ScienceDirect] [ps.gz]
G. Calinescu, C.G. Fernandes, H. Karloff and A. Zelikovski, "A New Approximation Algorithm for Finding Heavy Planar Subgraphs", Algorithmica (2003) 36: 179-205. [ps.gz]
G. Calinescu and C.G. Fernandes and I. Mandoiu and A. Olshevsky and K. Yang and A. Zelikovsky, "Primal-Dual Algorithms for QoS Multimedia Multicast", Proceedings of the GLOBECOM, 6pp, 2003.
C.G. Fernandes, "A Better Approximation Ratio for the Minimum k-edge-connected Spanning Subgraph Problem", Journal of Algorithms 28 (1), 105-124 (1998). [ps.gz]
G. Calinescu, C.G. Fernandes, U. Finkler and H. Karloff, "A Better Approximation Algorithm for Finding Planar Subgraphs", Journal of Algorithms 27 (2), 269-302 (1998). [ps.gz]

Conference proceedings

C.G. Fernandes and R.C.S. Schouery, "Second-Price Ad Auctions with Binary Bids and Markets with Good Competition", ISCO 2012. To appear in Lecture Notes in Computer Science.
S.F. de Rezende, C.G. Fernandes, D.M. Martin and Y. Wakabayashi, "Intersection of longest paths in a graph", EUROCOMB 2011, in the Electronic Notes in Discrete Mathematics (ENDM) v. 38, p. 743-748.
C.G. Fernandes and M. Stein, "Stability in geodesics for memoryless binary long-lived consensus", LAGOS 2011, in the Electronic Notes in Discrete Mathematics (ENDM) v. 37, p. 351-356.
C.G. Fernandes, C.E. Ferreira, F.K. Miyazawa and Y. Wakabayashi, "Selfish Square Packing", LAGOS 2011, in the Electronic Notes in Discrete Mathematics (ENDM) v. 37, p. 369-374.
G. Calinescu, C.G. Fernandes and Hemanshu Kaul, "Maximum Series-Parallel Subgraph", WG 2009, Lecture Notes in Computer Science, 2010, Volume 5911/2010, 54-65.
H. Mendes and C.G. Fernandes, "A concurrent implementation of skip graphs", LAGOS 2009. Electronic Notes in Discrete Mathematics, v. 35. p. 263-268, 2008.
C.G. Fernandes, C.E. Ferreira, C. Tjandraatmadja, and Y. Wakabayashi, "A polyhedral investigation of the LCS problem and a repetition-free variant", In: 8th Latin American Theoretical Informatics Symposium (LATIN), Buzios, 2008. Lecture Notes in Computer Science 4957. E.S. Laber et al. (Eds.): pp. 329-338, 2008.
S.S. Adi, M.D.V. Braga, C.G. Fernandes, C.E. Ferreira, F.H.V. Martinez, M.-F. Sagot, M.A. Stefanes, C. Tjandraatmadja, and Y. Wakabayashi, "Repetition-free longest common subsequence", LAGOS, 2007. Electronic Notes in Discrete Mathematics, Volume 30, 243-248, 2008.
J.R. Correa, C.G. Fernandes, M. Matamala, and Y. Wakabayashi, "A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs". In: 5th Workshop on Approximation and Online Algorithms (WAOA), 2007, Eilat. Lecture Notes in Computer Science. Berlin: Spring-Verlag, 2008. v. 4927. p. 184-192. [pdf]
J.R. Correa, C.G. Fernandes and Y. Wakabayashi, "Approximating Rational Objectives is as Easy as Approximating Linear Ones", SWAT 2006, LNCS 4059, 351-362.
V. Lacroix, C.G. Fernandes and M.-F. Sagot, "Reaction Motifs in Metabolic Networks". In the Fifth Workshop on Algorithms in Bioinformatics (Mallorca, WABI 2005). LNCS 3692, 178-191.
J. Boyer, C.G. Fernandes, A. Noma and J.C. Pina, "Lempel, Even, and Cederbaum Planarith Method", In the Third International Workshop in Experimental Algorithms (Angra dos Reis, 2004), C. C. Ribeiro and S. L. Martins, Eds., v. 3059 of Lecture Notes in Computer Science. Springer, pp. 129-144. [ps.gz] Transparencies available in [pdf].
G. Calinescu, C.G. Fernandes, I. Mandoiu, A. Olshevsky, K. Yang, and A. Zelikovsky, "Primal-Dual Algorithms for QoS Multimedia Multicast", GLOBECOM 2003. [ps.gz]
G. Calinescu and C.G. Fernandes, "Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width", Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO), 2001. Published in Electronic Notes in Discrete Mathematics, Volume 7, 194-197. [ps.gz]
C.G. Fernandes and T. Nierhoff, "The UPS Problem", 18th International Symposium on Theoretical Aspects of Computer Science (STACS), Dresden, 238-246, Lecture Notes in Computer Science, 2010, Springer, Berlin, 2001. [ps.gz]
G. Calinescu, C.G. Fernandes and B. Reed, "Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width", In Integer Programming and Combinatorial Optimization (Berlin, 1998), R. E. Bixby and E. A. Boyd and R. Z. Ríos-Mercado, Eds., v.1412 of Lecture Notes in Computer Science. Springer, pp. 137-152. [ps.gz]
C.G. Fernandes, "A Better Approximation Ratio for the Minimum k-edge-connected Spanning Subgraph Problem", Proc. 8th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 629-638, 1997. [ps.gz]
G. Calinescu and C.G. Fernandes, "Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus", Proc. 2nd Annual International Computing and Combinatorics Conference (COCOON), v.1090 of Lecture Notes in Comput. Science, 152-161, 1996. [ps.gz]
G. Calinescu, C.G. Fernandes, U. Finkler and H. Karloff, "A Better Approximation Algorithm for Finding Planar Subgraphs", Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 16-25, 1996. [ps.gz]

Submitted papers and manuscripts

C.G. Fernandes, C.E. Ferreira, F.K. Miyazawa and Y. Wakabayashi, "Selfish and dynamic 2D bin packing", submitted, 2011.
C.G. Fernandes and M. Stein, "Geodesic stability for memoryless binary long-lived consensus", submitted, 2011. Also in the arXiv.
C.G. Fernandes, L.A.A. Meira, F.K. Miyazawa, and L.L.C. Pedrosa, "Squared Metric Facility Location Problem", submitted, 2011. Also in the arXiv.

Other manuscripts

C.H. Cardonha, M.K. de Carli Silva and C.G. Fernandes, Computação Quântica: Complexidade e Algoritmos, Relatório Técnico (in Portuguese), 2005. Anais das Jornadas de Iniciação Científica, IMPA, 2004. [ps.gz][pdf]
P. Feofiloff, C.G. Fernandes, C.E. Ferreira and J.C. Pina, "A Note on Johnson, Minkoff and Phillips' Algorithm for the Prize-Collecting Steiner Tree Problem", revised version, 2009. [arXiv:1004.1437v1 [cs.DS]] [pdf][ps.gz]
P. Feofiloff, C.G. Fernandes, C.E. Ferreira and J.C. Pina, "$O(n^2\log n)$ implementation of an approximation for the Prize-Collecting Steiner Tree Problem", 2002. [ps.gz]
C.G. Fernandes, H. van der Holst and J.C. Pina, "Multilength Single Pair Shortest Disjoint Paths", Technical Report, 2004. [ps.gz]
C.G. Fernandes and R. Thomas, "Edge-Coloring Series-Parallel Multigraphs", 2000. Revised version in the arXiv.

Last modified: Fri Feb 3 11:57:45 BRST 2012