Homepage of Dennis Komm

DBLP ORCiD Google Scholar

News

2019-07-15 ARDA 2019
The program for ARDA 2019 has now been compiled and published.
ARDA 2019 website
2019-07-10 Informatik-Spektrum
I have contributed a number of articles to the most recent issue of Informatik-Spektrum.
Informatik-Spektrum website
2019-04-25 SOFSEM 2020
I am in the program committee of SOFSEM 2020 taking place in Cyprus. The paper submission is now open.
SOFSEM 2020 website
Dennis Komm

Welcome to my personal homepage.

I studied computer science (with minor Psychology) at RWTH Aachen and Information Technology at QUT Brisbane, receiving my Master in 2008 and my PhD from ETH Zurich in 2012. After that, I stayed at ETH as postdoc, and became lecturer in 2013. Additionally, I teach at other universities, for instance, at the University of Zurich, where I regularly read the lecture Foundations of Computing II since 2014. In 2016, I was offered a position as assistant teaching professor at the University of Illinois, but I had to decline due to personal reasons. Since 2018, I work as a lecturer at PH Graubünden additionally to teaching at ETH.

My major focus is on how to nicely communicate some of the basic ideas and concepts of computer science to students of all ages. As a result, I teach at many different levels, starting at primary school. Complementing this, I give further education courses for computer science teachers.

In theoretical computer science, my main topics of interest include approximation algorithms for hard optimization problems, reoptimization of optimization problems, advice complexity in different setups and environments.

Besides that, I enjoy hiking, snowboarding, traveling, LATEX, Linux, Perl, and Python.

Some more facts:

Curriculum Vitæ

since 2018 Lecturer at PH Graubünden
since 2013 Lecturer at ETH Zürich
since 2010 Member of Ausbildungs- und Beratungszentrum für Informatikunterricht, Switzerland
2018 Lecturer at Zurich University of Applied Sciences
2014 – 2019 Lecturer at University of Zurich
2012 – 2013 Postdoctoral researcher at ETH Zürich
2009 – 2012 Board member of Engineers without borders Switzerland
2008 – 2012 PhD Studies of Computer Science at ETH Zürich, Switzerland
2006 Studies of Information Technology at Queensland University of Technology, Australia
2002 – 2008 Studies of Computer Science at RWTH Aachen University, Germany

Since February 2013, I am voted the representative of the “akademischer Mittelbau” at the Conference on Education in Didactics at ETH.

In 2010, 2014, and 2018, I was an expert for Schweizer Jugend forscht.

In February 2010, I was visitor at King's College (with Kathleen Steinhöfel), in June 2011 at RWTH Aachen University (with Peter Rossmanith), in March 2015 at Comenius University (with Rastislav Královič), and in July 2018 at Stanford University (with Gio Wiederhold).

Back in high school
Back in high school
Hiking
Hiking
Studies in Aachen
Studies in Aachen
Studies in Brisbane
Studies in Brisbane

This year, I chair ARDA 2019, an MFCS satellite workshop on advances in reoptimization and dynamic algorithms.

Also, I was (still am) member of the program committees of

Furthermore, I reviewed submissions to Algorithmica, Algorithmic Operations Research, Fundamenta Informaticæ, Information Processing Letters, International Journal of Foundations of Computer Science, Journal of Scheduling, Parallel Processing Letters, RAIRO – Theoretical Informatics and Applications, Theoretical Computer Science, Theory of Computing Systems, CIAA, COCOA, COCOON, CSR, DLT, ESA, ICALP, IFIP TCS, ISAAC, ISSEP, LATA, MEMICS, MFCS, SEA, SOFSEM, WAOA, and WG.

Teaching

I am giving a Python programming course with special focus on preparing for the Swiss Olympiad in Informatics.

In summer 2014, I gave a course on computational biology at Volkshochschule Zürich; lecture notes (in German): Summary 1, 2 (Handout), 3 (Handout), and 4.

Since 2010, together with colleagues from the ABZ, I gave some programming lessons for elementary school students at, e.g., Kantonsschule Solothurn, Primarschule Domat-Ems, Primarschule Saas im Prättgau, and Schweizerische Alpine Mittelschule Davos.

Courses at ETH

