Profile
Profile

Prof. Dr. Dr. h.c. Bernhard Korte

E-Mail: dm(at)or.uni-bonn.de
Telefon: +49 228 73 8770
Homepage: http://www.or.uni-bonn.de/cards/card-korte.eng.html
Institute: Research Institute for Discrete Mathematics
Forschungsbereiche: Research Area KL
Former Research Area K
Geburtsdatum: 03.Nov 1938
Mathscinet-Number: 105130

Academic Career

1967

PhD in Mathematics, University of Bonn

1971

Habilitation, University of Bonn

1971

Professor, University of Regensburg

1971 - 1973

Professor, University of Bielefeld (charter dean)

Since 1972

Professor, University of Bonn

Since 1987

Director, Research Institute for Discrete Mathematics, University of Bonn

Guest professorship at Stanford, Cornell, Waterloo, MIT, Yale, Rome, Pisa, Barcelona, PUC Rio de Janeiro, Rutger's.

Research Profile

The application of combinatorial optimization to chip design is still an extremely challenging field to which I have devoted my research during the last 20 years. By applying methods of discrete mathematics new theoretical insights into combinatorial structures are generated. Moreover highly complex chips can only be designed by our methods, the so-called BonnTools. More than 1,000 most complex microprocessors and ASICS (application specific integrated circuits) have been designed by BonnTools. It is very satisfying to learn that these designs are only possible by using our mathematics and that by this, billions of Dollars we saved.

Of course, I will continue my research in the area of combinatorial optimization, especially the most successful application of combinatorial optimization in chip design. Here we are faced with many new and highly complex problems. It is a fact that by now billions of transistors and kilometers of nets have to be packed on a square centimeter of silicon; we have to re-design many of our algorithms. While it was formerly possible to deal with design goals and objective functions separately and consecutively, we have now to attack different objectives simultaneously. Timing, packing density, buffering, transistor sizing, vt-optimization, power consumption, noise and routing have to be integrated in a new and common framework. This is a great challenge for our future work. In leading edge chip design only a few picoseconds matters in timing matter to get a feasible design. In order to be successful we have to develop new theoretical results and algorithms, especially new approximation results, which will then lead to an overall improvement of our BonnTools.

Research Projects and Activities

Long-term cooperation project “Combinatorial Optimization and Chip Design”
with IBM, USA and Magma Design Automation, USA, jointly with Jens Vygen, since 1986

Several projects of the European Commission within the framework of PROCOPE, ESPRIT, Human Capital and Mobility, DONET (Discrete Optimization Network)
Co-director and German Coordinator, since 1988

Contribution to Research Areas

Former Research Area K
I have continued my successful research in combinatorial optimization and chip design. Based on new theoretical insights BonnTools, a software system with several million lines of code will be continuously enhanced. New technologies and further miniaturization demand new combinatorial structures, new algorithms and different approaches (e.g. gridless routing, facility location, resource sharing, mask colouring, transistor sizing, and cell layout). However, there are still many challenging open problems in chip design [1].

Selected Publications

[1] Bernhard Korte, Jens Vygen
Combinatorial problems in chip design
Building bridges
of Bolyai Soc. Math. Stud. : 333--368
Publisher: Springer, Berlin
2008
DOI: 10.1007/978-3-540-85221-6_12
[2] Bernhard Korte, Jens Vygen
Combinatorial optimization
Theory and algorithms
of Algorithms and Combinatorics : xx+659
Publisher: Springer, Heidelberg
2012
ISBN: 978-3-642-24487-2
DOI: 10.1007/978-3-642-24488-9
[3] Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Yygen
Combinatorial optimization in VLSI design
Combinatorial Optimization: Methods and Applications
Combinatorial Optimization: Methods and Applications : 33--96
Publisher: IOS Press, Amsterdam
2011
DOI: 10.3233/978-1-60750-718-5-33
[4] Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
Workshop on Discrete Optimization, DO'99 (Piscataway, NJ)
Discrete Appl. Math.
, 123: (1-3): 103--127
2002
DOI: 10.1016/S0166-218X(01)00339-0
[5] Bernhard Korte, László Lovász, Rainer Schrader
Greedoids
of Algorithms and Combinatorics : viii+211
Publisher: Springer-Verlag, Berlin
1991
ISBN: 3-540-18190-3
DOI: 10.1007/978-3-642-58191-5
[6] Bernhard Korte, Hans Jürgen Prömel, Angelika Steger
Steiner trees in VLSI-layout
Paths, flows, and VLSI-layout (Bonn, 1988)
of Algorithms Combin. : 185--214
Publisher: Springer, Berlin
1990
[7] Bernhard Korte, László Lovász
Polyhedral results for antimatroids
Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985)
of Ann. New York Acad. Sci. : 283--295
Publisher: New York Acad. Sci., New York
1989
DOI: 10.1111/j.1749-6632.1989.tb22462.x
[8] Bernhard Korte, László Lovász
Noninterval greedoids and the transposition property
Discrete Math. , 59: (3): 297--314
1986
DOI: 10.1016/0012-365X(86)90176-7
[9] Anders Björner, Bernhard Korte, László Lovász
Homotopy properties of greedoids
Adv. in Appl. Math. , 6: (4): 447--494
1985
DOI: 10.1016/0196-8858(85)90021-1
[10] Bernhard Korte, László Lovász
Polymatroid greedoids
J. Combin. Theory Ser. B , 38: (1): 41--72
1985
DOI: 10.1016/0095-8956(85)90091-7

Publication List

Editorships

• Acta Mathematicae Applicatae Sinica
• Advances in Applied Mathematics
• Annals of Operations Research
• Combinatorica
• Chinese Journal of Operations Research
• Discrete Applied Mathematics
• Discrete Optimization
• IEICE Transactions on Fundamentals of Electronics
• Communications and Computer Science (Japan, Overseas Advisor)
• Japan Journal of Applied Mathematics
• Mathematical Programming
• Ser. A, Mathematical Systems in Economics
• Matemática Applicata e Computational
• Methods of Operations Research
• Operations Research Spektrum
• Optimization, Mathematische Operationsforschung
• Zeitschrift für Operations Research

Awards

1985

Distinguished senior fellow, Rutgers Center for Operations Research, New Brunswick, NJ, USA

1986

Grande Ufficiale dell’ Ordine al Merito della Repubblica Italiana

1987

Honorary doctorate, Université deglè Studi di Roma, La Sapienza, Italy

1988

Honorary professor of Applied Mathematics, Academia Sinica, Beijing, China

1988

Professor honorário da Universidade, Ponteficia Universidade Católica, Rio de Janeiro, Brasil

1989

Ordinary member of the North-Rhine-Westphalian Academy of Sciences

1990

Alexander-v.-Humboldt-Research-Prize (France: Prix Alexander de Humboldt)

1991

Fellow of the Institute of Combinatorics and Applications, Canada

1993

Order of Merits of the State of North-Rhine-Westphalia

1996

State Prize of North-Rhine-Westphalia

1996

Member of Leopoldina (German National Academy of Sciences)

2002

Grand Cross of the Order of Merits of the Federal Republic of Germany

2002

Member of acatech (German Academy of Technology)

2005

Hahn Prize of the University of Tübingen

Selected Invited Lectures

Several invited lectures at different SIAM conferences

GAMM annual meeting

NATO Research Institutes

DMV annual meeting

International Math. Progr. Symposia

EURO

ORSA/TIMS (INFORMS) meetings

Offers

Several offers from universities in Germany and North America.

Download Profile