 | 2009 |
|---|
| 17 |       | Tinaz Ekim,
Pinar Heggernes,
Daniel Meister:
Polar Permutation Graphs.
IWOCA 2009: 218-229 |
| 16 | | Pinar Heggernes,
Daniel Meister,
Charis Papadopoulos:
A Complete Characterisation of the Linear Clique-Width of Path Powers.
TAMC 2009: 241-250 |
| 15 | | 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) |
| 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) |
