Jan Hackfeld
From MaRDI portal
Person:1743489
Available identifiers
zbMath Open hackfeld.janMaRDI QIDQ1743489
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 | 2022-02-08 | Paper |
| Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents | 2020-02-11 | Paper |
| Tight Bounds for Online TSP on the Line | 2018-07-16 | Paper |
| Undirected Graph Exploration with ⊝(log log n) Pebbles | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636607 | 2018-04-19 | Paper |
| The matching extension problem in general graphs is co-NP-complete | 2018-04-13 | Paper |
Research outcomes over time
This page was built for person: Jan Hackfeld