Autumn 2019 Digitale Medizin I: Einführung in die Programmierung
Spring 2019 Programmieren und Problemlösen
Spring 2016, 2018 Methoden zum Entwurf von zufallsgesteuerten Algorithmen
Spring 2015 Algorithmik für schwere Probleme
Autumn 2015 Einsatz von Informatikmitteln
Autumn 2014 – 2016 Grundlagen der Informatik
Spring 2013 – 2019 Approximations- und Online-Algorithmen; download lecture notes (in German)

Courses at Other Universities

Spring 2019 Lernressourcen nutzen at PH Graubünden
Spring 2018 Algorithmen für schwere Optimierungsprobleme at ZHAW School of Engineering
Autumn 2014 – 2019 Foundations of Computing II at the University of Zurich; download lecture notes

Supervised Theses

You can use a template to typeset your bachelor's, master, or PhD thesis (example and resulting PDF).

Co-Refereed Theses

Publications

You can query DBLP for an overview of my publications; alternatively, you can check my Google Scholar page.

Just let me know if you are interested in any of the full papers.

An introduction to online computation: determinism, randomization, adviceI have somewhat recently written a book on online computation, which you can now order at Amazon.

An Introduction to Online Computation — Determinism, Randomization, Advice.

From the cover: “This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.”

Contains 101 exercises with solutions. ISBN: 978-3-319-42747-8, hardcover, Springer-Verlag 2016, 349 pages.

Book Chapter

  1. H.-J. Böckenhauer, J. Hromkovič, and D. Komm:
    Reoptimization of hard optimization problems.
    In AAM Handbook of Approximation Algorithms and Metaheuristics, second edition, chapter 25, Chapman and Hall/CRC 2018.

Editorial Work

  1. H.-J. Böckenhauer, D. Komm, and W. Unger:
    Adventures Between Lower Bounds and Higher Altitudes — Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday.
    Lecture Notes in Computer Science 11011, Springer-Verlag 2018.
    Order at Amazon.
  2. H.-J. Böckenhauer, J. Hromkovič, and D. Komm:
    Approximation and Parameterization.
    Special issue of MDPI Algorithms 2018.
    Available online via mdpi.com.

Invited Publications in Books and Proceedings

  1. J. Hromkovič, D. Komm, R. Lacher, and J Staub:
    Teaching with LOGO philosophy
    Encyclopedia of Education and Information Technologies.To appear, 2019.
  2. J. Hromkovič and D. Komm:
    Can solving short tasks be an essential part of constructionist learning?
    Constructivist Foundations 14(5), open commentary on V. Dagienė , G. Futschek, and G. Stupurienė: Creativity in solving short tasks for learning computational thinking, 2019.
    PDF available online at constructivist.info/14/3/.
  3. H.-J. Böckenhauer, T. Kohn, D. Komm, and G. Serafini:
    An elementary approach towards teaching dynamic programming.
    Bulletin of the EATCS 128, The Education Column, 2019.
    PDF available online at bulletin.eatcs.org/index.php/beatcs/article/view/587/, © European Association for Theoretical Computer Science.
  4. T. Kohn and D. Komm:
    Denn sie wissen nicht, was sie programmieren.
    Informatik Spektrum 42(2):112–117, 2019.
  5. U. Hauser, D. Komm, and G. Serafini:
    Wie Mathematik und Informatik voneinander profitieren können – Teil 1: Abstraktionsfähigkeit.
    Informatik Spektrum 42(2):118–123, 2019.
  6. U. Hauser, D. Komm, and G. Serafini:
    Wie Mathematik und Informatik voneinander profitieren können – Teil 2: Variation der Problemstellung und Modularisierung.
    Informatik Spektrum 42(2):124–129, 2019.
  7. U. Hauser and D. Komm:
    Interdisciplinary education in mathematics and informatics at swiss high schools.
    Bulletin of the EATCS 126, The Education Column, 2018.
    PDF available online at bulletin.eatcs.org/index.php/beatcs/article/view/552/, © European Association for Theoretical Computer Science.
  8. J. Hromkovič, T. Kohn, D. Komm, and G. Serafini:
    Algorithmic thinking from the start.
    Bulletin of the EATCS 121, The Education Column, 2017.
    PDF available online at bulletin.eatcs.org/index.php/beatcs/article/view/478/, © European Association for Theoretical Computer Science.
  9. H.-J. Böckenhauer, J. Hromkovič, and D. Komm:
    A technique to obtain hardness results for randomized online algorithms.
    In Computing with New Resources: Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday, volume 8808 of Lecture Notes in Computer Science, Springer-Verlag 2014, pages 264–276.
    PDF available online via SpringerLink, © Springer-Verlag.
  10. H.-J. Böckenhauer, J. Hromkovič, D. Komm, R. Královič, and P. Rossmanith:
    On the power of randomness versus advice in online computation.
    In Languages Alive: Essays Dedicated to J├╝rgen Dassow on the Occasion of His 65th Birthday, volume 7300 of Lecture Notes in Computer Science, Springer-Verlag 2012, pages 30–43.
    PDF available online via SpringerLink, © Springer-Verlag.

