| Publication | Date of Publication | Type |
|---|
Compact formulations and valid inequalities for parallel machine scheduling with conflicts
European Journal of Operational Research | 2025-09-10 | Paper |
| Seymour's second neighborhood conjecture in arbitrary orientations of a random graph | 2025-08-01 | Paper |
Approximations for the Steiner multicycle problem
Theoretical Computer Science | 2024-11-07 | Paper |
Polyhedral approach to weighted connected matchings in general graphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
| Polyhedral approach to weighted connected matchings in general graphs | 2023-10-09 | Paper |
Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
Discrete Mathematics | 2023-10-04 | Paper |
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
Journal of Combinatorial Optimization | 2023-08-02 | Paper |
Approximations for the Steiner multicycle problem
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Approximation and parameterized algorithms for balanced connected partition problems
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
European Journal of Operational Research | 2022-06-10 | Paper |
| Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane | 2022-04-27 | Paper |
Partitioning a graph into balanced connected classes: formulations, separation and experiments
European Journal of Operational Research | 2021-06-07 | Paper |
| Cut and flow formulations for the balanced connected k-partition problem | 2021-02-04 | Paper |
Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
Theoretical Computer Science | 2020-08-17 | Paper |
Strong intractability results for generalized convex recoloring problems
Discrete Applied Mathematics | 2020-05-29 | Paper |
| Polyhedral study of the Convex Recoloring problem | 2019-11-25 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
Discrete Optimization | 2018-05-24 | Paper |
| Strong intractability of generalized convex recoloring problems | 2018-04-09 | Paper |
The k-hop connected dominating set problem: approximation and hardness
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
| The k-hop connected dominating set problem: hardness and polyhedra | 2016-10-17 | Paper |
The convex recoloring problem: polyhedra, facets and computational experiments
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
On the proper orientation number of bipartite graphs
Theoretical Computer Science | 2015-01-06 | Paper |
On optimal \(k\)-fold colorings of webs and antiwebs
Discrete Applied Mathematics | 2012-11-22 | Paper |
On the connected (sub)partition polytope
(available as arXiv preprint) | N/A | Paper |
