Publication | Date of Publication | Type |
---|
The stable set polytope of icosahedral graphs | 2015-12-08 | Paper |
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths | 2015-10-21 | Paper |
The stable set polytope of claw-free graphs with stability number greater than three | 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 | 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 | 2014-08-29 | Paper |
2-clique-bond of stable set polyhedra | 2014-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q2861525 | 2013-11-08 | Paper |
Edge-colouring of joins of regular graphs. II | 2013-04-08 | Paper |
Gear Composition of Stable Set Polytopes and 𝒢-Perfection | 2011-04-27 | Paper |
Edge-colouring of joins of regular graphs. I | 2010-02-24 | Paper |
Gear composition and the stable set polytope | 2009-03-04 | Paper |
On the Stable Set Polytope of Claw-Free Graphs | 2009-01-27 | Paper |
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs | 2009-01-27 | Paper |
Edge-colouring of regular graphs of large degree | 2008-01-07 | Paper |
Improved approximation of maximum vertex cover | 2006-01-18 | Paper |
Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4474101 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4425950 | 2003-09-14 | Paper |
Polynomial time algorithms for 2-edge-connectivity augmentation problems | 2003-08-19 | Paper |
The circular flow number of a 6-edge connected graph is less than four | 2003-02-18 | Paper |
High-girth graphs avoiding a minor are nearly bipartite | 2002-12-10 | Paper |
Optimization via enumeration: A new algorithm for the max cut problem | 2001-06-26 | Paper |
The complexity of \(H\)-colouring of bounded degree graphs | 2001-03-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4234137 | 1999-11-03 | Paper |
Even Directed Cycles inH-Free Digraphs | 1999-08-23 | Paper |
On the theory of Pfaffian orientations. I: Perfect matchings and permanents | 1999-02-02 | Paper |
On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration | 1999-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4350678 | 1998-11-01 | Paper |
A nice class for the vertex packing problem | 1997-12-22 | Paper |
The rank facets of the stable set polytope for claw-free graphs | 1997-05-05 | Paper |
(p,q)-odd digraphs | 1997-04-07 | Paper |
Cycles of Prescribed Modularity in Planar Digraphs | 1996-10-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4871067 | 1996-08-13 | Paper |
New classes of Berge perfect graphs | 1995-02-28 | Paper |
Different capacities of a digraph | 1994-09-26 | Paper |