Daniel Meister

According to our database1, Daniel Meister authored at least 42 papers between 2003 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Are there any good digraph width measures?
J. Comb. Theory, Ser. B, 2016

Clique-width of path powers.
Discret. Appl. Math., 2016

2015
Using swaps and deletes to make strings match.
Theor. Comput. Sci., 2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.
Theor. Comput. Sci., 2015

Computing the metric dimension for chain graphs.
Inf. Process. Lett., 2015

Clique-width of full bubble model graphs.
Discret. Appl. Math., 2015

A characterisation of clique-width through nested partitions.
Discret. Appl. Math., 2015

End-Vertices of Graph Search Algorithms.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Clique-width with an inactive label.
Discret. Math., 2014

Digraphs of bounded elimination width.
Discret. Appl. Math., 2014

2013
Polar permutation graphs are polynomial-time recognisable.
Eur. J. Comb., 2013

Two characterisations of the minimal triangulations of permutation graphs.
Discret. Math., 2013

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

2012
Chordal digraphs.
Theor. Comput. Sci., 2012

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.
Discret. Appl. Math., 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Graphs of linear clique-width at most 3.
Theor. Comput. Sci., 2011

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.
Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.
Theor. Comput. Sci., 2011

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.
Proceedings of the Computer Science - Theory and Applications, 2011

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Treewidth and minimum fill-in on permutation graphs in linear time.
Theor. Comput. Sci., 2010

Hardness and approximation of minimum distortion embeddings.
Inf. Process. Lett., 2010

Recognizing digraphs of Kelly-width 2.
Discret. Appl. Math., 2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Bandwidth of bipartite permutation graphs in polynomial time.
J. Discrete Algorithms, 2009

A new representation of proper interval graphs with an application to clique-width.
Electron. Notes Discret. Math., 2009

A Complete Characterisation of the Linear Clique-Width of Path Powers.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Polar Permutation Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.
Proceedings of the Algorithm Theory, 2008

Leaf Powers and Their Properties: Using the Trees.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.
Theory Comput. Syst., 2007

Characterization and Recognition of Digraphs of Bounded Kelly-width.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

A Characterisation of the Minimal Triangulations of Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006
The complexity of membership problems for finite recurrent systems and minimal triangulations.
PhD thesis, 2006

Error-bounded probabilistic computations between MA and AM.
J. Comput. Syst. Sci., 2006

Two characterisations of minimal triangulations of 2K<sub>2</sub>-free graphs.
Discret. Math., 2006

2005
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.
Discret. Appl. Math., 2005

Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2003
Small Bounded-Error Computations and Completeness
Electron. Colloquium Comput. Complex., 2003


  Loading...