| Subdivisions in digraphs of large out-degree or large dichromatic number P Aboulker, N Cohen, F Havet, W Lochet, PFS Moura, S Thomassé The Electronic Journal of Combinatorics 26 (3), P3.19, 2019 | 25 | 2019 |
| On the proper orientation number of bipartite graphs J Araujo, N Cohen, SF De Rezende, F Havet, PFS Moura Theoretical Computer Science 566, 59-75, 2015 | 22 | 2015 |
| Partitioning a graph into balanced connected classes: formulations, separation and experiments FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi European Journal of Operational Research, 2021 | 16 | 2021 |
| The convex recoloring problem: polyhedra, facets and computational experiments M Campêlo, AS Freire, KR Lima, PFS Moura, Y Wakabayashi Mathematical Programming 156 (1-2), 303-330, 2016 | 14 | 2016 |
| The k-hop connected dominating set problem: approximation and hardness RS Coelho, PFS Moura, Y Wakabayashi Journal of Combinatorial Optimization 34, 1060-1083, 2017 | 11 | 2017 |
| Polyhedral studies on the convex recoloring problem M Campêlo, KR Lima, PFS Moura, Y Wakabayashi Electronic Notes in Discrete Mathematics 44, 233-238, 2013 | 11 | 2013 |
| Cut and Flow Formulations for the Balanced Connected k-Partition Problem FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal …, 2020 | 9 | 2020 |
| The k-hop connected dominating set problem: hardness and polyhedra RS Coelho, PFS Moura, Y Wakabayashi Electronic Notes in Discrete Mathematics 50, 59-64, 2015 | 9 | 2015 |
| On optimal k-fold colorings of webs and antiwebs M Campêlo, RC Corrêa, PFS Moura, MC Santos Discrete Applied Mathematics 161 (1-2), 60-70, 2013 | 9 | 2013 |
| Graph colorings and digraph subdivisions PFS Moura, Y Wakabayashi Anais do XXXI Concurso de Teses e Dissertações, 2018 | 4 | 2018 |
| On the representatives k-fold coloring polytope M Campêlo, PFS Moura, MC Santos Electronic Notes in Discrete Mathematics 44, 239-244, 2013 | 4 | 2013 |
| Strong intractability results for generalized convex recoloring problems PFS Moura, Y Wakabayashi Discrete Applied Mathematics 281, 252-260, 2020 | 2 | 2020 |
| Strong intractability of generalized convex recoloring problems PFS Moura, Y Wakabayashi Electronic Notes in Discrete Mathematics 62, 93-98, 2017 | 2 | 2017 |
| Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope M Campelo, PFS Moura, MC Santos Discrete Optimization 21, 131-156, 2016 | 2 | 2016 |
| Seymour’s Second Neighborhood Conjecture on sparse random graphs F Botler, P Moura, T Naia Anais do VII Encontro de Teoria da Computação, 37-40, 2022 | 1 | 2022 |
| Seymour’s second neighborhood conjecture in arbitrary orientations of a random graph F Botler, PFS Moura, T Naia Discrete Mathematics Days 2022 263, 58, 2022 | 1 | 2022 |
| Approximation and parameterized algorithms for balanced connected partition problems PFS Moura, MJ Ota, Y Wakabayashi Algorithms and Discrete Applied Mathematics: 8th International Conference …, 2022 | 1 | 2022 |
| Approximation and parameterized algorithms to find balanced connected partitions of graphs PFS Moura, MJ Ota, Y Wakabayashi arXiv preprint arXiv:2108.10398, 2021 | 1 | 2021 |
| Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane CN Lintzmayer, FK Miyazawa, PFS Moura, EC Xavier Theoretical Computer Science 835, 134-155, 2020 | 1 | 2020 |
| Strong inequalities and a branch-and-price algorithm for the convex recoloring problem M Campêlo, AS Freire, PFS Moura, JC Soares European Journal of Operational Research 303 (1), 54-65, 2022 | | 2022 |
Yoshiko WakabayashiProfessor of Computer Science, University of São PauloZweryfikowany adres z ime.usp.br
