| Publication | Date of Publication | Type |
|---|
The hypergraph orientation problem with vertex constraints
Discrete Applied Mathematics | 2026-02-24 | Paper |
On general packing functions in graphs
Procedia Computer Science | 2025-12-11 | Paper |
| Minimizing external vertices in hypergraph orientations | 2025-02-07 | Paper |
Solving the list coloring problem through a branch-and-price algorithm
European Journal of Operational Research | 2024-08-13 | Paper |
Resources synchronization in a full truckload pickup and delivery problem: an exact approach
Computers & Operations Research | 2023-07-04 | Paper |
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Discrete Applied Mathematics | 2023-04-17 | Paper |
Circuits and circulant minors
(available as arXiv preprint) | 2022-04-27 | Paper |
A branch and price algorithm for list coloring problem
(available as arXiv preprint) | 2022-04-27 | Paper |
On dominating set polyhedra of circular interval graphs
Discrete Mathematics | 2021-03-25 | Paper |
Grundy dominating sequences on X-join product
Discrete Applied Mathematics | 2020-07-07 | Paper |
Circuits and circulant minors
(available as arXiv preprint) | 2019-02-08 | Paper |
Total dominating sequences in trees, split graphs, and under modular decomposition
Discrete Optimization | 2018-08-17 | Paper |
Total dominating sequences in trees, split graphs, and under modular decomposition
Discrete Optimization | 2018-08-17 | 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 |
A DSATUR-based algorithm for the equitable coloring problem
Computers & Operations Research | 2016-11-10 | Paper |
A DSATUR-based algorithm for the equitable coloring problem
Computers & Operations Research | 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
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A tabu search heuristic for the equitable coloring problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A tabu search heuristic for the equitable coloring problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A polyhedral approach for the equitable coloring problem
Discrete Applied Mathematics | 2014-05-05 | Paper |
The packing coloring problem for lobsters and partner limited graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
Limited packing and multiple domination problems: polynomial time reductions
Discrete Applied Mathematics | 2014-05-05 | 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 |
| 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
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 |
Polynomial instances of the packing coloring problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Polynomial reductions between the limited packing and tuple domination problems in graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Polyhedral results for the equitable coloring problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On the dominating set polytope of web graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
The multiple domination and limited packing problems in graphs
Information Processing Letters | 2013-04-04 | Paper |
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
Discrete Optimization | 2013-03-13 | Paper |
| A graph theoretical model for the total balancedness of combinatorial games | 2012-12-06 | Paper |
The packing coloring problem for \((q,q-4)\) graphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the behavior of the \(N_{+}\)-operator under blocker duality
Discrete Applied Mathematics | 2011-03-10 | Paper |
On the computational complexity of combinatorial flexibility problems
International Journal of Computer Mathematics | 2011-01-20 | Paper |
| The disjunctive procedure on the matching problem | 2010-10-14 | Paper |
Combinatorial flexibility problems and their computational complexity
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 |
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 |
On a certain class of nonideal clutters
Discrete Applied Mathematics | 2006-08-17 | Paper |
| On the relationship between disjunctive relaxations and minors in packing and covering problems | 2006-07-14 | 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 |
Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality''
Discrete Applied Mathematics | 2005-09-28 | Paper |
Lift and project relaxations for the matching and related polytopes
Discrete Applied Mathematics | 2004-01-26 | Paper |
The disjunctive procedure and blocker duality
Discrete Applied Mathematics | 2002-08-29 | Paper |
