Stephan Held - RankMe

46 papers A* 4A 6B 4Journal 25Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Customized SAT-based Solver for Graph Coloring. ALENEX Timo Brand, Daniel Faber, Stephan Held, Petra Mutzel
2026	J	`jnl`	Introduction to the Special Issue on Advances in Physical Design Automation. ACM Trans. Design Autom. Electr. Syst. Stephan Held, Gracieli Posser, Iris Hui-Ru Jiang, David G. Chinnery
2026	—	`ed.`	Proceedings of the 2026 International Symposium on Physical Design, ISPD 2026, BonnGermany, March 15-18, 2026 ISPD Stephan Held, Rickard Ewetz, Tung-Chieh Chen, Gracieli Posser
2025	J	`jnl`	A Customized SAT-based Solver for Graph Coloring. CoRR Timo Brand, Daniel Faber, Stephan Held, Petra Mutzel
2025	A*	`conf`	Cost-Distance Steiner Trees for Timing-Constrained Global Routing. DAC Stephan Held, Edgar Perner
2025	J	`jnl`	Cost-Distance Steiner Trees for Timing-Constrained Global Routing. CoRR Stephan Held, Edgar Perner
2025	—	`ed.`	Proceedings of the 2025 International Symposium on Physical Design, ISPD 2025, Austin, TX, USA, March 16-19, 2025 ISPD Gracieli Posser, Stephan Held
2024	J	`jnl`	Constrained Local Search for Last-Mile Routing. Transp. Sci. William J. Cook, Stephan Held, Keld Helsgaun
2024	J	`jnl`	Fractional Chromatic Numbers from Exact Decision Diagrams. CoRR Timo Brand, Stephan Held
2024	J	`jnl`	Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2023	J	`jnl`	Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. Siad Daboul, Stephan Held, Jens Vygen
2023	J	`jnl`	Global Interconnect Optimization. ACM Trans. Design Autom. Electr. Syst. Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter
2023	A	`conf`	Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. APPROX/RANDOM Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley
2023	J	`jnl`	Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. CoRR Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley
2022	—	`conf`	Challenges and Approaches in VLSI Routing. ISPD Gracieli Posser, Evangeline F. Y. Young, Stephan Held, Yih-Lang Li, David Z. Pan
2022	J	`jnl`	Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem. CoRR Stephan Held, Yannik Kyle Dustin Spitzley
2022	J	`jnl`	Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2021	B	`conf`	Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO Siad Daboul, Stephan Held, Jens Vygen
2020	B	`conf`	An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. WAOA Ardalan Khazraei, Stephan Held
2020	J	`jnl`	Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR Siad Daboul, Stephan Held, Jens Vygen
2019	A	`conf`	Global Interconnect Optimization. ICCAD Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter
2019	J	`jnl`	Vehicle routing with subtours. Discret. Optim. Stephan Held, Jochen Könemann, Jens Vygen
2018	J	`jnl`	An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke
2018	J	`jnl`	Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. ACM Trans. Algorithms Stephan Held, Sophie Theresa Spirkl
2018	A*	`conf`	Exact algorithms for delay-bounded steiner arborescences. DAC Stephan Held, Benjamin Rockel
2018	J	`jnl`	Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
2018	J	`jnl`	Provably Fast and Near-Optimum Gate Sizing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Siad Daboul, Nicolai Hähnle, Stephan Held, Ulrike Schorr
2018	J	`jnl`	Vehicle Routing with Subtours. CoRR Stephan Held, Jochen Könemann, Jens Vygen
2017	J	`jnl`	Fast Prefix Adders for Non-uniform Input Arrival Times. Algorithmica Stephan Held, Sophie Spirkl
2017	J	`jnl`	Two-level rectilinear Steiner trees. Comput. Geom. Stephan Held, Nicolas Kämmerling
2015	J	`jnl`	Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. CoRR Stephan Held, Sophie Theresa Spirkl
2015	A	`conf`	Global Routing with Inherent Static Timing Constraints. ICCAD Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen
2015	A*	`conf`	Local search algorithms for timing-driven placement under arbitrary delay models. DAC Adrian Bock, Stephan Held, Nicolas Kämmerling, Ulrike Schorr
2015	J	`jnl`	Two-Level Rectilinear Steiner Trees. CoRR Stephan Held, Nicolas Kämmerling
2014	—	`conf`	A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. ISPD Stephan Held, Sophie Theresa Spirkl
2014	J	`jnl`	Fast Prefix Adders for Non-Uniform Input Arrival Times. CoRR Stephan Held, Sophie Theresa Spirkl
2014	A*	`conf`	Post-Routing Latch Optimization for Timing Closure. DAC Stephan Held, Ulrike Schorr
2013	B	`conf`	Shallow-Light Steiner Arborescences with Vertex Delays. IPCO Stephan Held, Daniel Rotter
2012	J	`jnl`	Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. Stephan Held, William J. Cook, Edward C. Sewell
2011	—	`ch.`	Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen
2011	B	`conf`	Safe Lower Bounds for Graph Coloring. IPCO Stephan Held, William J. Cook, Edward C. Sewell
2010	J	`jnl`	The repeater tree construction problem. Inf. Process. Lett. Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen
2009	—	`conf`	Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2009	A	`conf`	Gate sizing for large cell-based designs. DATE Stephan Held
2006	—	`conf`	Efficient generation of short and fast repeater tree topologies. ISPD Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2003	A	`conf`	Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen