default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Held
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]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: 100848 (2024)- [j12]William J. Cook, Stephan Held, Keld Helsgaun:
Constrained Local Search for Last-Mile Routing. Transp. Sci. 58(1): 12-26 (2024) - 2023
- [j11]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. 197(2): 529-547 (2023) - [j10]Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter:
Global Interconnect Optimization. ACM Trans. Design Autom. Electr. Syst. 28(5): 72:1-72:24 (2023) - [c16]Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley:
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. APPROX/RANDOM 2023: 19:1-19:16 - [i8]Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley:
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. CoRR abs/2305.03381 (2023) - 2022
- [c15]Gracieli Posser, Evangeline F. Y. Young, Stephan Held, Yih-Lang Li, David Z. Pan:
Challenges and Approaches in VLSI Routing. ISPD 2022: 185-192 - [i7]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 abs/2205.00889 (2022) - [i6]Stephan Held, Yannik Kyle Dustin Spitzley:
Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem. CoRR abs/2211.03830 (2022) - 2021
- [c14]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO 2021: 30-42 - 2020
- [c13]Ardalan Khazraei, Stephan Held:
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. WAOA 2020: 189-203 - [i5]Siad Daboul, Stephan Held, Jens Vygen:
Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR abs/2011.02446 (2020)
2010 – 2019
- 2019
- [j9]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle routing with subtours. Discret. Optim. 33: 87-100 (2019) - [c12]Siad Daboul, Stephan Held, Bento Natura, Daniel Rotter:
Global Interconnect Optimization. ICCAD 2019: 1-8 - 2018
- [j8]Stephan Held, Sophie Theresa Spirkl:
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. ACM Trans. Algorithms 14(1): 4:1-4:18 (2018) - [j7]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): 406-419 (2018) - [j6]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): 3163-3176 (2018) - [j5]Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke:
An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. 23(6): 68:1-68:16 (2018) - [c11]Stephan Held, Benjamin Rockel:
Exact algorithms for delay-bounded steiner arborescences. DAC 2018: 44:1-44:6 - [i4]Stephan Held, Jochen Könemann, Jens Vygen:
Vehicle Routing with Subtours. CoRR abs/1801.04991 (2018) - 2017
- [j4]Stephan Held, Sophie Spirkl:
Fast Prefix Adders for Non-uniform Input Arrival Times. Algorithmica 77(1): 287-308 (2017) - [j3]Stephan Held, Nicolas Kämmerling:
Two-level rectilinear Steiner trees. Comput. Geom. 61: 48-59 (2017) - 2015
- [c10]Adrian Bock, Stephan Held, Nicolas Kämmerling, Ulrike Schorr:
Local search algorithms for timing-driven placement under arbitrary delay models. DAC 2015: 29:1-29:6 - [c9]Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen:
Global Routing with Inherent Static Timing Constraints. ICCAD 2015: 102-109 - [i3]Stephan Held, Nicolas Kämmerling:
Two-Level Rectilinear Steiner Trees. CoRR abs/1501.00933 (2015) - [i2]Stephan Held, Sophie Theresa Spirkl:
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. CoRR abs/1503.08659 (2015) - 2014
- [c8]Stephan Held, Ulrike Schorr:
Post-Routing Latch Optimization for Timing Closure. DAC 2014: 7:1-7:6 - [c7]Stephan Held, Sophie Theresa Spirkl:
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles. ISPD 2014: 37-44 - [i1]Stephan Held, Sophie Theresa Spirkl:
Fast Prefix Adders for Non-Uniform Input Arrival Times. CoRR abs/1411.2917 (2014) - 2013
- [c6]Stephan Held, Daniel Rotter:
Shallow-Light Steiner Arborescences with Vertex Delays. IPCO 2013: 229-241 - 2012
- [j2]Stephan Held, William J. Cook, Edward C. Sewell:
Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4(4): 363-381 (2012) - 2011
- [c5]Stephan Held, William J. Cook, Edward C. Sewell:
Safe Lower Bounds for Graph Coloring. IPCO 2011: 261-273 - [p1]Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen:
Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96 - 2010
- [j1]Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010)
2000 – 2009
- 2009
- [c4]Stephan Held:
Gate sizing for large cell-based designs. DATE 2009: 827-832 - [c3]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD 2009: 43-50 - 2006
- [c2]Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen:
Efficient generation of short and fast repeater tree topologies. ISPD 2006: 120-127 - 2003
- [c1]Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen:
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD 2003: 232-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
