Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

223 Publications


2002 | Conference Paper | LibreCat-ID: 2135 | OA
Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2136 | OA
Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2137 | OA
Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2138 | OA
Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2140 | OA
Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2141 | OA
Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2142 | OA
Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
LibreCat | Files available
 

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

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

2000 | Conference Paper | LibreCat-ID: 2146 | OA
Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147 | OA
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 | Files available
 

2000 | Journal Article | LibreCat-ID: 2148
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
 

2000 | Conference Paper | LibreCat-ID: 2149 | OA
Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2150 | OA
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 | Files available
 

2000 | Conference Paper | LibreCat-ID: 2211 | OA
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 | Files available
 

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

1999 | Conference Paper | LibreCat-ID: 2164 | OA
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165 | OA
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
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 | Files available
 

Filters and Search Terms

(person=20792) AND (type=conference_editor OR type=conference OR type=dissertation OR type=mastersthesis OR type=journal_article OR type=journal_editor OR type=preprint OR type=report OR type=working_paper OR type=book_chapter OR type=book_editor OR type=bachelorsthesis OR type=conference_abstract OR type=newspaper_article)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed