[{"publication":"Human Centered Design","language":[{"iso":"eng"}],"year":"2011","title":"A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities","date_created":"2018-12-18T13:04:39Z","publisher":"Springer Berlin Heidelberg","status":"public","editor":[{"last_name":"Kurosu","full_name":"Kurosu, Masaaki","first_name":"Masaaki"}],"type":"book_chapter","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","series_title":"Lecture Notes in Computer Science","_id":"6300","intvolume":"      6776","page":"28-37","citation":{"bibtex":"@inbook{Fischer_Nebe_Klompmaker_2011, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities}, volume={6776}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>}, booktitle={Human Centered Design}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}, editor={Kurosu, MasaakiEditor}, year={2011}, pages={28–37}, collection={Lecture Notes in Computer Science} }","mla":"Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities.” <i>Human Centered Design</i>, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg, 2011, pp. 28–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>.","short":"H.G. Fischer, K. Nebe, F. Klompmaker, in: M. Kurosu (Ed.), Human Centered Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 28–37.","apa":"Fischer, H. G., Nebe, K., &#38; Klompmaker, F. (2011). A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In M. Kurosu (Ed.), <i>Human Centered Design</i> (Vol. 6776, pp. 28–37). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">https://doi.org/10.1007/978-3-642-21753-1_4</a>","chicago":"Fischer, Holger Gerhard, Karsten Nebe, and Florian Klompmaker. “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities.” In <i>Human Centered Design</i>, edited by Masaaki Kurosu, 6776:28–37. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">https://doi.org/10.1007/978-3-642-21753-1_4</a>.","ieee":"H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities,” in <i>Human Centered Design</i>, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 28–37.","ama":"Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu M, ed. <i>Human Centered Design</i>. Vol 6776. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>"},"place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783642217524","9783642217531"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","conference":{"name":"International Conference on Human Centered Design (HCD) as part of HCI International 2011","start_date":"2011-07-09","end_date":"2011-07-14","location":"Orlando, USA"},"doi":"10.1007/978-3-642-21753-1_4","volume":6776,"author":[{"full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer","first_name":"Holger Gerhard"},{"first_name":"Karsten","full_name":"Nebe, Karsten","last_name":"Nebe"},{"first_name":"Florian","full_name":"Klompmaker, Florian","last_name":"Klompmaker"}],"date_updated":"2022-01-06T07:03:00Z"},{"doi":"10.1007/978-3-642-18381-2_15","title":"Collisionless Gathering of Robots with an Extent","date_created":"2020-04-06T07:52:42Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"last_name":"Hüllmann","full_name":"Hüllmann, Martina","first_name":"Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"first_name":"Alexander","full_name":"Klaas, Alexander","last_name":"Klaas"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Kurras","full_name":"Kurras, Sven","first_name":"Sven"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"},{"first_name":"Kamil","full_name":"Swierkot, Kamil","last_name":"Swierkot"},{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"last_name":"Weddemann","full_name":"Weddemann, Christoph","first_name":"Christoph"},{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"}],"publisher":"Springer","date_updated":"2022-01-06T06:52:50Z","page":"178-189","citation":{"chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 178–89. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 2011, no. 6543, pp. 178–189.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>. Springer; 2011:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i> (pp. 178–189). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, no. 6543, Springer, 2011, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189.","bibtex":"@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, number={6543}, booktitle={37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }"},"year":"2011","issue":"6543","publication_identifier":{"isbn":["9783642183805","9783642183812"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16410","status":"public","abstract":[{"lang":"eng","text":"Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version."}],"publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","type":"conference"},{"author":[{"first_name":"Philipp","last_name":"Brandes","full_name":"Brandes, Philipp"},{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-08T06:52:53Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-22212-2_13","title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642222115","9783642222122"]},"citation":{"mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” <i>Structural Information and Communication Complexity</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.","bibtex":"@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","apa":"Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>","ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>","ieee":"P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2011.","chicago":"Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” In <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>."},"year":"2011","place":"Berlin, Heidelberg","user_id":"15415","department":[{"_id":"63"}],"_id":"16459","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Structural Information and Communication Complexity","status":"public"},{"language":[{"iso":"eng"}],"user_id":"14961","department":[{"_id":"69"}],"_id":"15097","status":"public","type":"conference","publication":"East European Conference on Advances in Databases and Information Systems","doi":"10.1007/978-3-642-23737-9_3","title":"Mixing Bottom-Up and Top-Down XPath Query Evaluation","author":[{"full_name":"Benter, Markus","last_name":"Benter","first_name":"Markus"},{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"}],"date_created":"2019-11-21T15:27:31Z","date_updated":"2022-01-06T06:52:15Z","publisher":"Springer","citation":{"ieee":"M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath Query Evaluation,” in <i>East European Conference on Advances in Databases and Information Systems</i>, 2011, pp. 27–41.","chicago":"Benter, Markus, Stefan Böttcher, and Rita Hartel. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.” In <i>East European Conference on Advances in Databases and Information Systems</i>, 27–41. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">https://doi.org/10.1007/978-3-642-23737-9_3</a>.","ama":"Benter M, Böttcher S, Hartel R. Mixing Bottom-Up and Top-Down XPath Query Evaluation. In: <i>East European Conference on Advances in Databases and Information Systems</i>. Springer; 2011:27-41. doi:<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>","bibtex":"@inproceedings{Benter_Böttcher_Hartel_2011, title={Mixing Bottom-Up and Top-Down XPath Query Evaluation}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>}, booktitle={East European Conference on Advances in Databases and Information Systems}, publisher={Springer}, author={Benter, Markus and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={27–41} }","short":"M. Benter, S. Böttcher, R. Hartel, in: East European Conference on Advances in Databases and Information Systems, Springer, 2011, pp. 27–41.","mla":"Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.” <i>East European Conference on Advances in Databases and Information Systems</i>, Springer, 2011, pp. 27–41, doi:<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>.","apa":"Benter, M., Böttcher, S., &#38; Hartel, R. (2011). Mixing Bottom-Up and Top-Down XPath Query Evaluation. In <i>East European Conference on Advances in Databases and Information Systems</i> (pp. 27–41). Springer. <a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">https://doi.org/10.1007/978-3-642-23737-9_3</a>"},"page":"27-41","year":"2011","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642237362","9783642237379"]}},{"status":"public","publication":"Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers","type":"conference","language":[{"iso":"eng"}],"_id":"15099","department":[{"_id":"69"}],"user_id":"14961","year":"2011","page":"154-166","citation":{"ama":"Bätz A, Böttcher S, Hartel R. Updates on Grammar-Compressed XML Data. In: <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>. Springer; 2011:154-166. doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>","chicago":"Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed XML Data.” In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 154–66. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">https://doi.org/10.1007/978-3-642-24577-0_17</a>.","ieee":"A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,” in <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 2011, pp. 154–166.","apa":"Bätz, A., Böttcher, S., &#38; Hartel, R. (2011). Updates on Grammar-Compressed XML Data. In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i> (pp. 154–166). Springer. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">https://doi.org/10.1007/978-3-642-24577-0_17</a>","bibtex":"@inproceedings{Bätz_Böttcher_Hartel_2011, title={Updates on Grammar-Compressed XML Data}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>}, booktitle={Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Bätz, Alexander and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={154–166} }","mla":"Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.” <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, Springer, 2011, pp. 154–66, doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>.","short":"A. Bätz, S. Böttcher, R. Hartel, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 154–166."},"publication_identifier":{"isbn":["9783642245763","9783642245770"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"Updates on Grammar-Compressed XML Data","doi":"10.1007/978-3-642-24577-0_17","date_updated":"2022-01-06T06:52:15Z","publisher":"Springer","date_created":"2019-11-21T15:30:41Z","author":[{"full_name":"Bätz, Alexander","last_name":"Bätz","first_name":"Alexander"},{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"}]},{"publication":"Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers","type":"conference","status":"public","_id":"15100","department":[{"_id":"69"}],"user_id":"14961","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783642245763","9783642245770"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2011","page":"182-193","citation":{"short":"S. Böttcher, R. Hartel, S. Stey, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 182–193.","mla":"Böttcher, Stefan, et al. “TraCX: Transformation of Compressed XML.” <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, Springer, 2011, pp. 182–93, doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>.","bibtex":"@inproceedings{Böttcher_Hartel_Stey_2011, title={TraCX: Transformation of Compressed XML}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>}, booktitle={Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Stey, Sebastian}, year={2011}, pages={182–193} }","apa":"Böttcher, S., Hartel, R., &#38; Stey, S. (2011). TraCX: Transformation of Compressed XML. In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i> (pp. 182–193). Springer. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">https://doi.org/10.1007/978-3-642-24577-0_19</a>","chicago":"Böttcher, Stefan, Rita Hartel, and Sebastian Stey. “TraCX: Transformation of Compressed XML.” In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 182–93. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">https://doi.org/10.1007/978-3-642-24577-0_19</a>.","ieee":"S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed XML,” in <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 2011, pp. 182–193.","ama":"Böttcher S, Hartel R, Stey S. TraCX: Transformation of Compressed XML. In: <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>. Springer; 2011:182-193. doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>"},"publisher":"Springer","date_updated":"2022-01-06T06:52:15Z","date_created":"2019-11-21T15:31:36Z","author":[{"first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan","id":"624"},{"full_name":"Hartel, Rita","id":"14961","last_name":"Hartel","first_name":"Rita"},{"full_name":"Stey, Sebastian","last_name":"Stey","first_name":"Sebastian"}],"title":"TraCX: Transformation of Compressed XML","doi":"10.1007/978-3-642-24577-0_19"},{"year":"2011","place":"Berlin, Heidelberg","citation":{"ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","doi":"10.1007/978-3-642-22012-8_52","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T07:47:55Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Martina","full_name":"Hüllmann, Martina","last_name":"Hüllmann"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"last_name":"Klaas","full_name":"Klaas, Alexander","first_name":"Alexander"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","last_name":"Kurras","first_name":"Sven"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"abstract":[{"text":"Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n","lang":"eng"}],"status":"public","type":"book_chapter","publication":"Automata, Languages and Programming","language":[{"iso":"eng"}],"_id":"16409","user_id":"15415","department":[{"_id":"63"}]},{"type":"conference","publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems","status":"public","abstract":[{"lang":"eng","text":"We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data."}],"series_title":"Lecture Notes in Computer Science","user_id":"15415","department":[{"_id":"63"}],"_id":"19796","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783642051173","9783642051180"],"issn":["0302-9743","1611-3349"]},"citation":{"bibtex":"@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}, volume={5873}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>}, booktitle={Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer, Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer Science} }","mla":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, vol. 5873, 2010, pp. 624--639, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>.","short":"M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.","apa":"Mense, M., &#38; Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (Vol. 5873, pp. 624--639). <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>","chicago":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 5873:624--639. Lecture Notes in Computer Science, 2010. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>.","ieee":"M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2010, vol. 5873, pp. 624--639.","ama":"Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>"},"page":"624--639","intvolume":"      5873","year":"2010","author":[{"first_name":"Mario","last_name":"Mense","full_name":"Mense, Mario"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"date_created":"2020-09-30T12:12:33Z","volume":5873,"date_updated":"2022-01-06T06:54:12Z","doi":"10.1007/978-3-642-05118-0_43","title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks"},{"publication":"From Animals to Animats 11","type":"conference","status":"public","_id":"20226","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783642151927","9783642151934"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2010","intvolume":"      6226","page":"639-648","citation":{"ama":"Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking in Collective Decision-Making. In: <i>From Animals to Animats 11</i>. Vol 6226. Springer; 2010:639-648. doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>","chicago":"Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model of Symmetry Breaking in Collective Decision-Making.” In <i>From Animals to Animats 11</i>, 6226:639–48. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>.","ieee":"H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in <i>From Animals to Animats 11</i>, 2010, vol. 6226, pp. 639–648.","apa":"Hamann, H., Meyer, B., Schmickl, T., &#38; Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In <i>From Animals to Animats 11</i> (Vol. 6226, pp. 639–648). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>","mla":"Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.” <i>From Animals to Animats 11</i>, vol. 6226, Springer, 2010, pp. 639–48, doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>.","bibtex":"@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>}, booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010}, pages={639–648} }","short":"H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats 11, Springer, 2010, pp. 639–648."},"date_updated":"2022-01-06T06:54:24Z","publisher":"Springer","volume":6226,"date_created":"2020-10-29T14:22:12Z","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"full_name":"Meyer, Bernd","last_name":"Meyer","first_name":"Bernd"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"}],"title":"A Model of Symmetry Breaking in Collective Decision-Making","doi":"10.1007/978-3-642-15193-4_60"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"year":"2010","citation":{"mla":"Grza̧ślewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.” <i>ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications</i>, 2010, doi:<a href=\"https://doi.org/10.1007/11424826_55\">10.1007/11424826_55</a>.","bibtex":"@article{Grza̧ślewicz_Kutyłowski_Kutyłowski_Pietkiewicz_2010, title={Robust Undetectable Interference Watermarks}, DOI={<a href=\"https://doi.org/10.1007/11424826_55\">10.1007/11424826_55</a>}, journal={ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications}, author={Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}, year={2010} }","short":"R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, W. Pietkiewicz, ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications (2010).","apa":"Grza̧ślewicz, R., Kutyłowski, J., Kutyłowski, M., &#38; Pietkiewicz, W. (2010). Robust Undetectable Interference Watermarks. <i>ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications</i>. <a href=\"https://doi.org/10.1007/11424826_55\">https://doi.org/10.1007/11424826_55</a>","ama":"Grza̧ślewicz R, Kutyłowski J, Kutyłowski M, Pietkiewicz W. Robust Undetectable Interference Watermarks. <i>ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications</i>. Published online 2010. doi:<a href=\"https://doi.org/10.1007/11424826_55\">10.1007/11424826_55</a>","chicago":"Grza̧ślewicz, Ryszard, Jarosław Kutyłowski, Mirosław Kutyłowski, and Wojciech Pietkiewicz. “Robust Undetectable Interference Watermarks.” <i>ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications</i>, 2010. <a href=\"https://doi.org/10.1007/11424826_55\">https://doi.org/10.1007/11424826_55</a>.","ieee":"R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,” <i>ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications</i>, 2010, doi: <a href=\"https://doi.org/10.1007/11424826_55\">10.1007/11424826_55</a>."},"date_updated":"2022-01-06T06:56:17Z","date_created":"2021-09-13T14:53:37Z","author":[{"last_name":"Grza̧ślewicz","full_name":"Grza̧ślewicz, Ryszard","first_name":"Ryszard"},{"full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski","first_name":"Jarosław"},{"first_name":"Mirosław","full_name":"Kutyłowski, Mirosław","last_name":"Kutyłowski"},{"full_name":"Pietkiewicz, Wojciech","last_name":"Pietkiewicz","first_name":"Wojciech"}],"title":"Robust Undetectable Interference Watermarks","doi":"10.1007/11424826_55","type":"journal_article","publication":"ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications","status":"public","_id":"24282","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"status":"public","type":"book_chapter","publication":"SWAT 2010","series_title":"Lecture Notes in Computer Science","user_id":"25078","department":[{"_id":"64"}],"_id":"2988","citation":{"bibtex":"@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Bregman Clustering for Separable Instances}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>}, booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture Notes in Computer Science} }","short":"M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.","mla":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” <i>SWAT 2010</i>, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>.","apa":"Ackermann, M. R., &#38; Blömer, J. (2010). Bregman Clustering for Separable Instances. In <i>SWAT 2010</i> (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">https://doi.org/10.1007/978-3-642-13731-0_21</a>","ama":"Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: <i>SWAT 2010</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>","ieee":"M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in <i>SWAT 2010</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.","chicago":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” In <i>SWAT 2010</i>, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">https://doi.org/10.1007/978-3-642-13731-0_21</a>."},"page":"212-223","year":"2010","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642137303","9783642137310"]},"doi":"10.1007/978-3-642-13731-0_21","title":"Bregman Clustering for Separable Instances","date_created":"2018-06-05T07:51:51Z","author":[{"first_name":"Marcel R.","last_name":"Ackermann","full_name":"Ackermann, Marcel R."},{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z"},{"abstract":[{"text":"Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars.\r\n","lang":"eng"}],"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"_id":"20961","department":[{"_id":"76"}],"user_id":"5786","place":"Berlin, Heidelberg","year":"2010","citation":{"apa":"Seebach, H., Nafz, F., Holtmann, J., Meyer, J., Tichy, M., Reif, W., &#38; Schäfer, W. (2010). Designing Self-healing in Automotive Systems. In <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">https://doi.org/10.1007/978-3-642-16576-4_4</a>","bibtex":"@inbook{Seebach_Nafz_Holtmann_Meyer_Tichy_Reif_Schäfer_2010, place={Berlin, Heidelberg}, title={Designing Self-healing in Automotive Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>}, booktitle={Lecture Notes in Computer Science}, author={Seebach, Hella and Nafz, Florian and Holtmann, Jörg and Meyer, Jan and Tichy, Matthias and Reif, Wolfgang and Schäfer, Wilhelm}, year={2010} }","mla":"Seebach, Hella, et al. “Designing Self-Healing in Automotive Systems.” <i>Lecture Notes in Computer Science</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>.","short":"H. Seebach, F. Nafz, J. Holtmann, J. Meyer, M. Tichy, W. Reif, W. Schäfer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2010.","chicago":"Seebach, Hella, Florian Nafz, Jörg Holtmann, Jan Meyer, Matthias Tichy, Wolfgang Reif, and Wilhelm Schäfer. “Designing Self-Healing in Automotive Systems.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">https://doi.org/10.1007/978-3-642-16576-4_4</a>.","ieee":"H. Seebach <i>et al.</i>, “Designing Self-healing in Automotive Systems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2010.","ama":"Seebach H, Nafz F, Holtmann J, et al. Designing Self-healing in Automotive Systems. In: <i>Lecture Notes in Computer Science</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-16576-4_4\">10.1007/978-3-642-16576-4_4</a>"},"publication_identifier":{"isbn":["9783642165757","9783642165764"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"Designing Self-healing in Automotive Systems","doi":"10.1007/978-3-642-16576-4_4","date_updated":"2022-01-06T06:54:42Z","date_created":"2021-01-13T10:54:04Z","author":[{"last_name":"Seebach","full_name":"Seebach, Hella","first_name":"Hella"},{"last_name":"Nafz","full_name":"Nafz, Florian","first_name":"Florian"},{"id":"3875","full_name":"Holtmann, Jörg","last_name":"Holtmann","orcid":"0000-0001-6141-4571","first_name":"Jörg"},{"last_name":"Meyer","full_name":"Meyer, Jan","first_name":"Jan"},{"first_name":"Matthias","full_name":"Tichy, Matthias","last_name":"Tichy"},{"first_name":"Wolfgang","full_name":"Reif, Wolfgang","last_name":"Reif"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}]},{"type":"conference","publication":"Workshop on Internet and Network Economics (WINE)","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"19029","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642175718","9783642175725"]},"citation":{"ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>.","short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }","apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>"},"year":"2010","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"last_name":"Chalermsook","full_name":"Chalermsook, Parinya","first_name":"Parinya"},{"first_name":"Sanjeev","full_name":"Khanna, Sanjeev","last_name":"Khanna"},{"first_name":"Bundit","last_name":"Laekhanukit","full_name":"Laekhanukit, Bundit"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"date_created":"2020-09-04T12:01:18Z","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/978-3-642-17572-5_37","title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"16505","language":[{"iso":"eng"}],"publication":"Advances in Visual Computing","type":"book_chapter","status":"public","abstract":[{"text":"We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.","lang":"eng"}],"author":[{"last_name":"Eikel","full_name":"Eikel, Benjamin","first_name":"Benjamin"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"}],"date_created":"2020-04-14T13:06:51Z","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/978-3-642-17289-2_60","title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642172885","9783642172892"]},"publication_status":"published","citation":{"bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” <i>Advances in Visual Computing</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>.","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","apa":"Eikel, B., Jähn, C., &#38; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>","ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>.","ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2010."},"year":"2010","place":"Berlin, Heidelberg"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642156830","9783642156847"]},"year":"2010","citation":{"mla":"Böttcher, Stefan, et al. “Searchable Compression of Office Documents by XML Schema Subtraction.” <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, Springer, 2010, pp. 103–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>.","bibtex":"@inproceedings{Böttcher_Hartel_Messinger_2010, title={Searchable Compression of Office Documents by XML Schema Subtraction}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>}, booktitle={Database and XML Technologies - 7th International XML Database Symposium, XSym 2010}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Messinger, Christian}, year={2010}, pages={103–112} }","short":"S. Böttcher, R. Hartel, C. Messinger, in: Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, Springer, 2010, pp. 103–112.","apa":"Böttcher, S., Hartel, R., &#38; Messinger, C. (2010). Searchable Compression of Office Documents by XML Schema Subtraction. In <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i> (pp. 103–112). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">https://doi.org/10.1007/978-3-642-15684-7_9</a>","ama":"Böttcher S, Hartel R, Messinger C. Searchable Compression of Office Documents by XML Schema Subtraction. In: <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>. Springer; 2010:103-112. doi:<a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">10.1007/978-3-642-15684-7_9</a>","ieee":"S. Böttcher, R. Hartel, and C. Messinger, “Searchable Compression of Office Documents by XML Schema Subtraction,” in <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, 2010, pp. 103–112.","chicago":"Böttcher, Stefan, Rita Hartel, and Christian Messinger. “Searchable Compression of Office Documents by XML Schema Subtraction.” In <i>Database and XML Technologies - 7th International XML Database Symposium, XSym 2010</i>, 103–12. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15684-7_9\">https://doi.org/10.1007/978-3-642-15684-7_9</a>."},"page":"103-112","date_updated":"2022-01-06T06:52:16Z","publisher":"Springer","author":[{"last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"first_name":"Rita","full_name":"Hartel, Rita","id":"14961","last_name":"Hartel"},{"last_name":"Messinger","full_name":"Messinger, Christian","first_name":"Christian"}],"date_created":"2019-11-22T08:43:42Z","title":"Searchable Compression of Office Documents by XML Schema Subtraction","doi":"10.1007/978-3-642-15684-7_9","type":"conference","publication":"Database and XML Technologies - 7th International XML Database Symposium, XSym 2010","status":"public","_id":"15137","user_id":"14961","department":[{"_id":"69"}],"language":[{"iso":"eng"}]},{"doi":"10.1007/978-3-642-13284-1_14","title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-02T13:56:17Z","date_updated":"2022-01-06T06:52:49Z","page":"168-182","citation":{"apa":"Degener, B., Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In <i>Structural Information and Communication Complexity</i> (pp. 168–182). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.","bibtex":"@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin, Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>}, booktitle={Structural Information and Communication Complexity}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2010}, pages={168–182}, collection={SIROCCO 2010} }","mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” <i>Structural Information and Communication Complexity</i>, 2010, pp. 168–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>.","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” In <i>Structural Information and Communication Complexity</i>, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>.","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2010, pp. 168–182.","ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: <i>Structural Information and Communication Complexity</i>. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>"},"place":"Berlin, Heidelberg","year":"2010","publication_identifier":{"isbn":["9783642132834","9783642132841"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","series_title":"SIROCCO 2010","_id":"16365","status":"public","publication":"Structural Information and Communication Complexity","type":"book_chapter"},{"date_created":"2020-04-03T12:56:30Z","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-14162-1","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"citation":{"ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010.","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>.","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>}, year={2010} }","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>"},"year":"2010","place":"Berlin, Heidelberg","user_id":"15415","department":[{"_id":"63"}],"_id":"16403","language":[{"iso":"eng"}],"type":"book_editor","status":"public","editor":[{"full_name":"Abramsky, Samson","last_name":"Abramsky","first_name":"Samson"},{"first_name":"Cyril","full_name":"Gavoille, Cyril","last_name":"Gavoille"},{"full_name":"Kirchner, Claude","last_name":"Kirchner","first_name":"Claude"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"full_name":"Spirakis, Paul G.","last_name":"Spirakis","first_name":"Paul G."}]},{"title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","doi":"10.1007/978-3-642-14165-2","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T12:58:05Z","place":"Berlin, Heidelberg","year":"2010","citation":{"bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>}, year={2010} }","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>.","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642141614","9783642141621"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16404","department":[{"_id":"63"}],"user_id":"15415","editor":[{"first_name":"Samson","full_name":"Abramsky, Samson","last_name":"Abramsky"},{"last_name":"Gavoille","full_name":"Gavoille, Cyril","first_name":"Cyril"},{"first_name":"Claude","last_name":"Kirchner","full_name":"Kirchner, Claude"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Spirakis","full_name":"Spirakis, Paul G.","first_name":"Paul G."}],"status":"public","type":"book_editor"},{"author":[{"last_name":"Trier","id":"72744","full_name":"Trier, Matthias","first_name":"Matthias"},{"first_name":"Claudia","full_name":"Müller, Claudia","last_name":"Müller"}],"date_created":"2019-09-19T09:45:04Z","date_updated":"2022-01-06T06:51:32Z","doi":"10.1007/978-3-540-30545-3_23","title":"Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540240884","9783540305453"]},"citation":{"chicago":"Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.” In <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">https://doi.org/10.1007/978-3-540-30545-3_23</a>.","ieee":"M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes,” in <i>Practical Aspects of Knowledge Management</i>, Berlin, Heidelberg, 2010.","ama":"Trier M, Müller C. Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In: <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>","short":"M. Trier, C. Müller, in: Practical Aspects of Knowledge Management, Berlin, Heidelberg, 2010.","mla":"Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.” <i>Practical Aspects of Knowledge Management</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>.","bibtex":"@inbook{Trier_Müller_2010, place={Berlin, Heidelberg}, title={Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">10.1007/978-3-540-30545-3_23</a>}, booktitle={Practical Aspects of Knowledge Management}, author={Trier, Matthias and Müller, Claudia}, year={2010} }","apa":"Trier, M., &#38; Müller, C. (2010). Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In <i>Practical Aspects of Knowledge Management</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30545-3_23\">https://doi.org/10.1007/978-3-540-30545-3_23</a>"},"place":"Berlin, Heidelberg","year":"2010","user_id":"62809","department":[{"_id":"198"}],"_id":"13301","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Practical Aspects of Knowledge Management","status":"public"},{"author":[{"first_name":"Olaf","full_name":"Bonorden, Olaf","last_name":"Bonorden"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"}],"date_created":"2020-09-28T10:25:34Z","date_updated":"2022-01-06T06:54:10Z","publisher":"Springer","doi":"10.1007/978-3-642-05434-1_25","title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","publication_identifier":{"isbn":["9783642054334","9783642054341"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"252-262","citation":{"chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg: Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>.","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>","apa":"Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer, 2009, pp. 252–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>.","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }"},"place":"Berlin, Heidelberg","year":"2009","department":[{"_id":"63"}],"user_id":"15415","_id":"19724","language":[{"iso":"eng"}],"publication":"Algorithmic Aspects of Wireless Sensor Networks","type":"book_chapter","status":"public","abstract":[{"text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds.","lang":"eng"}]}]