2014 - present: Research Fellowship, Brazilian National Council for Science and Technology (CNPq), level 1c
2008 - 2014: Research Fellowship, Brazilian National Council for Science and Technology (CNPq), level 1d
2003 - 2003: Postdoctoral fellowship from CAPES (Ministry of Education, Brazil)
2002 - 2002: Posdoctoral fellowship FAPESP (São Paulo Research Foundation, Brazil)
1999 - 2007: Research Fellowship, Brazilian National Council for Science and Technology (CNPq), level 2
1995 - 1999: Research Fellowship, Brazilian National Council for Science and Technology (CNPq), level 2c
1993 - 1994: Research Fellowship, Université Catholique de Louvain (Belgium)
1989 - 1993: Doctorate Fellowship, Brazilian National Council for Science and Technology (CNPq)
1987 - 1989: M.Sc. Fellowship, Brazilian Ministry of Education (CAPES)
1987 - 1989: Research Support, IBM (Brazil)
1994 - 1999: fellowships for 30+ PhD, MSc and postdoctoral students supervised or under supervision at FAPESP (State of São Paulo Research Foundation, Brazil)

Courses at UNICAMP:

• Data Structures (Graduate and Undergraduate)
• Design and Analysis of Algorithms (Graduate and Undergraduate)
• Discrete Mathematics and Graph Theory (Undergraduate)
• Integer Programming (Graduate)
• Introduction to Computer Programming (Undergraduate)
• Network Flows (Graduate)

The formulation and resolution of problems in the fields of Operations Research (routing, scheduling, etc) and Computer Science (discrete computational geometry, computational biology, graphs, etc) by combinatorial optimization and mixed integer programming. Other: design and analysis of exact and approximate algorithms, heuristics, distributed algorithms for combinatorial optimization, the application of polyhedral combinatorics to different structured problems, hybrid algorithms using Mathematical Programming and Metaheuristics for hard combinatorial optimization problems.

• Fourth Place - Workshop on Open Problems and Hard Instance Challenges, ACM Symposium on Computational Geometry (SoCG 2019).
• Best paper award. Brazilian Symposium in Operations Research (SBPO 2021).
• MSc. dissertation supervised (joint with Prof. Pedro J. de Rezende): by Felipe Pereira, second prize in the Brazilian Operations Research Society contest (SBPO, 2019).
• MSc. dissertation supervised (joint with Prof. Pedro J. de Rezende): by Felipe Pereira, third prize in the Brazilian Computer Society contest (CTD, SBC 2022).
• PhD. thesis supervised (joint with Prof. Tallys Yunes): by L. de Oliveira, second prize in the UNESCO - Latin American Conference on Informatics (CLEI 2017).
• M.Sc. dissertation supervised (joint with Prof. Pedro J. de Rezende): by D. C. Tozoni, first prize in the UNESCO - Latin American Conference on Informatics (CLEI 2015).
• Teaching Excellence Award, Institute of Computing, University of Campinas, 2013.
• Best MSc dissertation prize of the XXXIV National Conference on Applied and Computational Mathematics (CNMAC, Brazil), 2012, obtained by the student Marcelo Couto (co-supervised by P. J. de Rezende).
• Second best Scientific Initiation prize of the XXXIV National Conference on Applied and Computational Mathematics (CNMAC, Brazil), 2012, obtained by the student Rafael Cano (co-supervised by P. J. de Rezende).
• M.Sc. dissertation supervised (joint with Prof. Arnaldo V. Moura): by A. A. Cire, second prize in the UNESCO - Latin American Conference on Informatics (2009).
• Best Paper Award in the Application Track of the International Conference on Principles and Practice of Constraint Programming (CP 2008), Sydney, Australia, 14-18 September 2008. Paper title: "Planning and Scheduling the Operation of a Very Large Oil Pipeline Network" (joint with A. Moura, A. Ciré and T. Lopes).
• Grant "Zeferino Vaz" for excellence in teaching and research from the University of Campinas (2007).
• Prêmio PETROBRAS de Tecnologia 2005 - Categoria "Produção"
  (Brazilian Oil Company, Tecnology Prize 2005 - Category "Production") won by the student Romulo P. Albuquerque (joint supervision with Prof. Arnaldo V. Moura).
• M.Sc. dissertation supervised (joint with Prof. Arnaldo V. Moura): by T. H. Yunes, first prize in the UNESCO - Latin American Conference on Informatics (2001).
• Grant "Zeferino Vaz" for excellence in teaching and research from the University of Campinas (2001).
• M.Sc. dissertation supervised: by C. N. Menezes, 4th prize in the UNESCO - Latin American Conference on Informatics (1998).

Published papers: (only includes papers in journals and in conference proceedings with peer reviewing process)

1. A heuristic for the convex recoloring problem in graphs.
   International Transactions in Operational Research, v. 29 (3), p. 1454-1478, 2022 (with A. P. Dantas and Z. Dias).
2. Solving the minimum convex partition of point sets with integer programming.
   Computational Geometry Theory and Applications, v. 99, p. 101794, 2021 (with A. Sapucaia and P. J. de Rezende).
3. A learning-from-data approach with soft clustering and path relinking to the history-matching problem.
   Journal of Petroleum Exploration and Production Technology, v. 11, p. 3045-3077, 2021 (with C. C. B. Cavalcante, C. Maschio, D. Schiozer and A. Rocha)
4. Solving the Coarseness Problem by ILP Using Column Generation.
   Lecture Notes in Computer Science,, v. 12953, p. 30-35, Proceedings of the 21st International Conference on Computational Science and Its Applications (ICCSA), 2021, Cagliari, Italy, September 13-16 (with A. Sapucaia and P. J. de Rezende).
5. Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips. Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021), Halifax, Canada (with A. Sapucaia, A. A. Cire and P. J. de Rezende).
6. Effective Heuristics for the Perfect Awareness Problem.
   Procedia Computer Science, v. 195, p. 489-498, 2021 Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS) (with F. C. Pereira and P. J. de Rezende).
7. A matheuristic for the firefighter problem on graphs.
   International Transactions in Operational Research, v. 27, p. 739-766, 2020 (with N. Ramos and P. J. de Rezende).
8. Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement
   Lecture Notes in Computer Science, v. 12558, p. 129-140, Proceedings of the 13th Brazilian Symposium on Bioinformatics (BSB), 2020, São Paulo, Brazil, November 23-27 (with P. O. Pinheiro, A. O. Alexandrino, A. R. Oliveira and Z. Dias)
9. Solving dynamic labeling problems to optimality using solution space reductions.
   Theoretical Computer Science, v. 789, p. 77-92, 2019 (with R. Cano and P. J. de Rezende).
10. A GRASP for the Convex Recoloring Problem in Graphs.
    Electronic Notes in Theoretical Computer Science, v. 346. p. 379-391 (2019) (with A. P. S. Dantas and Z. Dias).
11. Minimum Convex Partition of Point Sets.
    Lecture Notes in Computer Science, vol. 11485, pp. 25-37, Proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, Rome, Italy, May 27-29, 2019 (with A. Sapucaia and P. J. de Rezende).
12. Solving the geometric firefighter routing problem via integer programming.
    European Journal of Operational Research, 274(3): 1090-1101, 2019 (with Mauricio J.O. Zambon and P. J. de Rezende).
13. Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.
    International Transactions in Operations Research, 26(4): 1339-1364, 2019 (with T. A. Santos and C. C. Ribeiro).
14. Finding exact solutions for the Geometric Firefighter Problem in practice.
    Computers & Operations Research, v. 97, pp. 72-83, 2018 (with Mauricio J.O. Zambon and P. J. de Rezende).
15. Optimal Solutions for a Geometric Knapsack Problem using Integer Programming. Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG 2018), Manitoba, Canada (with R. Cano and P. J. de Rezende).
16. Fast Optimal Labelings for Rotating Maps
    Lecture Notes in Computer Science, vol. 10167, pp. 161--173, Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM), Hsinchu, Taiwan, March 29-31, 2017, (with R. Cano and P. J. de Rezende).
17. Minimum stabbing rectangular partitions of rectilinear polygons
    Computers & Operations Research, vol. 80, pp 184--197, 2017, (with B. Piva).
18. Engineering Art Galleries,
    Lecture Notes in Computer Science, vol. 9220, pp 379--417, 2016 (special volume dedicated to Selected Results and Surveys on Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders), (with P. J. de Rezende, S. Friedrichs, M. Hemmer, A. Kroller and D. Tozoni)
19. A note on the paper 'Eternal security in graphs' by Goddard, Hedetniemi, and Hedetniemi (2005),
    Journal of Combinatorial Mathematics and Combinatorial Computing, v. 96, p. 13-22, 2016 (with A. S. Braga and O. Lee).
20. Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph,
    Discrete Optimization, v. 21, p. 42-70, 2016 (with A. Agra and M. Doostmohammadi).
21. Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm,
    Computers & Operations Research, v. 72, p. 147-159, 2016 (with L. Oliveira and T. Yunes).
22. Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming,
    ACM Transactions on Mathematical Software, v. 43, p. 1-27, 2016 (with D. Tozoni and P. J. de Rezende).
23. Exact Solutions for the Geometric Firefighter Problem Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG 2016), Vancouver, Canada: Simon Fraser University, (with M. Zambon and P. J. de Rezende).
24. Arc-based integer programming formulations for three variants of proportional symbol maps,
    Discrete Optimization, 18: 87-110 (2015). (with R. Cano, P. J. de Rezende and T. Yunes).
25. Solving the natural wireless localization problem to optimality efficiently.
    Computational Geometry Theory and Applications, 48(5): 370-379, 2015. (with Crepaldi, B. E. and de Rezende, P. J.).
26. The Eternal Dominating Set problem for proper interval graphs.
    Information Processing Letters, 115(6-8): 582-587, 2015 (with A. Braga and O. Lee).
27. On the Complexity of the Traveling Umpire Problem.
    Theoretical Computer Science, vol. 562, p. 101-111, 2015 (with L. de Oliveira and T. Yunes).
28. Computing Minimum Dilation Spanning Trees in Geometric Graphs.
    Lecture Notes in Computer Science, vol. 9198, 297-309 Proceedings of the 21st International Conference Computing and Combinatorics (COCOON), Beijing, China, August 4-6, 2015, (with A. F. Brandt, M. F. A. de Gaiowski, and P. J. de Rezende).
29. Minimum Dilation Triangulation: Reaching Optimality Efficiently. Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG 2014), Halifax, Canada, 2014 (with A. Brandt, M. Gaiowski and P. J. de Rezende).
30. An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.
    Lecture Notes in Computer Science, v. 8504. p. 59-73. Proceedings of the 12th Symposium on Experimental Algorithms (SEA 2014), Copenhagen, Denmark, 2014 (with M. Zambon and P. J. de Rezende).
31. Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
    INFORMS Journal on Computing, v. 26, p. 199-207, 2014 (with G. Kunigami, P. J. de Rezende and T.H. Yunes).
32. Integer programming approaches for Minimum Stabbing Problems
    RAIRO - Operations Research v. 48, p. 211-233, 2014 (with B. Piva, Y. Frota and L. Simonetti).
33. Improved Bounds for the Traveling Umpire Problem: A Stronger Formulation and a Relax-and-Fix Heuristic
    European Journal on Operational Research v. 236, p. 592-600, 2014 (with L. de Oliveira and T. H. Yunes).
34. An Integer Programming Formulation for the Maximum k-Subset Intersection Problem.
    Lecture Notes in Computer Science, v. p. 87-99. Proceedings of the 3rd International Symposium on Combinatorial Optimization (ISCO 2014), Revised Selected Papers, Lisbon, Portugal, 2014 (with E. T. Bogue, E. C. Xavier, and A. S. Freire)
35. A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps,
    Computers & Operations Research, Volume 40 Issue 5, May, 2013 Pages 1435-1447 (with R. G. Cano, G. Kunigami and P. J. De Rezende).
36. Intersecting a simple mixed integer set with a vertex packing set,
    Electronic Notes in Discrete Mathematics, 41: 327-334 (2013) (with A, Agra and M. Doostmohammadi )
37. Arc-based integer programming formulations for three variants of proportional symbol maps,
    Electronic Notes in Discrete Mathematics, vol. 44, 251-256, 2013 (with R. G. Cano P. J. de Rezende and T. H. Yunes).
38. An Efficient Exact Algorithm for the Natural Wireless Localization Problem, Proceedings of 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Canada, vol. 1, 223--228. (with B. E. Crepaldi and P. J. de Rezende).
39. Point guards and point clouds: solving general art gallery problems. Proceedings of the Symposium on Computational Geometry (SoCG), pg 347-348, 2013 (with D. Borrmann, P. J. de Rezende, S. P. Fekete, S. Friedrichs, A. Kröller, A. Nüchter, C. Schmidt, and D C. Tozoni)
40. The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm,
    Lecture Notes in Computer Science, vol. 7933, 320-336, Proceedings of the 11th International Symposium on Experimental Algorithms (SEA 2013). Rome, Italy, 2013 (with D. C. Tozoni and P. J. de Rezende).
