Phablo F. S. Moura

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