Publikationen

Tobias Ganzow

2012

  • T. Ganzow. Definability and Model Checking: The Role of Orders and Compositionality. PhD thesis, RWTH Aachen University, 2012.                                 

2010

  • T. Ganzow and Ł. Kaiser. New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures. In Proceedings of the 19th Annual Conference of the European Association for Computer Science Logic, CSL 2010 (A. Dawar and H. Veith, Eds.), vol. 6247 of Lecture Notes in Computer Science, pp. 366–380. Springer, 2010.                                 

2008

  • A. Dermaku, T. Ganzow, G. Gottlob, B. J. McMahan, N. Musliu, and M. Samer. Heuristic Methods for Hypertree Decomposition. In Proceedings of the 7th Mexican International Conference on Artificial Intelligence, MICAI 2008, pp. 1–11, 2008.             
  • T. Ganzow and S. Rubin. Order-Invariant MSO is Stronger than Counting MSO in the Finite. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008 (S. Albers and P. Weil, Eds.), pp. 313–324, 2008.