Extremal paths in graphs - foundations, search strategies and related topics - Ulrich Huckenbeck (Akademie Verlag, 1997)

On Valve Adjustments that Interrupt all s-t-Paths in a Digraph - Ulrich Huckenbeck (J. Autom. Lang. Comb., 1997)

On Paths in Networks with Valves - Ulrich Huckenbeck (STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, 1993)

Constructing Sets of Functions Which Have a Given F-Cardinality - Ulrich Huckenbeck (Math. Syst. Theory, 1992)

Some Elementary Results About the Equivalence of Computability and Decidability - Ulrich Huckenbeck (Math. Log. Q., 1991)

A Result about the Power of Geometric Oracle Machines - Ulrich Huckenbeck (Theor. Comput. Sci., 1991)

On geometric automata which can nondeterminstically choose auxiliary points - Ulrich Huckenbeck (RAIRO Theor. Informatics Appl., 1990)

A Generalized Best-First Search Method in Graphs - Ulrich Huckenbeck; Detlev Ruland (Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings, 1990)

An Equivalence Result for Oracle Sets - Ulrich Huckenbeck (J. Inf. Process. Cybern., 1989)

Euclidian Geometry in Terms of Automata Theory - Ulrich Huckenbeck (Theor. Comput. Sci., 1989)

On the complexity of convex hull algorithms if rotational minima can be found very fast - Ulrich Huckenbeck (ZOR Methods Model. Oper. Res., 1988)

Geometrical Abstract Automata - Ulrich Huckenbeck (Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, Würzburg, Germany, March 24-25, 1988, 1988)

On Paths in Search or Decision Trees Which Require Almost Worst-Case Time - Ulrich Huckenbeck (Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings, 1988)

Geometrische Maschinenmodelle - Ulrich Huckenbeck (Julius Maximilians University Würzburg, Germany, 1987)