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.

298 Publications


2003 | Conference Paper | LibreCat-ID: 2133 | OA
Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.
LibreCat | Files available
 

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

2002 | Conference Paper | LibreCat-ID: 2135 | OA
Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2136 | OA
Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 2137 | OA
Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.
LibreCat | Files available
 

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

2001 | Journal Article | LibreCat-ID: 2139
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 | DOI
 

2001 | Conference Paper | LibreCat-ID: 2140 | OA
Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2141 | OA
Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 2142 | OA
Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.
LibreCat | Files available
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed