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.

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.

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.

Group Spreading: A Protocol for Provably Secure Distributed Name Service
B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.

A Distributed Hash Table for Computational Grids
C. Riley, C. Scheideler, in: IPDPS, 2004.

Robust Distributed Name Service
B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.

The hyperring: a low-congestion deterministic data structure for distributed environments
B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.

Consistent and compact data management in distributed storage systems
B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.

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.

Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment
M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.

Supervised Peer-to-Peer Systems
K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.

Constant density spanners for wireless ad-hoc networks
K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.

How to spread adversarial nodes?: rotate!
C. Scheideler, in: STOC, 2005, pp. 704--713.

Overlay networks for wireless ad hoc networks
C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.

Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.

Robust Random Number Generation for Peer-to-Peer Systems
B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.

Towards a scalable and robust DHT
B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.

The Effect of Faults on Network Expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.

Towards a paradigm for robust distributed algorithms and data structures
C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.

Linearization: Locally Self-Stabilizing Sorting in Graphs
M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.

Towards Scalable and Robust Overlay Networks
B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.

A denial-of-service resistant DHT
B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.

A Denial-of-Service Resistant DHT
B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47.

Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings
J. Aspnes, C. Scheideler, A. Arora, S. Madden, eds., Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings, 2007.

SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007
P. B. Gibbons, C. Scheideler, eds., SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, ACM, 2007.

Overlay Networks for Peer-to-Peer Networks
A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.

Dynamic and redundant data placement
A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Can ISPs and P users cooperate for improved performance?
V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).

Algorithms for Overlay Networks
C. Scheideler, Bulletin of the EATCS (2008) 130--152.

A jamming-resistant MAC protocol for single-hop wireless networks
B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.

SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.

Tiara: A Self-stabilizing Deterministic Skip List
T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.

Broadcasting: Wie verbreite ich schnell Informationen?
C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.

INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland
H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, C. Scheideler, eds., INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland, 2008.