Bäumker, A., Dittrich, W., &; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203.https://doi.org/10.1016/s0304-3975(98)00020-6 

Meyer auf der Heide, F., &; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/bfb0054332 

Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K.,https://doi.org/10.1145/276698.276790__Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98.https://doi.org/10.1145/276698.276790 

Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Czumaj, A., &; Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).https://doi.org/10.1007/3-540-63397-9_9 

Strothmann, W.-B., &; Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.

Sohler, C., &; Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In Proceedings of the 9th Canadian Conference on Computational Geometry (pp. 39–43).

Bock, S., Meyer auf der Heide, F., &; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.