2010

Monographs, Textbooks, and Chapters in Books

• J. Hromkovič:
  Теоретическaя информaтикa (Theoretical Computer Science).
  Bhv-Verlag St. Petersburg, 2010, ISBN: 978-5-9775-0406-5 (Russian).
  
  
• K. Freiermuth, J. Hromkovič, L. Keller, B. Steffen:
  Einführung in die Kryptologie.
  Vieweg+Teubner 2010, ISBN: 978-3-8348-1005-2.
  

Editorial Work

• J. Hromkovič, R. Královič, J. Vahrenhold:
  Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010).
  Zurich, Switzerland, January 13-15, volume 5941, Springer 2010, ISBN: 978-3-642-11375-8.
  
  
• J. Hromkovič:
  Special Issue "Hardest Boolean Functions and O.B. Lupanov".
  Fundamenta Informaticae 104(3), IOS Press, 2010.
  

Publications in Refereed Journals

• H.-J. Böckenhauer, M. Forišek, J. Oravec, B. Steffen, K. Steinhöfel, M. Steinová:
  The uniform minimum-ones 2SAT problem and its application to haplotype classification.
  Theoretical Informatics and Applications (RAIRO) 44, 2010, pp. 363-377.
  
  
• H.-J. Böckenhauer, D. Komm:
  Reoptimization of the metric deadline TSP.
  Journal of Discrete Algorithms 8, 2010, pp. 87-100.
  
  
• J. Hromkovič, G. Schnitger:
  On probabilistic pushdown automata.
  Information and Computation 208(8), 2010, pp. 982-995.
  
  
• M. Steinová:
  Approximability of the minimum Steiner cycle problem.
  Computing and Informatics 29(6), 2010, pp. 1349-1357.
  

Publications in Refereed Books and Proceedings

• H.-J. Böckenhauer, K. Freiermuth, J. Hromkovič, T. Mömke, A. Sprock, B. Steffen:
  The Steiner tree reoptimization problem with sharpened triangle inequality.
  Proc. of the 7th International Conference on Algorithms and Complexity (CIAC 2010), LNCS 6078, Springer 2010, pp. 180-191.
  
  
• H.-J. Böckenhauer, R. Klasing, T. Mömke, M. Steinová:
  Improved approximations for TSP with simple precedence constraints.
  Proc. of the 7th International Conference on Algorithms and Complexity (CIAC 2010), LNCS 6078, Springer 2010, pp. 61-72.
  
  
• L. Keller, D. Komm, G. Serafini, A. Sprock, B. Steffen:
  Teaching public-key cryptography in school.
  Proc. of the 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010), volume 5941 of LNCS, Springer 2010, pp. 112-123.
  
  
• M. Forišek, M. Steinová:
  Didactic games for teaching information theory.
  Proc. of the 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010), volume 5941 of LNCS, Springer 2010, pp. 86-99.
  
  
• M. Steinová, J. Šišková:
  Programming camps: letting children discover the computer science.
  Proc. of the 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010), volume 5941 of LNCS, Springer 2010, pp. 170-181.||

Invited Contributions in Books and Proceedings

• J. Hromkovič:
  Algorithmics - Is there hope for a unified theory.
  Proc. of the 5th International Computer Science Symposium in Russia (CSR 2010), volume 6072 of LNCS, Springer 2010, pp. 181-194.
  
  
• J. Hromkovič, R. Královič, R. Královič:
  Information complexity of online problems.
  Proc. of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), volume 6281 of LNCS, Springer 2010, pp. 24-36.

Other Publications

• H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič:
  On the advice complexity of the k-server problem.
  Technical Report 703, ETH Zurich, 2010.
  
  
• H.-J. Böckenhauer, K. Freiermuth, J. Hromkovič, T. Mömke, A. Sprock, B. Steffen:
  The Steiner tree reoptimization problem with sharpened triangle inequality.
  Technical Report 658, ETH Zurich, 2010.
  
  
• H.-J. Böckenhauer, J. Oravec, B. Steffen, K. Steinhöfel, M. Steinová:
  The uniform minimum-ones 2SAT problem and its application to haplotype classification.
  Technical Report 673, ETH Zurich, 2010.
  
  
• D. Komm, R. Královič:
  Advice complexity and barely random algorithms.
  Technical Report 684, ETH Zurich, 2010.
  
  
• M. Steinová:
  On the approximation of special instances of minimum topic-connected overlay.
  Technical Report 693, ETH Zurich, 2010.