Phablo Moura

Phablo F. S. Moura

phablo (at) dcc ufmg br

Assistant professor in the Computer Science Department at Universidade Federal de Minas Gerais, Belo Horizonte, Brazil (since 2019)

Previously, I was a postdoctoral researcher at Charles University in Prague, Czech Republic, hosted by Zdeněk Dvořák and Tereza Klimošová (2018-2019)
I was also a postdoc at Universidade de Campinas, where I collaborated with Flávio Miyazawa (2017-2018)

I completed my PhD in 2017 at Universidade de São Paulo under the supervision of Yoshiko Wakabayashi
Part of my PhD studies was done under supervision of Stéphan Thomassé at École Normale Supérieure de Lyon, France (2015-2016)


Curriculum Vitae

CV Lattes

Main research interests

  • Algorithms (exact and approximate)
  • Combinatorial optimization
  • Graph theory
  • Polyhedral combinatorics

Publications

submitted or in preparation

  1. Approximation and parameterized algorithms for balanced connected partition problems (with Matheus Ota and Yoshiko Wakabayashi). (in preparation)
  2. Polyhedral study on the balanced connected partition problem (with Flávio Miyazawa, Matheus Ota, and Yoshiko Wakabayashi) (in preparation).
  3. Partitioning graphs into monochromatic trees: algorithms and hardness (with Vinicius F. dos Santos and Diego Rangel) (in preparation)
  4. Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (with Manoel Campêlo, Alexandre Freire, and Joel Soares). (submitted)

in journals

  1. Partitioning graphs into balanced connected classes: formulations, separation and experiments (with Flávio Miyazawa, Matheus Ota, and Yoshiko Wakabayashi). European Journal of Operational Research 293(3):826-836 (2021)
  2. Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane (with Carla Lintzmayer, Flávio Miyazawa, and Eduardo Xavier). Theoretical Computer Science 835(C):134-155 (2020)
  3. Strong intractability results for generalized convex recoloring problems (with Yoshiko Wakabayashi). Discrete Applied Mathematics 281:252-260 (2020)
  4. Subdivisions in digraphs of large out-degree or large dichromatic number (with Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, and Stéphan Thomassé). The Electronic Journal of Combinatorics 26(3):#P3.19 (2019)
  5. The \(k\)-hop connected dominating set problem: approximation and hardness (with Rafael S. Coelho, and Yoshiko Wakabayashi). Journal of Combinatorial Optimization 34:1060-1083 (2017)
  6. Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (with Manoel Campêlo, and Marcio C. Santos). Discrete Optimization 21:131-156 (2016)
  7. The convex recoloring problem: polyhedra, facets, and computational experiments (with Manoel Campêlo, Alexandre Freire, Karla R. Lima, and Yoshiko Wakabayashi). Mathematical Programming 156:303-330 (2016)
  8. On the proper orientation number of bipartite graphs (with Júlio C. Araújo, Nathann Cohen, Susanna de Rezende, and Frédéric Havet). Theoretical Computer Science 566:59-75 (2015)
  9. On optimal \(k\)-fold colorings of webs and antiwebs (with Manoel Campêlo, Ricardo C. Corrêa, and Marcio C. Santos). Discrete Applied Mathematics 161:60-70 (2013)

in conferences

  1. Approximation and parameterized algorithms for balanced connected partition problems (with Matheus Ota and Yoshiko Wakabayashi). To appear in the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2022).
  2. Cut and flow formulations for the Balanced Connected $k$-Partition problem (with Flávio Miyazawa, Matheus Ota, and Yoshiko Wakabayashi). Lecture Notes in Computer Science 12176:128-139 (2020). Proceedings of the International Symposium on Combinatorial Optimization (ISCO 2020).
  3. Quasilinear approximation scheme for Steiner Multi Cycle in the Euclidean plane (with Carla Lintzmayer, Flávio Miyazawa, and Eduardo Xavier). Electronic Notes in Theoretical Computer Science 346:589-601 (2019). Proceedings of the X Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brazil.
  4. Strong intractability of generalized convex recoloring problems (with Yoshiko Wakabayashi). Electronic Notes in Discrete Mathematics 62:93-98 (2017). Proceedings of the IX Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2017), Marseille, France.
  5. The \(k\)-hop connected dominating set problem: hardness and polyhedra (with Rafael S. Coelho, and Yoshiko Wakabayashi). Electronic Notes in Discrete Mathematics 50:59-64 (2015). Proceedings of the VIII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2015), Beberibe, Brazil.
  6. On the proper orientation number of bipartite graphs (with Júlio C. Araújo, Nathann Cohen, Susanna de Rezende, and Frédéric Havet). Proceedings of the 9th International Colloquium on Graph Theory and Combinatorics (ICGT 2014), Grenoble, France.
  7. Polyhedral studies on the convex recoloring problem (with Manoel Campêlo, Karla R. Lima, and Yoshiko Wakabayashi). Electronic Notes in Discrete Mathematics 44:233-238 (2013). Proceedings of the VII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2013), Playa del Carmen, Mexico.
  8. On the representatives \(k\)-fold coloring polytope (with Manoel Campêlo, and Marcio C. Santos). Electronic Notes in Discrete Mathematics 44:239-244 (2013). Proceedings of the VII Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS 2013), Playa del Carmen, Mexico.
  9. The \(k\)-th Chromatic Number of Webs and Antiwebs (with Manoel Campêlo, Ricardo C. Corrêa, and Marcio C. Santos). Proceedings of the XLIII SBPO - Simpósio Brasileiro de Pesquisa Operacional, Ubatuba, Brazil (2011) 3448-3458.
  10. Sobre a complexidade de coloração mista (com Júlio C. Araújo, e Manoel Campêlo). Anais do III Encontro Regional de Pesquisa Operacional do Nordeste, Fortaleza, Brazil (2009) 1-10.


Last update
Nov 26 2021