Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.
LibreCat: /record/2126

Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.
LibreCat: /record/2127

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

Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.
LibreCat: /record/2129

Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.
LibreCat: /record/2130

Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.
LibreCat: /record/2131

Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.
LibreCat: /record/2132

Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.
LibreCat: /record/2133

Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.
LibreCat: /record/2135

Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.
LibreCat: /record/2136

Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.
LibreCat: /record/2137

Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.
LibreCat: /record/2138

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

Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.
LibreCat: /record/2140

Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.
LibreCat: /record/2141

Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.
LibreCat: /record/2142

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

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