Small Bounded-Error Computations and Completeness - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (Electron. Colloquium Comput. Complex., 2003)

Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. - Daniel Meister 001 (FCT, 2005)

Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. - Daniel Meister 001 (WG, 2005)

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

Two characterisations of minimal triangulations of 2K2-free graphs. - Daniel Meister 001 (Discret. Math., 2006)

Error-bounded probabilistic computations between MA and AM. - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (J. Comput. Syst. Sci., 2006)

The complexity of membership problems for finite recurrent systems and minimal triangulations. - Daniel Meister 001 (2006)

A Characterisation of the Minimal Triangulations of Permutation Graphs. - Daniel Meister 001 (WG, 2007)

Characterization and Recognition of Digraphs of Bounded Kelly-width. - Daniel Meister 001; Jan Arne Telle; Martin Vatshelle (WG, 2007)

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

Leaf Powers and Their Properties: Using the Trees. - Michael R. Fellows; Daniel Meister 001; Frances A. Rosamond; R. Sritharan; Jan Arne Telle (ISAAC, 2008)

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. - Pinar Heggernes; Daniel Meister 001; Andrzej Proskurowski (SWAT, 2008)

Polar Permutation Graphs. - Tínaz Ekim; Pinar Heggernes; Daniel Meister 001 (IWOCA, 2009)

A Complete Characterisation of the Linear Clique-Width of Path Powers. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos (TAMC, 2009)

A new representation of proper interval graphs with an application to clique-width. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos (Electron. Notes Discret. Math., 2009)

Bandwidth of bipartite permutation graphs in polynomial time. - Pinar Heggernes; Dieter Kratsch; Daniel Meister 001 (J. Discrete Algorithms, 2009)

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. - Pinar Heggernes; Daniel Meister 001; Yngve Villanger (ISAAC (2), 2010)

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. - Pinar Heggernes; Daniel Meister 001; Udi Rotics (TAMC, 2010)

Recognizing digraphs of Kelly-width 2. - Daniel Meister 001; Jan Arne Telle; Martin Vatshelle (Discret. Appl. Math., 2010)

Hardness and approximation of minimum distortion embeddings. - Pinar Heggernes; Daniel Meister 001 (Inf. Process. Lett., 2010)

Treewidth and minimum fill-in on permutation graphs in linear time. - Daniel Meister 001 (Theor. Comput. Sci., 2010)

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. - Binh-Minh Bui-Xuan; Pinar Heggernes; Daniel Meister 001; Andrzej Proskurowski (COCOON, 2011)

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. - Pinar Heggernes; Daniel Meister 001; Udi Rotics (CSR, 2011)

Bandwidth on AT-free graphs. - Petr A. Golovach; Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov; Daniel Meister 001; Saket Saurabh 001 (Theor. Comput. Sci., 2011)

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. - Pinar Heggernes; Daniel Meister 001; Andrzej Proskurowski (Theor. Comput. Sci., 2011)

Graphs of linear clique-width at most 3. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos (Theor. Comput. Sci., 2011)

Computing Minimum Geodetic Sets of Proper Interval Graphs. - Tínaz Ekim; Aysel Erey; Pinar Heggernes; Pim van 't Hof; Daniel Meister 001 (LATIN, 2012)

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos (Discret. Appl. Math., 2012)

Chordal digraphs. - Daniel Meister 001; Jan Arne Telle (Theor. Comput. Sci., 2012)

Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. - Daniel Meister 001; Udi Rotics (CoRR, 2013)

Two characterisations of the minimal triangulations of permutation graphs. - Daniel Meister 001 (Discret. Math., 2013)

Polar permutation graphs are polynomial-time recognisable. - Tínaz Ekim; Pinar Heggernes; Daniel Meister 001 (Eur. J. Comb., 2013)

Digraphs of bounded elimination width. - Henning Fernau; Daniel Meister 001 (Discret. Appl. Math., 2014)

Clique-width with an inactive label. - Daniel Meister 001 (Discret. Math., 2014)

End-Vertices of Graph Search Algorithms. - Dieter Kratsch; Mathieu Liedloff; Daniel Meister 001 (CIAC, 2015)

A characterisation of clique-width through nested partitions. - Bruno Courcelle; Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos; Udi Rotics (Discret. Appl. Math., 2015)

Clique-width of full bubble model graphs. - Daniel Meister 001; Udi Rotics (Discret. Appl. Math., 2015)

Computing the metric dimension for chain graphs. - Henning Fernau; Pinar Heggernes; Pim van 't Hof; Daniel Meister 001; Reza Saei (Inf. Process. Lett., 2015)

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. - Pinar Heggernes; Pim van 't Hof; Daniel Meister 001; Yngve Villanger (Theor. Comput. Sci., 2015)

Using swaps and deletes to make strings match. - Daniel Meister 001 (Theor. Comput. Sci., 2015)

Clique-width of path powers. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos; Udi Rotics (Discret. Appl. Math., 2016)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)