Bernhard Korte

According to our database, Bernhard Korte authored at least 33 papers between 1968 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2011

Combinatorial Optimization in VLSI Design.

Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

2007

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip.

Bernhard Korte, Dieter Rautenbach, Jens Vygen

Proc. IEEE, 2007

2003

Clock Scheduling and Clocktree Construction for High Performance ASICS.

Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen

Proceedings of the 2003 International Conference on Computer-Aided Design, 2003

2002

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

2001

Vojtech Jarni'k's work in combinatorial optimization.

Bernhard Korte, Jaroslav Nesetril

Discret. Math., 2001

1999

Cycle time and slack optimization for VLSI-chips.

Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen

Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999

How Long Does a Bit Live in a Computer? (abstract).

Bernhard Korte

Proceedings of the Algorithms, 1999

1991

Mathematik, Realität und Ästhetik - eine Bilderfolge zum VLSI Chip Design.

Bernhard Korte

Springer, ISBN: 978-3-540-53760-1, 1991

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

Applications of Combinatorial Optimization in the Design, Layout and Production of Computers.

Bernhard Korte

Proceedings of the Modelling the Innovation: Communications, 1990

VLSI: placement based on routing and timing information.

Jörn Garbers, Bernhard Korte, Hans Jürgen Prömel, E. Schwietzke, Angelika Steger

Proceedings of the European Design Automation Conference, 1990

1989

The intersection of matroids and antimatroids.

Bernhard Korte, László Lovász

Discret. Math., 1989

Combining partitioning and global routing in sea-of-cells design.

Bernhard Korte, Hans Jürgen Prömel, Angelika Steger

Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

1986

Non-interval greedoids and the transposition property.

Bernhard Korte, László Lovász

Discret. Math., 1986

Homomorphisms and Ramsey properties of antimatroids.

Bernhard Korte, László Lovász

Discret. Appl. Math., 1986

1985

Relations between subclasses of greedoids.

Bernhard Korte, László Lovász

Z. Oper. Research, 1985

Polymatroid greedoids.

Bernhard Korte, László Lovász

J. Comb. Theory, Ser. B, 1985

A Note on Selectors and Greedoids.

Bernhard Korte, László Lovász

Eur. J. Comb., 1985

1983

Structural properties of greedoids.

Bernhard Korte, László Lovász

Comb., 1983

1982

Complexity of Matroid Property Algorithms.

Per M. Jensen, Bernhard Korte

SIAM J. Comput., 1982

XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany.

Bernhard Korte

Math. Program., 1982

Scientific Program.

Achim Bachem, Bernhard Korte, Martin Grötschel

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

Exponential Lower Bounds on a Class of Knapsack Algorithms.

Dirk Hausmann, Ravindran Kannan, Bernhard Korte

Math. Oper. Res., 1981

A Survey on Oracle Techniques.

Bernhard Korte, Rainer Schrader

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Mathematical Structures Underlying Greedy Algorithms.

Bernhard Korte, László Lovász

Proceedings of the Fundamentals of Computation Theory, 1981

1979

On the RAS-algorithm.

Achim Bachem, Bernhard Korte

Computing, 1979

1978

<i>K</i>-greedy algorithms for independence systems.

Dirk Hausmann, Bernhard Korte

Z. Oper. Research, 1978

Buchbesprechungen.

D. Braess, H. Läpple, W. Mag, Heiner Müller-Merbach, M. Gaitanides, Bernhard Korte

Z. Oper. Research, 1978

Lower bounds on the worst-case complexity of some oracle algorithms.

Dirk Hausmann, Bernhard Korte

Discret. Math., 1978

1974

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, Bernd Schiemenz, G. Trenkler, Peter Kall, Hans M. Dathe

Z. Oper. Research, 1974

1970

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben.

Wilhelm Krelle, Bernhard Korte, Walter Oberhofer

Unternehmensforschung, 1970

1969

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben - Teil I.

Bernhard Korte, Wilhelm Krelle, Walter Oberhofer

Unternehmensforschung, 1969

1968

Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems.

Bernhard Korte, Walter Oberhofer

Unternehmensforschung, 1968