41. Planning The Operation of a Large Real-World Oil Pipeline,
    Computers & Chemical Engineering, v. 46, p. 17-28, 2012 (with T. Lopes, A. Moura and A. Cire).
42. Generating Optimal Drawings of Physically Realizable Symbol Maps with Integer Programming,
    The Visual Computer, 28(10): 1015-1026, 2012 (with G. Kunigami, P. J. de Rezende, and T. H. Yunes).
43. The maximum common edge subgraph problem: A polyhedral investigation,
    Discrete and Applied Mathematics, v. 160, p. 2523-2541, 2012. (with G. Manic, L. Bahiense and B. Piva).
44. Polyhedral study of the maximum common induced subgraph problem,
    Annals of Operations Research, 199(1): 77-102, 2012 (with B. Piva)
45. A branch-and-cut-and-price approach for the capacitated m-ring-star problem,
    Discrete and Applied Mathematics, 160(18): 2728-2741, 2012 (with Edna Hoshino).
46. The Minimum Stabbing Triangulation Problem: {IP} Models and Computational Evaluation, Proceedings of the Second International Symposium on Combinatorial Optimization (ISCO), 2012, Athens, Greece.
    Lecture Notes in Computer Science, v. 7422, p. 36--47. (with B. Piva).
47. Optimizing the layout of proportional symbol maps, In: CGA 2011 - Computational Geometry and Applications, 2011, Santander (Spain).
    Lecture Notes in Computer Science - Proc. Computational Geometry and Applications 2011 - Part III, 2011. v. 6784. p. 1-16. (with G. Kunigami, P. J. de Rezende, and T. H. Yunes).
48. Determining an Optimal Visualization of Physically Realizable Symbol Maps.. In: 24th Conference on Graphics, Patterns and Images (SIBGRAPI), 2011, Maceió, AL, Brazil. Proceedings of the 24th Conference on Graphics, Patterns and Images (SIBGRAPI). IEEE Computer Society Conference Publishing Services, 2011. p. 1-8. (with G. Kunigami, P. J. de Rezende, and T. H. Yunes).
49. A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. In: International Symposium on Combinatorial Optimization, 2010, Hammamet, Tunisia.
    Electronic Notes in Discrete Mathematics. v. 36. p. 623-630. (with A. S. da Cunha, L. Bahiense, and A. Lucena).
50. An Exact Algorithm for Minimizing Vertex-Guards on Art Galleries,
    International Transactions in Operations Research, v. 18, p. 425-448, 2011. (with M. C. Couto and P. J. de Rezende).
51. The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm,
    Discrete and Applied Mathematics, Volume 159, Issue 16, Pages 1901-1914, 2011 (with L. Simonetti and Y. A. Frota).
52. Exact Algorithms for the Vertex Separator Problem in Graphs,
    Networks 57(3), 212-230, 2011 (with V. F. Cavalcante).
53. An exact approach to the problem of extracting an embedded network matrix,
    Computers & Operations Research, 38 (11), 1483 - 1492, 2011 (with R. M. V. de Figueiredo and M. Labbé).
54. A Branch-and-Price Approach for the Partition Coloring Problem,
    Operations Research Letters, 39 (2), 132-137, 2011, (with E. A. Hoshino and Y. A. Frota).
55. Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs,
    Lecture Notes in Computer Science, vol. 6630, 304-314, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA 2011). Kolimpari, Greece, May 2011. (with I. de Assis).
56. Planning and Scheduling the Operation of a Very Large Oil Pipeline Network,
    Constraints, v. 15, p. 151-189, 2010, (with A.V. Moura, A. Cire and T. Lopes).
57. A branch-and-cut algorithm for the maximum common edge subgraph problem
    Electronic Notes in Discrete Mathematics, vol. 35, 47-52, December 2009 (special issue of the V Latin-American Algorithms, Graphs and Optimization Symposium) (with G. Manic and L. Bahiense)
    
58. Upper and lower bounding procedures for the for the minimum caterpillar spanning problem
    Electronic Notes in Discrete Mathematics, vol. 35, 83-88, December 2009 (special issue of the V Latin-American Algorithms, Graphs and Optimization Symposium) (with L. Simonetti and Y. Frota)
    
59. A branch-and-cut-and-price approach for the capacitated m-ring-star problem
    Electronic Notes in Discrete Mathematics, vol. 35, 103-108, December 2009 (special issue of the V Latin-American Algorithms, Graphs and Optimization Symposium) (with E.A. Hoshino)
    
60. Scheduling activities at oil wells with resource displacement,
    International Transactions in Operational Research, Vol 15, Issue 6, 659-683, November 2008 (with A. V. Moura, R. A. Pereira).
61. Acyclic Orientations with Path Constraints,
    RAIRO Operations Research, Volume 42, Issue 4, 455-468, October 2008 (with R.M.V. Figueiredo, V.C. Barbosa and N. Maculan).
62. Planning and Scheduling the Operation of a Very Large Oil Pipeline Network,
    Lecture Notes in Computer Science, vol. 5202, 36-51. Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008), Sydney, Australia, September 2008 (with A. Moura, A. Ciré and T. Lopes).
63. Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem
    Lecture Notes in Computer Science, vol. 5038, 101-113. Proceedings of the 7th International Workshop Experimental and Efficient Algorithms (WEA 2008), Provincetown, Cape Cod, Massachusetts, USA, May 30-June 1, 2008 (with M.C. Couto and P.J. Rezende)
    
64. Column Generation Algorithms for the Capacitated m-Ring-Star Problem,
    Lecture Notes in Computer Science, vol. 5092, 631-641. Proceedings of the 14th Annual International Computing and Combinatorics Conference (COCOON 2008), Dalian, China, June 2008 (with E.A. Hoshino)
    
65. Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem Proceedings of the 11th IEEE International Conference on Computational Science and Engineering (CSE-08), São Paulo, Brazil, July 16-18, 2008. IEEE Computer Society Press, p.455-462.. (with A.V. Moura, A. Cire and T. Lopes).
66. A relax-and-cut algorithm to the set partitioning problem.
    Computers & Operations Research, 35, pages 1963-1981, 2008. (with V. Cavalcante and A. Lucena).
67. An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007), Belo Horizonte, Brazil, October 2007, pages 87-94, IEEE Computer Society. (with M. Couto and P. J. de Rezende).
68. Lagrangian relaxation and cutting planes for the vertex separator problem.
    Lecture Notes in Computer Science, vol. 4614, 471-482. (Post) Proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, China, April 2007 (with V. Cavalcante).
69. Multiprocessor Scheduling under Precedence Constraints.
    Discrete and Applied Mathematics, Volume 154 (5), 770-801, April 2006. (with P. Coll and C. Ribeiro).
70. A column generation approach for SONET ring assignment.
    Networks, Volume 47, Issue 3, 157-171. May 2006 (with E. Macambira and N. Maculan).
71. Vehicle and Crew Scheduling for Urban Bus Lines.
    European Journal of Operational Research, Volume 170, Issue 3, 844-862, May 2006 (with M. M. Rodrigues and A. V. Moura).
72. The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation,
    ACM Journal on Experimental Algorithms, Volume 10, Issue 2, pages 1-16, 2005. (with A. Lima, N. Moreano and G. Araujo).
73. A note on characterizing canonical cuts using geometry.
    International Transactions in Operational Research, (12), 581--593, 2005 (with E. Macambira and N. Maculan).
74. Efficient Datapath Merging for Reconfigurable Architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume 24, Issue 7, July 2005, pages 969 - 980 (Digital Object Identifier 10.1109/TCAD.2005.850844) (with N. Moreano, E. Borin and G. Araujo).
75. The vertex separator problem: algorithms and computations.
    Mathematical Programming - Series A, Volume 103, Issue 3, Jul 2005, Pages 609 - 631 (with Egon Balas).
76. The vertex separator problem: a polyhedral investigation.
    Mathematical Programming - Series A, Volume 103, Issue 3, Jul 2005, Pages 583 - 608 (with Egon Balas).
77. Hybrid Column Generation Approaches for Urban Transit Crew Management Problems.
    Transportation Science, vol. 39, No. 2, 273--288, May 2005. (with Tallys H. Yunes and Arnaldo V. Moura)
78. Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem
    Lecture Notes in Computer Science, vol. 3503, 328-340, Proceedings of the Fourth International Workshop Experimental and Efficient Algorithms (WEA 2005), Santorini, Greece, May 2005 (with R. A. Pereira and A. V. Moura).
