Sophia Heimann
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
2
Venues
2
Active years
2024–2026
Best venue rank
A*
Where they publish
Papers
2 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman Problem. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2024 | ICALP | The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. | Sophia Heimann, Hung P. Hoang, Stefan Hougardy |