Publications in Refereed Journals

  1. E. Burjons, D. Komm, and M. Schöngens:
    The k-server problem with advice in d dimensions and on the sphere.
    Algorithmica 81(5), 2019, pages 1859–1880.
  2. M. P. Bianchi, H.-J. Böckenhauer, T. Brülisauer, D. Komm, and B. Palano:
    Online minimum spanning tree with advice.
    International Journal of Foundations of Computer Science 29(4), 2018, pages 505–527.
  3. S. Dobrev, J. Edmonds, D. Komm, R. Královič, R. Královič, S. Krug, and T. Mömke:
    Improved analysis of the online set cover problem with advice.
    Theoretical Computer Science 689, 2017, pages 96–107.
  4. H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič, and T. Mömke:
    Online algorithms with advice: the tape model.
    Information and Computation 254, 2017, pages 59–83.
  5. H.-J. Böckenhauer, D. Komm, R. Královič, and R. Královič:
    On the advice complexity of the k-server problem.
    Journal of Computer and System Sciences 86, 2017, pages 159–170.
  6. H.-J. Böckenhauer, J. Hromkovič, D. Komm, S. Krug, J. Smula, and A. Sprock:
    The string guessing problem as a method to prove lower bounds on the advice complexity.
    Theoretical Computer Science 554, 2014, pages 95–108.
  7. H.-J. Böckenhauer, D. Komm, R. Královič, and P. Rossmanith:
    The online knapsack problem: advice and randomization.
    Theoretical Computer Science 527, 2014, pages 61–72.
  8. D. Komm and R. Královič:
    Advice complexity and barely random algorithms.
    Theoretical Informatics and Applications (RAIRO ITA) 45(2), 2011, pages 249–267.
  9. D. Bilò, H.-J. Böckenhauer, D. Komm, R. Královič, T. Mömke, S. Seibert, and A. Zych:
    Reoptimization of the shortest common superstring problem.
    Algorithmica 61(2), 2011, pages 227–251.
  10. H.-J. Böckenhauer and D. Komm:
    Reoptimization of the metric deadline TSP.
    Journal of Discrete Algorithms 8, 2010, pages 87–100.

