| Publication | Date of Publication | Type |
|---|
Characterization of graphs with perfect closed neighbourhood matrices
Procedia Computer Science | 2025-12-11 | Paper |
The minimum clique routing problem on cycles
Networks | 2025-06-13 | Paper |
| On the complexity of the minimum chromatic violation problem | 2025-02-07 | Paper |
| 1-persistency of the clique relaxation of the stable set polytope | 2025-02-07 | Paper |
| The Minimum Clique Routing Problem on Cycles | 2023-11-16 | Paper |
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Discrete Applied Mathematics | 2023-04-17 | Paper |
The minimum chromatic violation problem: a polyhedral approach
Discrete Applied Mathematics | 2020-05-29 | Paper |
| Packing functions and graphs with perfect closed neighbourhood matrices | 2018-12-21 | Paper |
| The minimum chromatic violation problem: a polyhedral study | 2018-04-09 | Paper |
Characterizing \(N_+\)-perfect line graphs
International Transactions in Operational Research | 2017-03-16 | Paper |
Lovász-Schrijver PSD-operator on claw-free graphs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
Discrete Applied Mathematics | 2016-06-22 | Paper |
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
Annals of Operations Research | 2016-03-09 | Paper |
Lovász and Schrijver \(N_+\)-relaxation on web graphs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
On the facets of lift-and-project relaxations under graph operations
Discrete Applied Mathematics | 2014-05-05 | Paper |
| A comparison between lift-and-project indices and imperfection ratio on web graphs | 2013-11-08 | Paper |
| On the \(k\)-dominating set polytope of web graphs | 2013-11-08 | Paper |
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Near-perfect graphs with polyhedral \(N_+(G)\)
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On the facets of the lift-and-project relaxations of graph subdivisions
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Strength of facets for the set covering and set packing polyhedra on circulant matrices
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
| A graph theoretical model for the total balancedness of combinatorial games | 2012-12-06 | Paper |
Lift-and-project ranks of the set covering polytope of circulant matrices
Discrete Applied Mathematics | 2012-11-22 | Paper |
On the behavior of the \(N_{+}\)-operator under blocker duality
Discrete Applied Mathematics | 2011-03-10 | Paper |
| The disjunctive procedure on the matching problem | 2010-10-14 | Paper |
A polyhedral approach to the stability of a family of coalitions
Discrete Applied Mathematics | 2010-05-05 | Paper |
The Shapley value for arbitrary families of coalitions
European Journal of Operational Research | 2010-01-15 | Paper |
Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
Operations Research Letters | 2007-02-19 | Paper |
On the commutativity of antiblocker diagrams under lift-and-project operators
Discrete Applied Mathematics | 2006-08-17 | Paper |
| scientific article; zbMATH DE number 2230211 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2230212 (Why is no real title available?) | 2005-11-18 | Paper |
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
Mathematics of Operations Research | 2005-11-11 | Paper |
On the influence of resequencing on the regularity of service
Performance Evaluation | 2003-06-24 | Paper |
The disjunctive procedure and blocker duality
Discrete Applied Mathematics | 2002-08-29 | Paper |
