Pagoda: a dynamic overlay network for routing, data management, and multicasting
A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.

The effect of faults on network expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.

Storage Management as Means to cope with Exponential Information Growth
C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.

Smoothed Motion Complexity
V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.

Anycasting in Adversarial Systems: Routing and Admission Control
B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.

Peer-to-peer systems for prefix search
B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.

Perfectly Balanced Allocation
A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.

On local algorithms for topology control and routing in ad hoc networks
L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.

Information gathering in adversarial systems: lines and cycles
K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.

Improved Bounds for Acyclic Job Shop Scheduling
U. Feige, C. Scheideler, Combinatorica (2002) 361--399.

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.

Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.

Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.

Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.

Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.

SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.

Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.