Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”10.1007/s002240000123__Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.

Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.

Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”10.1007/s002240000096__Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.

Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.

Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.

Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”10.1007/3-540-60313-1_154__ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.

Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” Thematic Applications of SAR Data, 1985, p. 57.