Undirected Graph Exploration with ⊝(log log n) Pebbles. - Yann Disser; Jan Hackfeld; Max Klimm (SODA, 2016)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Maximal Exploration of Trees with Energy-Constrained Agents. - Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Jan Hackfeld; Christina Karousatou (CoRR, 2018)

The matching extension problem in general graphs is co-NP-complete. - Jan Hackfeld; Arie M. C. A. Koster (J. Comb. Optim., 2018)

A lightweight BFT consensus protocol for blockchains. - Jan Hackfeld (CoRR, 2019)

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. - Yann Disser; Jan Hackfeld; Max Klimm (J. ACM, 2019)

Efficient graph exploration. - Jan Hackfeld (2019)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)