I. Althöfer and W. Wenzel, k-best solutions under distance constraints in valuated Delta-matroids. Adv. in Appl. Math. 22 (1999), no. 4, 381--412.
I. Althöfer and W. Wenzel, Two-best solutions under distance constraints: the model and exemplary results for matroids. Adv. in Appl. Math. 22 (1999), no. 2, 155--185.
Numbers, information and complexity. Papers from the symposium held in honor of Rudolf Ahlswede on his 60th birthday at the University of Bielefeld, Bielefeld, October 1998. Edited by Ingo Althöfer, Ning Cai, Gunter Dueck, Levon Khachatrian, Mark S. Pinsker, Andras Sárközy, Ingo Wegener and Zhen Zhang. Kluwer Academic Publishers, Boston, MA, 2000. xx+652 pp.
I. Althöfer and M. Löwe, Edge search in hypergraphs, Discrete Math. 162 (1996), no.~1-3, 267--271; MR 97g:05127
I. Althöfer and I. Leader, Correlation of Boolean functions and pathology in recursion trees, SIAM J. Discrete Math. 8 (1995), no.~4, 526--535; MR 96m:68160
I. Althöfer and J. Bültermann, Superlinear period lengths in some subtraction games, Theoret. Comput. Sci. 148 (1995), no.~1, 111--119; MR 96h:90174
I. Althöfer, On sparse approximations to randomized strategies and convex combinations, Linear Algebra Appl. 199 (1994), 339--355; MR 95m:90156
I. Althöfer, Small integral flows need only sparse networks, Networks 24 (1994), no.~4, 263--266; MR 95e:90033
R. Ahlswede and I. Althöfer, The asymptotic behaviour of diameters in the average, J. Combin. Theory Ser. B 61 (1994), no.~2, 167--177; MR 95e:05002
I. Althöfer, A parallel game tree search algorithm with a linear speedup, J. Algorithms 15 (1993), no.~2, 175--198; MR 94h:68176
I. Althöfer and K.-U. Koschnick, On the deterministic complexity of searching local maxima, Discrete Appl. Math. 43 (1993), no.~2, 111--113; MR 94e:90077
I. Althöfer and E. Triesch, Edge search in graphs and hypergraphs of bounded rank, Discrete Math. 115 (1993), no.~1-3, 1--9; MR 93m:05179
I. Althöfer, G. Das, D. Dobkin, D. Joseph, J. Soares, On sparse spanners of weighted graphs, Discrete Comput. Geom. 9 (1993), no.~1, 81--100; MR 93h:05161
I. Althöfer and T. Sillke, An ``average distance'' inequality for large subsets of the cube, J. Combin. Theory Ser. B 56 (1992), no.~2, 296--301; MR 93i:05057
I. Althöfer and K.-U. Koschnick, On the convergence of ``threshold accepting'', Appl. Math. Optim. 24 (1991), no.~2, 183--195; MR 92i:90081
I. Althöfer, On pathology in game tree and other recursion tree models, Habilitation Thesis (June 1991), Faculty of Mathematics, University of Bielefeld.
I. Althöfer, Data compression using an intelligent generator: the storage of chess games as an example. Artificial Intelligence 52 (1991), 109-113.
I. Althöfer and B. Balkenhol, A game tree with distinct leaf values which is easy for the alpha-beta algorithm, Artificial Intelligence 52 (1991), no.~2, 183--190; CNO CMP 1 143 868
I. Althöfer, The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad, J. Complexity 6 (1990), no.~3, 264--277; MR 91m:68072
I. Althöfer, Generating sparse spanners for weighted graphs, in {\it SWAT 90 (Bergen, 1990), 26--37, Lecture Notes in Comput. Sci., 447, Springer, Berlin, ; CNO CMP 1 076 014
I. Althöfer, Tight lower bounds on the length of word chains, Inform. Process. Lett. 34 (1990), no.~5, 275--276; CNO CMP 1 059 --> --992
I. Althöfer, Average distances in undirected graphs and the removal of vertices, J. Combin. Theory Ser. B 48 (1990), no.~1, 140--142; MR 91c:05071
I. Althöfer, Asymptotic properties of levelregular decision trees with randomly evaluated leaves, Probab. Theory Related Fields 80 (1989), no.~3, 381--394; MR 90f:90177
I. Althöfer, On optimal realizations of finite metric spaces by graphs. Discrete & Computational Geometry 3 (1988), 103-122.
I. Althöfer, On the complexity of searching game trees and other recursion trees, J. Algorithms 9 (1988), no.~4, 538--567; MR 90g:68123
I. Althöfer, Nim games with arbitrary periodic moving orders, Internat. J. Game Theory 17 (1988), no.~3, 165--175; MR 89j:90276
I. Althöfer, On optimal realizations of finite metric spaces by graphs, Discrete Comput. Geom. 3 (1988), no.~2, 103--122; MR 89a:05123
I. Althöfer, An incremental error correcting evaluation algorithm for recursion networks without circuits, in {\it Trees and hierarchical structures (Bielefeld, 1987), 125--137, Lecture Notes in Biomath., 84, Springer, Berlin, ; CNO CMP 1 184 656