| Publication | Date of Publication | Type |
|---|
| Clique-width of path powers | 2016-04-07 | Paper |
| Are there any good digraph width measures? | 2015-12-11 | Paper |
| End-Vertices of Graph Search Algorithms | 2015-09-21 | Paper |
| A characterisation of clique-width through nested partitions | 2015-06-10 | Paper |
| Computing the metric dimension for chain graphs | 2015-06-02 | Paper |
| Clique-width of full bubble model graphs | 2015-04-28 | Paper |
| Induced subgraph isomorphism on proper interval and bipartite permutation graphs | 2014-12-02 | Paper |
| Using swaps and deletes to make strings match | 2014-12-02 | Paper |
| Clique-width with an inactive label | 2014-10-31 | Paper |
| Digraphs of bounded elimination width | 2014-04-02 | Paper |
| Two characterisations of the minimal triangulations of permutation graphs | 2014-01-23 | Paper |
| A new representation of proper interval graphs with an application to clique-width | 2013-07-04 | Paper |
| Polar permutation graphs are polynomial-time recognisable | 2013-01-24 | Paper |
| Chordal digraphs | 2013-01-07 | Paper |
| Computing Minimum Geodetic Sets of Proper Interval Graphs | 2012-06-29 | Paper |
| Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs | 2012-05-11 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| Graphs of linear clique-width at most 3 | 2011-10-10 | Paper |
| A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition | 2011-08-17 | Paper |
| Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width | 2011-06-17 | Paper |
| Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs | 2011-03-14 | Paper |
| Induced Subgraph Isomorphism on Interval and Proper Interval Graphs | 2010-12-09 | Paper |
| Are There Any Good Digraph Width Measures? | 2010-12-07 | Paper |
| Treewidth and minimum fill-in on permutation graphs in linear time | 2010-10-11 | Paper |
| Hardness and approximation of minimum distortion embeddings | 2010-09-07 | Paper |
| Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width | 2010-06-17 | Paper |
| Recognizing digraphs of Kelly-width 2 | 2010-05-25 | Paper |
| Chordal Digraphs | 2010-01-21 | Paper |
| Bandwidth on AT-Free Graphs | 2009-12-17 | Paper |
| Polar Permutation Graphs | 2009-12-11 | Paper |
| Bandwidth of bipartite permutation graphs in polynomial time | 2009-12-10 | Paper |
| A Complete Characterisation of the Linear Clique-Width of Path Powers | 2009-06-03 | Paper |
| Leaf Powers and Their Properties: Using the Trees | 2009-01-29 | Paper |
| Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs | 2008-07-15 | Paper |
| A Characterisation of the Minimal Triangulations of Permutation Graphs | 2008-07-01 | Paper |
| Characterization and Recognition of Digraphs of Bounded Kelly-width | 2008-07-01 | Paper |
| Graphs of Linear Clique-Width at Most 3 | 2008-05-27 | Paper |
| Bandwidth of Bipartite Permutation Graphs in Polynomial Time | 2008-04-15 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers | 2007-09-06 | Paper |
| Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs | 2006-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Error-bounded probabilistic computations between MA and AM | 2006-10-05 | Paper |
| Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs | 2005-02-22 | Paper |
