[< BACK]

Education

• PhD in Combinatorics and Optimization (supervisor: Dan H. Younger), University of Waterloo, Canada, 1983
• Master in Applied Mathematics (supervisor: Imre Simon), USP, 1974
• Electronics Engineering, USP, 1969

Research interests

• Graph Theory
• Combinatorial Optimization
• Algorithms Design and Analysis

Publications

• E.G. Birgin, P. Feofiloff, C.G. Fernandes, E.L. de Melo, M.T.I. Oshiro, D.P. Ronconi,  A MILP model for an extended version of the Flexible Job Shop Problem,  Optimization Letters 8, 2014  [arXiv:1401.3654]
• P. Feofiloff, C.G. Fernandes, C.E. Ferreira, J.C. de Pina, A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner tree problem, arXiv:1004.1437v2, 2010
• P. Feofiloff, C.G. Fernandes, C.E. Ferreira, J.C. de Pina, Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem, Information Processing Letters, 103, 2007  [corrected version, 2013]

Books

• Algoritmos em linguagem C,  Elsevier, 2008–2009
• Uma Introdução Sucinta a Algoritmos de Aproximação,  with M.H. de Carvalho, M.R. Cerioli, R. Dahab, C.G. Fernandes, C.E. Ferreira, K.S. Guimarães, F.K. Miyazawa, J.C. de Pina Jr., J.A.R. Soares and Y. Wakabayashi,  IMPA, 2001

Lecture notes and monographs

• Algorithms Design (in C)
• Analysis of Algorithms
• Algorithms for Minimax Equalities in Graphs, with Cláudio L. Lucchesi, VI Escola de Computação, Campinas, 1988
• Graph Algorithms with Stanford GraphBase
• Graph Theory Exercises
• A Brief Introduction to Graph Theory, with Y. Kohayakawa and Y. Wakabayashi, 2004
• A Brief Introduction to Approximation Algorithms, with M.H. Carvalho, M.R. Cerioli, R. Dahab, C.G. Fernandes, C.E. Ferreira, K.S. Guimarães, F.K. Miyazawa, J.C. Pina, J. Soares, and Y. Wakabayashi, IMPA, 2001
• Linear Programming Algorithms,  1999
• Combinatorial Optimization
• Literate Programming & CWEB

Supervised Master's theses

• The Minimum Multicut Problem, by Juan Gabriel Gutiérrez Alva, 2012
• List-coloring, by Gordana Manić, 2001
• T-joins, T-cuts, and conservative functions, 
  by Mario Leston Rey, 1999
• Construction of Efficient Algorithms for NP-hard Problems in Graphs, by Fábio Henrique Carvalheiro, 1994
• Parallel Algorithms in Graphs: Lists, Forests and Collections of Forests, by Stephen W. Kassner, 1992
• Circulation Problems in Graphs, by Cristina Gomes Fernandes, 1992
• Disjoint Circuits in Graphs, by José Augusto Ramos Soares, 1987

Courses taught

• Algorithms and Data Structures
• Analysis of Algorithms
• Programming Challenges
• Approximation Algorithms
• Linear Programming
• Combinatorial Optimization
• Introduction to Graph Theory
• Graph Algorithms
• Combinatorics and Graphs
• Topics in Combinatorics
• Digraphs

Administrative duties

• Co-editor of the GRACO 2005 (2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics) papers, Discrete Applied Mathematics, volume 156, number 7
• Co-editor of the proceedings of GRACO 2005 (2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics), Electronic Notes in Discrete Mathematics, volume 19
• Representative of the Computer Science Department on the Undergraduate Committee of IME, 2001–2003
• Director, Department of Informatics, University Central Administration,  1998–1999
• Chairman, Department of Computer Science, IME-USP,  1987–1991
• Chairman, Department of Applied Mathematics, IME-USP,  1986–1987
• Chairman, Organizing Committee of LATIN 92 (Latin American Theoretical Informatics), 1991–1992