List of technical reports

• Error-bounded probabilistic computations between MA and AM, E. Böhler, C. Glaßer, D. Meister
  (report no. 299, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2002)
• Recognizing and computing minimal triangulations efficiently, D. Meister
  (report no. 302, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2002)
• Small Bounded-Error Computations and Completeness, E. Böhler, C. Glaßer, D. Meister
  (report no. 311, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2003)
• A complete characterisation of minimal triangulations of co-square-free graphs, D. Meister
  (report no. 328, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2004)
• Membership problems for recurrent systems over the power set of the natural numbers, D. Meister
  (report no. 336, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2004)
• The structure of separator graphs and efficient algorithms for minimal triangulations problems of permutation graphs, D. Meister
  (report no. 361, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2005)
• The complexity of problems concerning matrix powers and the numbers of paths in a graph, D. Meister
  (report no. 369, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2005)
• Generating maximal spanning forests for some geometric graph classes, D. Meister
  (report no. 393, Institut für Informatik, Julius-Maximilians-Universität Würzburg, 2006)
• A characterisation of the minimal triangulations of permutation graphs, D. Meister
  (report no. 350, Institutt for Informatikk, Universitetet i Bergen, 2007)
• Characterization and recognition of digraphs of bounded Kelly-width, D. Meister, J. A. Telle, M. Vatshelle
  (report no. 351, Institutt for Informatikk, Universitetet i Bergen, 2007)
• A new representation of proper interval graphs with an application to clique-width, P. Heggernes, D. Meister, C. Papadopoulos
  (report no. 354, Institutt for Informatikk, Universitetet i Bergen, 2007)
• Bandwidth of bipartite permutation graphs in polynomial time, P. Heggernes, D. Kratsch, D. Meister
  (report no. 356, Institutt for Informatikk, Universitetet i Bergen, 2007)
• Graphs of small bounded linear clique-width, P. Heggernes, D. Meister, C. Papadopoulos
  (report no. 362, Institutt for Informatikk, Universitetet i Bergen, 2007)
• Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs, P. Heggernes, D. Meister, A. Proskurowski
  (report no. 369, Institutt for Informatikk, Universitetet i Bergen, 2008)
• A complete characterisation of the linear clique-width of path powers, P. Heggernes, D. Meister, C. Papadopoulos
  (report no. 381, Institutt for Informatikk, Universitetet i Bergen, 2009)
• Polar permutation graphs, T. Ekim, P. Heggernes, D. Meister
  (report no. 385, Institutt for Informatikk, Universitetet i Bergen, 2009)