Stephan Held

According to our database, Stephan Held authored at least 28 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Global Interconnect Optimization.

Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter

ACM Trans. Design Autom. Electr. Syst., September, 2023

Approximating the discrete time-cost tradeoff problem with bounded depth.

Siad Daboul, Stephan Held, Jens Vygen

Math. Program., February, 2023

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem.

Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley

Proceedings of the Approximation, 2023

2022

Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem.

Stephan Held, Yannik Kyle Dustin Spitzley

CoRR, 2022

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks.

Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen

CoRR, 2022

Challenges and Approaches in VLSI Routing.

Gracieli Posser, Evangeline F. Y. Young, Stephan Held, Yih-Lang Li, David Z. Pan

Proceedings of the ISPD 2022: International Symposium on Physical Design, Virtual Event, Canada, March 27, 2022

2020

An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem.

Ardalan Khazraei, Stephan Held

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

2019

Vehicle routing with subtours.

Stephan Held, Jochen Könemann, Jens Vygen

Discret. Optim., 2019

2018

An Approximation Algorithm for Threshold Voltage Optimization.

Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke

ACM Trans. Design Autom. Electr. Syst., 2018

Global Routing With Timing Constraints.

Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 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

Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two.

Stephan Held, Sophie Theresa Spirkl

ACM Trans. Algorithms, 2018

Exact algorithms for delay-bounded steiner arborescences.

Stephan Held, Benjamin Rockel

Proceedings of the 55th Annual Design Automation Conference, 2018

2017

Two-level rectilinear Steiner trees.

Stephan Held, Nicolas Kämmerling

Comput. Geom., 2017

Fast Prefix Adders for Non-uniform Input Arrival Times.

Stephan Held, Sophie Spirkl

Algorithmica, 2017

2015

Global Routing with Inherent Static Timing Constraints.

Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen

Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 2015

Local search algorithms for timing-driven placement under arbitrary delay models.

Adrian Bock, Stephan Held, Nicolas Kämmerling, Ulrike Schorr

Proceedings of the 52nd Annual Design Automation Conference, 2015

2014

A fast algorithm for rectilinear steiner trees with length restrictions on obstacles.

Stephan Held, Sophie Theresa Spirkl

Proceedings of the International Symposium on Physical Design, 2014

Post-Routing Latch Optimization for Timing Closure.

Stephan Held, Ulrike Schorr

Proceedings of the 51st Annual Design Automation Conference 2014, 2014

2013

Shallow-Light Steiner Arborescences with Vertex Delays.

Stephan Held, Daniel Rotter

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Maximum-weight stable sets and safe lower bounds for graph coloring.

Stephan Held, William J. Cook, Edward C. Sewell

Math. Program. Comput., 2012

2011

Combinatorial Optimization in VLSI Design.

Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

Safe Lower Bounds for Graph Coloring.

Stephan Held, William J. Cook, Edward C. Sewell

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

The repeater tree construction problem.

Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen

Inf. Process. Lett., 2010

2009

Fast buffering for optimizing worst slack and resource consumption in repeater trees.

Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen

Proceedings of the 2009 International Symposium on Physical Design, 2009

Gate sizing for large cell-based designs.

Stephan Held

Proceedings of the Design, Automation and Test in Europe, 2009

2006

Efficient generation of short and fast repeater tree topologies.

Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen

Proceedings of the 2006 International Symposium on Physical Design, 2006

2003

Clock Scheduling and Clocktree Construction for High Performance ASICS.

Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen

Proceedings of the 2003 International Conference on Computer-Aided Design, 2003