Preprints
Preprints
Approximation schemes for covering and packing mixed-integer programs with a fixed number of constraints
with K. Grobben and H. Yaman, 2025
Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
with M. Davari and H. Yaman, 2025
On the connected (sub)partition polytope
with H. Yaman and R. Leus
Mathematical Programming, accepted; forthcoming
Compact formulations and valid inequalities for parallel machine scheduling with conflicts
with R. Leus, and H. Yaman
European Journal of Operational Research 325:433-443 (2025)
Approximations for the Steiner Multicycle Problem
with C. G. Fernandes, C. N. Lintzmayer
Theoretical Computer Science 1020: 114836 (2024)
Polyhedral approach to weighted connected matchings in general graphs
with P. Samer
Discrete Applied Mathematics 359:143-152 (2024)
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs
with F. Botler and T. Naia
Discrete Mathematics 346 (12):113583 (2023)
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
with M. J. Ota, and Y. Wakabayashi
Journal of Combinatorial Optimization 45:127 (2023)
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
with M. Campêlo, A. Freire, and J. Soares
European Journal of Operational Research 303:54-65 (2022)
Partitioning graphs into balanced connected classes: formulations, separation and experiments
with F. Miyazawa, M. Ota, and Y. Wakabayashi
European Journal of Operational Research 293(3):826-836 (2021)
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane
with C. Lintzmayer, F. Miyazawa, and E. Xavier
Theoretical Computer Science 835(C):134-155 (2020)
Strong intractability results for generalized convex recoloring problems
with Yoshiko Wakabayashi
Discrete Applied Mathematics 281:252-260 (2020)
Subdivisions in digraphs of large out-degree or large dichromatic number
with P. Aboulker, N. Cohen, F. Havet, W. Lochet, and S. Thomassé
The Electronic Journal of Combinatorics 26(3):#P3.19 (2019)
The k-hop connected dominating set problem: approximation and hardness
with R. S. Coelho, and Y. Wakabayashi
Journal of Combinatorial Optimization 34:1060-1083 (2017)
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope
with M. Campêlo, and M. C. Santos
Discrete Optimization 21:131-156 (2016)
The convex recoloring problem: polyhedra, facets, and computational experiments
with M. Campêlo, A. Freire, K. R. Lima, and Y. Wakabayashi
Mathematical Programming 156:303-330 (2016)
On the proper orientation number of bipartite graphs
with J. C. Araújo, N. Cohen, S. de Rezende, and F. Havet
Theoretical Computer Science 566:59-75 (2015)
On optimal k-fold colorings of webs and antiwebs
with M. Campêlo, R. C. Corrêa, and M. C. Santos
Discrete Applied Mathematics 161:60-70 (2013)
Approximations for the Steiner Multicycle Problem
with C. G. Fernandes and C.N. Lintzmayer
Lecture Notes in Computer Science 13568:188–203
LATIN - 15th Latin American Theoretical Informatics Symposium 2022
Approximation and parameterized algorithms for balanced connected partition problems
with M. Ota and Y. Wakabayashi
Lecture Notes in Computer Science 13179:211-223
CALDAM - 8th Int. Conference on Algorithms and Discrete Applied Mathematics 2022
Seymour’s second neighborhood conjecture in arbitrary orientations of a random graph with F. Botler and T Naia
Proceedings of Discrete Mathematics Days 2022 263:58-63
DMD - Discrete Mathematics Days 2022
Cut and flow formulations for the Balanced Connected k-Partition problem
with F. Miyazawa, M. Ota, and Y. Wakabayashi
Lecture Notes in Computer Science 12176:128-139
ISCO - International Symposium on Combinatorial Optimization 2020
Quasilinear approximation scheme for Steiner Multi Cycle in the Euclidean plane
with C. Lintzmayer, F. Miyazawa, and E. Xavier
Electronic Notes in Theoretical Computer Science 346:589-601
LAGOS - X Latin-American Algorithms, Graphs and Optimization Symposium 2019
Strong intractability of generalized convex recoloring problems
with Y. Wakabayashi
Electronic Notes in Discrete Mathematics 62:93-98
LAGOS - IX Latin-American Algorithms, Graphs and Optimization Symposium 2017
On the proper orientation number of bipartite graphs
with J. C. Araújo, N. Cohen, S. de Rezende, and F. Havet
ICGT - 9th International Colloquium on Graph Theory and Combinatorics 2014
Polyhedral studies on the convex recoloring problem
with M. Campêlo, K. R. Lima, and Y. Wakabayashi
Electronic Notes in Discrete Mathematics 44:233-238
LAGOS - VII Latin-American Algorithms, Graphs and Optimization Symposium 2013
On the representatives k-fold coloring polytope
with M. Campêlo, and M. C. Santos
Electronic Notes in Discrete Mathematics 44 239-244.
LAGOS - VII Latin-American Algorithms, Graphs and Optimization Symposium 2013