| Publication | Date of Publication | Type |
|---|
| A branch-and-cut algorithm for the routing and spectrum allocation problem | 2023-12-11 | Paper |
| Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes | 2023-08-02 | Paper |
| A hybrid heuristic for the rectilinear picture compression problem | 2023-06-07 | Paper |
| The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations | 2022-11-02 | Paper |
| Facet-generating procedures for the maximum-impact coloring polytope | 2022-11-02 | Paper |
| Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques | 2022-09-26 | Paper |
| An integer programming approach for the 2-class single-group classification problem | 2022-04-27 | Paper |
| The 2D subarray polytope | 2022-04-27 | Paper |
| Facet-generating procedures for the maximum-impact coloring polytope | 2022-04-27 | Paper |
| Facets based on cycles and cliques for the acyclic coloring polytope | 2021-05-10 | Paper |
| The minimum chromatic violation problem: a polyhedral approach | 2020-05-29 | Paper |
| Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope | 2019-11-20 | Paper |
| An integer programming approach to b-coloring | 2019-06-14 | Paper |
| On the combinatorics of the 2-class classification problem | 2019-06-13 | Paper |
| Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach | 2019-02-20 | Paper |
| Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem | 2019-02-11 | Paper |
| Integer programming models for the routing and spectrum allocation problem | 2018-11-07 | Paper |
| The quasi-periodicity of the minority game revisited | 2018-09-11 | Paper |
| The distance polytope for the vertex coloring problem | 2018-08-17 | Paper |
| Polyhedral studies of vertex coloring problems: the standard formulation | 2018-05-24 | Paper |
| General cut-generating procedures for the stable set polytope | 2018-05-24 | Paper |
| The caterpillar-packing polytope | 2018-05-24 | Paper |
| Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model | 2018-04-09 | Paper |
| The minimum chromatic violation problem: a polyhedral study | 2018-04-09 | Paper |
| An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools | 2017-12-15 | Paper |
| An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint | 2017-06-20 | Paper |
| The maximum-impact coloring polytope | 2017-03-16 | Paper |
| Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope | 2016-10-18 | Paper |
| A strengthened general cut-generating procedure for the stable set polytope | 2016-10-17 | Paper |
| The caterpillar-packing polytope | 2016-10-17 | Paper |
| A polyhedral study of the maximum stable set problem with weights on vertex-subsets | 2016-06-22 | Paper |
| The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity | 2016-03-09 | Paper |
| Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 2015-08-28 | Paper |
| Topological additive numbering of directed acyclic graphs | 2014-12-09 | Paper |
| Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game | 2014-06-20 | Paper |
| Envy-free division of discrete cakes | 2014-05-05 | Paper |
| An approach for efficient ship routing | 2013-11-29 | Paper |
| Mathematical models for optimizing production chain planning in salmon farming | 2013-11-14 | Paper |
| Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope | 2013-07-23 | Paper |
| A polyhedral study of the single-item lot-sizing problem with continuous start-up costs | 2013-07-23 | Paper |
| Solving the segmentation problem for the 2010 Argentine census with integer programming | 2013-07-23 | Paper |
| Combinatorial properties and further facets of maximum edge subgraph polytopes | 2013-07-23 | Paper |
| Envy-free division of discrete cakes | 2013-07-23 | Paper |
| A polyhedral study of the acyclic coloring problem | 2013-07-19 | Paper |
| A polyhedral study of the maximum edge subgraph problem | 2013-07-19 | Paper |
| A polyhedral study of the maximum edge subgraph problem | 2012-11-22 | Paper |
| A polyhedral study of the acyclic coloring problem | 2012-11-22 | Paper |
| A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem | 2012-04-05 | Paper |
| Minimum sum set coloring of trees and line graphs of trees | 2011-03-10 | Paper |
| On the b-coloring of cographs and \(P_{4}\)-sparse graphs | 2009-12-09 | Paper |
| Exploring the complexity boundary between coloring and list-coloring | 2009-09-03 | Paper |
| Cycle-based facets of chromatic scheduling polytopes | 2009-04-17 | Paper |
| Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques | 2009-04-17 | Paper |
| The Football Pool Polytope | 2008-06-05 | Paper |
| Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems | 2008-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439663 | 2007-05-29 | Paper |
| Exploring the complexity boundary between coloring and list-coloring | 2007-05-29 | Paper |
| On the combinatorial structure of chromatic scheduling polytopes | 2006-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708510 | 2005-11-18 | Paper |
| Facets of the graph coloring polytope | 2003-01-27 | Paper |
