Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.
LibreCat: /record/2140

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.
LibreCat: /record/2141

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
LibreCat: /record/2142

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”https://doi.org/10.1007/s002240010006__Theory Comput. Syst. 33, no. 5/6 (2000): 337--391.https://doi.org/10.1007/s002240010006 .
LibreCat: /record/2143
DOI: 10.1007/s002240010006

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”https://doi.org/10.1137/S0097539799353431__SIAM J. Comput. 30, no. 4 (2000): 1126--1155.https://doi.org/10.1137/S0097539799353431 .
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.
LibreCat: /record/2146

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.
LibreCat: /record/2147

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.
LibreCat: /record/2148

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
LibreCat: /record/2149

Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
LibreCat: /record/2150

Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
LibreCat: /record/2211

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”https://doi.org/10.1007/s002240000123__Theory Comput. Syst. 32, no. 3 (1999): 387--420.https://doi.org/10.1007/s002240000123 .
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat: /record/2164

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat: /record/2165

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat: /record/2210

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.
LibreCat: /record/2166

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”https://doi.org/10.1007/s002240000096__Theory Comput. Syst. 31, no. 4 (1998): 425--449.https://doi.org/10.1007/s002240000096 .
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat: /record/2169

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat: /record/2170

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998.https://doi.org/10.1007/BFb0052928 .
LibreCat: /record/2185
DOI: 10.1007/BFb0052928