Graph classes, layout and width parameters

• P. Heggernes, D. Meister, U. Rotics
  • Exploiting restricted linear structure to cope with the hardness of clique-width, TAMC 2010
• P. Heggernes and D. Meister
  • Hardness and approximation of minimum distortion embeddings, Information Processing Letters 110 (2010)
• P. Golovach, P. Heggernes, D. Kratsch, D. Lokshtanov, D. Meister, S. Saurabh
  • Bandwidth on AT-free graphs, ISAAC 2009
• T. Ekim, P. Heggernes, D. Meister
  • Polar permutation graphs, IWOCA 2009
• D. Meister and J. A. Telle
  • Chordal digraphs, WG 2009
• P. Heggernes, D. Meister, Ch. Papadopoulos
  • A complete characterisation of the linear clique-width of path powers, TAMC 2009
• P. Heggernes, D. Meister, Ch. Papadopoulos
  • A new representation of proper interval graphs with an application to clique-width, DIMAP Workshop on Algorithmic Graph Theory (2009)
• M. Fellows, D. Meister, Fr. Rosamond, R. Sritharan, J.A. Telle
  • Leaf Powers and Their Properties: Using the Trees, ISAAC 2008
• P. Heggernes, D. Meister, A. Proskurowski
  • Minimum distortion embeddings into a path of bipartite permutation graphs and threshold graphs, SWAT 2008
• P. Heggernes, D. Meister, Ch. Papadopoulos
  • Graphs of linear clique-width at most 3, TAMC 2008
• P. Heggernes, D. Kratsch, D. Meister
  • Bandwidth of bipartite permutation graphs in polynomial time, LATIN 2008
  • Bandwidth of bipartite permutation graphs in polynomial time, Journal of Discrete Algorithms 7 (2009)
• D. Meister, J.A. Telle, M. Vatshelle
  • Characterization and recognition of digraphs of bounded Kelly-width, WG 2007
  • Recognizing digraphs of Kelly-width 2, Discrete Applied Mathematics 158 (2010)
• D. Meister
  • A characterisation of the minimal triangulations of permutation graphs, WG 2007
• D. Meister
  • Two characterisations of minimal triangulations of 2K₂-free graphs, Discrete Mathematics 306 (2006)
• D. Meister
  • Computing treewidth and minimum fill-in for permutation graphs in linear time, WG 2005
• D. Meister
  • Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, Discrete Applied Mathematics 146 (2005)

Complexity theory

• D. Meister
  • Decidable membership problems for finite recurrent systems over sets of naturals, FCT 2005
  • Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers, Theory of Computing Systems 41 (2007)
• E. Böhler, Chr. Glaßer, D. Meister
  • Error-bounded Probabilistic Computations between MA and AM, MFCS 2003
  • Error-bounded Probabilistic Computations between MA and AM, Journal of Computer and System Sciences 72 (2006)