Publications in Refereed Books and Proceedings

  1. E. Burjons, F. Frei, E. Hemaspaandra, D. Komm, and D. Wehner:
    Finding optimal solutions with neighborly help.
    In Proc. of the 44th International Symposium on Mathematical Foundations of Computer Sciences (MFCS 2019), volume 138 of Leibniz International Proceedings in Informatics, Springer-Verlag 2019, pages 78:1–78:14.
    PDF available online via drops.dagstuhl.de, © Schloss Dagstuhl—Leibniz-Zentrum für Informatik.
  2. H.-J. Böckenhauer, N.C. Benz, and D. Komm:
    Call admission problems on trees with advice (Extended abstract).
    In Proc. of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), volume 11638 of Lecture Notes in Computer Science, Springer-Verlag 2019, pages 108–121.
    PDF available online via SpringerLink, © Springer-Verlag.
  3. T. Kohn and D. Komm:
    Teaching programming and algorithmic complexity with tangible machines.
    In Proc. of the 11th International Conference on Informatics in Schools (ISSEP 2018), volume 11169 of Lecture Notes in Computer Science, Springer-Verlag 2018, pages 68–83.
    PDF available online via SpringerLink, © Springer-Verlag.
  4. H.-J. Böckenhauer, D. Komm, and R. Wegner:
    Call admission problems on grids with advice (Extended abstract).
    In Proc. of the 16th Workshop on Approximation and Online Algorithms (WAOA 2018), volume 11312 of Lecture Notes in Computer Science, Springer-Verlag 2018, pages 118–133.
    PDF available online via SpringerLink, © Springer-Verlag.
  5. E. Burjons, D. Komm, and M. Schöngens:
    The k-server problem with advice in d dimensions and on the sphere.
    In Proc. of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of Lecture Notes in Computer Science, Springer-Verlag 2018, pages 155–166.
    PDF available online via SpringerLink, © Springer-Verlag.
  6. J. Hromkovič, T. Kohn, D. Komm, and G. Serafini:
    Combining the power of Python with the simplicity of Logo for a sustainable computer science education.
    In Proc. of the 9th International Conference on Informatics in Secondary Schools (ISSEP 2016), volume 9973 of Lecture Notes in Computer Science, Springer-Verlag 2016, pages 155–166.
    PDF available online via SpringerLink, © Springer-Verlag.
  7. J. Clemente, J. Hromkovič, D. Komm, and Ch. Kudahl:
    Advice complexity of the online search problem.
    In Proc. of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), volume 9843 of Lecture Notes in Computer Science, Springer-Verlag 2016, pages 203–212.
    PDF available online via SpringerLink, © Springer-Verlag.
  8. D. Komm, R. Královič, R. Královič, and Ch. Kudahl:
    Advice complexity of the online induced subgraph problem.
    In Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics, pages 59:1–59:13.
    PDF available online via drops.dagstuhl.de, © Schloss Dagstuhl—Leibniz-Zentrum für Informatik.
  9. S. Dobrev, J. Hromkovič, D. Komm, R. Královič, R. Královič, and T. Mömke:
    The complexity of paging against a probabilistic adversary.
    In Proc. of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), volume 9587 of Lecture Notes in Computer Science, Springer-Verlag 2016, pages 265–276.
    PDF available online via SpringerLink, © Springer-Verlag.
  10. M. P. Bianchi, H.-J. Böckenhauer, T. Brülisauer, D. Komm, and B. Palano:
    Online minimum spanning tree with advice (Extended abstract).
    In Proc. of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), volume 9587 of Lecture Notes in Computer Science, Springer-Verlag 2016, pages 195–207.
    PDF available online via SpringerLink, © Springer-Verlag.
  11. D. Komm, R. Královič, R. Královič, and J. Smula:
    Treasure hunt with advice.
    In Proc. of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015), volume 9439 of Lecture Notes in Computer Science, Springer-Verlag 2015, pages 328–341.
    PDF available online via SpringerLink, © Springer-Verlag.
  12. H. Gebauer, D. Komm, R. Královič, R. Královič, and J. Smula:
    Disjoint path allocation with sublinear advice.
    In Proc. of the 21st International Conference on Computing and Combinatorics (COCOON 2015), volume 9198 of Lecture Notes in Computer Science, Springer-Verlag 2015, pages 417–429.
    PDF available online via SpringerLink, © Springer-Verlag.
  13. D. Komm, R. Královič, R. Královič, and T. Mömke:
    Randomized online algorithms with high probability guarantees.
    In Proc. of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), volume 25 of Leibniz International Proceedings in Informatics, pages 470–481.
    PDF available online via drops.dagstuhl.de, © Schloss Dagstuhl—Leibniz-Zentrum für Informatik.
  14. H.-J. Böckenhauer, J. Hromkovič, D. Komm, S. Krug, J. Smula, and A. Sprock:
    The string guessing problem as a method to prove lower bounds on the advice complexity (Extended abstract).
    In Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON 2013), volume 7936 of Lecture Notes in Computer Science, Springer-Verlag 2013, pages 493–505.
    PDF available online via SpringerLink, © Springer-Verlag.
  15. D. Komm, R. Královič, and T. Mömke:
    On the advice complexity of the set cover problem.
    In Proc. of the 7th International Computer Science Symposium in Russia (CSR 2012), volume 7353 of Lecture Notes in Computer Science, Springer-Verlag 2012, pages 241–252.
    PDF available online via SpringerLink, © Springer-Verlag.
  16. H.-J. Böckenhauer, D. Komm, R. Královič, and P. Rossmanith:
    On the advice complexity of the knapsack problem.
    In Proc. of the 10th Latin American Symposium on Theoretical Informatics (LATIN 2012), volume 7256 of Lecture Notes in Computer Science, Springer-Verlag 2012, pages 61–72.
    PDF available online via SpringerLink, © Springer-Verlag.
  17. H.-J. Böckenhauer, D. Komm, R. Královič, and R. Královič:
    On the advice complexity of the k-server problem.
    In Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), volume 6755 of Lecture Notes in Computer Science, Springer-Verlag 2011, pages 207–218.
    PDF available online via SpringerLink, © Springer-Verlag.
  18. D. Komm and R. Královič:
    Advice complexity and barely random algorithms.
    In Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), volume 6543 of Lecture Notes in Computer Science, Springer-Verlag 2011, pages 332–343.
    PDF available online via SpringerLink, © Springer-Verlag.
  19. L. Keller, D. Komm, G. Serafini, A. Sprock, and B. Steffen:
    Teaching public-key cryptography in school.
    In Proc. of the 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010), volume 5941 of Lecture Notes in Computer Science, Springer-Verlag 2010, pages 112–123.
    PDF available online via SpringerLink, © Springer-Verlag.
  20. H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič, and T. Mömke:
    On the advice complexity of online problems (Extended abstract).
    In Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), volume 5878 of Lecture Notes in Computer Science, Springer-Verlag 2009, pages 331–340.
    PDF available online via SpringerLink, © Springer-Verlag.
  21. D. Bilò, H.-J. Böckenhauer, D. Komm, R. Královič, T. Mömke, S. Seibert, and A. Zych:
    Reoptimization of the shortest common superstring problem (Extended abstract).
    In Proc. of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), volume 5577 of Lecture Notes in Computer Science, Springer-Verlag 2009, pages 78–91.
    PDF available online via SpringerLink, © Springer-Verlag.
  22. H.-J. Böckenhauer and D. Komm:
    Reoptimization of the metric deadline TSP (Extended abstract).
    In Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), volume 5162 of Lecture Notes in Computer Science, Springer-Verlag 2008, pages 156–167.
    PDF available online via SpringerLink, © Springer-Verlag.

