Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.

Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.

Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.”https://doi.org/10.1007/s004930200018__Combinatorica, no. 3 (2002): 361--399.https://doi.org/10.1007/s004930200018 .

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.

Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.

Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”https://doi.org/10.1007/s004930170007__Combinatorica 21, no. 1 (2001): 95--138.https://doi.org/10.1007/s004930170007 .