| Publication | Date of Publication | Type |
|---|
The stable set polytope of icosahedral graphs
Discrete Mathematics | 2015-12-08 | Paper |
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
The stable set polytope of claw-free graphs with stability number greater than three
Operations Research Proceedings | 2015-03-03 | Paper |
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
Journal of Combinatorial Theory. Series B | 2014-09-04 | Paper |
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
Journal of Combinatorial Theory. Series B | 2014-08-29 | Paper |
2-clique-bond of stable set polyhedra
Discrete Applied Mathematics | 2014-04-22 | Paper |
The stable set polytope of claw-free graphs with large stability number
| 2013-11-08 | Paper |
Edge-colouring of joins of regular graphs. II
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
Gear composition of stable set polytopes and \(\mathcal G\)-perfection
Mathematics of Operations Research | 2011-04-27 | Paper |
Edge-colouring of joins of regular graphs. I
Journal of Combinatorial Optimization | 2010-02-24 | Paper |
Gear composition and the stable set polytope
Operations Research Letters | 2009-03-04 | Paper |
On the Stable Set Polytope of Claw-Free Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Edge-colouring of regular graphs of large degree
Theoretical Computer Science | 2008-01-07 | Paper |
Improved approximation of maximum vertex cover
Operations Research Letters | 2006-01-18 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
scientific article; zbMATH DE number 2081003 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1979495 (Why is no real title available?)
| 2003-09-14 | Paper |
Polynomial time algorithms for 2-edge-connectivity augmentation problems
Algorithmica | 2003-08-19 | Paper |
The circular flow number of a 6-edge connected graph is less than four
Combinatorica | 2003-02-18 | Paper |
High-girth graphs avoiding a minor are nearly bipartite
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Optimization via enumeration: A new algorithm for the max cut problem
Mathematical Programming. Series A. Series B | 2001-06-26 | Paper |
The complexity of \(H\)-colouring of bounded degree graphs
Discrete Mathematics | 2001-03-04 | Paper |
scientific article; zbMATH DE number 1263264 (Why is no real title available?)
| 1999-11-03 | Paper |
Even Directed Cycles inH-Free Digraphs
Journal of Algorithms | 1999-08-23 | Paper |
On the theory of Pfaffian orientations. I: Perfect matchings and permanents
The Electronic Journal of Combinatorics | 1999-02-02 | Paper |
On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
The Electronic Journal of Combinatorics | 1999-02-02 | Paper |
scientific article; zbMATH DE number 1056873 (Why is no real title available?)
| 1998-11-01 | Paper |
A nice class for the vertex packing problem
Discrete Applied Mathematics | 1997-12-22 | Paper |
The rank facets of the stable set polytope for claw-free graphs
Journal of Combinatorial Theory. Series B | 1997-05-05 | Paper |
(p,q)-odd digraphs
| 1997-04-07 | Paper |
Cycles of Prescribed Modularity in Planar Digraphs
Journal of Algorithms | 1996-10-16 | Paper |
scientific article; zbMATH DE number 861342 (Why is no real title available?)
| 1996-08-13 | Paper |
New classes of Berge perfect graphs
Discrete Mathematics | 1995-02-28 | Paper |
Different capacities of a digraph
Graphs and Combinatorics | 1994-09-26 | Paper |