79. The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation.
    Lecture Notes in Computer Science, vol. 3059, 545--558, Proceedings of the Third International Workshop Experimental and Efficient Algorithms (WEA 2004), Angra dos Reis, RJ, Brazil, May 25-28, 2004. (with A. M. M. Lima, N. B. Moreano and G. Araujo).
80. Constructing Nurse Schedules at Large Hospitals.
    International Transactions in Operations Research, v.10, 245-265, 2003. (with D. Ferber, T. Dias and A. Moura).
81. Optimal Rectangular Partitions.
    Networks, 41 (1), 51-67, 2003 (with Abilio Lucena and Felipe Calheiros).
82. Rearrangement of DNA fragments: a branch-and-cut algorithm,
    Discrete Applied Mathematics, (116)1-2, 161-177, 2002 (with C.E. Ferreira and Y. Wakabayashi)
83. Scheduling Projects with Labor Constraints.
    Discrete Applied Mathematics, 112, 27-52, 2001 (with C.C Cavalcante, M.W.P. Savelsbergh, Y. Wang and L.A. Wolsey).
84. Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem, in Essays and Surveys in Metaheuristics (C.C. Ribeiro and P. Hansen, editors), 201-225, Kluwer, 2001. (with C.C.B. Cavalcante, V.C. Cavalcante and C.C. Ribeiro)
85. Exact solutions of rectangular partitions via integer programming.
    International Journal of Computational Geometry and Applications, vol. 10, No. 5, 477-522, 2000. (with C. N. de Meneses).
86. Solving Very Large Crew Scheduling Problems to Optimality. Proceedings of the 14th ACM Symposium on Applied Computing (SAC 2000). vol. 1, 446-451, Villa Olmo, Como, Italy. March 19-21, 2000 (with T. H. Yunes and A. V. Moura).
87. A Hybrid Approach for Solving Large Scale Crew Scheduling Problems.
    Lecture Notes in Computer Science, vol. 1753, 293 - 307, Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages (PADL'00). Boston, MA, USA. January 17-20, 2000 (with T. H. Yunes and A. V. Moura).
88. Scheduling under Labour Resource Constraints,
    Constraints, 5(4) (2000), 415 - 422 (with C. Cavalcante, Y. Colombani and S. Heipcke).
89. The Edge-Weighted Clique Problem: valid inequalities, facets and Polyhedral Computations.
    European Journal of Operational Research, 123 (2000), 346 - 371 (with E. M. Macambira).
90. A New Formulation for Scheduling Unrelated Processors under Precedence Constraints,
    Revue d'Automatique, Informatique et Recherche Operationelle (RAIRO), 33 (1999) , 87 - 90. (with C. C. Ribeiro, N. Maculan and S.Porto).
91. The Node Capacitated Graph Partitioning Problem: A Computational Study,
    Mathematical Programming, series B, 81 (1998), 229--256 (with C. E. Ferreira, A. Martin, R. Weismantel and L. A. Wolsey).
92. The Node Capacitated Graph Partitioning Problem: Formulations and Valid Inequalities,
    Mathematical Programming, series A, 74 (1996), 247-266 (with C. E. Ferreira, A. Martin, R. Weismantel and L. A. Wolsey).
93. Some New facets for the Equicut Polytope,
    Discrete and Applied Mathematics, Special Volume on Partitioning and Decomposition in Combinatorial Optimization, Eds. M. Lucertini, G. Rinaldi, A. Sassano e B. Simeone, Vol. 62 (1995), No. 1-3, 167-192 (with M. Laurent).
94. A New Approach to Minimizing the Frontwidth in Finite Element Calculations,
    Computer Methods in Applied Mechanics and Engineering, 111 (1994) 323-334 (with L. Wolsey, R. Keunings and O.Zone).
95. Heuristics for the minimum rectilinear Steiner Tree Problem: new algorithms and a computational study,
    Discrete and Applied Mathematics, 45 (1993), 205-220, (with C. C. Ribeiro).
96. A Worst-Case Bound for the Performance Ratio of Heuristics for the Minimum Rectilinear Steiner Tree Problem,
    OR Spektrum, 12 (1990), 109-111 (with C. C. Ribeiro).
97. O Problema de Steiner na Métrica Retilínea,
    Revista Latino-Americana de Investigación Operativa, 1-3 (1990), 213-249 (with C. C. Ribeiro).