Jan Hackfeld
From MaRDI portal
Person:1743489
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Efficient graph exploration | 2024-11-01 | Paper |
| Tight Bounds for Online TSP on the Line ACM Transactions on Algorithms | 2022-02-08 | Paper |
| Tight bounds for undirected graph exploration with pebbles and multiple agents Journal of the ACM | 2020-02-11 | Paper |
| Tight bounds for online TSP on the line Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Undirected Graph Exploration with ⊝(log log n) Pebbles Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6862102 (Why is no real title available?) (available as arXiv preprint) | 2018-04-19 | Paper |
| The matching extension problem in general graphs is co-NP-complete Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Research outcomes over time
This page was built for person: Jan Hackfeld
