Stephan Held

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 22

Top Topics

Vehicle Routing

Discrete Geometry

Search Algorithm

Top Venues

Discret. Optim.

Publications

William J. Cook, Stephan Held, Keld Helsgaun
Constrained Local Search for Last-Mile Routing. Transp. Sci. 58 (1) (2024)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. 53 (2024)
Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter
Global Interconnect Optimization. ACM Trans. Design Autom. Electr. Syst. 28 (5) (2023)
Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. CoRR (2023)
Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. APPROX/RANDOM (2023)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. 197 (2) (2023)
Stephan Held, Yannik Kyle Dustin Spitzley
Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem. CoRR (2022)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR (2022)
Gracieli Posser, Evangeline F. Y. Young, Stephan Held, Yih-Lang Li, David Z. Pan
Challenges and Approaches in VLSI Routing. ISPD (2022)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO (2021)
Siad Daboul, Stephan Held, Jens Vygen
Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR (2020)
Ardalan Khazraei, Stephan Held
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. WAOA (2020)
Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter
Global Interconnect Optimization. ICCAD (2019)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle routing with subtours. Discret. Optim. 33 (2019)
Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke
An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. 23 (6) (2018)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle Routing with Subtours. CoRR (2018)
Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37 (2) (2018)
Stephan Held, Sophie Theresa Spirkl
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. ACM Trans. Algorithms 14 (1) (2018)
Siad Daboul, Nicolai Hähnle, Stephan Held, Ulrike Schorr
Provably Fast and Near-Optimum Gate Sizing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37 (12) (2018)
Stephan Held, Benjamin Rockel
Exact algorithms for delay-bounded steiner arborescences. DAC (2018)
Stephan Held, Nicolas Kämmerling
Two-level rectilinear Steiner trees. Comput. Geom. 61 (2017)
Stephan Held, Sophie Spirkl
Fast Prefix Adders for Non-uniform Input Arrival Times. Algorithmica 77 (1) (2017)
Stephan Held, Nicolas Kämmerling
Two-Level Rectilinear Steiner Trees. CoRR (2015)
Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen
Global Routing with Inherent Static Timing Constraints. ICCAD (2015)
Adrian Bock, Stephan Held, Nicolas Kämmerling, Ulrike Schorr
Local search algorithms for timing-driven placement under arbitrary delay models. DAC (2015)
Stephan Held, Sophie Theresa Spirkl
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. CoRR (2015)
Stephan Held, Sophie Theresa Spirkl
Fast Prefix Adders for Non-Uniform Input Arrival Times. CoRR (2014)
Stephan Held, Ulrike Schorr
Post-Routing Latch Optimization for Timing Closure. DAC (2014)
Stephan Held, Sophie Theresa Spirkl
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. ISPD (2014)
Stephan Held, Daniel Rotter
Shallow-Light Steiner Arborescences with Vertex Delays. IPCO (2013)
Stephan Held, William J. Cook, Edward C. Sewell
Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4 (4) (2012)
Stephan Held, William J. Cook, Edward C. Sewell
Safe Lower Bounds for Graph Coloring. IPCO (2011)
Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen
The repeater tree construction problem. Inf. Process. Lett. 110 (24) (2010)
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD (2009)
Stephan Held
Gate sizing for large cell-based designs. DATE (2009)
Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
Efficient generation of short and fast repeater tree topologies. ISPD (2006)
Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD (2003)