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.