| 2026 | ALENEX | A Customized SAT-based Solver for Graph Coloring. | Timo Brand, Daniel Faber, Stephan Held, Petra Mutzel |
| 2025 | DAC | Cost-Distance Steiner Trees for Timing-Constrained Global Routing. | Stephan Held, Edgar Perner |
| 2021 | IPCO | Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. | Siad Daboul, Stephan Held, Jens Vygen |
| 2020 | WAOA | An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. | Ardalan Khazraei, Stephan Held |
| 2019 | ICCAD | Global Interconnect Optimization. | Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter |
| 2018 | DAC | Exact algorithms for delay-bounded steiner arborescences. | Stephan Held, Benjamin Rockel |
| 2015 | DAC | Local search algorithms for timing-driven placement under arbitrary delay models. | Adrian Bock, Stephan Held, Nicolas Kmmerling, Ulrike Schorr |
| 2015 | ICCAD | Global Routing with Inherent Static Timing Constraints. | Stephan Held, Dirk Mller, Daniel Rotter, Vera Traub, Jens Vygen |
| 2014 | DAC | Post-Routing Latch Optimization for Timing Closure. | Stephan Held, Ulrike Schorr |
| 2013 | IPCO | Shallow-Light Steiner Arborescences with Vertex Delays. | Stephan Held, Daniel Rotter |
| 2011 | IPCO | Safe Lower Bounds for Graph Coloring. | Stephan Held, William J. Cook, Edward C. Sewell |
| 2009 | DATE | Gate sizing for large cell-based designs. | Stephan Held |
| 2003 | ICCAD | Clock Scheduling and Clocktree Construction for High Performance ASICS. | Stephan Held, Bernhard Korte, Jens Maberg, Matthias Ringe, Jens Vygen |