Jan Hackfeld

According to our database, Jan Hackfeld authored at least 8 papers between 2016 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Efficient graph exploration.

Jan Hackfeld

PhD thesis, 2019

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.

Yann Disser, Jan Hackfeld, Max Klimm

J. ACM, 2019

A lightweight BFT consensus protocol for blockchains.

Jan Hackfeld

CoRR, 2019

2018

The matching extension problem in general graphs is co-NP-complete.

Jan Hackfeld, Arie M. C. A. Koster

J. Comb. Optim., 2018

Maximal Exploration of Trees with Energy-Constrained Agents.

Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou

CoRR, 2018

2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.

Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Tight Bounds for Online TSP on the Line.

Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles.

Yann Disser, Jan Hackfeld, Max Klimm

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016