TY - CONF AU - Awerbuch, Baruch AU - Brinkmann, André AU - Scheideler, Christian ID - 2129 T2 - ICALP TI - Anycasting in Adversarial Systems: Routing and Admission Control VL - 2719 ER - TY - CONF AU - Awerbuch, Baruch AU - Scheideler, Christian ID - 2130 T2 - PODC TI - Peer-to-peer systems for prefix search ER - TY - CONF AU - Czumaj, Artur AU - Riley, Chris AU - Scheideler, Christian ID - 2131 T2 - RANDOM-APPROX TI - Perfectly Balanced Allocation VL - 2764 ER - TY - CONF AU - Jia, Lujun AU - Rajaraman, Rajmohan AU - Scheideler, Christian ID - 2132 T2 - SPAA TI - On local algorithms for topology control and routing in ad hoc networks ER - TY - CONF AU - Kothapalli, Kishore AU - Scheideler, Christian ID - 2133 T2 - SPAA TI - Information gathering in adversarial systems: lines and cycles ER - TY - JOUR AU - Feige, Uriel AU - Scheideler, Christian ID - 2134 IS - 3 JF - Combinatorica TI - Improved Bounds for Acyclic Job Shop Scheduling ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2135 T2 - SODA TI - Improved bounds for the unsplittable flow problem ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2136 T2 - SPAA TI - Compact, adaptive placement schemes for non-uniform requirements ER - TY - CONF AU - Bagchi, Amitabha AU - Chaudhary, Amitabh AU - Scheideler, Christian AU - Kolman, Petr ID - 2137 T2 - SPAA TI - Algorithms for fault-tolerant routing in circuit switched networks ER - TY - CONF AU - Scheideler, Christian ID - 2138 T2 - STACS TI - Models and Techniques for Communication in Dynamic Networks VL - 2285 ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian ID - 2139 IS - 1 JF - Combinatorica TI - Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols VL - 21 ER - TY - CONF AU - Awerbuch, Baruch AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2140 T2 - FOCS TI - Simple Routing Strategies for Adversarial Systems ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2141 T2 - PDP TI - SIMLAB-A Simulation Environment for Storage Area Networks ER - TY - CONF AU - Kolman, Petr AU - Scheideler, Christian ID - 2142 T2 - SPAA TI - Simple on-line algorithms for the maximum disjoint paths problem ER - TY - JOUR AU - Adler, Micah AU - Scheideler, Christian ID - 2143 IS - 5/6 JF - Theory Comput. Syst. TI - Efficient Communication Strategies for Ad Hoc Wireless Networks VL - 33 ER - TY - JOUR AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2145 IS - 4 JF - SIAM J. Comput. TI - From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols VL - 30 ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2146 T2 - PDPTA TI - Distributed Path Selection for Storage Networks ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2147 T2 - SODA TI - Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma ER - TY - JOUR AU - Czumaj, Artur AU - Scheideler, Christian ID - 2148 IS - 3-4 JF - Random Struct. Algorithms TI - Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma VL - 17 ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2149 T2 - SPAA TI - Efficient, distributed data placement strategies for storage area networks (extended abstract) ER -