Daniel Meister

Publication Activity (10 Years)

Years Active: 2003-2016
Publications (10 Years): 2

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Discret. Math.

CoRR

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
Clique-width of path powers. Discret. Appl. Math. 205 (2016)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? J. Comb. Theory, Ser. B 116 (2016)
Dieter Kratsch, Mathieu Liedloff, Daniel Meister
End-Vertices of Graph Search Algorithms. CIAC (2015)
Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115 (9) (2015)
Daniel Meister
Using swaps and deletes to make strings match. Theor. Comput. Sci. 562 (2015)
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187 (2015)
Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562 (2015)
Daniel Meister, Udi Rotics
Clique-width of full bubble model graphs. Discret. Appl. Math. 185 (2015)
Daniel Meister
Clique-width with an inactive label. Discret. Math. 337 (2014)
Henning Fernau, Daniel Meister
Digraphs of bounded elimination width. Discret. Appl. Math. 168 (2014)
Tínaz Ekim, Pinar Heggernes, Daniel Meister
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34 (3) (2013)
Daniel Meister, Udi Rotics
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. CoRR (2013)
Daniel Meister
Two characterisations of the minimal triangulations of permutation graphs. Discret. Math. 313 (20) (2013)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. 160 (6) (2012)
Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN (2012)
Daniel Meister, Jan Arne Telle
Chordal digraphs. Theor. Comput. Sci. 463 (2012)
Pinar Heggernes, Daniel Meister, Udi Rotics
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR (2011)
Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON (2011)
Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412 (12-14) (2011)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412 (39) (2011)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412 (50) (2011)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are There Any Good Digraph Width Measures? IPEC (2010)
Pinar Heggernes, Daniel Meister, Udi Rotics
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? CoRR (2010)
Pinar Heggernes, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) (2010)
Daniel Meister
Treewidth and minimum fill-in on permutation graphs in linear time. Theor. Comput. Sci. 411 (40-42) (2010)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158 (7) (2010)
Pinar Heggernes, Daniel Meister
Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. 110 (8-9) (2010)
Tínaz Ekim, Pinar Heggernes, Daniel Meister
Polar Permutation Graphs. IWOCA (2009)
Pinar Heggernes, Dieter Kratsch, Daniel Meister
Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7 (4) (2009)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
Bandwidth on AT-Free Graphs. ISAAC (2009)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC (2009)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. 32 (2009)
Daniel Meister, Jan Arne Telle
Chordal Digraphs. WG (2009)
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
Leaf Powers and Their Properties: Using the Trees. ISAAC (2008)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Graphs of Linear Clique-Width at Most 3. TAMC (2008)
Pinar Heggernes, Dieter Kratsch, Daniel Meister
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN (2008)
Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT (2008)
Daniel Meister, Jan Arne Telle, Martin Vatshelle
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG (2007)
Daniel Meister
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. Theory Comput. Syst. 41 (2) (2007)
Daniel Meister
A Characterisation of the Minimal Triangulations of Permutation Graphs. WG (2007)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72 (6) (2006)
Daniel Meister
-free graphs. Discret. Math. 306 (24) (2006)
Daniel Meister
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. WG (2005)
Daniel Meister
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. FCT (2005)
Daniel Meister
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discret. Appl. Math. 146 (3) (2005)
Elmar Böhler, Christian Glaßer, Daniel Meister
Small Bounded-Error Computations and Completeness Electron. Colloquium Comput. Complex. (069) (2003)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-Bounded Probabilistic Computations between MA and AM. MFCS (2003)

Daniel Meister.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Meister