Daniel Meister

49 papers B 11C 5Misc 2Journal 28Unranked 2

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