Publications
Publications
Held, Stephan
References
17.
Stephan Held and Daniel Rotter
Shallow-light Steiner arborescences with vertex delays
Integer programming and combinatorial optimization Volume 7801 of Lecture Notes in Comput. Sci.
page 229--241.
Publisher: Springer, Heidelberg,
2013
16.
Stephan Held and Daniel Rotter
Shallow-Light Steiner Arborescences with VertexDelays.
IPCO , page 229--241.
2013
15.
Stephan Held, William Cook and Edward C. Sewell
Maximum-weight stable sets and safe lower bounds for graph coloring
Math. Program. Comput., 4(4):363--381
2012
14.
Stephan Held, William Cook and Edward C Sewell
Maximum-weight stable sets and safe lower bounds forgraph coloring
Mathematical Programming Computation, :1--19
2012
13.
Edward C Sewell, William Cook and Stephan Held
Maximum-weight Stable Sets and Safe Lower Bounds forGraph Coloring
Publisher: Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität Bonn,
2012
12.
Stephan Held, Bernhard Korte, Dieter Rautenbach and Jens Vygen
Combinatorial Optimization in VLSI Design.
Combinatorial Optimization-Methods and Applications, 31:33--96
2011
11.
Guenther Hutzl, Stephan Held, Juergenand Korte, Bernhard Koehl, Jens Massberg, Matthias Ringe and Jens Vygen
Structure for optimizing the signal time behavior ofan electronic circuit design
2011
10.
Stephan Held, William Cook and Edward C. Sewell
Safe lower bounds for graph coloring
Integer programming and combinatorial optimization Volume 6655 of Lecture Notes in Comput. Sci.
page 261--273.
Publisher: Springer, Heidelberg,
2011
9.
Stephan Held, William Cook and Edward C Sewell
Safe lower bounds for graph coloring
International Conference on Integer Programming andCombinatorial Optimization , page 261--273.
Springer, Berlin, Heidelberg
2011
8.
Guenther Hutzl, Stephan Held, Juergenand Korte, Bernhard Koehl, Jens Massberg, Matthias Ringe and Jens Vygen
Method and computer system for optimizing the signaltime behavior of an electronic circuit design
2010
7.
Christoph Bartoschek, Stephan andMaÃ?berg, Jens Held, Dieter Rautenbach and Jens Vygen
The repeater tree construction problem
Information Processing Letters, 110(24):1079--1083
2010
6.
C. Bartoschek, S. Held, J. MaÃ? berg, D. Rautenbach and J. Vygen
The repeater tree construction problem
Inform. Process. Lett., 110(24):1079--1083
2010
Page:  
Export as:
BibTeX, XML