| 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 |
| 2026 | STACS | A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm. | Stefan Hougardy, Bart Zondervan |
| 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 |
| 2024 | IWOCA | The Bottom-Left Algorithm for the Strip Packing Problem. | Stefan Hougardy, Bart Zondervan |
| 2024 | WAOA | Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. | Stefan Hougardy, Karolina Tammemaa |
| 2021 | STACS | The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. | Ulrich A. Brodowsky, Stefan Hougardy |
| 2014 | WG | Edge Elimination in TSP Instances. | Stefan Hougardy, Rasmus T. Schroeder |
| 2013 | ASPDAC | BonnCell: Automatic layout of leaf cells. | Stefan Hougardy, Tim Nieberg, Jan Schneider |
| 2002 | SODA | Polynomial time recognition of P4-structure. | Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed |
| 2001 | WG | Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. | Clemens Grpl, Stefan Hougardy, Till Nierhoff, Hans Jrgen Prmel |
| 1999 | SODA | A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. | Stefan Hougardy, Hans Jrgen Prmel |