Daniel Meister

University of Trier

	2011
32		Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342
31		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: 233-246
30		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): 1275-1297 (2011)
29		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412(39): 5466-5486 (2011)
28		Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011)
	2010
27		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146
26		Pinar Heggernes, Daniel Meister, Yngve Villanger: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409
25		Pinar Heggernes, Daniel Meister, Udi Rotics: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295
24		Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485: (2010)
23		Daniel Meister, Jan Arne Telle, Martin Vatshelle: Recognizing digraphs of Kelly-width 2. Discrete Applied Mathematics 158(7): 741-746 (2010)
22		Pinar Heggernes, Daniel Meister: Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. 110(8-9): 312-316 (2010)
21		Daniel Meister: Treewidth and minimum fill-in on permutation graphs in linear time. Theor. Comput. Sci. 411(40-42): 3685-3700 (2010)
	2009
20		Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582
19		Tinaz Ekim, Pinar Heggernes, Daniel Meister: Polar Permutation Graphs. IWOCA 2009: 218-229
18		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250
17		Daniel Meister, Jan Arne Telle: Chordal Digraphs. WG 2009: 273-284
16		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics 32: 27-34 (2009)
15		Pinar Heggernes, Dieter Kratsch, Daniel Meister: Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7(4): 533-544 (2009)
	2008
14		Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413
13		Pinar Heggernes, Dieter Kratsch, Daniel Meister: Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227
12		Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342
11		Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341
	2007
10		Daniel Meister, Jan Arne Telle, Martin Vatshelle: Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279
9		Daniel Meister: A Characterisation of the Minimal Triangulations of Permutation Graphs. WG 2007: 99-108
8		Daniel Meister: Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. Theory Comput. Syst. 41(2): 257-289 (2007)
	2006
7		Daniel Meister: Two characterisations of minimal triangulations of 2K2-free graphs. Discrete Mathematics 306(24): 3327-3333 (2006)
6		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006)
	2005
5		Daniel Meister: Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. FCT 2005: 80-91
4		Daniel Meister: Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. WG 2005: 91-102
3		Daniel Meister: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discrete Applied Mathematics 146(3): 193-218 (2005)
	2003
2		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258
1		Elmar Böhler, Christian Glaßer, Daniel Meister: Small Bounded-Error Computations and Completeness Electronic Colloquium on Computational Complexity (ECCC)(069): (2003)

Coauthor Index

1	Elmar Böhler	[1] [2] [6]
2	Binh-Minh Bui-Xuan (Bùi Xuân Bình Minh)	[32]
3	Tinaz Ekim	[19]
4	Michael R. Fellows (Mike Fellows)	[14]
5	Robert Ganian	[24] [27]
6	Christian Glaßer (Christian Glasser)	[1] [2] [6]
7	Petr A. Golovach	[20] [28]
8	Pinar Heggernes	[11] [12] [13] [15] [16] [18] [19] [20] [22] [25] [26] [28] [29] [30] [31] [32]
9	Petr Hlinený	[24] [27]
10	Joachim Kneis	[24] [27]
11	Dieter Kratsch	[13] [15] [20] [28]
12	Daniel Lokshtanov	[20] [28]
13	Jan Obdrzálek	[24] [27]
14	Charis Papadopoulos	[11] [16] [18] [29]
15	Andrzej Proskurowski	[12] [30] [32]
16	Frances A. Rosamond	[14]
17	Peter Rossmanith	[24] [27]
18	Udi Rotics	[25] [31]
19	Saket Saurabh	[20] [28]
20	Somnath Sikdar	[24] [27]
21	R. Sritharan	[14]
22	Jan Arne Telle	[10] [14] [17] [23]
23	Martin Vatshelle	[10] [23]
24	Yngve Villanger	[26]

Colors in the list of coauthors

Last update Fri Feb 10 22:28:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page