Lower bounds on the worst-case complexity of some oracle algorithms. - Dirk Hausmann; Bernhard Korte (Discret. Math., 1978)

K-greedy algorithms for independence systems. - Dirk Hausmann; Bernhard Korte (Z. Oper. Research, 1978)

Characterizations of adjacency on the branching polyhedron. - Rick Giles; Dirk Hausmann (Discret. Math., 1979)

Exponential Lower Bounds on a Class of Knapsack Algorithms. - Dirk Hausmann; Ravindran Kannan; Bernhard Korte (Math. Oper. Res., 1981)