| Publication | Date of Publication | Type |
|---|
| Parallel best-first branch-and-bound in discrete optimization: a framework | 2024-06-21 | Paper |
Integer programming models and polyhedral study for the geodesic classification problem on graphs
European Journal of Operational Research | 2024-06-17 | Paper |
A parallel lagrangian heuristic for the fractional chromatic number of a graph
RAIRO - Operations Research | 2023-09-19 | Paper |
| The geodesic classification problem on graphs | 2022-04-27 | Paper |
| An integer programming approach for the 2-class single-group classification problem | 2022-04-27 | Paper |
Revenge of the steamroller: ABCP as a window on risk choices
Review of Finance | 2021-08-18 | Paper |
On the combinatorics of the 2-class classification problem
Discrete Optimization | 2019-06-13 | Paper |
General cut-generating procedures for the stable set polytope
Discrete Applied Mathematics | 2018-05-24 | Paper |
Limits of \(k\)-dimensional poset sequences
Discrete Applied Mathematics | 2018-05-24 | Paper |
Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
Theoretical Computer Science | 2017-01-09 | Paper |
| A strengthened general cut-generating procedure for the stable set polytope | 2016-10-17 | Paper |
| On extensions, linear extensions, upsets and downsets of ordered sets (extended abstract) | 2016-07-01 | Paper |
A polyhedral study of the maximum stable set problem with weights on vertex-subsets
Discrete Applied Mathematics | 2016-06-22 | Paper |
| Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 2015-08-28 | Paper |
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence
Journal of Discrete Algorithms | 2014-08-13 | Paper |
A note on random \(k\)-dimensional posets
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On optimal \(k\)-fold colorings of webs and antiwebs
Discrete Applied Mathematics | 2012-11-22 | Paper |
A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Optimal gathering protocols on paths under interference constraints
Discrete Mathematics | 2009-12-15 | Paper |
Cliques, holes and the vertex coloring polytope
Information Processing Letters | 2009-07-09 | Paper |
| About a Brooks-type theorem for improper colouring | 2009-03-16 | Paper |
On the asymmetric representatives formulation for the vertex coloring problem
Discrete Applied Mathematics | 2008-04-16 | Paper |
| scientific article; zbMATH DE number 5158521 (Why is no real title available?) | 2007-05-29 | Paper |
Gathering Algorithms on Paths Under Interference Constraints
Lecture Notes in Computer Science | 2007-05-02 | Paper |
On extensions, linear extensions, upsets and downsets of ordered sets
Discrete Mathematics | 2005-06-23 | Paper |
A parallel approximation scheme for the multiprocessor scheduling problem
Parallel Computing | 2002-07-25 | Paper |
| ILP formulations for scheduling ordered tasks on a bounded number of processors | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1302197 (Why is no real title available?) | 2000-09-26 | Paper |
| scientific article; zbMATH DE number 934535 (Why is no real title available?) | 1997-01-26 | Paper |
