1. 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.

  2. 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.

  3. [S]? I. Althöfer, Decision Support Systems With Multiple Choice Structure, Reports on Optimization 99--31 (1999) und in [4].

  4. 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.

  5. [S] I. Althöfer, List-3-Hirn vs Grandmaster Yusupov - a report on a very experimental match. ICCA Journal 21 (1998), 52-60 and 131-134.

  6. [S] I. Althöfer, 13 Jahre 3-Hirn - Meine Schach-Experimente mit Mensch-Maschinen-Kombinationen. Buch mit 348 Seiten, Selbstverlag (1998).

  7. [S] I. Althöfer, A symbiosis of man and machine beats Grandmaster Timoshchenko. ICCA Journal 20.1 (March 1997), 40-47.

  8. [S] I. Althöfer, On the k-best mode in computer chess: measuring the similarity of move proposals, ICCA Journal 10 (1997), 152-165.

  9. I. Althöfer and M. Löwe, Edge search in hypergraphs, Discrete Math. 162 (1996), no.~1-3, 267--271; MR 97g:05127

  10. [S] I. Althöfer, Doppelfritz mit Chef. CSS (October 1996), 33-36.

  11. 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

  12. 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

  13. I. Althöfer, On sparse approximations to randomized strategies and convex combinations, Linear Algebra Appl. 199 (1994), 339--355; MR 95m:90156

  14. I. Althöfer, Small integral flows need only sparse networks, Networks 24 (1994), no.~4, 263--266; MR 95e:90033

  15. 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

  16. I. Althöfer, A parallel game tree search algorithm with a linear speedup, J. Algorithms 15 (1993), no.~2, 175--198; MR 94h:68176

  17. 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

  18. 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

  19. [S] I. Althöfer, Das Dreihirn - eine Zwischenbilanz. CSS (April 1993), 49-52.

  20. 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

  21. [S] I. Althöfer, On telescoping linear evalution functions, ICCA Journal 16 (1993), 91--94.

  22. 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

  23. 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

  24. I. Althöfer, On pathology in game tree and other recursion tree models, Habilitation Thesis (June 1991), Faculty of Mathematics, University of Bielefeld.

  25. I. Althöfer, Data compression using an intelligent generator: the storage of chess games as an example. Artificial Intelligence 52 (1991), 109-113.

  26. [S] I. Althöfer, Selective trees and majority systems: two experiments with commercial chess computers. In "Advances in Computer Chess 6" (Editor D.F. Beal), Ellis Horwood (1991), Chichester, 37-59.

  27. 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

  28. [S] I. Althöfer, Je mehr, desto besser - Mehrheitssysteme im Computerschach und der Yazgac-Test. MODUL (June 1990), 54-61.

  29. 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

  30. [S] I. Althöfer, Generalized minimax algorithms are no better error correctors than minimax itself. In "Advances in Computer Chess 5" (Editor D.F. Beal), North-Holland (1990), 265-282.

  31. 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

  32. 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

  33. 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

  34. 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

  35. I. Althöfer, On optimal realizations of finite metric spaces by graphs. Discrete & Computational Geometry 3 (1988), 103-122.

  36. 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

  37. I. Althöfer, Nim games with arbitrary periodic moving orders, Internat. J. Game Theory 17 (1988), no.~3, 165--175; MR 89j:90276

  38. I. Althöfer, On optimal realizations of finite metric spaces by graphs, Discrete Comput. Geom. 3 (1988), no.~2, 103--122; MR 89a:05123

  39. 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

  40. [S] I. Althöfer, Das Dreihirn - Entscheidungsteilung im Schach. CSS (December 1985), 20-22