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