On optimal k-fold colorings of webs and antiwebs. - Manoel B. Campêlo; Ricardo C. Corrêa; Phablo F. S. Moura; Marcio Costa Santos (Discret. Appl. Math., 2013)

Polyhedral studies on the convex recoloring problem. - Manoel B. Campêlo; Karla Roberta Lima; Phablo F. S. Moura; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2013)

On the representatives k-fold coloring polytope. - Manoel B. Campêlo; Phablo F. S. Moura; Marcio Costa Santos (Electron. Notes Discret. Math., 2013)

Convex recoloring: inapproximability and a polyhedral study. - Manoel B. Campêlo; Alexandre S. Freire; Phablo F. S. Moura; Yoshiko Wakabayashi (CTW, 2015)

Facet-defining inequalities for the representatives k-fold coloring polytope. - Manoel B. Campêlo; Phablo F. S. Moura; Marcio Costa Santos (CTW, 2015)

The k-hop connected dominating set problem: hardness and polyhedra. - Rafael S. Coelho; Phablo F. S. Moura; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2015)

On the proper orientation number of bipartite graphs. - Júlio Araújo 001; Nathann Cohen; Susanna F. de Rezende; Frédéric Havet; Phablo F. S. Moura (Theor. Comput. Sci., 2015)

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. - Manoel B. Campêlo; Phablo F. S. Moura; Marcio Costa Santos (Discret. Optim., 2016)

The convex recoloring problem: polyhedra, facets and computational experiments. - Manoel B. Campêlo; Alexandre S. Freire; Karla Roberta Lima; Phablo F. S. Moura; Yoshiko Wakabayashi (Math. Program., 2016)

Strong intractability of generalized convex recoloring problems. - Phablo F. S. Moura; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2017)

The k-hop connected dominating set problem: approximation and hardness. - Rafael S. Coelho; Phablo F. S. Moura; Yoshiko Wakabayashi (J. Comb. Optim., 2017)

Graph colorings and digraph subdivisions. - Phablo F. S. Moura (2017)

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. - Pierre Aboulker; Nathann Cohen; Frédéric Havet; William Lochet; Phablo F. S. Moura; Stéphan Thomassé (Electron. J. Comb., 2019)

Integer Programming Approaches to Balanced Connected k-Partition. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CoRR, 2019)

Polyhedral study of the Convex Recoloring problem. - Manoel B. Campêlo; Phablo F. S. Moura; Joel C. Soares (CoRR, 2019)

Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. - Carla Negri Lintzmayer; Flávio Keidi Miyazawa; Phablo F. S. Moura; Eduardo C. Xavier (LAGOS, 2019)

Cut and Flow Formulations for the Balanced Connected k-Partition Problem. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (ISCO, 2020)

Strong intractability results for generalized convex recoloring problems. - Phablo F. S. Moura; Yoshiko Wakabayashi (Discret. Appl. Math., 2020)

Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. - Carla Negri Lintzmayer; Flávio Keidi Miyazawa; Phablo F. S. Moura; Eduardo C. Xavier (Theor. Comput. Sci., 2020)

Approximation and parameterized algorithms to find balanced connected partitions of graphs. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CoRR, 2021)

Partitioning a graph into balanced connected classes: Formulations, separation and experiments. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (Eur. J. Oper. Res., 2021)

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CALDAM, 2022)

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. - Manoel B. Campêlo; Alexandre S. Freire; Phablo F. S. Moura; Joel C. Soares (Eur. J. Oper. Res., 2022)

Scheduling with conflicts: formulations, valid inequalities, and computational experiments. - Phablo F. S. Moura; Roel Leus; Hande Yaman (CoRR, 2023)

Balanced connected partitions of graphs: approximation, parameterization and lower bounds. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (J. Comb. Optim., 2023)

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. - Fábio Botler; Phablo F. S. Moura; Tássio Naia (Discret. Math., 2023)

Polyhedral approach to weighted connected matchings in general graphs. - Phillippe Samer; Phablo F. S. Moura (Discret. Appl. Math., 2024)

Approximations for the Steiner Multicycle problem. - Cristina G. Fernandes; Carla Negri Lintzmayer; Phablo F. S. Moura (Theor. Comput. Sci., 2024)

Edge-weighted balanced connected partitions: Hardness and formulations. - Morteza Davari; Phablo F. S. Moura; Hande Yaman (CoRR, 2025)