Fast parallel vertex colouring. - Frank Bauernöppel; Hermann Jung 001 (FCT, 1985)

Degree Bounds and Subhamiltonian Cycles in Planar Graphs. - Frank Bauernöppel (J. Inf. Process. Cybern., 1987)

Implementing Abstract Data Structures in Hardware. - Frank Bauernöppel; Hermann Jung 001 (MFCS, 1988)

A Parallel Dictionary with Good Amortized Behavior. - Frank Bauernöppel (J. Inf. Process. Cybern., 1989)

Beschleunigung von Datenstrukturen durch effiziente Parallelisierung. - Frank Bauernöppel (1989)

Optimal Shooting: Characterizations and Applications. - Frank Bauernöppel; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (ICALP, 1995)

Planar Stage Graphs: Characterizations and Applications. - Frank Bauernöppel; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Jörg-Rüdiger Sack; Jorge Urrutia (Theor. Comput. Sci., 1997)

An $ varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. - Frank Bauernöppel; Anil Maheshwari; Jörg-Rüdiger Sack (LATIN, 2020)

An Ω(nd) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures. - Frank Bauernöppel; Anil Maheshwari; Jörg-Rüdiger Sack (Comput. Geom., 2022)