Creating and Testing Textbooks for Secondary Schools. - Karin Freiermuth; Juraj Hromkovic; Björn Steffen (ISSEP, 2008)

The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Karin Freiermuth; Juraj Hromkovic; Tobias Mömke; Andreas Sprock; Björn Steffen (CIAC, 2010)

Teaching Public-Key Cryptography in School. - Lucia Keller; Dennis Komm; Giovanni Serafini; Andreas Sprock; Björn Steffen (ISSEP, 2010)

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. - Hans-Joachim Böckenhauer; Michal Forisek; Ján Oravec; Björn Steffen; Kathleen Steinhöfel; Monika Steinová (RAIRO Theor. Informatics Appl., 2010)

Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. - Juraj Hromkovic; Björn Steffen (ISSEP, 2011)

A Short Introduction to Classical Cryptology as a Way to Motivate High School Students for Informatics. - Lucia Keller; Barbara Scheuner; Giovanni Serafini; Björn Steffen (ISSEP, 2011)

Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. - Juraj Hromkovic; Lucia Keller; Dennis Komm; Giovanni Serafini; Björn Steffen (LOG IN, 2011)

Steiner tree reoptimization in graphs with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Karin Freiermuth; Juraj Hromkovic; Tobias Mömke; Andreas Sprock; Björn Steffen (J. Discrete Algorithms, 2012)

On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (COCOON, 2013)

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. - Kfir Barhum; Hans-Joachim Böckenhauer; Michal Forisek; Heidi Gebauer; Juraj Hromkovic; Sacha Krug; Jasmin Smula; Björn Steffen (SOFSEM, 2014)

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (Theor. Comput. Sci., 2014)

Advice complexity of online graph problems. - Björn Steffen (2014)