Clock Scheduling and Clocktree Construction for High Performance ASICS. - Stephan Held; Bernhard Korte; Jens Maßberg; Matthias Ringe; Jens Vygen (ICCAD, 2003)

Efficient generation of short and fast repeater tree topologies. - Christoph Bartoschek; Stephan Held; Dieter Rautenbach; Jens Vygen (ISPD, 2006)

Gate sizing for large cell-based designs. - Stephan Held (DATE, 2009)

Fast buffering for optimizing worst slack and resource consumption in repeater trees. - Christoph Bartoschek; Stephan Held; Dieter Rautenbach; Jens Vygen (ISPD, 2009)

The repeater tree construction problem. - Christoph Bartoschek; Stephan Held; Jens Maßberg; Dieter Rautenbach; Jens Vygen (Inf. Process. Lett., 2010)

Safe Lower Bounds for Graph Coloring. - Stephan Held; William J. Cook; Edward C. Sewell (IPCO, 2011)

Combinatorial Optimization in VLSI Design. - Stephan Held; Bernhard Korte; Dieter Rautenbach; Jens Vygen (Combinatorial Optimization - Methods and Applications, 2011)

Maximum-weight stable sets and safe lower bounds for graph coloring. - Stephan Held; William J. Cook; Edward C. Sewell (Math. Program. Comput., 2012)

Shallow-Light Steiner Arborescences with Vertex Delays. - Stephan Held; Daniel Rotter (IPCO, 2013)

Post-Routing Latch Optimization for Timing Closure. - Stephan Held; Ulrike Schorr (DAC, 2014)

A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. - Stephan Held; Sophie Theresa Spirkl (ISPD, 2014)

Local search algorithms for timing-driven placement under arbitrary delay models. - Adrian Bock; Stephan Held; Nicolas Kämmerling; Ulrike Schorr (DAC, 2015)

Global Routing with Inherent Static Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Vera Traub; Jens Vygen (ICCAD, 2015)

Fast Prefix Adders for Non-uniform Input Arrival Times. - Stephan Held; Sophie Spirkl (Algorithmica, 2017)

Two-level rectilinear Steiner trees. - Stephan Held; Nicolas Kämmerling (Comput. Geom., 2017)

Exact algorithms for delay-bounded steiner arborescences. - Stephan Held; Benjamin Rockel (DAC, 2018)

Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. - Stephan Held; Sophie Theresa Spirkl (ACM Trans. Algorithms, 2018)

Provably Fast and Near-Optimum Gate Sizing. - Siad Daboul; Nicolai Hähnle; Stephan Held; Ulrike Schorr (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018)

Global Routing With Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Rudolf Scheifele; Vera Traub; Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018)

An Approximation Algorithm for Threshold Voltage Optimization. - Siad Daboul; Stephan Held; Jens Vygen; Sonja Wittke (ACM Trans. Design Autom. Electr. Syst., 2018)

Vehicle routing with subtours. - Stephan Held; Jochen Könemann; Jens Vygen (Discret. Optim., 2019)

An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. - Ardalan Khazraei; Stephan Held (WAOA, 2020)

Challenges and Approaches in VLSI Routing. - Gracieli Posser; Evangeline F. Y. Young; Stephan Held; Yih-Lang Li; David Z. Pan (ISPD, 2022)

Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem. - Stephan Held; Yannik Kyle Dustin Spitzley (CoRR, 2022)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. - Josefine Foos; Stephan Held; Yannik Kyle Dustin Spitzley (APPROX/RANDOM, 2023)

Approximating the discrete time-cost tradeoff problem with bounded depth. - Siad Daboul; Stephan Held; Jens Vygen (Math. Program., 2023)

Global Interconnect Optimization. - Siad Daboul; Stephan Held; Bento Natura; Daniel Rotter (ACM Trans. Design Autom. Electr. Syst., 2023)

Fractional Chromatic Numbers from Exact Decision Diagrams. - Timo Brand; Stephan Held (CoRR, 2024)

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. - Jannis Blauth; Stephan Held; Dirk Müller 003; Niklas Schlomberg; Vera Traub; Thorben Tröbst; Jens Vygen (Discret. Optim., 2024)

Constrained Local Search for Last-Mile Routing. - William J. Cook; Stephan Held; Keld Helsgaun (Transp. Sci., 2024)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing. - Stephan Held; Edgar Perner (CoRR, 2025)

A Customized SAT-based Solver for Graph Coloring. - Timo Brand; Daniel Faber; Stephan Held; Petra Mutzel (CoRR, 2025)