Bernhard Korte - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2011

Combinatorial Optimization in VLSI DesignStephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen. In Vasek Chvátal, editor, Combinatorial Optimization - Methods and Applications. Volume 31 of NATO Science for Peace and Security Series - D: Information and Communication Security, pages 33-96, IOS Press, 2011. [doi]

2007

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a ChipBernhard Korte, Dieter Rautenbach, Jens Vygen. pieee, 95(3):555-572, 2007. [doi]

2003

Clock Scheduling and Clocktree Construction for High Performance ASICSStephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen. iccad 2003: 232-240 [doi]

2002

Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chipChristoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen. DAM, 123(1-3):103-127, 2002.

2001

Vojtech Jarni k s work in combinatorial optimizationBernhard Korte, Jaroslav Nesetril. DM, 235(1-3):1-17, 2001. [doi]

1999

Cycle time and slack optimization for VLSI-chipsChristoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen. iccad 1999: 232-238 [doi]

How Long Does a Bit Live in a Computer? (abstract)Bernhard Korte. esa 1999: 28 [doi]

1991

Mathematik, Realität und Ästhetik - eine Bilderfolge zum VLSI Chip DesignBernhard Korte. Springer, 1991. [doi]

1990

VLSI: placement based on routing and timing informationJörn Garbers, Bernhard Korte, Hans Jürgen Prömel, E. Schwietzke, Angelika Steger. eurodac 1990: 317-321 [doi]

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells DesignAsmus Hetzel, Bernhard Korte, Roland Krieger, Hans Jürgen Prömel, Ulf-Dietmar Radicke, Angelika Steger. ife, 5(1):2-19, 1990.

1989

The intersection of matroids and antimatroidsBernhard Korte, László Lovász. DM, 73(1-2):143-157, 1989. [doi]

Combining partitioning and global routing in sea-of-cells designBernhard Korte, Hans Jürgen Prömel, Angelika Steger. iccad 1989: 98-101 [doi]

1986

Non-interval greedoids and the transposition propertyBernhard Korte, László Lovász. DM, 59(3):297-314, 1986. [doi]

Homomorphisms and Ramsey properties of antimatroidsBernhard Korte, László Lovász. DAM, 15(2-3):283-290, 1986. [doi]

1985

Polymatroid greedoidsBernhard Korte, László Lovász. JCT, 38(1):41-72, 1985. [doi]

A Note on Selectors and GreedoidsBernhard Korte, László Lovász. ejc, 6(1):59-67, 1985. [doi]

Relations between subclasses of greedoidsBernhard Korte, László Lovász. mmor, 29(7):249-267, 1985. [doi]

1983

Structural properties of greedoidsBernhard Korte, László Lovász. combinatorica, 3(3):359-374, 1983.

1982

Scientific ProgramAchim Bachem, Bernhard Korte, Martin Grötschel. ismp 1983: 605-648 [doi]

Complexity of Matroid Property AlgorithmsPer M. Jensen, Bernhard Korte. SICOMP, 11(1):184-190, 1982.

XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. GermanyBernhard Korte. mp, 22(1):122-123, 1982. [doi]

1981

Exponential Lower Bounds on a Class of Knapsack AlgorithmsDirk Hausmann, Ravindran Kannan, Bernhard Korte. mor, 6(2):225-232, 1981. [doi]

A Survey on Oracle TechniquesBernhard Korte, Rainer Schrader. mfcs 1981: 61-77

Mathematical Structures Underlying Greedy AlgorithmsBernhard Korte, László Lovász. fct 1981: 205-209

1979

On the RAS-algorithmAchim Bachem, Bernhard Korte. computing, 23(2):189-198, 1979. [doi]

1978

K-greedy algorithms for independence systemsDirk Hausmann, Bernhard Korte. mmor, 22(1):219-228, 1978. [doi]

Lower bounds on the worst-case complexity of some oracle algorithmsDirk Hausmann, Bernhard Korte. DM, 24(3):261-276, 1978. [doi]

1970

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger ProgrammierungsaufgabenWilhelm Krelle, Bernhard Korte, Walter Oberhofer. mmor, 14(1):228-234, 1970. [doi]

1969

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben - Teil IBernhard Korte, Wilhelm Krelle, Walter Oberhofer. mmor, 13(2):73-98, 1969. [doi]

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger ProgrammierungsaufgabenWilhelm Krelle, Bernhard Korte, Walter Oberhofer. mmor, 13(3):171-192, 1969. [doi]

1968

Zwei Algorithmen zur Lösung eines komplexen ReihenfolgeproblemsBernhard Korte, Walter Oberhofer. mmor, 12(1):217-231, 1968. [doi]

Sign in or sign up to see more results.

runs on WebDSL