Learning-based control strategies for hybrid electric vehicles. - Sascha Geulen; Martina Josevski; Johanna Nellen; Janosch Fuchs; Lukas Netz; Benedikt Wolters; Dirk Abel; Erika Ábrahám; Walter Unger (CCA, 2015)

Online Exploration of Rectangular Grids. - Hans-Joachim Böckenhauer; Janosch Fuchs; Ulla Karhumäki; Walter Unger (CoRR, 2016)

Exploring Sparse Graphs with Advice (Extended Abstract). - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (WAOA, 2018)

The Graph Exploration Problem with Advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (CoRR, 2018)

Online Matching in Regular Bipartite Graphs. - Lali Barrière; Xavier Muñoz; Janosch Fuchs; Walter Unger (Parallel Process. Lett., 2018)

The Complexity of Packing Edge-Disjoint Paths. - Jan Dreier; Janosch Fuchs; Tim A. Hartmann; Philipp Kuinke; Peter Rossmanith; Bjoern Tauer; Hung-Lung Wang (IPEC, 2019)

Waiting for Trains: Complexity Results. - Bjoern Tauer; Dennis Fischer 001; Janosch Fuchs; Laura Vargas Koch; Stephan Zieger (CALDAM, 2020)

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. - Elisabet Burjons; Janosch Fuchs; Henri Lotze (IWOCA, 2022)

Exploring sparse graphs with advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (Inf. Comput., 2022)

Graph exploration with advice and online crossing minimization. - Janosch Fuchs (2022)

The Complexity of Online Graph Games. - Janosch Fuchs; Christoph Grüne; Tom Janßen (SOFSEM, 2024)

The 2-Attractor Problem Is NP-Complete. - Janosch Fuchs; Philip Whittington (STACS, 2024)

The Complexity of Graph Exploration Games. - Janosch Fuchs; Christoph Grüne; Tom Janßen (SOFSEM (2), 2025)