Jan Hackfeld
Operations Research
Wirtschaftswissenschaftliche Fakultät
Humboldt-Universität zu Berlin
Spandauer Straße 1
10099 Berlin
Email: jan.hackfeld@hu-berlin.de
Tel.:
Office: 339
Office hours: by appointment
Publications
- Jan Hackfeld and Arie M. C. A. Koster (2018):
The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim.35(3), pp. 853-859. - Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, and Leen Stougie (2017):
Tight Bounds for Online TSP on the Line. Proceedings of the 28th Symposium on Discrete Algorithms (SODA), pp. 994-1005. -
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna (2017):
Energy-Efficient Delivery by Heterogeneous Mobile Agents. Proceedings of the 34th Symposium on Theoretical Compuer Science (STACS). -
Yann Disser, Jan Hackfeld, Max Klimm (2016):
Undirected Graph Exploration with ⊝(log log n) Pebbles. Proceedings of the 27th Symposium on Discrete Algorithms (SODA), pp. 25-39.