| Publication | Date of Publication | Type |
|---|
Clique-width of path powers
Discrete Applied Mathematics | 2016-04-07 | Paper |
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics | 2015-06-10 | Paper |
On the clique-width of some perfect graph classes
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On the clique-width of graph with few \(P_{4}\)'s
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Clique-width of full bubble model graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Polynomial-time recognition of clique-width 3 graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Clique-width is NP-complete
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics | 2008-09-10 | Paper |
Computing Graph Polynomials on Graphs of Bounded Clique-Width
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Equistable distance-hereditary graphs
Discrete Applied Mathematics | 2008-02-26 | Paper |
Read-Once Functions Revisited and the Readability Number of a Boolean Function
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| Chain Graphs have Unbounded Readability | 2006-10-15 | Paper |
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
Discrete Applied Mathematics | 2006-06-09 | Paper |
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing | 2005-09-16 | Paper |
Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
Algorithmica | 2005-02-11 | Paper |
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2044924 (Why is no real title available?) | 2004-02-18 | Paper |
Equistable chordal graphs
Discrete Applied Mathematics | 2003-12-04 | Paper |
Computing the treewidth and the minimum fill-in with the modular decomposition
Algorithmica | 2003-08-19 | Paper |
Linear time solvable optimization problems on graphs of bounded clique-width
Theory of Computing Systems | 2003-03-18 | Paper |
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics | 2003-03-09 | Paper |
| Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract) | 2002-03-14 | Paper |
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Discrete Applied Mathematics | 2001-11-09 | Paper |
| scientific article; zbMATH DE number 1439435 (Why is no real title available?) | 2001-05-17 | Paper |
| scientific article; zbMATH DE number 1512682 (Why is no real title available?) | 2001-05-13 | Paper |
| scientific article; zbMATH DE number 1420904 (Why is no real title available?) | 2000-05-22 | Paper |
| scientific article; zbMATH DE number 1262783 (Why is no real title available?) | 1999-12-13 | Paper |
Restrictions of minimum spanner problems
Information and Computation | 1997-12-14 | Paper |
