| Publication | Date of Publication | Type |
|---|
| Solving the list coloring problem through a branch-and-price algorithm | 2024-08-13 | Paper |
| Resources synchronization in a full truckload pickup and delivery problem: an exact approach | 2023-07-04 | Paper |
| Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs | 2023-04-17 | Paper |
| Circuits and circulant minors | 2022-04-27 | Paper |
| A branch and price algorithm for list coloring problem | 2022-04-27 | Paper |
| On dominating set polyhedra of circular interval graphs | 2021-03-25 | Paper |
| Grundy dominating sequences on \(X\)-join product | 2020-07-07 | Paper |
| Circuits and circulant minors | 2019-02-08 | Paper |
| Total dominating sequences in trees, split graphs, and under modular decomposition | 2018-08-17 | Paper |
| Characterizing N+-perfect line graphs | 2017-03-16 | Paper |
| Lovász-Schrijver PSD-Operator on Claw-Free Graphs | 2016-11-30 | Paper |
| A DSATUR-based algorithm for the equitable coloring problem | 2016-11-10 | Paper |
| Some links between identifying codes and separating, dominating and total dominating sets in graphs | 2016-10-17 | Paper |
| Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs | 2015-10-16 | Paper |
| A Tabu Search Heuristic for the Equitable Coloring Problem | 2015-10-16 | Paper |
| A polyhedral approach for the equitable coloring problem | 2014-05-05 | Paper |
| The packing coloring problem for lobsters and partner limited graphs | 2014-05-05 | Paper |
| Limited packing and multiple domination problems: polynomial time reductions | 2014-05-05 | Paper |
| The minor inequalities in the description of the set covering polyhedron of circulant matrices | 2014-03-25 | Paper |
| Some advances on the set covering polyhedron of circulant matrices | 2014-02-18 | Paper |
| The Identifying Code problem on $P_4$-tidy graphs | 2013-12-14 | Paper |
| The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs | 2013-11-08 | Paper |
| Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope | 2013-07-23 | Paper |
| Near-perfect graphs with polyhedral \(N_+(G)\) | 2013-07-23 | Paper |
| Polynomial instances of the packing coloring problem | 2013-07-23 | Paper |
| Polynomial reductions between the limited packing and tuple domination problems in graphs | 2013-07-23 | Paper |
| Polyhedral results for the equitable coloring problem | 2013-07-23 | Paper |
| On the dominating set polytope of web graphs | 2013-07-19 | Paper |
| The multiple domination and limited packing problems in graphs | 2013-04-04 | Paper |
| A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games | 2013-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3143963 | 2012-12-06 | Paper |
| The Packing Coloring Problem for (q,q-4) Graphs | 2012-11-02 | Paper |
| The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs | 2012-05-13 | Paper |
| The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems | 2012-05-13 | Paper |
| On the behavior of the \(N_{+}\)-operator under blocker duality | 2011-03-10 | Paper |
| On the computational complexity of combinatorial flexibility problems | 2011-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161195 | 2010-10-14 | Paper |
| Combinatorial flexibility problems and their computational complexity | 2008-06-05 | Paper |
| Some insight into characterizations of minimally nonideal matrices | 2008-05-05 | Paper |
| Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture | 2007-02-19 | Paper |
| On the commutativity of antiblocker diagrams under lift-and-project operators | 2006-08-17 | Paper |
| On a certain class of nonideal clutters | 2006-08-17 | Paper |
| On the relationship between disjunctive relaxations and minors in packing and covering problems | 2006-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708497 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708498 | 2005-11-18 | Paper |
| A Generalization of the Perfect Graph Theorem Under the Disjunctive Index | 2005-11-11 | Paper |
| Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality | 2005-09-28 | Paper |
| Lift and project relaxations for the matching and related polytopes | 2004-01-26 | Paper |
| The disjunctive procedure and blocker duality | 2002-08-29 | Paper |
