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.

Flammini, M., &; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).

Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281.https://doi.org/10.1016/0304-3975(96)00032-1 

Meyer auf der Heide, F., &; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).

Meyer auf der Heide, F., &; Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.

Cypher, R., Meyer auf der Heide, F., Scheideler, C., &; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.

Meyer auf der Heide, F., &; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354).https://doi.org/10.1007/3-540-60313-1_154 

Meyer auf der Heide, F., &; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).

Raggam, J., Triebnig, G., Buchroithner, M., Domik, G., &; Leberl, F. (1985). Radargrammetric aspects of SAR data evaluation. Thematic Applications of SAR Data, 57.