Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems. - Bernhard Korte; Walter Oberhofer (Unternehmensforschung, 1968)

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben - Teil I. - Bernhard Korte; Wilhelm Krelle; Walter Oberhofer (Unternehmensforschung, 1969)

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. - Wilhelm Krelle; Bernhard Korte; Walter Oberhofer (Unternehmensforschung, 1970)

Buchbesprechungen. - 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; et al. (Z. Oper. Research, 1974)

Lower bounds on the worst-case complexity of some oracle algorithms. - Dirk Hausmann; Bernhard Korte (Discret. Math., 1978)

Buchbesprechungen. - D. Braess; H. Läpple; W. Mag; Heiner Müller-Merbach; M. Gaitanides; Bernhard Korte (Z. Oper. Research, 1978)

K-greedy algorithms for independence systems. - Dirk Hausmann; Bernhard Korte (Z. Oper. Research, 1978)

On the RAS-algorithm. - Achim Bachem; Bernhard Korte (Computing, 1979)

Mathematical Structures Underlying Greedy Algorithms. - Bernhard Korte; László Lovász 001 (FCT, 1981)

A Survey on Oracle Techniques. - Bernhard Korte; Rainer Schrader (MFCS, 1981)

Exponential Lower Bounds on a Class of Knapsack Algorithms. - Dirk Hausmann; Ravindran Kannan; Bernhard Korte (Math. Oper. Res., 1981)

Scientific Program. - Achim Bachem; Bernhard Korte; Martin Grötschel (ISMP, 1982)

XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany. - Bernhard Korte (Math. Program., 1982)

Complexity of Matroid Property Algorithms. - Per M. Jensen; Bernhard Korte (SIAM J. Comput., 1982)

Structural properties of greedoids. - Bernhard Korte; László Lovász 001 (Comb., 1983)

A Note on Selectors and Greedoids. - Bernhard Korte; László Lovász 001 (Eur. J. Comb., 1985)

Polymatroid greedoids. - Bernhard Korte; László Lovász 001 (J. Comb. Theory B, 1985)

Relations between subclasses of greedoids. - Bernhard Korte; László Lovász 001 (Z. Oper. Research, 1985)

Homomorphisms and Ramsey properties of antimatroids. - Bernhard Korte; László Lovász 001 (Discret. Appl. Math., 1986)

Non-interval greedoids and the transposition property. - Bernhard Korte; László Lovász 001 (Discret. Math., 1986)

Combining partitioning and global routing in sea-of-cells design. - Bernhard Korte; Hans Jürgen Prömel; Angelika Steger (ICCAD, 1989)

The intersection of matroids and antimatroids. - Bernhard Korte; László Lovász 001 (Discret. Math., 1989)

VLSI: placement based on routing and timing information. - Jörn Garbers; Bernhard Korte; Hans Jürgen Prömel; E. Schwietzke; Angelika Steger (EURO-DAC, 1990)

Applications of Combinatorial Optimization in the Design, Layout and Production of Computers. - Bernhard Korte (Modelling the Innovation, 1990)

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design. - Asmus Hetzel; Bernhard Korte; Roland Krieger; Hans Jürgen Prömel; Ulf-Dietmar Radicke; Angelika Steger (Inform. Forsch. Entwickl., 1990)

Mathematik, Realität und Ästhetik - eine Bilderfolge zum VLSI Chip Design. - Bernhard Korte (Springer, 1991)

How Long Does a Bit Live in a Computer? (abstract). - Bernhard Korte (ESA, 1999)

Cycle time and slack optimization for VLSI-chips. - Christoph Albrecht; Bernhard Korte; Jürgen Schietke; Jens Vygen (ICCAD, 1999)

Vojtech Jarni'k's work in combinatorial optimization. - Bernhard Korte; Jaroslav Nesetril (Discret. Math., 2001)

Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. - Christoph Albrecht; Bernhard Korte; Jürgen Schietke; Jens Vygen (Discret. Appl. Math., 2002)

Clock Scheduling and Clocktree Construction for High Performance ASICS. - Stephan Held; Bernhard Korte; Jens Maßberg; Matthias Ringe; Jens Vygen (ICCAD, 2003)

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. - Bernhard Korte; Dieter Rautenbach; Jens Vygen (Proc. IEEE, 2007)

Combinatorial Optimization in VLSI Design. - Stephan Held; Bernhard Korte; Dieter Rautenbach; Jens Vygen (Combinatorial Optimization - Methods and Applications, 2011)