Bernhard Korte

Publication Activity (10 Years)

Years Active: 1968-2007
Publications (10 Years): 0

Publications

Bernhard Korte, Dieter Rautenbach, Jens Vygen
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE 95 (3) (2007)
Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD (2003)
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) (2002)
Bernhard Korte, Jaroslav Nesetril
Vojtech Jarni'k's work in combinatorial optimization. Discret. Math. 235 (1-3) (2001)
Bernhard Korte
How Long Does a Bit Live in a Computer? (abstract). ESA (1999)
Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
Cycle time and slack optimization for VLSI-chips. ICCAD (1999)
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)
Bernhard Korte
Applications of Combinatorial Optimization in the Design, Layout and Production of Computers. Modelling the Innovation (1990)
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) (1990)
Bernhard Korte, Hans Jürgen Prömel, Angelika Steger
Combining partitioning and global routing in sea-of-cells design. ICCAD (1989)
Bernhard Korte, László Lovász
The intersection of matroids and antimatroids. Discret. Math. 73 (1-2) (1989)
Bernhard Korte, László Lovász
Homomorphisms and Ramsey properties of antimatroids. Discret. Appl. Math. 15 (2-3) (1986)
Bernhard Korte, László Lovász
Non-interval greedoids and the transposition property. Discret. Math. 59 (3) (1986)
Bernhard Korte, László Lovász
Relations between subclasses of greedoids. Z. Oper. Research 29 (7) (1985)
Bernhard Korte, László Lovász
A Note on Selectors and Greedoids. Eur. J. Comb. 6 (1) (1985)
Bernhard Korte, László Lovász
Polymatroid greedoids. J. Comb. Theory, Ser. B 38 (1) (1985)
Bernhard Korte, László Lovász
Structural properties of greedoids. Comb. 3 (3) (1983)
Achim Bachem, Bernhard Korte, Martin Grötschel
Scientific Program. ISMP (1982)
Per M. Jensen, Bernhard Korte
Complexity of Matroid Property Algorithms. SIAM J. Comput. 11 (1) (1982)
Bernhard Korte
XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany. Math. Program. 22 (1) (1982)
Bernhard Korte, Rainer Schrader
A Survey on Oracle Techniques. MFCS (1981)
Dirk Hausmann, Ravindran Kannan, Bernhard Korte
Exponential Lower Bounds on a Class of Knapsack Algorithms. Math. Oper. Res. 6 (2) (1981)
Bernhard Korte, László Lovász
Mathematical Structures Underlying Greedy Algorithms. FCT (1981)
Achim Bachem, Bernhard Korte
On the RAS-algorithm. Computing 23 (2) (1979)
D. Braess, H. Läpple, W. Mag, Heiner Müller-Merbach, M. Gaitanides, Bernhard Korte
Buchbesprechungen. Z. Oper. Research 22 (1) (1978)
Dirk Hausmann, Bernhard Korte
Lower bounds on the worst-case complexity of some oracle algorithms. Discret. Math. 24 (3) (1978)
Dirk Hausmann, Bernhard Korte
-greedy algorithms for independence systems. Z. Oper. Research 22 (1) (1978)
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) (1974)
Wilhelm Krelle, Bernhard Korte, Walter Oberhofer
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung 14 (1) (1970)
Wilhelm Krelle, Bernhard Korte, Walter Oberhofer
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben. Unternehmensforschung 13 (3) (1969)
Bernhard Korte, Wilhelm Krelle, Walter Oberhofer
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben - Teil I. Unternehmensforschung 13 (2) (1969)
Bernhard Korte, Walter Oberhofer
Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems. Unternehmensforschung 12 (1) (1968)