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

Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &; Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.

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

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.

Awerbuch, B., &; Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.

Czumaj, A., Riley, C., &; Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.

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

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

Feige, U., &; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399.https://doi.org/10.1007/s004930200018 

Kolman, P., &; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).

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

Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.

Meyer auf der Heide, F., &; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138.https://doi.org/10.1007/s004930170007 

Awerbuch, B., Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.

Kolman, P., &; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).

Adler, M., &; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.https://doi.org/10.1007/s002240010006 

Scheideler, C., &; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155.https://doi.org/10.1137/S0097539799353431