| Publication | Date of Publication | Type |
|---|
Clique-width of path powers
Discrete Applied Mathematics | 2016-04-07 | Paper |
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
End-vertices of graph search algorithms
Lecture Notes in Computer Science | 2015-09-21 | Paper |
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics | 2015-06-10 | Paper |
Computing the metric dimension for chain graphs
Information Processing Letters | 2015-06-02 | Paper |
Clique-width of full bubble model graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
Induced subgraph isomorphism on proper interval and bipartite permutation graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Using swaps and deletes to make strings match
Theoretical Computer Science | 2014-12-02 | Paper |
Clique-width with an inactive label
Discrete Mathematics | 2014-10-31 | Paper |
Digraphs of bounded elimination width
Discrete Applied Mathematics | 2014-04-02 | Paper |
Two characterisations of the minimal triangulations of permutation graphs
Discrete Mathematics | 2014-01-23 | Paper |
A new representation of proper interval graphs with an application to clique-width
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics | 2013-01-24 | Paper |
Chordal digraphs
Theoretical Computer Science | 2013-01-07 | Paper |
Computing minimum geodetic sets of proper interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Bandwidth on AT-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Graphs of linear clique-width at most 3
Theoretical Computer Science | 2011-10-10 | Paper |
A generic approach to decomposition algorithms, with an application to digraph decomposition
Lecture Notes in Computer Science | 2011-08-17 | 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 |
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Theoretical Computer Science | 2011-03-14 | Paper |
Induced subgraph isomorphism on interval and proper interval graphs
Algorithms and Computation | 2010-12-09 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science | 2010-10-11 | Paper |
Hardness and approximation of minimum distortion embeddings
Information Processing Letters | 2010-09-07 | Paper |
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics | 2010-05-25 | Paper |
Chordal digraphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Bandwidth on AT-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
Polar permutation graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms | 2009-12-10 | Paper |
A Complete Characterisation of the Linear Clique-Width of Path Powers
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Leaf Powers and Their Properties: Using the Trees
Algorithms and Computation | 2009-01-29 | Paper |
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
A Characterisation of the Minimal Triangulations of Permutation Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Characterization and Recognition of Digraphs of Bounded Kelly-width
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Graphs of Linear Clique-Width at Most 3
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers
Theory of Computing Systems | 2007-09-06 | Paper |
Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
Discrete Mathematics | 2006-12-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences | 2006-10-05 | Paper |
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
