Phablo F. S. Moura

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 22

Top Venues

University of São Paulo, Brazil (PHD)

Education History

University of São Paulo, Brazil

PHD

Publications

Phillippe Samer, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. Discret. Appl. Math. 359 (2024)
Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura
Approximations for the Steiner Multicycle Problem. CoRR (2023)
Phablo F. S. Moura, Roel Leus, Hande Yaman
Scheduling with conflicts: formulations, valid inequalities, and computational experiments. CoRR (2023)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Balanced connected partitions of graphs: approximation, parameterization and lower bounds. J. Comb. Optim. 45 (5) (2023)
Fábio Botler, Phablo F. S. Moura, Tássio Naia
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. Discret. Math. 346 (12) (2023)
Phillippe Samer, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. CoRR (2023)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Joel C. Soares
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. Eur. J. Oper. Res. 303 (1) (2022)
Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura
Approximations for the Steiner Multicycle Problem. LATIN (2022)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. CALDAM (2022)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Partitioning a graph into balanced connected classes: Formulations, separation and experiments. Eur. J. Oper. Res. 293 (3) (2021)
Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Approximation and parameterized algorithms to find balanced connected partitions of graphs. CoRR (2021)
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. Theor. Comput. Sci. 835 (2020)
Phablo F. S. Moura, Yoshiko Wakabayashi
Strong intractability results for generalized convex recoloring problems. Discret. Appl. Math. 281 (2020)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Cut and Flow Formulations for the Balanced Connected k-Partition Problem. ISCO (2020)
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi
Integer Programming Approaches to Balanced Connected k-Partition. CoRR (2019)
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier
Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. LAGOS (2019)
Manoel B. Campêlo, Phablo F. S. Moura, Joel C. Soares
Polyhedral study of the Convex Recoloring problem. CoRR (2019)
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26 (3) (2019)
Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi
The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34 (4) (2017)
Phablo F. S. Moura, Yoshiko Wakabayashi
Strong intractability of generalized convex recoloring problems. Electron. Notes Discret. Math. 62 (2017)
Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
The convex recoloring problem: polyhedra, facets and computational experiments. Math. Program. 156 (1-2) (2016)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. Discret. Optim. 21 (2016)
Rafael S. Coelho, Phablo F. S. Moura, Yoshiko Wakabayashi
The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discret. Math. 50 (2015)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi
Convex recoloring: inapproximability and a polyhedral study. CTW (2015)
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566 (2015)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW (2015)
Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
Polyhedral studies on the convex recoloring problem. Electron. Notes Discret. Math. 44 (2013)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
On the representatives k-fold coloring polytope. Electron. Notes Discret. Math. 44 (2013)
Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos
On optimal k-fold colorings of webs and antiwebs. Discret. Appl. Math. 161 (1-2) (2013)
Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos
Optimal k-fold colorings of webs and antiwebs CoRR (2011)

Phablo F. S. Moura.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Phablo F. S. Moura