Teaching Material

  1. U. Hauser, J. Hromkovič, T. Kohn, D. Komm, and G. Serafini:
    Programmieren mit Python.
    Skript zur Tagung des Kaders von Bundesrat Johann Schneider-Ammann, 2018.
    PDF available online at www.abz.inf.ethz.ch.
  2. D. Komm:
    An introduction to the theory of computing.
    Lecture Notes, University of Zurich, 2017.
    PDF available online.
  3. L. Fässler, M. Dahinden, D. Komm, and D. Sichau:
    Einführung in die Programmierung mit Python und Matlab.
    Begleitunterlagen zum Onlinekurs und zur Vorlesung, 2015.
    Order at Amazon.
  4. D. Komm:
    Eine Einführung in Online-Algorithmen.
    Lecture Notes, ETH Zürich, 2017.
    PDF available online.
  5. H.-J. Böckenhauer, D. Komm, and J. Hromkovič:
    Programmieren mit LOGO für Fortgeschrittene.
    Lecture Notes, ETH Zürich, 2015.
    PDF available online at www.abz.inf.ethz.ch (the basics can be found here).
  6. H.-J. Böckenhauer, D. Komm, and J. Hromkovič:
    Programmieren mit LOGO — Projekte.
    Lecture Notes, ETH Zürich, 2015.
    PDF available online at www.abz.inf.ethz.ch.

