| Publication | Date of Publication | Type |
|---|
On the density of sets of the Euclidean plane avoiding distance 1
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
On the density of sets of the Euclidean plane avoiding distance 1
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
On circular-perfect graphs: a survey
European Journal of Combinatorics | 2021-02-08 | Paper |
On the density of sets avoiding parallelohedron distance 1
Discrete & Computational Geometry | 2019-09-11 | Paper |
On the density of sets avoiding parallelohedron distance 1
Discrete & Computational Geometry | 2019-09-11 | Paper |
Beyond perfection: computational results for superclasses
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Strong chromatic index of planar graphs with large girth
Discussiones Mathematicae Graph Theory | 2014-11-18 | Paper |
Computing the clique number of \(a\)-perfect graphs in polynomial time
European Journal of Combinatorics | 2014-07-29 | Paper |
| scientific article; zbMATH DE number 6302998 (Why is no real title available?) | 2014-06-11 | Paper |
On the theta number of powers of cycle graphs
Combinatorica | 2014-03-17 | Paper |
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
| Computing the clique number of a-perfect graphs in polynomial time | 2013-11-01 | Paper |
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
MPQ-trees for the orthogonal packing problem
JMMA. Journal of Mathematical Modelling and Algorithms | 2013-02-19 | Paper |
Consecutive ones matrices for multi-dimensional orthogonal packing problems
JMMA. Journal of Mathematical Modelling and Algorithms | 2013-02-19 | Paper |
Polynomial time computability of some graph parameters for superclasses of perfect graphs
International Journal of Mathematics in Operational Research | 2012-11-16 | Paper |
Clique and chromatic number of circular-perfect graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
MPQ-trees for orthogonal packing problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Consecutive ones matrices for multi-dimensional orthogonal packing problems
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A note on the Chvàtal-Rank of clique family inequalities
RAIRO - Operations Research | 2011-06-01 | Paper |
Claw-free circular-perfect graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Decomposition of sparse graphs, with application to game coloring number
Discrete Mathematics | 2010-05-05 | Paper |
On facets of stable set polytopes of claw-free graphs with stability number 3
Discrete Mathematics | 2010-03-29 | Paper |
Triangle-free strongly circular-perfect graphs
Discrete Mathematics | 2009-06-19 | Paper |
Characterizing and bounding the imperfection ratio for some classes of graphs
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
Claw-free circular-perfect graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On classes of minimal circular-imperfect graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
On facets of stable set polytopes of claw-free graphs with stability number three
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Generalized clique family inequalities for claw-free graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Three classes of minimal circular-imperfect graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On strongly circular-perfectness
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A construction for non-rank facets of stable set polytopes of webs
European Journal of Combinatorics | 2006-11-15 | Paper |
On the circular chromatic number of circular partitionable graphs
Journal of Graph Theory | 2006-09-06 | Paper |
On non-rank facets of stable set polytopes of webs with clique number four
Discrete Applied Mathematics | 2006-06-09 | Paper |
Almost all webs are not rank-perfect
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
| scientific article; zbMATH DE number 2230253 (Why is no real title available?) | 2005-11-18 | Paper |
Partitionable graphs arising from near-factorizations of finite groups
Discrete Mathematics | 2003-08-19 | Paper |
