[{"doi":"10.1007/s004930200018","title":"Improved Bounds for Acyclic Job Shop Scheduling","author":[{"first_name":"Uriel","last_name":"Feige","full_name":"Feige, Uriel"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-04-03T05:43:36Z","date_updated":"2022-01-06T06:54:55Z","citation":{"apa":"Feige, U., &#38; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>, (3), 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3, 2002, pp. 361--399, doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>. 2002;(3):361--399. doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” <i>Combinatorica</i>, no. 3, pp. 361--399, 2002.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3 (2002): 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>."},"page":"361--399","year":"2002","issue":"3","user_id":"15504","department":[{"_id":"79"}],"_id":"2134","status":"public","type":"journal_article","publication":"Combinatorica"},{"title":"Improved bounds for the unsplittable flow problem","date_created":"2018-04-03T05:44:11Z","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publisher":"ACM/SIAM","oa":"1","date_updated":"2022-01-06T06:54:55Z","citation":{"ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: <i>SODA</i>. ACM/SIAM; 2002:184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In <i>SODA</i>, 184--193. ACM/SIAM, 2002.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in <i>SODA</i>, 2002, pp. 184--193.","apa":"Kolman, P., &#38; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In <i>SODA</i> (pp. 184--193). ACM/SIAM.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>SODA</i>, ACM/SIAM, 2002, pp. 184--193.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193."},"page":"184--193","year":"2002","has_accepted_license":"1","file_date_updated":"2018-04-12T08:59:58Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"_id":"2135","file":[{"file_name":"SODA-02.pdf","access_level":"open_access","file_id":"2303","file_size":246604,"creator":"florida","date_created":"2018-04-12T08:59:58Z","date_updated":"2018-04-12T08:59:58Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","urn":"21357","type":"conference","publication":"SODA"},{"date_updated":"2022-01-06T06:54:56Z","oa":"1","date_created":"2018-04-03T05:44:56Z","author":[{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"title":"Compact, adaptive placement schemes for non-uniform requirements","has_accepted_license":"1","year":"2002","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in <i>SPAA</i>, 2002, pp. 53--62.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In <i>SPAA</i>, 53--62, 2002.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: <i>SPAA</i>. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In <i>SPAA</i> (pp. 53--62).","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” <i>SPAA</i>, 2002, pp. 53--62.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }"},"page":"53--62","_id":"2136","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T09:02:22Z","type":"conference","publication":"SPAA","urn":"21366","file":[{"relation":"main_file","content_type":"application/pdf","file_size":123373,"file_name":"BSS-SPAA-02.pdf","access_level":"open_access","file_id":"2305","date_updated":"2018-04-12T09:02:22Z","creator":"florida","date_created":"2018-04-12T09:02:22Z"}],"status":"public"},{"title":"Algorithms for fault-tolerant routing in circuit switched networks","date_created":"2018-04-03T05:45:44Z","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"}],"date_updated":"2022-01-06T06:54:57Z","oa":"1","page":"265--274","citation":{"chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In <i>SPAA</i>, 265--274, 2002.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in <i>SPAA</i>, 2002, pp. 265--274.","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: <i>SPAA</i>. ; 2002:265--274.","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” <i>SPAA</i>, 2002, pp. 265--274.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., &#38; Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In <i>SPAA</i> (pp. 265--274)."},"year":"2002","has_accepted_license":"1","file_date_updated":"2018-04-12T09:03:44Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"2137","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T09:03:44Z","creator":"florida","date_created":"2018-04-12T09:03:44Z","file_size":187124,"access_level":"open_access","file_name":"BCKS-SPAA-02.pdf","file_id":"2306"}],"urn":"21376","publication":"SPAA","type":"conference"},{"publisher":"Springer","date_created":"2018-04-03T05:46:38Z","title":"Models and Techniques for Communication in Dynamic Networks","year":"2002","ddc":["040"],"publication":"STACS","file":[{"file_id":"2304","file_name":"STACS-02.pdf","access_level":"open_access","file_size":273875,"date_created":"2018-04-12T09:01:03Z","creator":"florida","date_updated":"2018-04-12T09:01:03Z","relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:54:57Z","oa":"1","volume":2285,"author":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"has_accepted_license":"1","page":"27--49","intvolume":"      2285","citation":{"ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: <i>STACS</i>. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in <i>STACS</i>, 2002, vol. 2285, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In <i>STACS</i>, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In <i>STACS</i> (Vol. 2285, pp. 27--49). Springer.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” <i>STACS</i>, vol. 2285, Springer, 2002, pp. 27--49.","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }"},"_id":"2138","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","file_date_updated":"2018-04-12T09:01:03Z","type":"conference","urn":"21386","status":"public"},{"date_updated":"2022-01-06T06:54:57Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:47:20Z","volume":21,"title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","doi":"10.1007/s004930170007","issue":"1","year":"2001","citation":{"ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>. 2001;21(1):95--138. doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, vol. 21, no. 1, pp. 95--138, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i> 21, no. 1 (2001): 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>, <i>21</i>(1), 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i>, vol. 21, no. 1, 2001, pp. 95--138, doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138."},"intvolume":"        21","page":"95--138","_id":"2139","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Combinatorica","status":"public"},{"_id":"2140","department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-04-12T08:59:00Z","publication":"FOCS","type":"conference","urn":"21406","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"2302","file_name":"FOCS-01.pdf","file_size":151156,"date_created":"2018-04-12T08:59:00Z","creator":"florida","date_updated":"2018-04-12T08:59:00Z"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z","publisher":"IEEE Computer Society","date_created":"2018-04-03T05:48:28Z","author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"Simple Routing Strategies for Adversarial Systems","has_accepted_license":"1","year":"2001","page":"158--167","citation":{"short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” <i>FOCS</i>, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In <i>FOCS</i> (pp. 158--167). IEEE Computer Society.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In <i>FOCS</i>, 158--167. IEEE Computer Society, 2001.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in <i>FOCS</i>, 2001, pp. 158--167.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: <i>FOCS</i>. IEEE Computer Society; 2001:158--167."}},{"title":"SIMLAB-A Simulation Environment for Storage Area Networks","date_updated":"2022-01-06T06:54:59Z","oa":"1","publisher":"IEEE Computer Society","date_created":"2018-04-03T05:49:21Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"year":"2001","citation":{"bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” <i>PDP</i>, IEEE Computer Society, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In <i>PDP</i> (pp. 227--234). IEEE Computer Society.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In <i>PDP</i>, 227--234. IEEE Computer Society, 2001.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in <i>PDP</i>, 2001, pp. 227--234.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: <i>PDP</i>. IEEE Computer Society; 2001:227--234."},"page":"227--234","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T08:39:01Z","_id":"2141","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"urn":"21415","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"PDP-00.pdf","file_id":"2298","access_level":"open_access","file_size":85778,"creator":"florida","date_created":"2018-04-12T08:39:01Z","date_updated":"2018-04-12T08:39:01Z"}],"status":"public","type":"conference","publication":"PDP"},{"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>SPAA</i>, 2001, pp. 38--47.","apa":"Kolman, P., &#38; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In <i>SPAA</i> (pp. 38--47).","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: <i>SPAA</i>. ; 2001:38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in <i>SPAA</i>, 2001, pp. 38--47.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In <i>SPAA</i>, 38--47, 2001."},"page":"38--47","year":"2001","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-04-03T05:50:16Z","oa":"1","date_updated":"2022-01-06T06:54:59Z","title":"Simple on-line algorithms for the maximum disjoint paths problem","type":"conference","publication":"SPAA","file":[{"relation":"main_file","content_type":"application/pdf","file_size":335171,"file_id":"2301","access_level":"open_access","file_name":"SPAA-01.pdf","date_updated":"2018-04-12T08:58:07Z","date_created":"2018-04-12T08:58:07Z","creator":"florida"}],"status":"public","urn":"21421","user_id":"15504","department":[{"_id":"79"}],"_id":"2142","file_date_updated":"2018-04-12T08:58:07Z","ddc":["040"]},{"language":[{"iso":"eng"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2143","status":"public","publication":"Theory Comput. Syst.","type":"journal_article","doi":"10.1007/s002240010006","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","volume":33,"author":[{"last_name":"Adler","full_name":"Adler, Micah","first_name":"Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T05:51:02Z","date_updated":"2022-01-06T06:54:59Z","page":"337--391","intvolume":"        33","citation":{"short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, 2000, pp. 337--391, doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>.","apa":"Adler, M., &#38; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput. Syst.</i>, <i>33</i>(5/6), 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, pp. 337--391, 2000.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i> 33, no. 5/6 (2000): 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>.","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput Syst</i>. 2000;33(5/6):337--391. doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>"},"year":"2000","issue":"5/6"},{"doi":"10.1137/S0097539799353431","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","date_created":"2018-04-03T06:12:15Z","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"volume":30,"date_updated":"2022-01-06T06:55:00Z","citation":{"ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J Comput</i>. 2000;30(4):1126--1155. doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” <i>SIAM J. Comput.</i>, vol. 30, no. 4, pp. 1126--1155, 2000.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i> 30, no. 4 (2000): 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i>, vol. 30, no. 4, 2000, pp. 1126--1155, doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>.","apa":"Scheideler, C., &#38; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J. Comput.</i>, <i>30</i>(4), 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>"},"page":"1126--1155","intvolume":"        30","year":"2000","issue":"4","language":[{"iso":"eng"}],"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"_id":"2145","status":"public","type":"journal_article","publication":"SIAM J. Comput."},{"_id":"2146","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-04-12T08:47:50Z","language":[{"iso":"eng"}],"type":"conference","publication":"PDPTA","urn":"21467","file":[{"content_type":"application/pdf","relation":"main_file","creator":"florida","date_created":"2018-04-12T08:47:50Z","date_updated":"2018-04-12T08:47:50Z","file_id":"2299","access_level":"open_access","file_name":"PDPTA-00.pdf","file_size":168677}],"status":"public","date_updated":"2022-01-06T06:55:00Z","oa":"1","author":[{"full_name":"Berenbrink, Petra","last_name":"Berenbrink","first_name":"Petra"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2018-04-03T06:13:07Z","title":"Distributed Path Selection for Storage Networks","has_accepted_license":"1","year":"2000","citation":{"short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” <i>PDPTA</i>, 2000.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In <i>PDPTA</i>.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: <i>PDPTA</i>. ; 2000.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in <i>PDPTA</i>, 2000.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In <i>PDPTA</i>, 2000."}},{"year":"2000","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>SODA</i>, 2000, pp. 30--39.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In <i>SODA</i> (pp. 30--39).","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In <i>SODA</i>, 30--39, 2000.","ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in <i>SODA</i>, 2000, pp. 30--39.","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: <i>SODA</i>. ; 2000:30--39."},"page":"30--39","has_accepted_license":"1","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","date_updated":"2022-01-06T06:55:00Z","oa":"1","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-04-03T06:16:48Z","urn":"21476","file":[{"date_created":"2018-04-12T08:36:17Z","creator":"florida","date_updated":"2018-04-12T08:36:17Z","access_level":"open_access","file_id":"2295","file_name":"SODA-00.pdf","file_size":185001,"content_type":"application/pdf","relation":"main_file"}],"status":"public","type":"conference","publication":"SODA","ddc":["040"],"file_date_updated":"2018-04-12T08:36:17Z","language":[{"iso":"eng"}],"_id":"2147","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}]},{"publication":"Random Struct. Algorithms","type":"journal_article","status":"public","_id":"2148","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","language":[{"iso":"eng"}],"issue":"3-4","year":"2000","intvolume":"        17","page":"213--237","citation":{"ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct Algorithms</i>. 2000;17(3-4):213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i> 17, no. 3–4 (2000): 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, pp. 213--237, 2000.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct. Algorithms</i>, <i>17</i>(3–4), 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, 2000, pp. 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237."},"date_updated":"2022-01-06T06:55:00Z","volume":17,"author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-04-03T06:17:52Z","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma"},{"has_accepted_license":"1","year":"2000","citation":{"ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: <i>SPAA</i>. ; 2000:119--128.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In <i>SPAA</i>, 119--128, 2000.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in <i>SPAA</i>, 2000, pp. 119--128.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In <i>SPAA</i> (pp. 119--128).","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” <i>SPAA</i>, 2000, pp. 119--128.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128."},"page":"119--128","oa":"1","date_updated":"2022-01-06T06:55:02Z","author":[{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T06:18:45Z","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","type":"conference","publication":"SPAA","urn":"21493","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"2297","file_name":"spaa_00.pdf","access_level":"open_access","file_size":222176,"date_created":"2018-04-12T08:38:13Z","creator":"florida","date_updated":"2018-04-12T08:38:13Z"}],"status":"public","_id":"2149","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T08:38:13Z"},{"has_accepted_license":"1","year":"2000","page":"38--47","citation":{"mla":"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).” <i>STOC</i>, ACM, 2000, pp. 38--47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In <i>STOC</i> (pp. 38--47). ACM.","ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: <i>STOC</i>. ACM; 2000:38--47.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in <i>STOC</i>, 2000, pp. 38--47.","chicago":"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 <i>STOC</i>, 38--47. ACM, 2000."},"oa":"1","date_updated":"2022-01-06T06:55:02Z","publisher":"ACM","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T06:21:11Z","title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","publication":"STOC","type":"conference","urn":"21509","status":"public","file":[{"file_size":190083,"file_name":"STOC-00.pdf","file_id":"2300","access_level":"open_access","date_updated":"2018-04-12T08:49:23Z","date_created":"2018-04-12T08:49:23Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"_id":"2150","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","ddc":["040"],"file_date_updated":"2018-04-12T08:49:23Z","language":[{"iso":"eng"}]},{"urn":"22111","file":[{"content_type":"application/pdf","relation":"main_file","creator":"florida","date_created":"2018-04-12T08:37:23Z","date_updated":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf","file_id":"2296","access_level":"open_access","file_size":190083}],"status":"public","type":"conference","publication":"32nd ACM Symposium on Theory of Computing","ddc":["040"],"file_date_updated":"2018-04-12T08:37:23Z","language":[{"iso":"eng"}],"_id":"2211","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"year":"2000","citation":{"ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In <i>32nd ACM Symposium on Theory of Computing</i>, 38–47, 2000.","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: <i>32nd ACM Symposium on Theory of Computing</i>. ; 2000:38-47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In <i>32nd ACM Symposium on Theory of Computing</i> (pp. 38–47)."},"page":"38-47","has_accepted_license":"1","title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","oa":"1","date_updated":"2022-01-06T06:55:26Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2018-04-05T07:02:46Z"},{"date_updated":"2022-01-06T06:55:02Z","volume":32,"date_created":"2018-04-03T06:22:14Z","author":[{"full_name":"Flammini, Michele","last_name":"Flammini","first_name":"Michele"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","doi":"10.1007/s002240000123","issue":"3","year":"1999","page":"387--420","intvolume":"        32","citation":{"ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput Syst</i>. 1999;32(3):387--420. doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i> 32, no. 3 (1999): 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, pp. 387--420, 1999.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, 1999, pp. 387--420, doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>.","apa":"Flammini, M., &#38; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput. Syst.</i>, <i>32</i>(3), 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>"},"_id":"2151","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","language":[{"iso":"eng"}],"publication":"Theory Comput. Syst.","type":"journal_article","status":"public"},{"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2164","file_date_updated":"2018-04-12T07:34:50Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"SODA","type":"conference","status":"public","file":[{"creator":"florida","date_created":"2018-04-12T07:34:50Z","date_updated":"2018-04-12T07:34:50Z","file_name":"SODA-99.pdf","file_id":"2288","access_level":"open_access","file_size":179058,"content_type":"application/pdf","relation":"main_file"}],"urn":"21649","date_created":"2018-04-03T08:56:06Z","author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"oa":"1","date_updated":"2022-01-06T06:55:09Z","title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","has_accepted_license":"1","page":"112--121","citation":{"ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in <i>SODA</i>, 1999, pp. 112--121.","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In <i>SODA</i>, 112--121, 1999.","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: <i>SODA</i>. ; 1999:112--121.","apa":"Berenbrink, P., &#38; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In <i>SODA</i> (pp. 112--121).","bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” <i>SODA</i>, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121."},"year":"1999"},{"has_accepted_license":"1","year":"1999","citation":{"apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In <i>SPAA</i> (pp. 33--42).","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” <i>SPAA</i>, 1999, pp. 33--42.","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: <i>SPAA</i>. ; 1999:33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in <i>SPAA</i>, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In <i>SPAA</i>, 33--42, 1999."},"page":"33--42","oa":"1","date_updated":"2022-01-06T06:55:09Z","date_created":"2018-04-03T08:56:45Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"Marco","last_name":"Riedel","full_name":"Riedel, Marco"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"title":"Simple Competitive Request Scheduling Strategies","type":"conference","publication":"SPAA","urn":"21658","file":[{"creator":"florida","date_created":"2018-04-12T07:36:27Z","date_updated":"2018-04-12T07:36:27Z","file_id":"2290","access_level":"open_access","file_name":"SPAA-99.pdf","file_size":144422,"content_type":"application/pdf","relation":"main_file"}],"status":"public","_id":"2165","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-04-12T07:36:27Z","language":[{"iso":"eng"}]}]