Bernhard Korte

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Combinatorial Optimization in VLSI Design.
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

2007
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip.
Proc. IEEE, 2007

2003
Clock Scheduling and Clocktree Construction for High Performance ASICS.
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.
Discret. Appl. Math., 2002

2001
Vojtech Jarni'k's work in combinatorial optimization.
Discret. Math., 2001

1999
Cycle time and slack optimization for VLSI-chips.
Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999

How Long Does a Bit Live in a Computer? (abstract).
Proceedings of the Algorithms, 1999

1991
Mathematik, Realität und Ästhetik - eine Bilderfolge zum VLSI Chip Design.
Springer, ISBN: 978-3-540-53760-1, 1991

1990
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.
Inform. Forsch. Entwickl., 1990

Applications of Combinatorial Optimization in the Design, Layout and Production of Computers.
Proceedings of the Modelling the Innovation: Communications, 1990

VLSI: placement based on routing and timing information.
Proceedings of the European Design Automation Conference, 1990

1989
The intersection of matroids and antimatroids.
Discret. Math., 1989

Combining partitioning and global routing in sea-of-cells design.
Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989

1986
Non-interval greedoids and the transposition property.
Discret. Math., 1986

Homomorphisms and Ramsey properties of antimatroids.
Discret. Appl. Math., 1986

1985
Relations between subclasses of greedoids.
Z. Oper. Research, 1985

Polymatroid greedoids.
J. Comb. Theory, Ser. B, 1985

A Note on Selectors and Greedoids.
Eur. J. Comb., 1985

1983
Structural properties of greedoids.
Comb., 1983

1982
Complexity of Matroid Property Algorithms.
SIAM J. Comput., 1982

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

Scientific Program.
Proceedings of the Mathematical Programming The State of the Art, 1982

1981
Exponential Lower Bounds on a Class of Knapsack Algorithms.
Math. Oper. Res., 1981

A Survey on Oracle Techniques.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Mathematical Structures Underlying Greedy Algorithms.
Proceedings of the Fundamentals of Computation Theory, 1981

1979
On the RAS-algorithm.
Computing, 1979

1978
<i>K</i>-greedy algorithms for independence systems.
Z. Oper. Research, 1978

Buchbesprechungen.
Z. Oper. Research, 1978

Lower bounds on the worst-case complexity of some oracle algorithms.
Discret. Math., 1978

1974
Buchbesprechungen.
Z. Oper. Research, 1974

1970
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben.
Unternehmensforschung, 1970

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

1968
Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems.
Unternehmensforschung, 1968


  Loading...