Bernhard Korte

Q: What Schools Are Affiliated With Bernhard Korte

Bernhard Korte is affiliated with the following schools: University of Regensburg, Bielefeld University, University of Bonn

Bernhard Korte's AcademicInfluence.com Rankings

Bernhard Korte

Mathematics

#2569

World Rank

#3941

Historical Rank

Measure Theory

#3297

World Rank

#3896

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Bernhard Korte's Degrees

PhD Mathematics University of Bonn

Why Is Bernhard Korte Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bernhard H. Korte is a German mathematician and computer scientist, a professor at the University of Bonn, and an expert in combinatorial optimization. Biography Korte earned his doctorate from the University of Bonn in 1967. His thesis was entitled "Beiträge zur Theorie der Hardy'schen Funktionenklassen" , and was supervised by Ernst Peschl and Walter Thimm. He earned his habilitation in 1971, and briefly held faculty positions at Regensburg University and Bielefeld University before joining the University of Bonn as a faculty member in 1972. At the University of Bonn, Korte is the director of the Research Institute for Discrete Mathematics.

(See a Problem?)

Bernhard Korte's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorial Optimization: Theory and Algorithms (2007) (1565)
Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 (1983) (461)
An Analysis of the Greedy Heuristic for Independence Systems (1978) (168)
Paths, Flows, and VLSI-Layout (1990) (167)
Combinatorial optimization (2000) (151)
Complexity of Matroid Property Algorithms (1982) (102)
Mathematical Structures Underlying Greedy Algorithms (1981) (99)
ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES (1981) (94)
Greedoids - A Structural Framework for the Greedy Algorithm (1984) (70)
Optimization and Operations Research (1976) (69)
Cycle time and slack optimization for VLSI-chips (1999) (59)
Homotopy properties of greedoids (1985) (56)
Worst case analysis of greedy type algorithms for independence systems (1980) (55)
Mathematical Programming the State of the Art: Bonn 1982 (1983) (52)
Structural properties of greedoids (1983) (52)
Clock scheduling and clocktree construction for high performance ASICs (2003) (52)
Triangularizing input-output matrices and the structure of production☆ (1971) (45)
Greedoids and Linear Objective Functions (1984) (37)
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip (2007) (36)
Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm (1998) (35)
Lower bounds on the worst-case complexity of some oracle algorithms (1978) (31)
On the RAS-algorithm (1979) (30)
Combinatorial Optimization in VLSI Design (2011) (29)
K-greedy algorithms for independence systems (1978) (27)
Algorithmic versus axiomatic definitions of matroids (1981) (27)
Approximative Algorithms for Discrete Optimization Problems (1979) (27)
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (2002) (26)
Minimum norm problems over transportation polytopes (1980) (22)
Colouring criteria for adjacency on 0–1-polyhedra (1978) (18)
Vojtech Jarni'k's work in combinatorial optimization (2001) (17)
Examples and algorithmic properties of Greedoids (1989) (16)
Combinatorial Problems in Chip Design (2008) (15)
Basis graphs of greedoids and two-connectivity (1985) (15)
Polyhedral Results for Antimatroids a (1989) (14)
Homomorphisms and Ramsey properties of antimatroids (1986) (14)
Relations between subclasses of greedoids (1985) (11)
Non-interval greedoids and the transposition property (1986) (10)
Oracle Algorithms for Fixed-Point Problems — An Axiomatic Approach (1978) (10)
VLSI-placement based on routing and timing information (1990) (9)
Combining partitioning and global routing in sea-of-cells design (1989) (8)
Linear Programming Algorithms (2012) (6)
A Note on Selectors and Greedoids (1985) (6)
Applications of Combinatorial Optimization in the Design, Layout and Production of Computers (1990) (5)
Network Design Problems (2012) (5)
Exponential Lower Bounds on a Class of Knapsack Algorithms (1981) (5)
Spanning Trees and Arborescences (2012) (5)
A note on convergence proofs for Shor-Khachian-Methods (1981) (4)
Some Remarks on a Classification of Oracle-Type-Algorithms (1979) (4)
A Survey on Oracle Techniques (1981) (3)
Multicommodity Flows and Edge-Disjoint Paths (2012) (3)
The Knapsack Problem (2012) (3)
Polymatroid greedoids (1985) (3)
Optimization and operations research: Proceedings of a workshop held at the University of Bonn, October 2-8, 1977 (1978) (3)
Abstract Convexity — Antimatroids (1991) (2)
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design (1990) (2)
Primal and Dual Methods for Updating Input-Output Matrices (1981) (2)
b-Matchings and T-Joins (2012) (2)
Can the Ellipsoid Method be Efficient (1984) (2)
A NOTE ON THE GENERALITY OF THE SELF-DUAL ALGORITHM WITH VARIOUS STARTING POINTS (2004) (2)
XI. International Symposium on Mathematical Programming (1982) (2)
Routing in VLSI-layout (1991) (2)
The Traveling Salesman Problem (2012) (2)
Estimating matrices (1981) (2)
Worst-case analysis for a class of combinatorial optimization algorithms (1978) (2)
Mathematical programming : proceedings of the International Congress on Mathematical Programming, Rio de Janeiro, Brazil, 6-8 April, 1981 (1984) (1)
Mathematik im Chip-Design (2009) (1)
Le probléme du bin-packing (2010) (1)
Algorithmic Mathematics versus Dialectic Mathematics (1985) (1)
Das Traveling-Salesman-Problem (2012) (1)
The intersection of matroids and antimatroids (1989) (1)
Two commodity trees (1976) (0)
b-Matching e T- Join (2011) (0)
Generalizations of Matroids (2012) (0)
A design-system for ASIC's with macrocells (1990) (0)
Local Poset Greedoids (1991) (0)
Computational relations between various definitions of matroids and independence systems (1980) (0)
Topological Results for Greedoids (1991) (0)
b -couplages et T -joints (2010) (0)
Optimization in Greedoids (1991) (0)
Intersection, Slimming and Trimming (1991) (0)
Netzwerk-Design-Probleme (2012) (0)
Long paths to success, or some classess of pseudo-Boolean functions (1983) (0)
About the XIth International Symposium on Mathematical Programming (1982) (0)
Plus courts chemins (2010) (0)
Mathematics of Chip Design (2010) (0)
Greedoids on Partially Ordered Sets (1991) (0)
How Long Does a Bit Live in a Computer? (abstract) (1999) (0)
Vojtech Jarn! work incombin atorial optimization (2001) (0)
Further Structural Properties (1991) (0)
Abstract Linear Dependence — Matroids (1991) (0)
Structural properties (0)
Minimum Cost Flows (2012) (0)
Independence theory in combinatorics: An introductory account with applications to graphs and transversals: V. BRYANT and H. PERFECT Chapman and Hall, London, 1980, xii + 144 pages, £5.50 (1982) (0)
Modern applied mathematics : optimization and operations research : collection of state-of-the-art surveys based on lectures presented at the summer school "Optimization and Operations Research," held at the University of Bonn, September 14-22, 1979 (1982) (0)
General Exchange Structures — Greedoids (1991) (0)

This paper list is powered by the following services:

Other Resources About Bernhard Korte

en.wikipedia.org

What Schools Are Affiliated With Bernhard Korte?

Bernhard Korte is affiliated with the following schools:

Bernhard Korte's Academic­Influence.com Rankings