Technical Reports

  1. E. Burjons, F. Frei, E. Hemaspaandra, D. Komm, and D. Wehner:
    Finding optimal solutions with neighborly help.
    CoRR abs/1906.10078, 2019.
    PDF available online at arxiv.org/abs/1906.10078.
  2. J. Clemente, J. Hromkovič, D. Komm, and Ch. Kudahl:
    Advice complexity of the online search problem.
    CoRR abs/1612.09299, 2016.
    PDF available online at arxiv.org/abs/1612.09299.
  3. D. Komm, R. Královič, R. Královič, and Ch. Kudahl:
    Advice complexity of the online induced subgraph problem.
    CoRR abs/1512.05996, 2015.
    PDF available online at arxiv.org/abs/1512.05996.
  4. H.-J. Böckenhauer, S. Geulen, D. Komm, and W. Unger:
    Constructing randomized online algorithms from algorithms with advice.
    Technical Report 48298, 2015.
    PDF available online at e-collection.library.ethz.ch/view/eth:48298.
  5. D. Komm, R. Královič, R. Královič, and T. Mömke:
    Randomized online computation with high probability guarantees.
    CoRR abs/1302.2805, 2013.
    PDF available online at arxiv.org/abs/1302.2805.
  6. H.-J. Böckenhauer, J. Hromkovič, D. Komm, S. Krug, J. Smula, and A. Sprock:
    The string guessing problem as a method to prove lower bounds on the advice complexity.
    Electronic Colloquium on Computational Complexity, TR12-162, 2012.
    PDF available online at eccc.hpi-web.de/report/2012/162.
  7. H.-J. Böckenhauer, D. Komm, R. Královič, and P. Rossmanith:
    On the advice complexity of the knapsack problem.
    Technical Report 740, ETH Zürich, 2011.
    PDF available online at e-collection.library.ethz.ch.
  8. D. Komm, R. Královič, and T. Mömke:
    On the advice complexity of the set cover problem.
    Technical Report 738, ETH Zürich, 2011.
    PDF available online at e-collection.library.ethz.ch.
  9. H.-J. Böckenhauer, D. Komm, R. Královič, and R. Královič:
    On the advice complexity of the k-server problem.
    Technical Report 703, ETH Zürich, 2010.
    PDF available online at e-collection.library.ethz.ch.
  10. D. Komm and R. Královič:
    Advice complexity and barely random algorithms.
    Technical Report 684, ETH Zürich, 2010.
    PDF available online at e-collection.library.ethz.ch.
  11. H.-J. Böckenhauer, D. Komm, R. Královič, R. Královič, and T. Mömke:
    Online algorithms with advice.
    Technical Report 614, ETH Zürich, 2009.
    PDF available online at e-collection.library.ethz.ch.

Other Publications

  1. D. Komm and T. Kohn:
    An introduction to running time analysis for an SOI workshop.
    Olympiads in Informatics 11:77–86, 2017.
    PDF available online at www.ioinformatics.org/oi/shtm/v11_2017_77_86.shtml.
  2. J. Hromkovič, T. Kohn, D. Komm, and G. Serafini:
    Examples of algorithmic thinking in programming education.
    Olympiads in Informatics 10:111–124, 2016.
    PDF available online at www.ioinformatics.org/oi/shtm/v10_2016_111_124.shtml.
  3. J. Hromkovič, L. Keller, D. Komm, G. Serafini, and B. Steffen:
    Entdeckendes Lernen am Beispiel fehlerkorrigierender Codes.
    Log-in 168:50–55, 2011.
  4. D. Komm:
    Teaching the concept of online algorithms.
    Olympiads in Informatics 5:58–71, 2011.
    PDF available online at www.ioinformatics.org/oi_content_v5.shtml.
  5. H. Bruderer and D. Komm:
    Programmieren und denkend Probleme lösen.
    Bildung Schweiz 11a:31 Sonderheft Computer und Internet, 2009.
    PDF available online at www.lch.ch/publikationen/bildung-schweiz.

Theses

  1. D. Komm:
    Advice and randomization in online computation.
    PhD Thesis, ETH Zürich, 2012. Supervisor: J. Hromkovič; Co-Referees: P. Widmayer, G. Schnitger. Defended on 21.12.2011.
    PDF available online at www.research-collection.ethz.ch/handle/20.500.11850/72815.
  2. D. Komm:
    Optimierung und Reoptimierung des metrischen Traveling-Salesman-Problems mit Deadlines.
    Diploma Thesis, RWTH Aachen University, 2008. Supervisor: P. Rossmanith.

Some Talks and Workshops

Photos

Some visual impressions of the past years; these are snapshots.

