default search action
Bernhard Korte
Person information
- affiliation: University of Bonn, Germany
- award: Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [p1]Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen:
Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications 2011: 33-96
2000 – 2009
- 2007
- [j23]Bernhard Korte, Dieter Rautenbach, Jens Vygen:
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE 95(3): 555-572 (2007) - 2003
- [c9]Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen:
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD 2003: 232-240 - 2002
- [j22]Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discret. Appl. Math. 123(1-3): 103-127 (2002) - 2001
- [j21]Bernhard Korte, Jaroslav Nesetril
:
Vojtech Jarni'k's work in combinatorial optimization. Discret. Math. 235(1-3): 1-17 (2001)
1990 – 1999
- 1999
- [c8]Bernhard Korte:
How Long Does a Bit Live in a Computer? (abstract). ESA 1999: 28 - [c7]Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Cycle time and slack optimization for VLSI-chips. ICCAD 1999: 232-238 - 1991
- [b1]Bernhard Korte:
Mathematik, Realität und Ästhetik - eine Bilderfolge zum VLSI Chip Design. Springer 1991, ISBN 978-3-540-53760-1, pp. 1-115 - 1990
- [j20]Asmus Hetzel, Bernhard Korte, Roland Krieger, Hans Jürgen Prömel, Ulf-Dietmar Radicke, Angelika Steger:
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design. Inform. Forsch. Entwickl. 5(1): 2-19 (1990) - [c6]Jörn Garbers, Bernhard Korte, Hans Jürgen Prömel, E. Schwietzke, Angelika Steger:
VLSI: placement based on routing and timing information. EURO-DAC 1990: 317-321 - [c5]Bernhard Korte:
Applications of Combinatorial Optimization in the Design, Layout and Production of Computers. Modelling the Innovation 1990: 517-538
1980 – 1989
- 1989
- [j19]Bernhard Korte, László Lovász:
The intersection of matroids and antimatroids. Discret. Math. 73(1-2): 143-157 (1989) - [c4]Bernhard Korte, Hans Jürgen Prömel, Angelika Steger:
Combining partitioning and global routing in sea-of-cells design. ICCAD 1989: 98-101 - 1986
- [j18]Bernhard Korte, László Lovász:
Homomorphisms and Ramsey properties of antimatroids. Discret. Appl. Math. 15(2-3): 283-290 (1986) - [j17]Bernhard Korte, László Lovász:
Non-interval greedoids and the transposition property. Discret. Math. 59(3): 297-314 (1986) - 1985
- [j16]Bernhard Korte, László Lovász:
A Note on Selectors and Greedoids. Eur. J. Comb. 6(1): 59-67 (1985) - [j15]Bernhard Korte, László Lovász:
Polymatroid greedoids. J. Comb. Theory B 38(1): 41-72 (1985) - [j14]Bernhard Korte, László Lovász:
Relations between subclasses of greedoids. Z. Oper. Research 29(7): 249-267 (1985) - 1983
- [j13]Bernhard Korte, László Lovász:
Structural properties of greedoids. Comb. 3(3): 359-374 (1983) - [e1]Achim Bachem, Bernhard Korte, Martin Grötschel:
Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982. Springer 1983, ISBN 978-3-642-68876-8 [contents] - 1982
- [j12]Bernhard Korte:
XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany. Math. Program. 22(1): 122-123 (1982) - [j11]Per M. Jensen, Bernhard Korte:
Complexity of Matroid Property Algorithms. SIAM J. Comput. 11(1): 184-190 (1982) - [c3]Achim Bachem, Bernhard Korte, Martin Grötschel:
Scientific Program. ISMP 1982: 605-648 - 1981
- [j10]Dirk Hausmann, Ravindran Kannan, Bernhard Korte:
Exponential Lower Bounds on a Class of Knapsack Algorithms. Math. Oper. Res. 6(2): 225-232 (1981) - [c2]Bernhard Korte, László Lovász:
Mathematical Structures Underlying Greedy Algorithms. FCT 1981: 205-209 - [c1]Bernhard Korte, Rainer Schrader:
A Survey on Oracle Techniques. MFCS 1981: 61-77
1970 – 1979
- 1979
- [j9]Achim Bachem, Bernhard Korte:
On the RAS-algorithm. Computing 23(2): 189-198 (1979) - 1978
- [j8]Dirk Hausmann, Bernhard Korte:
Lower bounds on the worst-case complexity of some oracle algorithms. Discret. Math. 24(3): 261-276 (1978) - [j7]Dirk Hausmann, Bernhard Korte:
K-greedy algorithms for independence systems. Z. Oper. Research 22(1): 219-228 (1978) - [j6]D. Braess, H. Läpple, W. Mag, Heiner Müller-Merbach, M. Gaitanides, Bernhard Korte:
Buchbesprechungen. Z. Oper. Research 22(1): 244-248 (1978) - 1974
- [j5]Bernhard Korte, O. Müller, B. Machost, Heiner Müller-Merbach, Reiner Horst, T. Talmon, Herbert Kargl, R. Koxholt, Tomas Gal, Dietrich Ohse, H. Läpple, Wolfgang Bühler, Bernd Schiemenz, G. Trenkler, Peter Kall, Hans M. Dathe:
Buchbesprechungen. Z. Oper. Research 18(5): 226-236 (1974) - 1970
- [j4]Wilhelm Krelle, Bernhard Korte, Walter Oberhofer:
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung 14(1): 228-234 (1970)
1960 – 1969
- 1969
- [j3]Bernhard Korte, Wilhelm Krelle, Walter Oberhofer:
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben - Teil I. Unternehmensforschung 13(2): 73-98 (1969) - [j2]Wilhelm Krelle, Bernhard Korte, Walter Oberhofer:
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung 13(3): 171-192 (1969) - 1968
- [j1]Bernhard Korte, Walter Oberhofer:
Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems. Unternehmensforschung 12(1): 217-231 (1968)
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-06-10 20:28 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: