| Publication | Date of Publication | Type |
|---|
| Location-Domination Type Problems Under the Mycielski Construction | 2023-11-23 | Paper |
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Discrete Applied Mathematics | 2023-04-17 | Paper |
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
Discrete Applied Mathematics | 2022-10-13 | Paper |
| Ontological dependence and grounding for a weak mathematical structuralism | 2022-10-09 | Paper |
Circuits and circulant minors
(available as arXiv preprint) | 2022-04-27 | Paper |
On dominating set polyhedra of circular interval graphs
Discrete Mathematics | 2021-03-25 | Paper |
| Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs | 2021-02-04 | Paper |
Linear-time algorithms for three domination-based separation problems in block graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
Circuits and circulant minors
(available as arXiv preprint) | 2019-02-08 | Paper |
Polyhedra associated with identifying codes in graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
Progress on the description of identifying code polyhedra for some families of split graphs
Discrete Optimization | 2018-05-24 | Paper |
| A linear-time algorithm for the identifying code problem on block graphs | 2018-04-09 | Paper |
Lovász-Schrijver PSD-operator on claw-free graphs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
| A polyhedral approach to locating-dominating sets in graphs | 2016-10-17 | Paper |
Study of identifying code polyhedra for some families of split graphs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
The minor inequalities in the description of the set covering polyhedron of circulant matrices
Mathematical Methods of Operations Research | 2014-03-25 | Paper |
Some advances on the set covering polyhedron of circulant matrices
Discrete Applied Mathematics | 2014-02-18 | Paper |
| Row family inequalities for the set covering polyhedron | 2013-11-08 | 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 |
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 nonidealness index of rank-ideal matrices
Discrete Applied Mathematics | 2010-08-13 | Paper |
On the set covering polyhedron of circulant matrices
Discrete Optimization | 2009-05-07 | Paper |
The nonidealness index of circulant matrices
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Some insight into characterizations of minimally nonideal matrices
Mathematical Methods of Operations Research | 2008-05-05 | Paper |
On a certain class of nonideal clutters
Discrete Applied Mathematics | 2006-08-17 | Paper |
Lift and project relaxations for the matching and related polytopes
Discrete Applied Mathematics | 2004-01-26 | Paper |