Brisbane, Australia, 2006
Brisbane, Australia, 2006
Rohan, New Zealand, 2006
Rohan, New Zealand, 2006
Pitztal, Austria, 2008
Pitztal, Austria, 2008
Venice, Italy, 2009
Venice, Italy, 2009
Venice, Italy, 2009
Venice, Italy, 2009
Venice, Italy, 2009
Venice, Italy, 2009
Davos, Switzerland, 2009
Davos, Switzerland, 2009
Davos, Switzerland, 2009
Davos, Switzerland, 2009
Rottweil, Germany, 2010
Rottweil, Germany, 2010
Königsfeld, Germany, 2010
Königsfeld, Germany, 2010
Königsfeld, Germany, 2010
Königsfeld, Germany, 2010
Königsfeld, Germany, 2010
Königsfeld, Germany, 2010
Vienna, Austria, 2010
Vienna, Austria, 2010
Bratislava, Slovakia, 2010
Bratislava, Slovakia, 2010
Bratislava, Slovakia, 2010
Bratislava, Slovakia, 2010
Europapark Rust, Germany, 2010
Europapark Rust, Germany, 2010
Andermatt, Switzerland, 2010
Andermatt, Switzerland, 2010
Rome, Italy, 2010
Rome, Italy, 2010
Rome, Italy, 2010
Rome, Italy, 2010
Cologne, Germany, 2011
Cologne, Germany, 2011
Zermatt, Switzerland, 2011
Zermatt, Switzerland, 2011
Highlands, Scotland, 2011
Highlands, Scotland, 2011
Highlands, Scotland, 2011
Highlands, Scotland, 2011
Stockholm, Sweden, 2011
Stockholm, Sweden, 2011
High Fens, Belgium, 2011
High Fens, Belgium, 2011
Zürich, Switzerland, 2011
Zürich, Switzerland, 2011
Zürich, Switzerland, 2012
Zürich, Switzerland, 2012
Arequipa, Peru, 2012
Arequipa, Peru, 2012
Colca Canyon, Peru, 2012
Colca Canyon, Peru, 2012
Colca Canyon, Peru, 2012
Colca Canyon, Peru, 2012
Tuscany, Italy, 2012
Tuscany, Italy, 2012
Tuscany, Italy, 2012
Tuscany, Italy, 2012
St. Petersburg, Russia, 2012
St. Petersburg, Russia, 2012
Provence, France, 2012
Provence, France, 2012
Paris, France, 2012
Paris, France, 2012
California, USA, 2013
California, USA, 2013
California, USA, 2013
California, USA, 2013
Death Valley, USA, 2013
Death Valley, USA, 2013
Locarno, Switzerland, 2013
Locarno, Switzerland, 2013
Malta, 2013
Malta, 2013
Malta 2013
Malta, 2013
Mallorca, 2014
Mallorca, 2014
Copenhagen, Denmark, 2014
Copenhagen, Denmark, 2014
Lachen, Switzerland, 2014
Lachen, Switzerland, 2014
Rhône Glacier, Switzerland, 2014
Rhône Glacier, Switzerland, 2014
Valais, Switzerland, 2014
Valais, Switzerland, 2015
Granada, Spain, 2015
Granada, Spain, 2015
Córdoba, Spain, 2015
Córdoba, Spain, 2015
California, USA, 2015
California (Going going, back back...)
Nevada, USA, 2014
Nevada, USA, 2015
Zion National Park, USA, 2015
Zion National Park, USA, 2015
Lower Antelope Canyon, USA, 2015
Lower Antelope Canyon, USA, 2015
Chinese Wall, China, 2015
Chinese Wall, China, 2015
Pyrenees, Spain, 2015
Pyrenees, Spain, 2015
Whitehaven Beach, Australia, 2016
Whitehaven Beach, Australia, 2016
Piedmont, Italy, 2016
Piedmont, Italy, 2016
Bandera, USA, 2016
Bandera, USA, 2016
Helsinki, Finland, 2016
Helsinki, Finland, 2016
Gindelwald, Switzerland, 2017
Grindelwald, Switzerland, 2017
Gordes, France, 2017
Gordes, France, 2017
Gordes, France, 2017
Gordes, France, 2017
Dolomites, Italy, 2018
Dolomites, Italy, 2018
Rottweil, Germany, 2019
Rottweil, Germany, 2019