Daniel Meister

Theor. Comput. Sci., 2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Computing the metric dimension for chain graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Clique-width of full bubble model graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

A characterisation of clique-width through nested partitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

End-Vertices of Graph Search Algorithms.

[BibT_eX]

[DOI]

Dieter Kratsch

Mathieu Liedloff

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Clique-width with an inactive label.

[BibT_eX]

[DOI]

Discret. Math., 2014

Digraphs of bounded elimination width.

[BibT_eX]

[DOI]

Henning Fernau

Discret. Appl. Math., 2014

2013

Polar permutation graphs are polynomial-time recognisable.

[BibT_eX]

[DOI]

Tínaz Ekim

Eur. J. Comb., 2013

Two characterisations of the minimal triangulations of permutation graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Chordal digraphs.

[BibT_eX]

[DOI]

Jan Arne Telle

Theor. Comput. Sci., 2012

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Graphs of linear clique-width at most 3.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Treewidth and minimum fill-in on permutation graphs in linear time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Hardness and approximation of minimum distortion embeddings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Recognizing digraphs of Kelly-width 2.

[BibT_eX]

[DOI]

Jan Arne Telle

Martin Vatshelle

Discret. Appl. Math., 2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.

[BibT_eX]

[DOI]

Yngve Villanger

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Bandwidth of bipartite permutation graphs in polynomial time.

[BibT_eX]

[DOI]

Dieter Kratsch

J. Discrete Algorithms, 2009

A new representation of proper interval graphs with an application to clique-width.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

A Complete Characterisation of the Linear Clique-Width of Path Powers.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Polar Permutation Graphs.

[BibT_eX]

[DOI]

Tínaz Ekim

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Proceedings of the Algorithm Theory, 2008

Leaf Powers and Their Properties: Using the Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Characterization and Recognition of Digraphs of Bounded Kelly-width.

[BibT_eX]

[DOI]

Jan Arne Telle

Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

A Characterisation of the Minimal Triangulations of Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

The complexity of membership problems for finite recurrent systems and minimal triangulations.

[BibT_eX]

[DOI]

PhD thesis, 2006

Error-bounded probabilistic computations between MA and AM.

[BibT_eX]

[DOI]

Elmar Böhler

Christian Glaßer

J. Comput. Syst. Sci., 2006

Two characterisations of minimal triangulations of 2K<sub>2</sub>-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2003

Small Bounded-Error Computations and Completeness

[BibT_eX]

[DOI]

Elmar Böhler

Christian Glaßer