Phablo F. S. Moura

Theor. Comput. Sci., 2024

Polyhedral approach to weighted connected matchings in general graphs.

[BibT_eX]

[DOI]

Phillippe Samer

Discret. Appl. Math., 2024

2023

Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs.

[BibT_eX]

[DOI]

Fábio Botler

Tássio Naia

Discret. Math., December, 2023

Balanced connected partitions of graphs: approximation, parameterization and lower bounds.

[BibT_eX]

[DOI]

J. Comb. Optim., July, 2023

Scheduling with conflicts: formulations, valid inequalities, and computational experiments.

[BibT_eX]

[DOI]

Roel Leus

Hande Yaman

CoRR, 2023

2022

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Partitioning a graph into balanced connected classes: Formulations, separation and experiments.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

Approximation and parameterized algorithms to find balanced connected partitions of graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane.

[BibT_eX]

[DOI]

Carla Negri Lintzmayer

Eduardo C. Xavier

Theor. Comput. Sci., 2020

Strong intractability results for generalized convex recoloring problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Cut and Flow Formulations for the Balanced Connected k-Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane.

[BibT_eX]

[DOI]

Carla Negri Lintzmayer

Eduardo C. Xavier

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Polyhedral study of the Convex Recoloring problem.

[BibT_eX]

[DOI]

Joel C. Soares

CoRR, 2019

Integer Programming Approaches to Balanced Connected k-Partition.

[BibT_eX]

[DOI]

CoRR, 2019

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2017

Graph colorings and digraph subdivisions.

[BibT_eX]

[DOI]

PhD thesis, 2017

The k-hop connected dominating set problem: approximation and hardness.

[BibT_eX]

[DOI]

Rafael S. Coelho

J. Comb. Optim., 2017

Strong intractability of generalized convex recoloring problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

The convex recoloring problem: polyhedra, facets and computational experiments.

[BibT_eX]

[DOI]

Math. Program., 2016

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope.

[BibT_eX]

[DOI]

Marcio Costa Santos

Discret. Optim., 2016

2015

On the proper orientation number of bipartite graphs.

[BibT_eX]

[DOI]

Júlio Araújo

Nathann Cohen

Susanna F. de Rezende

Frédéric Havet

Theor. Comput. Sci., 2015

The k-hop connected dominating set problem: hardness and polyhedra.

[BibT_eX]

[DOI]

Rafael S. Coelho

Electron. Notes Discret. Math., 2015

Facet-defining inequalities for the representatives k-fold coloring polytope.

[BibT_eX]

Marcio Costa Santos

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Convex recoloring: inapproximability and a polyhedral study.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

On the representatives k-fold coloring polytope.

[BibT_eX]

[DOI]