[{"language":[{"iso":"eng"}],"page":"30--39","type":"conference","year":"2000","citation":{"short":"A. Czumaj, C. Scheideler, in: SODA, 2000, 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 SODA, 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 SODA, 30--39, 2000.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 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} }"},"urn":"21476","_id":"2147","date_updated":"2022-01-06T06:55:00Z","oa":"1","file":[{"file_name":"SODA-00.pdf","date_created":"2018-04-12T08:36:17Z","access_level":"open_access","file_size":185001,"file_id":"2295","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","relation":"main_file"}],"file_date_updated":"2018-04-12T08:36:17Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SODA","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T06:16:48Z","has_accepted_license":"1","status":"public","user_id":"14955","ddc":["040"],"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma"},{"status":"public","date_created":"2018-04-03T06:17:52Z","volume":17,"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Random Struct. Algorithms","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","language":[{"iso":"eng"}],"type":"journal_article","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 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} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, 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. Random Struct Algorithms. 2000;17(3-4):213--237.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 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.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237."},"year":"2000","page":"213--237","issue":"3-4","date_updated":"2022-01-06T06:55:00Z","_id":"2148","intvolume":" 17"},{"ddc":["040"],"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","user_id":"14955","has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:18:45Z","author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"last_name":"Salzwedel","first_name":"Kay","full_name":"Salzwedel, Kay"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","file":[{"creator":"florida","file_id":"2297","file_size":222176,"relation":"main_file","date_updated":"2018-04-12T08:38:13Z","content_type":"application/pdf","file_name":"spaa_00.pdf","date_created":"2018-04-12T08:38:13Z","access_level":"open_access"}],"oa":"1","_id":"2149","date_updated":"2022-01-06T06:55:02Z","urn":"21493","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, 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} }","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128)."},"year":"2000","type":"conference","page":"119--128","language":[{"iso":"eng"}]},{"department":[{"_id":"79"},{"_id":"63"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","oa":"1","file":[{"date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf","access_level":"open_access","file_size":190083,"file_id":"2300","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T08:49:23Z","relation":"main_file"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:21:11Z","user_id":"14955","ddc":["040"],"type":"conference","citation":{"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 STOC, 2000, pp. 38--47.","short":"A. Czumaj, C. Scheideler, in: STOC, 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} }","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).” 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 STOC, 38--47. ACM, 2000.","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: STOC. ACM; 2000:38--47.","apa":"Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM."},"year":"2000","page":"38--47","_id":"2150","urn":"21509"},{"type":"conference","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 32nd ACM Symposium on Theory of Computing, 2000, pp. 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 .” 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 32nd ACM Symposium on Theory of Computing, 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: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.","apa":"Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47)."},"year":"2000","page":"38-47","language":[{"iso":"eng"}],"_id":"2211","date_updated":"2022-01-06T06:55:26Z","urn":"22111","oa":"1","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T08:37:23Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"32nd ACM Symposium on Theory of Computing","file":[{"creator":"florida","file_id":"2296","file_size":190083,"relation":"main_file","date_updated":"2018-04-12T08:37:23Z","content_type":"application/pdf","date_created":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf","access_level":"open_access"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:02:46Z","ddc":["040"],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","user_id":"14955"},{"citation":{"apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"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","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, 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.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001."},"type":"journal_article","year":"2001","page":"95--138","language":[{"iso":"eng"}],"_id":"2139","date_updated":"2022-01-06T06:54:57Z","intvolume":" 21","doi":"10.1007/s004930170007","issue":"1","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","volume":21,"status":"public","date_created":"2018-04-03T05:47:20Z","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","user_id":"14955"},{"user_id":"15504","ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:48:28Z","file":[{"date_created":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","access_level":"open_access","creator":"florida","file_id":"2302","file_size":151156,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:59:00Z"}],"publisher":"IEEE Computer Society","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T08:59:00Z","department":[{"_id":"79"}],"publication":"FOCS","oa":"1","_id":"2140","date_updated":"2022-01-06T06:54:59Z","urn":"21406","type":"conference","year":"2001","citation":{"ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, 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} }","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society."},"page":"158--167"},{"page":"227--234","type":"conference","citation":{"apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.","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.” PDP, IEEE Computer Society, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234."},"year":"2001","urn":"21415","_id":"2141","file_date_updated":"2018-04-12T08:39:01Z","publication":"PDP","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"IEEE Computer Society","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:39:01Z","creator":"florida","file_id":"2298","file_size":85778,"access_level":"open_access","file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z"}],"date_created":"2018-04-03T05:49:21Z","status":"public","has_accepted_license":"1","ddc":["040"],"user_id":"14955","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:59Z","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks"},{"user_id":"15504","title":"Simple on-line algorithms for the maximum disjoint paths problem","ddc":["040"],"file":[{"file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","access_level":"open_access","file_size":335171,"creator":"florida","file_id":"2301","date_updated":"2018-04-12T08:58:07Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:58:07Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:50:16Z","date_updated":"2022-01-06T06:54:59Z","_id":"2142","urn":"21421","oa":"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} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47."},"year":"2001","type":"conference","page":"38--47"},{"status":"public","date_created":"2018-04-03T05:43:36Z","author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"Combinatorica","title":"Improved Bounds for Acyclic Job Shop Scheduling","user_id":"15504","year":"2002","type":"journal_article","citation":{"mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, 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. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018","apa":"Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399."},"page":"361--399","doi":"10.1007/s004930200018","issue":"3","_id":"2134","date_updated":"2022-01-06T06:54:55Z"},{"date_created":"2018-04-03T05:44:11Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:59:58Z","relation":"main_file","file_size":246604,"file_id":"2303","creator":"florida","access_level":"open_access","date_created":"2018-04-12T08:59:58Z","file_name":"SODA-02.pdf"}],"department":[{"_id":"79"}],"publication":"SODA","file_date_updated":"2018-04-12T08:59:58Z","publisher":"ACM/SIAM","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"15504","ddc":["040"],"title":"Improved bounds for the unsplittable flow problem","page":"184--193","citation":{"ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” 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} }","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002."},"year":"2002","type":"conference","oa":"1","urn":"21357","_id":"2135","date_updated":"2022-01-06T06:54:55Z"},{"page":"53--62","type":"conference","citation":{"apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.","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} }","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","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 SPAA, 2002, pp. 53--62."},"year":"2002","language":[{"iso":"eng"}],"oa":"1","urn":"21366","date_updated":"2022-01-06T06:54:56Z","_id":"2136","date_created":"2018-04-03T05:44:56Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:02:22Z","author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Salzwedel","first_name":"Kay","full_name":"Salzwedel, Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_created":"2018-04-12T09:02:22Z","file_name":"BSS-SPAA-02.pdf","access_level":"open_access","creator":"florida","file_id":"2305","file_size":123373,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:02:22Z"}],"ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements","user_id":"14955"},{"page":"265--274","year":"2002","citation":{"mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 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} }","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274."},"type":"conference","urn":"21376","date_updated":"2022-01-06T06:54:57Z","_id":"2137","oa":"1","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:03:44Z","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"}],"file":[{"file_id":"2306","creator":"florida","file_size":187124,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:03:44Z","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z","access_level":"open_access"}],"date_created":"2018-04-03T05:45:44Z","has_accepted_license":"1","status":"public","title":"Algorithms for fault-tolerant routing in circuit switched networks","ddc":["040"],"user_id":"15504"},{"title":"Models and Techniques for Communication in Dynamic Networks","department":[{"_id":"79"}],"date_updated":"2022-01-06T06:54:57Z","oa":"1","series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"15504","publisher":"Springer","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:01:03Z","publication":"STACS","file":[{"file_size":273875,"creator":"florida","file_id":"2304","content_type":"application/pdf","date_updated":"2018-04-12T09:01:03Z","relation":"main_file","file_name":"STACS-02.pdf","date_created":"2018-04-12T09:01:03Z","access_level":"open_access"}],"volume":2285,"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:46:38Z","intvolume":" 2285","_id":"2138","urn":"21386","type":"conference","year":"2002","citation":{"mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, 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} }","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49."},"page":"27--49"},{"language":[{"iso":"eng"}],"citation":{"mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003."},"year":"2003","type":"conference","_id":"19790","date_updated":"2022-01-06T06:54:12Z","status":"public","has_accepted_license":"1","date_created":"2020-09-30T12:04:14Z","file":[{"success":1,"relation":"main_file","date_updated":"2020-09-30T12:03:57Z","content_type":"application/pdf","file_id":"19793","creator":"koala","file_size":499057,"access_level":"closed","date_created":"2020-09-30T12:03:57Z","file_name":"pub-hni-908.pdf"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Vodisek","first_name":"Mario","full_name":"Vodisek, Mario"},{"last_name":"Rückert","full_name":"Rückert, Ulrich","first_name":"Ulrich"}],"file_date_updated":"2020-09-30T12:03:57Z","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"publication":"Proceedings of SSGRR 2003","user_id":"15415","ddc":["000"],"title":"Storage Management as Means to cope with Exponential Information Growth","abstract":[{"text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.","lang":"eng"}]},{"status":"public","date_created":"2018-04-03T05:37:10Z","volume":2832,"author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"publisher":"Springer","department":[{"_id":"79"},{"_id":"63"}],"publication":"ESA","user_id":"14955","title":"Smoothed Motion Complexity","language":[{"iso":"eng"}],"year":"2003","citation":{"ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17"},"type":"conference","page":"161--171","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-39658-1_17","_id":"2128","date_updated":"2022-01-06T06:54:52Z","intvolume":" 2832"},{"title":"Anycasting in Adversarial Systems: Routing and Admission Control","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:54:53Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"14955","volume":2719,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:38:36Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","publication":"ICALP","file_date_updated":"2018-04-12T09:04:48Z","file":[{"access_level":"open_access","date_created":"2018-04-12T09:04:48Z","file_name":"ICALP-03.pdf","relation":"main_file","date_updated":"2018-04-12T09:04:48Z","content_type":"application/pdf","creator":"florida","file_id":"2307","file_size":154427}],"_id":"2129","intvolume":" 2719","urn":"21297","year":"2003","citation":{"short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }"},"type":"conference","page":"1153--1168"},{"type":"conference","citation":{"ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.","ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132."},"year":"2003","page":"123--132","date_updated":"2022-01-06T06:54:53Z","_id":"2130","urn":"21303","oa":"1","file":[{"date_created":"2018-04-12T09:10:10Z","file_name":"PODC-03.pdf","access_level":"open_access","file_size":127013,"creator":"florida","file_id":"2308","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"ACM","file_date_updated":"2018-04-12T09:10:10Z","publication":"PODC","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:39:48Z","user_id":"15504","ddc":["040"],"title":"Peer-to-peer systems for prefix search"},{"urn":"21313","intvolume":" 2764","_id":"2131","page":"240--251","year":"2003","type":"conference","citation":{"chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }","short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251."},"user_id":"15504","ddc":["040"],"date_created":"2018-04-03T05:41:01Z","has_accepted_license":"1","status":"public","volume":2764,"file":[{"file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","access_level":"open_access","file_size":112587,"file_id":"2310","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T09:16:17Z","relation":"main_file"}],"publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","oa":"1","date_updated":"2022-01-06T06:54:54Z","series_title":"Lecture Notes in Computer Science","title":"Perfectly Balanced Allocation","department":[{"_id":"79"}]},{"date_created":"2018-04-03T05:41:53Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","date_created":"2018-04-12T09:18:55Z","file_name":"JRS-SPAA-03.pdf","date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf","relation":"main_file","file_size":224200,"file_id":"2311","creator":"florida"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:18:55Z","publication":"SPAA","publisher":"ACM","author":[{"full_name":"Jia, Lujun","first_name":"Lujun","last_name":"Jia"},{"first_name":"Rajmohan","full_name":"Rajaraman, Rajmohan","last_name":"Rajaraman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"On local algorithms for topology control and routing in ad hoc networks","ddc":["040"],"page":"220--229","type":"conference","year":"2003","citation":{"ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, 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} }","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229."},"oa":"1","urn":"21320","_id":"2132","date_updated":"2022-01-06T06:54:54Z"}]