2011

Monographs, Textbooks, and Chapters in Books

• J. Hromkovič:
  Berechenbarkeit. Logik, Argumentation, Rechner und Assembler, Unendlichkeit, Grenzen der Automatisierbarkeit.
  Vieweg+Teubner 2011, ISBN: 978-3-8348-1509-5.
  
  
• J. Hromkovič:
  Theoretische Informatik. Formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie.
  Vierte Auflage, Vieweg+Teubner 2010, ISBN: 978-3-8348-0650-5.

Editorial Work

• I. Cerná, T. Gyimóthy, J. Hromkovič, K. G. Jeffery, R. Královič, M. Vukolic, S. Wolf:
  Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011).
  Nový Smokovec, Slovakia, January 22-28, Springer 2011, ISBN: 978-3-642-24721-7.

Publications in Refereed Books and Proceedings

• R. Královič:
  On the power of randomization for one-way finite automata.
  Proc. of the 3rd Workshop on Non-Classical Models for Automata and Applications (NCMA 2011), 2011, pp. 165-177.
  
  
• J. Hosoda, J. Hromkovič, T. Izumi, H. Ono, M. Steinová, K. Wada:
  On the approximability of minimum topic connected overlay and its special instances.
  Proc. of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), LNCS 6907, Springer 2011, pp. 376-387.
  
  
• D. Komm, R. Královič:
  Advice complexity and barely random algorithms.
  Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), LNCS 6543, Springer 2011, pp. 332-343.
  
  
• H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič:
  On the advice complexity of the k-server problem.
  Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Part I, LNCS 6755, Springer 2011, pp. 207-218.
  
  
• M. Steinová:
  Brief announcement: On the hardness and approximation of minimum topic-connected overlay.
  Proc. of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011), ACM 2011, pp. 295-296.
  
  
• L. Keller, B. Scheuner, G. Serafini, B. Steffen:
  A short introduction to classical cryptology as a way to motivate high school students for informatics.
  Proc. of the 5th International Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2011), LNCS 7013, Springer 2011, pp. 189-200.
  
  
• G. Serafini:
  Teaching programming at primary schools: Visions, experiences, and long-term research prospects.
  Proc. of the 5th International Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2011), LNCS 7013, Springer 2011, pp. 143-154.
  
  
• M. Dahinden, L. Fässler:
  Monitoring blended learning environments  based  on performance data.
  Proc. of the IADIS International Conference e-Learning, Vol. 1, 2011, pp. 401-408.
  

Publications in Refereed Journals

• D. Bilò, H.-J. Böckenhauer, D. Komm, R. Královič, T. Mömke, S. Seibert, A. Zych:
  Reoptimization of the shortest common superstring problem.
  Algorithmica 61(2), 2011, pp. 227-251.
  
  
• D. Komm, R. Královič:
  Advice complexity and barely random algorithms.
  Theoretical Informatics and Applications (RAIRO) 45(2), 2011, pp. 249-267.
  
  
• H.-J. Böckenhauer, J. Hromkovič, A. Sprock:
  On the hardness of reoptimization with multiple given solutions.
  Fundamenta Informaticae 110, 2011, pp. 59-76.
  
  
• J. Hromkovič, G. Schnitger:
  Ambiguity and communication.
  Theory of Computing Systems 48(3), 2011, pp. 517-534.
  
  
• D. Komm:
  Teaching the concept of online algorithms.
  Olympiads in Informatics 5, 2011, pp. 58-71.

Invited Publications in Books and Proceedings

• H.-J. Böckenhauer, J. Hromkovič, A. Sprock:
  Knowing all optimal solutions does not help for TSP reoptimization.
  In: J. Kelemen, A. Kelemenová (eds.): Computation, Cooperation and Life - Essays Dedicated to Gheorghe Păun on the Occasion of His 60th Birthday, LNCS 6610, Springer Verlag 2011, pp. 7-15.
  
  
• H.-J. Böckenhauer, J. Hromkovič, T. Mömke:
  Improved approximations for hard optimization problems via problem instance classification.
  In: C. S. Calude, G. Rozenberg, A. Salomaa (eds.): Rainbow of Computer Science - Essays Dedicated to Hermann Maurer on the Occasion of His 70th Birthday, LNCS 6570, Springer Verlag 2011, pp. 3-19.
  
  
• J. Hromkovič, B. Steffen:
  Why teaching informatics in schools is as important as teaching mathematics and natural sciences.
  Proc. of the 5th International Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2011), LNCS 7013, Springer 2011, pp. 21-30.

Other Publications

• S. Krug:
  Analysis of approximation algorithms for the traveling salesman problem in near-metric graphs.
  Technical Report 728, ETH Zürich, 2011.
  
  
• D. Komm, R. Královič, T. Mömke:
  On the advice complexity of the set cover problem.
  Technical Report 738, ETH Zurich, 2011.
  
  
• H.-J. Böckenhauer, D. Komm, R. Královič, P. Rossmanith:
  On the advice complexity of the knapsack problem.
  Technical Report 740, ETH Zurich, 2011.
  
  
• L. Fässler:
  Gymnasialer ICT-Unterricht im digitalen Datenlabor.
  Technical Report 743, ETH Zurich, 2011.