[{"title":"The Online Multi-Commodity Facility Location Problem","external_id":{"arxiv":["2005.08391"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication_identifier":{"isbn":["9781450369350"]},"publication_status":"published","department":[{"_id":"63"}],"doi":"10.1145/3350755.3400281","date_updated":"2022-01-06T06:53:10Z","language":[{"iso":"eng"}],"user_id":"39241","ddc":["000"],"abstract":[{"lang":"eng","text":" We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \\( S \\) of commodities.\r\n Ravi and Sinha (SODA 2004) introduced the model as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.\r\n The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.\r\n In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.\r\n A request has to be connected to a set of facilities jointly offering the commodities demanded by it.\r\n In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.\r\n\r\n To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.\r\n We present results regarding the competitive ratio.\r\n On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \\( \\Omega ( \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n} ) \\) that already holds for simple line metrics.\r\n Here, \\( n \\) is the number of requests.\r\n On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function."}],"date_created":"2020-07-14T07:53:20Z","status":"public","has_accepted_license":"1","file":[{"date_created":"2020-07-14T07:56:52Z","file_name":"3350755.3400281.pdf","access_level":"closed","file_size":1271416,"creator":"tillk","file_id":"17373","date_updated":"2020-07-14T07:56:52Z","content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","file_date_updated":"2020-07-14T07:56:52Z","keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","id":"38705","last_name":"Castenow"},{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"},{"last_name":"Knollmann","id":"39241","first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"_id":"17370","type":"conference","citation":{"bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400281","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400281.","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"year":"2020"},{"user_id":"38705","ddc":["000"],"file":[{"file_name":"3350755.3400263.pdf","date_created":"2020-07-14T07:56:04Z","access_level":"closed","creator":"janniksu","file_id":"17372","file_size":1078544,"success":1,"relation":"main_file","date_updated":"2020-07-14T07:56:04Z","content_type":"application/pdf"}],"file_date_updated":"2020-07-14T07:56:04Z","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-07-14T07:53:47Z","status":"public","has_accepted_license":"1","_id":"17371","type":"conference","year":"2020","citation":{"mla":"Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400263.","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up}, DOI={10.1145/3350755.3400263}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2020} }","apa":"Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400263","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400263","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400263.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"external_id":{"arxiv":["2010.02043 "]},"title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","department":[{"_id":"63"}],"publication_identifier":{"isbn":["9781450369350"]},"publication_status":"published","date_updated":"2022-01-06T06:53:10Z","doi":"10.1145/3350755.3400263","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-54921-3_4","date_updated":"2022-01-06T06:53:00Z","department":[{"_id":"63"}],"title":"Local Gathering of Mobile Robots in Three Dimensions","external_id":{"arxiv":["arXiv:2005.07495"]},"citation":{"ieee":"M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile Robots in Three Dimensions,” in Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Paderborn, 2020.","short":"M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.","bibtex":"@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering of Mobile Robots in Three Dimensions}, DOI={10.1007/978-3-030-54921-3_4}, booktitle={Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow, Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020, doi:10.1007/978-3-030-54921-3_4.","chicago":"Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local Gathering of Mobile Robots in Three Dimensions.” In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3_4.","ama":"Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots in Three Dimensions. In: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer; 2020. doi:10.1007/978-3-030-54921-3_4","apa":"Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Paderborn: Springer. https://doi.org/10.1007/978-3-030-54921-3_4"},"type":"conference","year":"2020","conference":{"name":"SIROCCO 2020","start_date":"2020-06-29","location":"Paderborn","end_date":"2020-07-01"},"_id":"16968","date_created":"2020-05-18T06:48:35Z","status":"public","has_accepted_license":"1","file":[{"date_updated":"2020-07-31T08:22:16Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":505712,"creator":"janniksu","file_id":"17504","access_level":"closed","file_name":"localGathering.pdf","date_created":"2020-07-31T08:22:16Z"}],"file_date_updated":"2020-07-31T08:22:16Z","publication":"Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)","publisher":"Springer","author":[{"last_name":"Braun","full_name":"Braun, Michael","first_name":"Michael"},{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"user_id":"38705","ddc":["000"],"abstract":[{"lang":"eng","text":"In this work, we initiate the research about the Gathering problem for robots\r\nwith limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering problem, a set of initially scattered robots is required to gather at\r\nthe same position. The robots' capabilities are very restricted -- they do not\r\nagree on any coordinate system or compass, have a limited viewing range, have\r\nno memory of the past and cannot communicate. We study the problem in two\r\ndifferent time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization of contracting strategies (continuous time) from\r\n[Algosensors'17] to three dimensions. In contracting strategies, every robot\r\nthat is located on the global convex hull of all robots' positions moves with\r\nfull speed towards the inside of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$ for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$ close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true in two dimensions. In general, it might be hard for\r\nrobots with limited viewing range to decide whether they are located on the\r\nglobal convex hull and which movement maintains the connectivity of the swarm,\r\nrendering the design of concrete contracting strategies a challenging task. We\r\nprove that the continuous variant of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover, we give a simple design criterion for\r\nthree-dimensional contracting strategies that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy based on this criterion."},{"lang":"eng","text":"Best Student Paper Award"}]},{"date_created":"2020-01-23T14:20:25Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"has_accepted_license":"1","status":"public","department":[{"_id":"63"}],"file_date_updated":"2020-01-24T08:19:38Z","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"}],"file":[{"file_name":"DissertationFeldkord.pdf","date_created":"2020-01-24T08:19:38Z","access_level":"closed","file_id":"15634","creator":"florida","file_size":633652,"success":1,"relation":"main_file","date_updated":"2020-01-24T08:19:38Z","content_type":"application/pdf"}],"ddc":["000"],"title":"Mobile Resource Allocation","user_id":"15415","place":"Universität Paderborn","year":"2020","type":"dissertation","citation":{"ieee":"B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","mla":"Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={10.17619/UNIPB/1-869}, author={Feldkord, Björn}, year={2020} }","ama":"Feldkord B. Mobile Resource Allocation. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-869","apa":"Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869","chicago":"Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-869."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-869","_id":"15631","date_updated":"2022-01-06T06:52:31Z"},{"publication":"Evolutionary Computation","publisher":"MIT Press Journals","author":[{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"last_name":"van Rooijen","id":"58843","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"volume":28,"date_created":"2019-11-18T14:19:19Z","status":"public","abstract":[{"lang":"eng","text":"In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available."}],"user_id":"15415","page":"165–193","citation":{"apa":"Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266","ama":"Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation. 2020;28(2):165–193. doi:10.1162/evco_a_00266","chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation 28, no. 2 (2020): 165–193. https://doi.org/10.1162/evco_a_00266.","bibtex":"@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={10.1162/evco_a_00266}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }","mla":"Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.","short":"M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266."},"year":"2020","type":"journal_article","intvolume":" 28","_id":"15025","issue":"2","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"},{"_id":"63"},{"_id":"238"}],"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"title":"Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets","related_material":{"link":[{"relation":"confirmation","url":"https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266"}]},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:15Z","doi":"10.1162/evco_a_00266"},{"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","publication_status":"accepted","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2019-11-25T12:18:41Z","status":"public","department":[{"_id":"63"},{"_id":"79"}],"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","publisher":"ACM","author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"conference":{"name":"21st International Conference on Distributed Computing and Networking ","start_date":"04.01.2020","location":"Kolkata, Indien","end_date":"07.01.2020"},"date_updated":"2022-01-06T06:52:16Z","_id":"15169","citation":{"apa":"Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien."},"year":"2020","type":"conference","language":[{"iso":"eng"}]},{"page":"289-309","type":"journal_article","citation":{"apa":"Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018","ama":"Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018","chicago":"Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.","bibtex":"@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={10.1016/j.tcs.2020.02.018}, journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer, Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2020}, pages={289–309} }","mla":"Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.","short":"J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.","ieee":"J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol. 815, pp. 289–309, 2020."},"year":"2020","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2020.02.018","date_updated":"2022-01-06T06:52:48Z","_id":"16299","intvolume":" 815","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","volume":815,"date_created":"2020-03-13T12:55:53Z","status":"public","publication":"Theoretical Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"full_name":"Harbig, Jonas","first_name":"Jonas","last_name":"Harbig"},{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Gathering Anonymous, Oblivious Robots on a Grid","user_id":"38705"},{"citation":{"ama":"Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion Time for Order Scheduling with Setup Times. In: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). ; 2020.","apa":"Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).","chicago":"Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","bibtex":"@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","short":"S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","ieee":"S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted Completion Time for Order Scheduling with Setup Times,” in Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020."},"year":"2020","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:45Z","_id":"13868","author":[{"first_name":"Simon","full_name":"Pukrop, Simon","last_name":"Pukrop","id":"44428"},{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","department":[{"_id":"63"}],"status":"public","date_created":"2019-10-15T12:19:49Z","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","user_id":"44428"},{"language":[{"iso":"eng"}],"date_updated":"2022-12-02T09:27:17Z","doi":"10.1007/s12599-019-00627-x","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"publication_status":"published","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","type":"journal_article","year":"2020","citation":{"short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. 2020;62(6):467-481. doi:10.1007/s12599-019-00627-x","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x}, number={6}, journal={Business & Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }"},"page":"467-481","_id":"13770","intvolume":" 62","issue":"6","file":[{"date_created":"2019-12-12T10:24:47Z","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","access_level":"closed","file_size":454532,"creator":"ups","file_id":"15311","date_updated":"2019-12-12T10:24:47Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"author":[{"full_name":"Karl, Holger","first_name":"Holger","id":"126","last_name":"Karl"},{"id":"21117","last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Springer","publication":"Business & Information Systems Engineering","file_date_updated":"2019-12-12T10:24:47Z","has_accepted_license":"1","status":"public","date_created":"2019-10-10T13:41:06Z","volume":62,"user_id":"477","ddc":["004"]},{"doi":"10.4230/LIPICS.MFCS.2019.65","date_updated":"2022-01-06T06:53:12Z","_id":"17432","language":[{"iso":"eng"}],"citation":{"ieee":"S. Baswana, S. Gupta, and A. Tulsyan, “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient,” in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, pp. 65:1--65:16.","short":"S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16.","mla":"Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16, doi:10.4230/LIPICS.MFCS.2019.65.","bibtex":"@inproceedings{Baswana_Gupta_Tulsyan_2019, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient}, DOI={10.4230/LIPICS.MFCS.2019.65}, booktitle={44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Baswana, Surender and Gupta, Shiv and Tulsyan, Ayush}, year={2019}, pages={65:1--65:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Baswana S, Gupta S, Tulsyan A. Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2019:65:1--65:16. doi:10.4230/LIPICS.MFCS.2019.65","apa":"Baswana, S., Gupta, S., & Tulsyan, A. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (pp. 65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.65","chicago":"Baswana, Surender, Shiv Gupta, and Ayush Tulsyan. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 65:1--65:16. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.65."},"type":"conference","year":"2019","page":"65:1--65:16","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"15415","title":"Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient","status":"public","date_created":"2020-07-29T07:33:56Z","author":[{"full_name":"Baswana, Surender","first_name":"Surender","last_name":"Baswana"},{"last_name":"Gupta","first_name":"Shiv","full_name":"Gupta, Shiv"},{"full_name":"Tulsyan, Ayush","first_name":"Ayush","last_name":"Tulsyan"}],"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","department":[{"_id":"63"}],"publication":"44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)"},{"series_title":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z","doi":"10.1109/CSCloud/EdgeCom.2019.000-9","department":[{"_id":"63"},{"_id":"541"}],"publication_identifier":{"issn":["null"]},"title":"Approaches for Collaborative Security Defences in Multi Network Environments","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors"}],"page":"113-123","citation":{"mla":"Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.” 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.","bibtex":"@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, title={Approaches for Collaborative Security Defences in Multi Network Environments}, DOI={10.1109/CSCloud/EdgeCom.2019.000-9}, booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)} }","chicago":"Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso. “Approaches for Collaborative Security Defences in Multi Network Environments.” In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 113–23. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019. https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9.","apa":"Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9","ama":"Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative Security Defences in Multi Network Environments. In: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:10.1109/CSCloud/EdgeCom.2019.000-9","ieee":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for Collaborative Security Defences in Multi Network Environments,” in 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.","short":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123."},"year":"2019","type":"conference","conference":{"name":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)"},"_id":"17667","keyword":["computer network security","multinetwork environments","multidomain defensive action","task execution order","timing influence defense efficiency","distributed attacks","collaborative security defence approach","minimize propagation approach","minimize countermeasure approach","counteract everywhere approach","Conferences","Cloud computing","Computer crime","Edge computing","Security","Defense Approaches","Multi-Domain Defense","Collaborative Defense","Defense Algorithms","Computer Networks"],"publication":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","author":[{"full_name":"Koning, Ralph","first_name":"Ralph","last_name":"Koning"},{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"Meijer","first_name":"Lydia","full_name":"Meijer, Lydia"},{"last_name":"de Laat","first_name":"Cees","full_name":"de Laat, Cees"},{"first_name":"Paola","full_name":"Grosso, Paola","last_name":"Grosso"}],"quality_controlled":"1","date_created":"2020-08-06T15:23:23Z","status":"public","extern":"1","abstract":[{"text":"Resolving distributed attacks benefits from collaboration between networks. We present three approaches for the same multi-domain defensive action that can be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures, and 3) Minimize Propagation. First, we provide a formula to compute efficiency of a defense; then we use this formula to compute the efficiency of the approaches under various circumstances. Finally, we discuss how task execution order and timing influence defense efficiency. Our results show that the Minimize Propagation approach is the most efficient method when defending against the chosen attack.","lang":"eng"}],"user_id":"83983"},{"status":"public","date_created":"2020-09-04T07:39:47Z","author":[{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"}],"department":[{"_id":"63"}],"user_id":"15415","related_material":{"link":[{"url":"https://doi.org/10.17619/UNIPB/1-766","relation":"confirmation"}]},"title":"Big Data: Sublinear Algorithms for Distributed Data Streams","place":"Universität Paderborn","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"citation":{"short":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.","ieee":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.","chicago":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-766.","ama":"Malatyali M. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-766","apa":"Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-766","mla":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.","bibtex":"@book{Malatyali_2019, place={Universität Paderborn}, title={Big Data: Sublinear Algorithms for Distributed Data Streams}, DOI={10.17619/UNIPB/1-766}, author={Malatyali, Manuel}, year={2019} }"},"type":"dissertation","year":"2019","doi":"10.17619/UNIPB/1-766","_id":"18975","date_updated":"2022-01-06T06:53:56Z"},{"status":"public","has_accepted_license":"1","date_created":"2019-02-25T13:03:02Z","author":[{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias"}],"file_date_updated":"2019-03-28T13:40:51Z","file":[{"file_size":3116177,"creator":"ups","file_id":"8715","date_updated":"2019-03-28T13:40:51Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games.pdf","date_created":"2019-03-28T13:40:51Z","access_level":"closed"}],"ddc":["000"],"user_id":"15415","abstract":[{"text":"This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.","lang":"eng"}],"citation":{"mla":"Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588.","bibtex":"@book{Feldotto_2019, place={Universität Paderborn}, title={Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}, DOI={10.17619/UNIPB/1-588}, author={Feldotto, Matthias}, year={2019} }","apa":"Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-588","ama":"Feldotto M. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-588","chicago":"Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-588.","ieee":"M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019.","short":"M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019."},"year":"2019","type":"dissertation","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"main_file_link":[{"url":"http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true"}],"_id":"8080","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"541"},{"_id":"63"}],"title":"Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games","place":"Universität Paderborn","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-588","date_updated":"2022-01-06T07:03:50Z"},{"title":"Scheduling on (Un-)Related Machines with Setup Times","user_id":"13536","author":[{"full_name":"Jansen, Klaus","first_name":"Klaus","last_name":"Jansen"},{"full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack"},{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"}],"publisher":"IEEE","department":[{"_id":"63"}],"publication":"Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)","status":"public","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901"}],"date_created":"2019-04-09T11:28:46Z","date_updated":"2022-01-06T07:04:04Z","_id":"8866","citation":{"ama":"Jansen K, Maack M, Mäcker A. Scheduling on (Un-)Related Machines with Setup Times. In: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2019:145-154.","apa":"Jansen, K., Maack, M., & Mäcker, A. (2019). Scheduling on (Un-)Related Machines with Setup Times. In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 145–154). IEEE.","chicago":"Jansen, Klaus, Marten Maack, and Alexander Mäcker. “Scheduling on (Un-)Related Machines with Setup Times.” In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 145–54. IEEE, 2019.","mla":"Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.” Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–54.","bibtex":"@inproceedings{Jansen_Maack_Mäcker_2019, title={Scheduling on (Un-)Related Machines with Setup Times}, booktitle={Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Jansen, Klaus and Maack, Marten and Mäcker, Alexander}, year={2019}, pages={145–154} }","short":"K. Jansen, M. Maack, A. Mäcker, in: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–154.","ieee":"K. Jansen, M. Maack, and A. Mäcker, “Scheduling on (Un-)Related Machines with Setup Times,” in Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019, pp. 145–154."},"type":"conference","year":"2019","page":"145 - 154","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1609/aaai.v33i01.33011973","date_updated":"2022-01-06T07:01:55Z","publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"541"},{"_id":"63"}],"title":" Multi-unit Bilateral Trade","citation":{"bibtex":"@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={ Multi-unit Bilateral Trade}, DOI={10.1609/aaai.v33i01.33011973}, booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }","mla":"Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.","chicago":"Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019. https://doi.org/10.1609/aaai.v33i01.33011973.","apa":"Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (2019). Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. https://doi.org/10.1609/aaai.v33i01.33011973","ama":"Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B. Multi-unit Bilateral Trade. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). ; 2019. doi:10.1609/aaai.v33i01.33011973","ieee":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: 10.1609/aaai.v33i01.33011973.","short":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019."},"type":"conference","year":"2019","conference":{"location":"Honolulu, Hawaii, USA","name":"Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","start_date":"2019-01-27","end_date":"2019-02-01"},"_id":"5471","date_created":"2018-11-12T09:38:16Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","file_date_updated":"2018-12-06T13:57:51Z","author":[{"last_name":"Lazos","first_name":"Philip","full_name":"Lazos, Philip"},{"last_name":"Goldberg","first_name":"Paul","full_name":"Goldberg, Paul"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"},{"first_name":"Matthias","full_name":"Gerstgrasser, Matthias","last_name":"Gerstgrasser"},{"last_name":"de Keijzer","first_name":"Bart","full_name":"de Keijzer, Bart"}],"file":[{"access_level":"closed","file_name":"1811.05130.pdf","date_created":"2018-12-06T13:57:51Z","date_updated":"2018-12-06T13:57:51Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":315877,"file_id":"6018","creator":"feldi"}],"ddc":["000"],"user_id":"15415","abstract":[{"lang":"eng","text":"We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. \r\nFurthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting."}]},{"user_id":"22704","title":"Managing Multiple Mobile Resources","external_id":{"arxiv":["1907.09834"]},"status":"public","date_created":"2019-07-22T09:00:05Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication_status":"published","author":[{"last_name":"Feldkord","id":"22704","first_name":"Björn","full_name":"Feldkord, Björn"},{"id":"39241","last_name":"Knollmann","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Springer","department":[{"_id":"63"}],"publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","doi":"10.1007/978-3-030-39479-0_9","_id":"12870","date_updated":"2022-01-06T06:51:20Z","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={10.1007/978-3-030-39479-0_9}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2019:120-137. doi:10.1007/978-3-030-39479-0_9","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer, 2019. https://doi.org/10.1007/978-3-030-39479-0_9.","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137."},"type":"conference","year":"2019","page":"120 - 137"},{"doi":"10.17619/UNIPB/1-828","date_updated":"2022-01-06T06:52:08Z","_id":"14851","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"year":"2019","citation":{"bibtex":"@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling with Setup Times}, DOI={10.17619/UNIPB/1-828}, author={Mäcker, Alexander}, year={2019} }","mla":"Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.","apa":"Mäcker, A. (2019). On Scheduling with Setup Times. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-828","ama":"Mäcker A. On Scheduling with Setup Times. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-828","chicago":"Mäcker, Alexander. On Scheduling with Setup Times. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-828.","ieee":"A. Mäcker, On Scheduling with Setup Times. Universität Paderborn, 2019.","short":"A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019."},"type":"dissertation","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-828"}]},"user_id":"15415","ddc":["000"],"title":"On Scheduling with Setup Times","place":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2019-11-07T14:17:05Z","status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker","id":"13536"}]},{"oa":"1","_id":"16341","date_updated":"2022-01-06T06:52:49Z","language":[{"iso":"eng"}],"year":"2019","citation":{"ieee":"S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels,” arXiv:1904.08225. 2019.","short":"S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225 (2019).","bibtex":"@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels}, journal={arXiv:1904.08225}, author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2019} }","mla":"Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.","chicago":"Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.","ama":"Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. arXiv:190408225. 2019.","apa":"Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225."},"type":"preprint","main_file_link":[{"open_access":"1"}],"user_id":"15415","title":"Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels","external_id":{"arxiv":["1904.08225"]},"abstract":[{"lang":"eng","text":"We present a technique for rendering highly complex 3D scenes in real-time by\r\ngenerating uniformly distributed points on the scene's visible surfaces. The\r\ntechnique is applicable to a wide range of scene types, like scenes directly\r\nbased on complex and detailed CAD data consisting of billions of polygons (in\r\ncontrast to scenes handcrafted solely for visualization). This allows to\r\nvisualize such scenes smoothly even in VR on a HMD with good image quality,\r\nwhile maintaining the necessary frame-rates. In contrast to other point based\r\nrendering methods, we place points in an approximated blue noise distribution\r\nonly on visible surfaces and store them in a highly GPU efficient data\r\nstructure, allowing to progressively refine the number of rendered points to\r\nmaximize the image quality for a given target frame rate. Our evaluation shows\r\nthat scenes consisting of a high amount of polygons can be rendered with\r\ninteractive frame rates with good visual quality on standard hardware."}],"status":"public","date_created":"2020-03-24T08:59:44Z","author":[{"last_name":"Brandt","id":"11648","first_name":"Sascha","full_name":"Brandt, Sascha","orcid":"0000-0003-3546-203X"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"arXiv:1904.08225"},{"file":[{"file_name":"DissertationFeldkord.pdf","date_created":"2020-01-24T08:12:58Z","access_level":"closed","file_id":"15632","creator":"florida","file_size":633652,"success":1,"relation":"main_file","date_updated":"2020-01-24T08:12:58Z","content_type":"application/pdf"}],"publication":"ACM Transactions on Parallel Computing (TOPC)","file_date_updated":"2020-01-24T08:12:58Z","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2019-10-16T07:06:22Z","has_accepted_license":"1","status":"public","volume":6,"user_id":"15504","ddc":["000"],"citation":{"ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC). 2019;6(3). doi:10.1145/3364204","apa":"Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC) 6, no. 3 (2019). https://doi.org/10.1145/3364204.","bibtex":"@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem}, volume={6}, DOI={10.1145/3364204}, number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2019} }","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.","short":"B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 2019."},"type":"journal_article","year":"2019","_id":"13873","intvolume":" 6","issue":"3","article_number":"14","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_status":"published","title":"The Mobile Server Problem","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:46Z","doi":"10.1145/3364204"},{"doi":"10.1007/s00591-019-00249-0","issue":"2","_id":"13937","intvolume":" 66","date_updated":"2022-01-06T06:51:47Z","page":"259-260","year":"2019","type":"journal_article","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte 66, no. 2 (2019): 259–60. https://doi.org/10.1007/s00591-019-00249-0.","apa":"Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0","ama":"Meyer auf der Heide F. Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte. 2019;66(2):259-260. doi:10.1007/s00591-019-00249-0","bibtex":"@article{Meyer auf der Heide_2019, title={Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln}, volume={66}, DOI={10.1007/s00591-019-00249-0}, number={2}, journal={Mathematische Semesterberichte}, author={Meyer auf der Heide, Friedhelm}, year={2019}, pages={259–260} }","mla":"Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.","short":"F. Meyer auf der Heide, Mathematische Semesterberichte 66 (2019) 259–260.","ieee":"F. Meyer auf der Heide, “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln,” Mathematische Semesterberichte, vol. 66, no. 2, pp. 259–260, 2019."},"language":[{"iso":"ger"}],"title":"Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln","user_id":"15415","publication_status":"published","volume":66,"date_created":"2019-10-21T08:54:14Z","status":"public","publication":"Mathematische Semesterberichte","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"page":"317-334","citation":{"apa":"Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\\_13","ama":"Kling P, Meyer auf der Heide F. Continuous Protocols for Swarm Robotics. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Vol 11340. Lecture Notes in Computer Science. Springer; 2019:317-334. doi:10.1007/978-3-030-11072-7\\_13","chicago":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” In Distributed Computing by Mobile Entities, Current Research in Moving and Computing, 11340:317–34. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-11072-7\\_13.","mla":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\\_13.","bibtex":"@inbook{Kling_Meyer auf der Heide_2019, series={Lecture Notes in Computer Science}, title={Continuous Protocols for Swarm Robotics}, volume={11340}, DOI={10.1007/978-3-030-11072-7\\_13}, booktitle={Distributed Computing by Mobile Entities, Current Research in Moving and Computing}, publisher={Springer}, author={Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2019}, pages={317–334}, collection={Lecture Notes in Computer Science} }","short":"P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Springer, 2019, pp. 317–334.","ieee":"P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–334."},"type":"book_chapter","year":"2019","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-11072-7\\_13","_id":"13939","intvolume":" 11340","date_updated":"2022-01-06T06:51:47Z","volume":11340,"date_created":"2019-10-21T13:20:43Z","status":"public","publication":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing","department":[{"_id":"63"}],"publisher":"Springer","author":[{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Continuous Protocols for Swarm Robotics","user_id":"15415"},{"date_created":"2019-10-21T13:42:50Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","author":[{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"SciTePress","user_id":"477","title":"Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location","language":[{"iso":"eng"}],"page":"315-321","year":"2019","type":"conference","citation":{"chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 315–21. SciTePress, 2019. https://doi.org/10.5220/0007369503150321.","apa":"Markarian, C., & Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems (pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321","ama":"Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems. SciTePress; 2019:315-321. doi:10.5220/0007369503150321","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={10.5220/0007369503150321}, booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321."},"doi":"10.5220/0007369503150321","_id":"13942","date_updated":"2022-01-06T06:51:47Z"},{"intvolume":" 786","_id":"13946","date_updated":"2022-01-06T06:51:48Z","doi":"10.1016/j.tcs.2018.11.006","page":"2-12","type":"journal_article","citation":{"ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.","mla":"Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.","bibtex":"@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient parallel algorithms for parameterized problems}, volume={786}, DOI={10.1016/j.tcs.2018.11.006}, journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2019}, pages={2–12} }","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science 786 (2019): 2–12. https://doi.org/10.1016/j.tcs.2018.11.006.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient parallel algorithms for parameterized problems. Theoretical Computer Science. 2019;786:2-12. doi:10.1016/j.tcs.2018.11.006","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006"},"year":"2019","language":[{"iso":"eng"}],"title":"Efficient parallel algorithms for parameterized problems","user_id":"15415","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","author":[{"full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N.","last_name":"Abu-Khzam"},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"volume":786,"date_created":"2019-10-21T13:57:06Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public"},{"page":"345-348","year":"2019","citation":{"mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\\_26.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\\_26","apa":"Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\\_26","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\\_26.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348."},"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-24922-9\\_26","conference":{"end_date":"2019-07-04","name":"SIROCCO 2019","start_date":"2019-07-01","location":"L'Aquila, Italy"},"date_updated":"2022-01-06T06:52:00Z","_id":"14539","date_created":"2019-11-04T10:09:35Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477"},{"title":" From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation","department":[{"_id":"541"},{"_id":"63"}],"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_updated":"2022-01-06T06:50:33Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare."}],"ddc":["004"],"user_id":"477","publication":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems","file_date_updated":"2019-08-26T11:10:02Z","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"full_name":"Lenzner, Pascal ","first_name":"Pascal ","last_name":"Lenzner"},{"last_name":"Molitor","first_name":"Louise","full_name":"Molitor, Louise"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file":[{"file_name":"1903.04265.pdf","date_created":"2019-08-26T11:10:02Z","access_level":"closed","file_id":"12962","creator":"ups","file_size":698599,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2019-08-26T11:10:02Z"}],"date_created":"2019-06-20T14:46:08Z","has_accepted_license":"1","status":"public","conference":{"name":"18th International Conference on Autonomous Agents and MultiAgent Systems","location":"Montreal QC, Canada"},"_id":"10281","main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3331973"}],"page":"1949--1951","citation":{"apa":"Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"Feldotto M, Lenzner P, Molitor L, Skopalik A. From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.","chicago":"Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.","bibtex":"@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}, booktitle={Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal and Molitor, Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }","mla":"Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","short":"M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","ieee":"M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal QC, Canada, 2019, pp. 1949--1951."},"type":"conference","year":"2019"},{"publisher":"Universität Paderborn","author":[{"last_name":"Pukrop","full_name":"Pukrop, Simon","first_name":"Simon"}],"department":[{"_id":"63"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"date_created":"2019-07-04T07:21:19Z","user_id":"477","title":"Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2019","type":"mastersthesis","citation":{"chicago":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","ama":"Pukrop S. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn; 2019.","apa":"Pukrop, S. (2019). Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn.","bibtex":"@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2019} }","mla":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","short":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019.","ieee":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019."},"_id":"10344","date_updated":"2022-01-06T06:50:37Z"},{"date_updated":"2022-01-06T06:56:39Z","doi":"10.4230/LIPIcs.ICALP.2018.51","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.01231"]},"place":"Dagstuhl, Germany","title":"Fully-Dynamic Bin Packing with Little Repacking","department":[{"_id":"541"},{"_id":"63"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"publication_status":"published","editor":[{"last_name":"Chatzigiannakis","first_name":"Ioannis","full_name":"Chatzigiannakis, Ioannis"},{"first_name":"Christos","full_name":"Kaklamanis, Christos","last_name":"Kaklamanis"},{"last_name":"Marx","first_name":"Dániel","full_name":"Marx, Dániel"},{"full_name":"Sannella, Donald","first_name":"Donald","last_name":"Sannella"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"conference":{"name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","start_date":"2018-07-10","location":"Prag","end_date":"2018-07-13"},"intvolume":" 107","_id":"2484","page":"51:1-51:24","citation":{"chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51","ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={10.4230/LIPIcs.ICALP.2018.51}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.","short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","ieee":"B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24."},"type":"conference","year":"2018","abstract":[{"lang":"eng","text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure."}],"ddc":["000"],"user_id":"14052","publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","file_date_updated":"2018-10-31T16:58:18Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"},{"id":"14052","last_name":"Feldotto","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"last_name":"Gupta","first_name":"Anupam","full_name":"Gupta, Anupam"},{"first_name":"Guru","full_name":"Guruganesh, Guru","last_name":"Guruganesh"},{"last_name":"Kumar","full_name":"Kumar, Amit ","first_name":"Amit "},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"},{"full_name":"Wajc, David","first_name":"David","last_name":"Wajc"}],"file":[{"file_id":"5227","creator":"feldi","file_size":723824,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T16:58:18Z","file_name":"LIPIcs-ICALP-2018-51.pdf","date_created":"2018-10-31T16:58:18Z","access_level":"closed"}],"volume":107,"date_created":"2018-04-24T15:21:56Z","status":"public","has_accepted_license":"1"},{"doi":"10.1145/3210377.3210389","date_updated":"2022-01-06T06:56:39Z","language":[{"iso":"eng"}],"title":"Online Facility Location with Mobile Facilities","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_status":"published","department":[{"_id":"63"}],"conference":{"location":"Wien","name":"SPAA'18"},"_id":"2485","page":"373 - 381 ","year":"2018","type":"conference","citation":{"ieee":"B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility Location with Mobile Facilities}, DOI={10.1145/3210377.3210389}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2018}, pages={373–381} }","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.","apa":"Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389","ama":"Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389"},"user_id":"477","ddc":["000"],"date_created":"2018-04-25T08:49:43Z","status":"public","has_accepted_license":"1","file":[{"success":1,"relation":"main_file","date_updated":"2018-11-02T14:42:33Z","content_type":"application/pdf","creator":"ups","file_id":"5280","file_size":1207546,"access_level":"closed","file_name":"p373-feldkord.pdf","date_created":"2018-11-02T14:42:33Z"}],"file_date_updated":"2018-11-02T14:42:33Z","publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","publisher":"ACM","author":[{"last_name":"Feldkord","id":"22704","first_name":"Björn","full_name":"Feldkord, Björn"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"abstract":[{"lang":"eng","text":"We consider a group of $n$ autonomous mobile robots of which $m$ are stationary thus cannot move. Robots are represented by points in the Euclidean plane. They have no memory, do not communicate or share a common coordinate system and they move solely based on the positioning of other robots within their limited viewing range of 1. The goal is to gather the robots inside of the convex hull of all stationary robots. A variant of this problem, the general gathering problem, has been studied in various different time models. In this work, we consider a continuous time model, where robots continuously observe their neighbors, compute the next target of movement and move with a speed limit of 1 at any time. Regarding the robots' local strategy, we only study contracting algorithms in which every robot that is positioned on the border of the convex hull of all robots moves into this hull. We present a time bound of $\\mathcal{O}(nd)$ for any general contracting algorithms in a configuration with only a single stationary robot. For configurations with more stationary robots, we prove that robots converge against the convex hull of all stationary robots and that no upper bound on the runtime exists. For the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle, we provide linear time bounds."}],"title":"Influence of Stationary Robots on Continuous Robot Formation Problems","ddc":["000"],"user_id":"55557","department":[{"_id":"63"}],"file_date_updated":"2021-09-29T12:21:24Z","author":[{"id":"55557","last_name":"Liedtke","full_name":"Liedtke, David Jan","first_name":"David Jan"}],"file":[{"date_created":"2021-09-29T12:21:24Z","file_name":"Bachelor - Thesis.pdf","access_level":"local","creator":"liedtke","file_id":"25124","file_size":6746519,"relation":"main_file","date_updated":"2021-09-29T12:21:24Z","content_type":"application/pdf"}],"date_created":"2021-09-29T12:30:40Z","has_accepted_license":"1","status":"public","date_updated":"2022-01-06T06:56:52Z","_id":"25121","type":"bachelorsthesis","citation":{"short":"D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.","ieee":"D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.","chicago":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.","ama":"Liedtke DJ. Influence of Stationary Robots on Continuous Robot Formation Problems.; 2018.","apa":"Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.","bibtex":"@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }","mla":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018."},"year":"2018","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"We introduce the \\emph{Online Connected Dominating Set Leasing} problem\r\n(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set\r\n$\\mathcal{L}$ of lease types each characterized by a duration and cost, and a\r\nsequence of subsets of $V$ arriving over time. A node can be leased using lease\r\ntype $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives\r\nin each step $t$ a subset of nodes that need to be dominated by a connected\r\nsubgraph consisting of nodes active at time $t$. The goal is to minimize the\r\ntotal leasing costs. OCDSL contains the \\emph{Parking Permit\r\nProblem}~\\cite{PPP} as a special subcase and generalizes the classical offline\r\n\\emph{Connected Dominating Set} problem~\\cite{Guha1998}. It has an $\\Omega(\\log\r\n^2 n + \\log |\\mathcal{L}|)$ randomized lower bound resulting from lower bounds\r\nfor the \\emph{Parking Permit Problem} and the \\emph{Online Set Cover}\r\nproblem~\\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\\mathcal{L}|$ is the\r\nnumber of available lease types and $n$ is the number of nodes in the input\r\ngraph. We give a randomized $\\mathcal{O}(\\log ^2 n + \\log |\\mathcal{L}| \\log\r\nn)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for\r\na variant of OCDSL in which the dominating subgraph need not be connected, the\r\n\\emph{Online Dominating Set Leasing} problem. The latter is based on a simple\r\nprimal-dual approach and has an $\\mathcal{O}(|\\mathcal{L}| \\cdot\r\n\\Delta)$-competitive ratio, where $\\Delta$ is the maximum degree of the input\r\ngraph."}],"title":"Online Connected Dominating Set Leasing","user_id":"15415","author":[{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"}],"department":[{"_id":"63"}],"publication":"arXiv:1805.02994","status":"public","date_created":"2020-10-12T12:42:54Z","date_updated":"2022-01-06T06:54:17Z","_id":"19978","year":"2018","citation":{"short":"C. Markarian, ArXiv:1805.02994 (2018).","ieee":"C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994. 2018.","ama":"Markarian C. Online Connected Dominating Set Leasing. arXiv:180502994. 2018.","apa":"Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.","chicago":"Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.","bibtex":"@article{Markarian_2018, title={Online Connected Dominating Set Leasing}, journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }","mla":"Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018."},"type":"preprint","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:01Z","doi":"10.1145/3230654.3230659","department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"publication_identifier":{"isbn":["978-1-4503-5916-0"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"title":"Disaggregating User Evaluations Using the Shapley Value","citation":{"apa":"Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA. https://doi.org/10.1145/3230654.3230659","ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659","chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6."},"type":"conference","year":"2018","page":"5:1-5:6","_id":"2831","conference":{"location":"Irvine, California, USA","start_date":"2018-06-18","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)","end_date":"2018-06-18"},"author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","id":"20801","last_name":"Haake"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"},{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun","id":"13264"}],"file_date_updated":"2018-08-15T07:30:50Z","publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","file":[{"date_created":"2018-08-15T07:30:50Z","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","access_level":"closed","file_size":1450171,"creator":"nmaraun","file_id":"3910","content_type":"application/pdf","date_updated":"2018-08-15T07:30:50Z","success":1,"relation":"main_file"}],"status":"public","has_accepted_license":"1","date_created":"2018-05-22T10:28:51Z","abstract":[{"lang":"eng","text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete."}],"ddc":["040"],"user_id":"14052"},{"file":[{"file_size":600583,"file_id":"5298","creator":"ups","date_updated":"2018-11-02T15:18:16Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:18:16Z","file_name":"TowardsFlexibleDemandsInOnline.pdf","access_level":"closed"}],"file_date_updated":"2018-11-02T15:18:16Z","publication":"Algorithmica","author":[{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Springer","date_created":"2018-05-24T08:32:38Z","status":"public","has_accepted_license":"1","volume":80,"user_id":"477","ddc":["000"],"page":"1556–1574","type":"journal_article","year":"2018","citation":{"bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y","apa":"Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y","chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5 (2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574, 2018.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574."},"intvolume":" 80","_id":"2848","issue":"5","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"title":"Towards Flexible Demands in Online Leasing Problems. ","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:06Z","doi":"10.1007/s00453-018-0420-y"},{"publication_identifier":{"unknown":["1432-4350"]},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9836-z","date_updated":"2022-01-06T06:58:06Z","status":"public","has_accepted_license":"1","date_created":"2018-05-24T08:39:15Z","publisher":"Springer","author":[{"last_name":"Abu-Khzam","first_name":"Faisal N. ","full_name":"Abu-Khzam, Faisal N. "},{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"}],"publication":"Theory of Computing Systems","file_date_updated":"2018-11-02T15:24:32Z","file":[{"creator":"ups","file_id":"5301","file_size":1371624,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-02T15:24:32Z","file_name":"ApproximationAndHeuristicAlgor.pdf","date_created":"2018-11-02T15:24:32Z","access_level":"closed"}],"ddc":["000"],"user_id":"477","citation":{"ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={10.1007/s00224-017-9836-z}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z"},"year":"2018","type":"journal_article","_id":"2849"},{"language":[{"iso":"eng"}],"citation":{"apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018). Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018. doi:10.4230/LIPIcs.FUN.2018.22","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In Ninth International Conference on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.","mla":"Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in Ninth International Conference on Fun with Algorithms (FUN), 2018."},"type":"conference","year":"2018","_id":"2850","date_updated":"2022-01-06T06:58:07Z","doi":"10.4230/LIPIcs.FUN.2018.22","file":[{"access_level":"closed","file_name":"LIPIcs-FUN-2018-22.pdf","date_created":"2018-11-13T13:15:19Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-13T13:15:19Z","creator":"feldi","file_id":"5536","file_size":554298}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Wahby","full_name":"Wahby, Mostafa","first_name":"Mostafa"}],"publication":"Ninth International Conference on Fun with Algorithms (FUN)","file_date_updated":"2018-11-13T13:15:19Z","department":[{"_id":"63"},{"_id":"238"}],"status":"public","has_accepted_license":"1","date_created":"2018-05-24T08:41:48Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"user_id":"15415","ddc":["000"],"title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets"},{"doi":"10.1007/978-3-319-94667-2_18","date_updated":"2022-01-06T06:56:19Z","_id":"24396","language":[{"iso":"eng"}],"citation":{"short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.","ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA). ; 2018. doi:10.1007/978-3-319-94667-2_18","apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA). https://doi.org/10.1007/978-3-319-94667-2_18","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms (IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.","bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }","mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA), 2018, doi:10.1007/978-3-319-94667-2_18."},"type":"conference","year":"2018","user_id":"15415","title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","place":"Cham","abstract":[{"text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively.","lang":"eng"}],"status":"public","date_created":"2021-09-14T12:23:29Z","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian"}],"publication":"International Workshop on Combinatorial Algorithms (IWOCA)","department":[{"_id":"63"}]},{"volume":36,"has_accepted_license":"1","status":"public","date_created":"2018-07-13T09:57:48Z","author":[{"full_name":"König, Jürgen","first_name":"Jürgen","id":"22358","last_name":"König"},{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker","id":"13536"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"file_date_updated":"2018-11-02T15:20:24Z","publication":"Journal of Combinatorial Optimization","file":[{"access_level":"closed","date_created":"2018-11-02T15:20:24Z","file_name":"SchedulingWithInterjobCommunic.pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:20:24Z","content_type":"application/pdf","creator":"ups","file_id":"5299","file_size":745708}],"ddc":["000"],"user_id":"477","type":"journal_article","year":"2018","citation":{"chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization. 2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018."},"page":"1356-1379","issue":"4","intvolume":" 36","_id":"3551","project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"title":"Scheduling with interjob communication on parallel processors","language":[{"iso":"eng"}],"doi":"10.1007/s10878-018-0325-3","date_updated":"2022-01-06T06:59:24Z"},{"citation":{"ama":"Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn; 2018.","apa":"Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.","chicago":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","mla":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","ieee":"S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018."},"type":"bachelorsthesis","year":"2018","language":[{"iso":"ger"}],"supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"_id":"3851","date_updated":"2022-01-06T06:59:45Z","department":[{"_id":"541"},{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"full_name":"Koop, Samuel","first_name":"Samuel","last_name":"Koop"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-08-08T11:56:37Z","status":"public","title":"Congestion Games mit gewichteten Strategien","user_id":"14052"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z","department":[{"_id":"63"},{"_id":"541"}],"editor":[{"last_name":"Kim","first_name":"Donghyun","full_name":"Kim, Donghyun"},{"last_name":"Uma","full_name":"Uma, R. N.","first_name":"R. N."},{"first_name":"Alexander","full_name":"Zelikovsky, Alexander","last_name":"Zelikovsky"}],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"place":"Cham","title":"Removing Undesirable Flows by Edge Deletion","citation":{"ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.","mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing."},"year":"2018","type":"conference","page":"217-232","_id":"17651","author":[{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"full_name":"Trajanovski, Stojan","first_name":"Stojan","last_name":"Trajanovski"},{"full_name":"Grosso, Paola","first_name":"Paola","last_name":"Grosso"},{"full_name":"de Laat, Cees","first_name":"Cees","last_name":"de Laat"}],"publisher":"Springer International Publishing","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"publication":"Combinatorial Optimization and Applications","status":"public","date_created":"2020-08-06T15:19:36Z","extern":"1","abstract":[{"text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.","lang":"eng"}],"user_id":"83983"},{"doi":"https://doi.org/10.1016/j.future.2018.08.011","date_updated":"2022-01-06T06:53:16Z","_id":"17666","year":"2018","citation":{"mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018, doi:https://doi.org/10.1016/j.future.2018.08.011.","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={https://doi.org/10.1016/j.future.2018.08.011}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011.","ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” Future Generation Computer Systems, 2018.","short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018)."},"type":"journal_article","language":[{"iso":"eng"}],"title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","user_id":"83983","extern":"1","abstract":[{"text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.","lang":"eng"}],"publication_identifier":{"issn":["0167-739X"]},"status":"public","date_created":"2020-08-06T15:23:11Z","author":[{"last_name":"Koning","full_name":"Koning, R.","first_name":"R."},{"last_name":"de Graaff","first_name":"B.","full_name":"de Graaff, B."},{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Meijer","full_name":"Meijer, R.","first_name":"R."},{"last_name":"de Laat","full_name":"de Laat, C.","first_name":"C."},{"last_name":"Grosso","first_name":"P.","full_name":"Grosso, P."}],"keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"department":[{"_id":"63"},{"_id":"541"}],"publication":"Future Generation Computer Systems"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:00Z","doi":"10.1007/s10951-017-0518-0","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Scheduling Shared Continuous Resources on Many-Cores","year":"2018","type":"journal_article","citation":{"ieee":"E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.","ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018): 77–92. https://doi.org/10.1007/s10951-017-0518-0."},"page":"77-92","intvolume":" 21","_id":"63","issue":"1","author":[{"full_name":"Althaus, Ernst","first_name":"Ernst","last_name":"Althaus"},{"last_name":"Brinkmann","first_name":"Andre","full_name":"Brinkmann, Andre"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Nagel","full_name":"Nagel, Lars","first_name":"Lars"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"last_name":"Sgall","first_name":"Jiri","full_name":"Sgall, Jiri"},{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"}],"publisher":"Springer","file_date_updated":"2018-03-21T13:16:59Z","publication":"Journal of Scheduling","file":[{"file_size":466808,"file_id":"1577","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T13:16:59Z","relation":"main_file","success":1,"date_created":"2018-03-21T13:16:59Z","file_name":"63-main_05.pdf","access_level":"closed"}],"volume":21,"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:03Z","ddc":["040"],"user_id":"15415"},{"_id":"4411","intvolume":" 11201","conference":{"end_date":"2018-11-07","location":"Tokyo","start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},"type":"conference","citation":{"ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1","apa":"Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201."},"year":"2018","abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"user_id":"39241","ddc":["000"],"file":[{"access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","date_created":"2018-11-02T14:38:37Z","success":1,"relation":"main_file","date_updated":"2018-11-02T14:38:37Z","content_type":"application/pdf","creator":"ups","file_id":"5277","file_size":500005}],"publisher":"Springer, Cham","author":[{"orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till","id":"39241","last_name":"Knollmann"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-11-02T14:38:37Z","has_accepted_license":"1","status":"public","date_created":"2018-09-17T13:12:18Z","volume":11201,"date_updated":"2022-01-06T07:01:02Z","doi":"10.1007/978-3-030-03232-6_1","series_title":"Lecture Notes of Computer Science","language":[{"iso":"eng"}],"external_id":{"arxiv":["1809.04923"]},"title":"A Self-Stabilizing Hashed Patricia Trie","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"editor":[{"last_name":"Izumi","first_name":"Taisuke","full_name":"Izumi, Taisuke"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}]},{"status":"public","has_accepted_license":"1","date_created":"2018-10-02T07:06:05Z","file":[{"creator":"ups","file_id":"6621","file_size":349034,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf","date_created":"2019-01-11T10:32:38Z","access_level":"closed"}],"author":[{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Sundermeier, Jannik","first_name":"Jannik","id":"38705","last_name":"Sundermeier"}],"publisher":"Springer","publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"file_date_updated":"2019-01-11T10:32:38Z","user_id":"38705","ddc":["000"],"abstract":[{"lang":"eng","text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n"}],"citation":{"ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018."},"type":"conference","year":"2018","_id":"4563","conference":{"name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","start_date":"2018-08-23","location":"Helsinki","end_date":"2018-08-24"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"title":"Competitive Routing in Hybrid Communication Networks","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:11Z"},{"doi":"10.1145/3210377.3210663","date_updated":"2022-01-06T07:01:12Z","language":[{"iso":"eng"}],"title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","department":[{"_id":"63"},{"_id":"79"}],"conference":{"name":"SPAA'18","start_date":"2018-07-17","location":"Wien","end_date":"2018-07-18"},"_id":"4565","year":"2018","type":"conference","citation":{"chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018."},"user_id":"38705","ddc":["000"],"date_created":"2018-10-02T07:34:47Z","has_accepted_license":"1","status":"public","file":[{"file_size":1025077,"file_id":"5254","creator":"ups","date_updated":"2018-11-02T13:48:10Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"p231-jung-1.pdf","date_created":"2018-11-02T13:48:10Z","access_level":"closed"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T13:48:10Z","publisher":"ACM Press","author":[{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}]},{"conference":{"name":"30th Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","location":"Vienna","end_date":"2018-07-18"},"_id":"7570","type":"conference","citation":{"ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, 2018.","short":"F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018.","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }","mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662","apa":"Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662."},"year":"2018","ddc":["000"],"user_id":"30291","date_created":"2019-02-06T14:16:19Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","file_date_updated":"2019-02-06T14:18:35Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian","id":"30291","last_name":"Schaefer"}],"publisher":"ACM Press","file":[{"file_name":"p359-meyer-auf-der-heide.pdf","date_created":"2019-02-06T14:18:35Z","access_level":"closed","file_size":1504739,"creator":"jschaef","file_id":"7576","date_updated":"2019-02-06T14:18:35Z","content_type":"application/pdf","relation":"main_file"}],"doi":"10.1145/3210377.3210662","date_updated":"2022-01-06T07:03:40Z","language":[{"iso":"eng"}],"title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}]},{"conference":{"end_date":"2018-08-21","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20","location":"Helsinki"},"_id":"4375","year":"2018","type":"conference","citation":{"bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4.","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018."},"abstract":[{"text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.","lang":"eng"}],"user_id":"14955","ddc":["000"],"file":[{"file_size":1122875,"file_id":"5863","creator":"tillk","date_updated":"2018-11-27T10:03:33Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-27T10:03:33Z","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","access_level":"closed"}],"file_date_updated":"2018-11-27T10:03:33Z","keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","author":[{"full_name":"Benter, Markus","first_name":"Markus","last_name":"Benter"},{"first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"},{"full_name":"Sundermeier, Jannik","first_name":"Jannik","id":"38705","last_name":"Sundermeier"}],"date_created":"2018-09-11T05:26:59Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T07:01:00Z","doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","department":[{"_id":"63"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_updated":"2022-01-06T07:01:51Z","_id":"5403","type":"bachelorsthesis","citation":{"short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","ieee":"M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.","chicago":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","apa":"Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.","ama":"Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.","mla":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }"},"year":"2018","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Mobile Facility Leasing","user_id":"477","date_created":"2018-11-07T09:20:59Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Marcel","full_name":"Geromel, Marcel","last_name":"Geromel"}],"publisher":"Universität Paderborn"},{"user_id":"477","title":"Online Algorithmen für das k-Page Migration Problem","department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"first_name":"Patrick Irenäus","full_name":"Kolpaczki, Patrick Irenäus","last_name":"Kolpaczki"}],"date_created":"2018-11-07T09:23:17Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","date_updated":"2022-01-06T07:01:51Z","_id":"5404","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"citation":{"ama":"Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018.","apa":"Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.","chicago":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","mla":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","ieee":"P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018."},"year":"2018","type":"bachelorsthesis"},{"file":[{"file_size":605207,"creator":"feldi","file_id":"5226","date_updated":"2018-10-31T16:57:32Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","date_created":"2018-10-31T16:57:32Z","access_level":"closed"}],"author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publisher":"Springer Nature","publication":"Journal of Combinatorial Optimization","file_date_updated":"2018-10-31T16:57:32Z","has_accepted_license":"1","status":"public","date_created":"2017-10-26T14:11:04Z","volume":36,"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"user_id":"14052","ddc":["000"],"type":"journal_article","year":"2018","citation":{"chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018."},"page":"1145-1167","intvolume":" 36","_id":"669","issue":"4","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication_status":"published","publication_identifier":{"issn":["1382-6905","1573-2886"]},"external_id":{"arxiv":["1607.05143"]},"title":"Congestion games with mixed objectives","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:15Z","doi":"10.1007/s10878-017-0189-y"},{"supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"type":"mastersthesis","year":"2018","citation":{"ieee":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","mla":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","bibtex":"@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }","apa":"Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.","ama":"Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn; 2018.","chicago":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018."},"date_updated":"2022-01-06T06:51:11Z","_id":"1186","date_created":"2018-03-02T13:47:57Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","department":[{"_id":"63"},{"_id":"541"}],"author":[{"last_name":"Kemper","first_name":"Arne","full_name":"Kemper, Arne"}],"publisher":"Universität Paderborn","user_id":"14052","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions"},{"_id":"1187","date_updated":"2022-01-06T06:51:11Z","citation":{"ieee":"M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","bibtex":"@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall, Marcel}, year={2018} }","mla":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.","ama":"Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn; 2018.","apa":"Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.","chicago":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018."},"year":"2018","type":"bachelorsthesis","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","user_id":"14052","publisher":"Universität Paderborn","author":[{"first_name":"Marcel","full_name":"Nachtigall, Marcel","last_name":"Nachtigall"}],"department":[{"_id":"63"},{"_id":"541"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-03-02T13:49:39Z"},{"title":"Learning deterministic bandit behaviour form compositions","user_id":"14052","publisher":"Universität Paderborn","author":[{"full_name":"Kempf, Jérôme","first_name":"Jérôme","last_name":"Kempf"}],"department":[{"_id":"63"},{"_id":"541"}],"status":"public","date_created":"2018-03-02T13:51:14Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_updated":"2022-01-06T06:51:11Z","_id":"1188","year":"2018","citation":{"ieee":"J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.","short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.","bibtex":"@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }","mla":"Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.","ama":"Kempf J. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn; 2018.","apa":"Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.","chicago":"Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018."},"type":"bachelorsthesis","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}]},{"doi":"10.17619/UNIPB/1-271","_id":"1209","date_updated":"2022-01-06T06:51:17Z","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"citation":{"chicago":"Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.","apa":"Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-271","ama":"Jung D. Local Strategies for Swarm Formations on a Grid. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-271","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={10.17619/UNIPB/1-271}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }","mla":"Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271.","short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.","ieee":"D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018."},"year":"2018","type":"dissertation","user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"title":"Local Strategies for Swarm Formations on a Grid","abstract":[{"lang":"eng","text":"My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors."}],"status":"public","date_created":"2018-03-13T10:26:16Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_identifier":{"isbn":["978-3-942647-99-1"]},"author":[{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}]},{"language":[{"iso":"eng"}],"year":"2018","citation":{"mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.","bibtex":"@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-98355-4_18}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }","ama":"Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham; 2018. doi:10.1007/978-3-319-98355-4_18","apa":"Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18","chicago":"Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham, 2018. https://doi.org/10.1007/978-3-319-98355-4_18.","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018."},"type":"book_chapter","doi":"10.1007/978-3-319-98355-4_18","date_updated":"2022-01-06T06:52:50Z","_id":"16392","date_created":"2020-04-03T07:04:59Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319125671","9783319125688"]},"department":[{"_id":"63"}],"publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"user_id":"15415","title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","place":"Cham"},{"year":"2018","citation":{"ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={10.1007/s10878-018-0269-7}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.","apa":"Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0269-7","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. 2018. doi:10.1007/s10878-018-0269-7"},"type":"journal_article","_id":"1369","file":[{"creator":"feldi","file_id":"5225","file_size":561187,"relation":"main_file","date_updated":"2018-10-31T16:56:13Z","content_type":"application/pdf","date_created":"2018-10-31T16:56:13Z","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","access_level":"closed"}],"file_date_updated":"2018-10-31T16:56:13Z","publication":"Journal of Combinatorial Optimization","publisher":"Springer Nature","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"id":"14052","last_name":"Feldotto","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"date_created":"2018-03-18T11:12:49Z","status":"public","has_accepted_license":"1","abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"user_id":"14052","ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:42Z","doi":"10.1007/s10878-018-0269-7","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"publication_identifier":{"issn":["1382-6905","1573-2886"]},"publication_status":"epub_ahead","title":"Pure Nash equilibria in restricted budget games"},{"status":"public","date_created":"2020-09-21T13:52:09Z","author":[{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"}],"department":[{"_id":"63"}],"title":"Parallel fixed parameter tractable problems","user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"10.17619/UNIPB/1-252 "}]},"place":"Universität Paderborn","citation":{"mla":"Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.","bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={10.17619/UNIPB/1-252}, author={Li, Shouwei}, year={2017} }","chicago":"Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-252.","ama":"Li S. Parallel Fixed Parameter Tractable Problems. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-252","apa":"Li, S. (2017). Parallel fixed parameter tractable problems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-252","ieee":"S. Li, Parallel fixed parameter tractable problems. Universität Paderborn, 2017.","short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017."},"year":"2017","type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"doi":"10.17619/UNIPB/1-252","_id":"19604","date_updated":"2022-01-06T06:54:07Z"},{"doi":"10.1007/978-3-319-89920-6_57","conference":{"end_date":"Sept 8, 2017","location":"Berlin","start_date":"Sept 6, 2017"},"_id":"2851","date_updated":"2022-01-06T06:58:08Z","type":"conference","year":"2017","citation":{"chicago":"Markarian, Christine. “Leasing with Uncertainty.” In International Conference on Operations Research (OR), 2017. https://doi.org/10.1007/978-3-319-89920-6_57.","apa":"Markarian, C. (2017). Leasing with Uncertainty. In International Conference on Operations Research (OR). Berlin. https://doi.org/10.1007/978-3-319-89920-6_57","ama":"Markarian C. Leasing with Uncertainty. In: International Conference on Operations Research (OR). ; 2017. doi:10.1007/978-3-319-89920-6_57","bibtex":"@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={10.1007/978-3-319-89920-6_57}, booktitle={International Conference on Operations Research (OR)}, author={Markarian, Christine}, year={2017} }","mla":"Markarian, Christine. “Leasing with Uncertainty.” International Conference on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.","short":"C. Markarian, in: International Conference on Operations Research (OR), 2017.","ieee":"C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017."},"language":[{"iso":"eng"}],"ddc":["000"],"title":"Leasing with Uncertainty","user_id":"14052","date_created":"2018-05-24T08:44:43Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","has_accepted_license":"1","publication":"International Conference on Operations Research (OR)","file_date_updated":"2018-11-13T13:16:30Z","department":[{"_id":"63"}],"author":[{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"}],"file":[{"date_created":"2018-11-13T13:16:30Z","file_name":"Markarian2018_Chapter_LeasingWithUncertainty.pdf","access_level":"closed","file_size":257103,"creator":"feldi","file_id":"5537","content_type":"application/pdf","date_updated":"2018-11-13T13:16:30Z","relation":"main_file","success":1}]},{"status":"public","date_created":"2021-09-14T12:41:58Z","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"full_name":"Khaluf, Yara","first_name":"Yara","last_name":"Khaluf"},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine"},{"last_name":"Simoens","first_name":"Pieter","full_name":"Simoens, Pieter"},{"last_name":"Reina","first_name":"Andreagiovanni","full_name":"Reina, Andreagiovanni"}],"department":[{"_id":"63"}],"publication":"International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)","user_id":"15415","title":"Scheduling Access to Shared Space in Multi-robot Systems","place":"Cham","abstract":[{"text":"Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.","lang":"eng"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12}, booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}, year={2017} }","mla":"Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.” International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.","ama":"Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12","apa":"Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12","chicago":"Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12.","ieee":"Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.","short":"Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017."},"year":"2017","type":"conference","doi":"10.1007/978-3-319-59930-4_12","date_updated":"2022-01-06T06:56:19Z","_id":"24398"},{"year":"2017","citation":{"ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233."},"type":"conference","page":"222--233","_id":"112","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:13Z","file":[{"date_created":"2018-03-21T13:05:37Z","file_name":"112-FeldottoLederSkopalik2017.pdf","access_level":"closed","file_size":264089,"file_id":"1566","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T13:05:37Z","success":1,"relation":"main_file"}],"author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","file_date_updated":"2018-03-21T13:05:37Z","user_id":"14052","ddc":["040"],"abstract":[{"text":"We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.","lang":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-57586-5_19","date_updated":"2022-01-06T06:50:58Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Congestion Games with Complementarities","external_id":{"arxiv":["1701.07304"]}},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:59Z","doi":"10.1007/978-3-319-71924-5_14","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"external_id":{"arxiv":["1710.01634"]},"title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","year":"2017","type":"conference","citation":{"ieee":"M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","bibtex":"@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={10.1007/978-3-319-71924-5_14}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }","mla":"Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.","apa":"Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE). https://doi.org/10.1007/978-3-319-71924-5_14","ama":"Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings of the 13th International Conference on Web and Internet Economics (WINE). ; 2017. doi:10.1007/978-3-319-71924-5_14","chicago":"Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14."},"_id":"113","author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"last_name":"Kotsialou","first_name":"Grammateia","full_name":"Kotsialou, Grammateia"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","file_date_updated":"2018-10-31T17:01:32Z","file":[{"file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","date_created":"2018-10-31T17:01:32Z","access_level":"closed","file_id":"5231","creator":"feldi","file_size":279055,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T17:01:32Z"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:13Z","abstract":[{"text":"We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].","lang":"eng"}],"ddc":["000"],"user_id":"14052"},{"title":"Filtering Undesirable Flows in Networks","place":"Cham","publication_identifier":{"isbn":["978-3-319-71150-8"]},"department":[{"_id":"63"},{"_id":"541"}],"doi":"10.1007/978-3-319-71150-8_1","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"83983","extern":"1","status":"public","date_created":"2020-08-06T15:19:48Z","author":[{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"first_name":"Stojan","full_name":"Trajanovski, Stojan","last_name":"Trajanovski"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"full_name":"de Laat, Cees","first_name":"Cees","last_name":"de Laat"}],"publisher":"Springer International Publishing","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"_id":"17652","citation":{"short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-71150-8_1","apa":"Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1","mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }"},"year":"2017","type":"conference","page":"3-17"},{"title":"Reciprocation Effort Games","user_id":"83983","extern":"1","date_created":"2020-08-06T15:20:09Z","status":"public","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","department":[{"_id":"63"},{"_id":"541"}],"keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."}],"publisher":"Springer","date_updated":"2022-01-06T06:53:16Z","_id":"17653","citation":{"bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.","ama":"Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017.","ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017."},"year":"2017","type":"conference","language":[{"iso":"eng"}],"series_title":"CCIS"},{"language":[{"iso":"eng"}],"year":"2017","type":"conference","citation":{"ieee":"G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017.","apa":"Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.","ama":"Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017."},"series_title":"CCIS","date_updated":"2022-01-06T06:53:16Z","_id":"17654","date_created":"2020-08-06T15:20:19Z","status":"public","keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Springer","author":[{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"full_name":"de Weerdt, M.M.","first_name":"M.M.","last_name":"de Weerdt"}],"user_id":"83983","title":"Competition between Cooperative Projects","extern":"1"},{"author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"arXiv:1702.03400","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-11T13:48:38Z","abstract":[{"lang":"eng","text":"We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved."}],"title":"Gathering Anonymous, Oblivious Robots on a Grid","user_id":"15415","type":"preprint","citation":{"ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).","bibtex":"@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }","mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.","ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017.","apa":"Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400."},"year":"2017","language":[{"iso":"eng"}],"_id":"17811","date_updated":"2022-01-06T06:53:20Z"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-89441-6","date_updated":"2022-01-06T07:03:47Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times","citation":{"ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, vol. 10787, pp. 207–222.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222}, collection={Lecture Notes in Computer Science} }","mla":"Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6"},"year":"2017","type":"conference","page":"207-222","_id":"79","intvolume":" 10787","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:06Z","volume":10787,"file":[{"file_id":"5289","creator":"ups","file_size":380629,"relation":"main_file","success":1,"date_updated":"2018-11-02T14:59:22Z","content_type":"application/pdf","file_name":"Non-clairvoyantSchedulingToMin.pdf","date_created":"2018-11-02T14:59:22Z","access_level":"closed"}],"author":[{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"publisher":"Springer","file_date_updated":"2018-11-02T14:59:22Z","publication":"Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)","user_id":"477","ddc":["000"],"abstract":[{"lang":"eng","text":"Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\\Theta(\\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\\sigma^{-2} \\log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\\Omega(\\sqrt{n})$-bound."}]},{"title":"Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"doi":"10.1007/978-3-319-59605-1_13","date_updated":"2022-01-06T07:03:52Z","language":[{"iso":"eng"}],"series_title":"LNCS","user_id":"477","ddc":["000"],"abstract":[{"lang":"eng","text":"Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter."}],"date_created":"2017-10-17T12:41:07Z","status":"public","has_accepted_license":"1","file":[{"access_level":"closed","date_created":"2018-11-02T15:07:35Z","file_name":"Modular-WidthAnAuxiliaryParame.pdf","date_updated":"2018-11-02T15:07:35Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":238276,"creator":"ups","file_id":"5294"}],"file_date_updated":"2018-11-02T15:07:35Z","publication":"Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)","author":[{"full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N.","last_name":"Abu-Khzam"},{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"_id":"82","page":"139-150","type":"conference","year":"2017","citation":{"apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW). LNCS. ; 2017:139-150. doi:10.1007/978-3-319-59605-1_13","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017. https://doi.org/10.1007/978-3-319-59605-1_13.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017, series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}, DOI={10.1007/978-3-319-59605-1_13}, booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150."}},{"ddc":["040"],"user_id":"477","abstract":[{"text":"We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\\%, 15\\%, and 65\\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \\in \\mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed).","lang":"eng"}],"date_created":"2017-10-17T12:41:02Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-21T13:17:33Z","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"file":[{"file_size":784867,"file_id":"1578","creator":"florida","date_updated":"2018-03-21T13:17:33Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"59-progress.pdf","date_created":"2018-03-21T13:17:33Z","access_level":"closed"}],"_id":"59","page":"123--132","type":"conference","citation":{"short":"P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.","apa":"Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132). https://doi.org/10.1145/3087556.3087578","ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578","bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }","mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578."},"year":"2017","title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"doi":"10.1145/3087556.3087578","date_updated":"2022-01-06T07:02:46Z","language":[{"iso":"eng"}]},{"page":"17 - 31","type":"conference","citation":{"mla":"Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.","bibtex":"@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={10.1007/978-3-319-71147-8_2}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }","chicago":"Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 17–31, 2017. https://doi.org/10.1007/978-3-319-71147-8_2.","ama":"Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2017:17-31. doi:10.1007/978-3-319-71147-8_2","apa":"Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2","ieee":"B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.","short":"B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31."},"year":"2017","language":[{"iso":"eng"}],"_id":"70","date_updated":"2022-01-06T07:03:26Z","doi":"10.1007/978-3-319-71147-8_2","publication":"Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T15:06:13Z","department":[{"_id":"63"}],"author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-11-02T15:06:13Z","content_type":"application/pdf","creator":"ups","file_id":"5293","file_size":287315,"access_level":"closed","date_created":"2018-11-02T15:06:13Z","file_name":"PriceFluctuationInOnlineLeasin.pdf"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:41:05Z","status":"public","has_accepted_license":"1","title":"Price Fluctuations in Online Leasing","ddc":["000"],"user_id":"477"},{"publisher":"Universität Paderborn","author":[{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"department":[{"_id":"63"}],"status":"public","date_created":"2017-11-14T14:13:21Z","related_material":{"link":[{"url":"https://doi.org/10.17619/UNIPB/1-230","relation":"confirmation"}]},"user_id":"15415","title":"Local Algorithms for the Continuous Gathering Problem","language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"citation":{"mla":"Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={10.17619/UNIPB/1-230}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }","apa":"Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230","ama":"Podlipyan P. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230","chicago":"Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230.","ieee":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017.","short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017."},"year":"2017","type":"dissertation","_id":"703","date_updated":"2022-01-06T07:03:26Z","doi":"10.17619/UNIPB/1-230"},{"department":[{"_id":"63"}],"file_date_updated":"2018-11-14T15:18:37Z","author":[{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"publisher":"Universität Paderborn","file":[{"access_level":"closed","file_name":"thesisStable.pdf","date_created":"2018-11-14T15:18:37Z","date_updated":"2018-11-14T15:18:37Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1491627,"creator":"feldi","file_id":"5673"}],"date_created":"2017-11-15T07:51:07Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"has_accepted_license":"1","status":"public","title":"Scheduling with Scarce Resources","ddc":["000"],"user_id":"14052","citation":{"ieee":"S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017.","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }","mla":"Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231.","chicago":"Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-231.","ama":"Riechers S. Scheduling with Scarce Resources. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-231","apa":"Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-231"},"type":"dissertation","year":"2017","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"_id":"704","date_updated":"2022-01-06T07:03:27Z","doi":"10.17619/UNIPB/1-231"},{"type":"journal_article","year":"2017","citation":{"mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194. doi:10.1007/s10878-017-0198-x","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1168–1194, 2017.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194."},"page":"1168-1194","intvolume":" 36","_id":"706","issue":"4","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"publisher":"Springer","publication":"Journal of Combinatorial Optimization","file_date_updated":"2018-03-14T12:21:34Z","file":[{"file_id":"1210","creator":"florida","file_size":608614,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-14T12:21:34Z","file_name":"706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf","date_created":"2018-03-14T12:21:34Z","access_level":"closed"}],"volume":36,"status":"public","has_accepted_license":"1","date_created":"2017-11-15T10:21:34Z","ddc":["040"],"user_id":"15415","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:27Z","doi":"10.1007/s10878-017-0198-x","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Cost-efficient Scheduling on Machines from the Cloud"},{"file":[{"relation":"main_file","success":1,"date_updated":"2018-11-02T14:50:35Z","content_type":"application/pdf","file_id":"5285","creator":"ups","file_size":433613,"access_level":"closed","file_name":"08054881.pdf","date_created":"2018-11-02T14:50:35Z"}],"file_date_updated":"2018-11-02T14:50:35Z","publication":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","keyword":["Software","Unified modeling language","Requirements engineering","Ontologies","Search problems","Natural languages"],"publisher":"IEEE","author":[{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"},{"last_name":"Bäumer","id":"38837","first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon"},{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"id":"42496","last_name":"Geierhos","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"id":"107","last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"}],"quality_controlled":"1","date_created":"2017-10-17T12:41:10Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets."}],"user_id":"57458","ddc":["000"],"page":"379-385","year":"2017","citation":{"bibtex":"@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }","mla":"van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.","apa":"van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., & Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26","ama":"van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26","chicago":"Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.","ieee":"L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.","short":"L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385."},"type":"conference","conference":{"end_date":"2017-09-08","start_date":"2017-09-04","name":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","location":"Lisbon, Portugal"},"_id":"97","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"34"},{"_id":"7"},{"_id":"66"},{"_id":"238"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"publication_status":"published","publication_identifier":{"eisbn":["978-1-5386-3488-2 "],"isbn":["978-1-5386-3489-9"]},"place":"Piscataway, NJ, USA","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:04:18Z","doi":"10.1109/REW.2017.26"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:56Z","doi":"10.1145/3087556.3087575","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"The Mobile Server Problem","page":"313-319","citation":{"mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server Problem}, DOI={10.1145/3087556.3087575}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2017}, pages={313–319} }","apa":"Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:313-319. doi:10.1145/3087556.3087575","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575.","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319."},"type":"conference","year":"2017","_id":"55","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T14:55:10Z","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"file":[{"creator":"ups","file_id":"5288","file_size":691691,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-02T14:55:10Z","file_name":"p313-feldkord.pdf","date_created":"2018-11-02T14:55:10Z","access_level":"closed"}],"date_created":"2017-10-17T12:41:02Z","status":"public","has_accepted_license":"1","abstract":[{"text":"We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence.","lang":"eng"}],"ddc":["000"],"user_id":"477"},{"abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"user_id":"14052","ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T16:58:42Z","creator":"feldi","file_id":"5228","file_size":346390,"access_level":"closed","date_created":"2018-10-31T16:58:42Z","file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf"}],"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"file_date_updated":"2018-10-31T16:58:42Z","publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:04Z","_id":"66","citation":{"ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15","apa":"Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15"},"type":"conference","year":"2017","page":"175--187","title":"Pure Nash Equilibria in Restricted Budget Games","department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-319-62389-4_15","series_title":"LNCS","language":[{"iso":"eng"}]},{"date_created":"2017-11-14T06:57:49Z","status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Nowack","first_name":"Joshua","full_name":"Nowack, Joshua"}],"publisher":"Universität Paderborn","user_id":"14052","title":"On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen","language":[{"iso":"ger"}],"citation":{"short":"J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen, Universität Paderborn, 2017.","ieee":"J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.","ama":"Nowack J. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn; 2017.","apa":"Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn.","chicago":"Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.","mla":"Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.","bibtex":"@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack, Joshua}, year={2017} }"},"type":"bachelorsthesis","year":"2017","_id":"695","date_updated":"2022-01-06T07:03:23Z"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}","citation":{"ieee":"J. Gausemeier et al., Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn, 2017.","short":"J. Gausemeier, E. Bodden, F. Dressler, R. Dumitrescu, F. Meyer auf der Heide, C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys), Paderborn, 2017.","bibtex":"@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}, author={Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}} }","mla":"Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017.","chicago":"Gausemeier, Jürgen, Eric Bodden, Falko Dressler, Roman Dumitrescu, Friedhelm Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn}. Paderborn, 2017.","ama":"Gausemeier J, Bodden E, Dressler F, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn; 2017.","apa":"Gausemeier, J., Bodden, E., Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., & Trächtler, A. (2017). Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn."},"type":"book","year":"2017","page":"369","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16444","author":[{"full_name":"Gausemeier, Jürgen","first_name":"Jürgen","last_name":"Gausemeier"},{"last_name":"Bodden","first_name":"Eric","full_name":"Bodden, Eric"},{"full_name":" Dressler, Falko","first_name":"Falko","last_name":" Dressler"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christoph","full_name":"Scheytt, Christoph","last_name":"Scheytt"},{"last_name":"Trächtler","full_name":"Trächtler, Ansgar","first_name":"Ansgar"}],"department":[{"_id":"63"}],"publication_status":"published","status":"public","date_created":"2020-04-07T06:36:06Z","place":"Paderborn","title":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)","user_id":"15415"},{"publication":"Structural Information and Communication Complexity","department":[{"_id":"63"}],"author":[{"full_name":"Bemmann, Pascal","first_name":"Pascal","last_name":"Bemmann"},{"last_name":"Biermeier","first_name":"Felix","full_name":"Biermeier, Felix"},{"first_name":"Jan","full_name":"Bürmann, Jan","last_name":"Bürmann"},{"last_name":"Kemper","first_name":"Arne","full_name":"Kemper, Arne"},{"last_name":"Knollmann","id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till"},{"full_name":"Knorr, Steffen","first_name":"Steffen","last_name":"Knorr"},{"first_name":"Nils","full_name":"Kothe, Nils","last_name":"Kothe"},{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker","id":"13536"},{"last_name":"Malatyali","id":"41265","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"id":"30291","last_name":"Schaefer","full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian"},{"first_name":"Jannik","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","id":"38705"}],"publication_identifier":{"isbn":["9783319720494","9783319720500"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2020-04-08T07:20:20Z","status":"public","external_id":{"arxiv":["arXiv:1706.03568 "]},"place":"Cham","title":"Monitoring of Domain-Related Problems in Distributed Data Streams","user_id":"15415","citation":{"ama":"Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: Structural Information and Communication Complexity. ; 2017. doi:10.1007/978-3-319-72050-0_13","apa":"Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity. https://doi.org/10.1007/978-3-319-72050-0_13","chicago":"Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In Structural Information and Communication Complexity. Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13.","mla":"Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13.","bibtex":"@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }","short":"P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.","ieee":"P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed Data Streams,” in Structural Information and Communication Complexity, Cham, 2017."},"type":"book_chapter","year":"2017","language":[{"iso":"eng"}],"_id":"16461","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-319-72050-0_13"},{"user_id":"14052","title":"Sortieren dynamischer Daten","author":[{"last_name":"Nachtigall","full_name":"Nachtigall, Simon","first_name":"Simon"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"status":"public","date_created":"2017-12-19T09:59:32Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_updated":"2022-01-06T06:50:50Z","_id":"1073","supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"language":[{"iso":"ger"}],"citation":{"ieee":"S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017.","short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","mla":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }","apa":"Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.","ama":"Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.","chicago":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017."},"type":"bachelorsthesis","year":"2017"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2017-12-19T10:00:25Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"}],"user_id":"14052","title":"Robuste Optimierung in Congestion Games","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"language":[{"iso":"ger"}],"year":"2017","type":"bachelorsthesis","citation":{"mla":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }","chicago":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","apa":"Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.","ama":"Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.","ieee":"S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017."},"date_updated":"2022-01-06T06:50:50Z","_id":"1074"},{"year":"2017","type":"mastersthesis","citation":{"ama":"Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.","apa":"Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn.","chicago":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","mla":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017.","ieee":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017."},"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:50:50Z","_id":"1080","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2017-12-19T10:07:35Z","author":[{"full_name":"Bürmann, Jan","first_name":"Jan","last_name":"Bürmann"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"title":"Complexity of Signalling in Routing Games under Uncertainty","user_id":"14052"},{"date_updated":"2022-01-06T06:50:51Z","_id":"1081","year":"2017","citation":{"short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","ieee":"V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","ama":"Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.","apa":"Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.","mla":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","bibtex":"@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }"},"type":"mastersthesis","supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","user_id":"14052","status":"public","date_created":"2017-12-19T10:08:44Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"author":[{"last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}]},{"file":[{"content_type":"application/pdf","date_updated":"2018-10-31T17:01:09Z","success":1,"relation":"main_file","file_size":1576363,"creator":"feldi","file_id":"5230","access_level":"closed","file_name":"Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf","date_created":"2018-10-31T17:01:09Z"}],"author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"last_name":"John","id":"3952","first_name":"Thomas","full_name":"John, Thomas"},{"last_name":"Kundisch","id":"21117","first_name":"Dennis","full_name":"Kundisch, Dennis"},{"last_name":"Hemsen","id":"22546","first_name":"Paul","full_name":"Hemsen, Paul"},{"full_name":"Klingsieck, Katrin","first_name":"Katrin","last_name":"Klingsieck"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"file_date_updated":"2018-10-31T17:01:09Z","publication":"Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","has_accepted_license":"1","status":"public","date_created":"2018-01-05T08:37:52Z","abstract":[{"lang":"eng","text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a \"lean\" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification."}],"user_id":"14052","ddc":["000"],"year":"2017","type":"conference","citation":{"short":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","ieee":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","apa":"Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32","ama":"Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST). LNCS. ; 2017:462-467. doi:10.1007/978-3-319-59144-5_32","chicago":"Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.","mla":"Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.","bibtex":"@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017, series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}, DOI={10.1007/978-3-319-59144-5_32}, booktitle={Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }"},"page":"462-467","_id":"1094","department":[{"_id":"63"},{"_id":"541"},{"_id":"276"}],"title":"Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:53Z","doi":"10.1007/978-3-319-59144-5_32"},{"title":"Towards a Lean Approach for Gamifying Education","department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}],"oa":"1","date_updated":"2022-01-06T06:50:53Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"14052","abstract":[{"lang":"eng","text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. "}],"has_accepted_license":"1","status":"public","date_created":"2018-01-05T08:39:41Z","author":[{"first_name":"Thomas","full_name":"John, Thomas","last_name":"John","id":"3952"},{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"id":"22546","last_name":"Hemsen","full_name":"Hemsen, Paul","first_name":"Paul"},{"full_name":"Klingsieck, Katrin","first_name":"Katrin","last_name":"Klingsieck"},{"id":"21117","last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"last_name":"Langendorf","first_name":"Mike","full_name":"Langendorf, Mike"}],"publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","file_date_updated":"2018-10-31T17:02:07Z","file":[{"access_level":"closed","date_created":"2018-10-31T17:02:07Z","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf","date_updated":"2018-10-31T17:02:07Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":485333,"creator":"feldi","file_id":"5232"}],"_id":"1095","year":"2017","citation":{"ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","short":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79.","bibtex":"@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: Proceedings of the 25th European Conference on Information Systems (ECIS). ; 2017:2970-2979.","apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., & Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In Proceedings of the 25th European Conference on Information Systems (ECIS), 2970–79, 2017."},"type":"conference","page":"2970-2979","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2017_rip/46","open_access":"1"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:55Z","doi":"10.1016/j.tcs.2017.03.021","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"title":"Continuous Speed Scaling with Variability: A Simple and Direct Approach","page":"1-13","citation":{"ieee":"A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” Theoretical Computer Science, pp. 1–13, 2017.","short":"A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science (2017) 1–13.","bibtex":"@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling with Variability: A Simple and Direct Approach}, DOI={10.1016/j.tcs.2017.03.021}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017}, pages={1–13} }","mla":"Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, Elsevier, 2017, pp. 1–13, doi:10.1016/j.tcs.2017.03.021.","chicago":"Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, 2017, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021.","ama":"Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science. 2017:1-13. doi:10.1016/j.tcs.2017.03.021","apa":"Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021"},"type":"journal_article","year":"2017","_id":"110","publication":"Theoretical Computer Science","file_date_updated":"2018-03-21T13:07:43Z","author":[{"last_name":"Antoniadis","first_name":"Antonios","full_name":"Antoniadis, Antonios"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"last_name":"Ott","first_name":"Sebastian","full_name":"Ott, Sebastian"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"}],"publisher":"Elsevier","file":[{"file_id":"1567","creator":"florida","file_size":494600,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-21T13:07:43Z","date_created":"2018-03-21T13:07:43Z","file_name":"110-TCSSubmission.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:13Z","has_accepted_license":"1","status":"public","abstract":[{"text":"We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof.","lang":"eng"}],"ddc":["040"],"user_id":"477"},{"status":"public","date_created":"2020-03-24T08:36:05Z","volume":1,"author":[{"orcid":"https://orcid.org/0000-0003-3546-203X","full_name":"Brandt, Sascha","first_name":"Sascha","id":"11648","last_name":"Brandt"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"last_name":"Gerges","full_name":"Gerges, Maria","first_name":"Maria"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"last_name":"Berssenbrügge","first_name":"Jan","full_name":"Berssenbrügge, Jan"}],"publication":"Volume 1: 37th Computers and Information in Engineering Conference","user_id":"15415","abstract":[{"text":"To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system’s virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Brandt_Fischer_Gerges_Jähn_Berssenbrügge_2017, title={Automatic Derivation of Geometric Properties of Components From 3D Polygon Models}, volume={1}, DOI={10.1115/detc2017-67528}, booktitle={Volume 1: 37th Computers and Information in Engineering Conference}, author={Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }","mla":"Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” Volume 1: 37th Computers and Information in Engineering Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.","ama":"Brandt S, Fischer M, Gerges M, Jähn C, Berssenbrügge J. Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In: Volume 1: 37th Computers and Information in Engineering Conference. Vol 1. ; 2017:91:1-91:10. doi:10.1115/detc2017-67528","apa":"Brandt, S., Fischer, M., Gerges, M., Jähn, C., & Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA. https://doi.org/10.1115/detc2017-67528","chicago":"Brandt, Sascha, Matthias Fischer, Maria Gerges, Claudius Jähn, and Jan Berssenbrügge. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” In Volume 1: 37th Computers and Information in Engineering Conference, 1:91:1-91:10, 2017. https://doi.org/10.1115/detc2017-67528.","ieee":"S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.","short":"S. Brandt, M. Fischer, M. Gerges, C. Jähn, J. Berssenbrügge, in: Volume 1: 37th Computers and Information in Engineering Conference, 2017, pp. 91:1-91:10."},"year":"2017","type":"conference","page":"91:1-91:10","_id":"16338","intvolume":" 1","conference":{"start_date":"2017-08-06","name":"37th Computers and Information in Engineering Conference","location":"Cleveland, USA","end_date":"2017-08-09"},"publication_identifier":{"isbn":["9780791858110"]},"publication_status":"published","department":[{"_id":"63"}],"title":"Automatic Derivation of Geometric Properties of Components From 3D Polygon Models","language":[{"iso":"eng"}],"doi":"10.1115/detc2017-67528","date_updated":"2022-01-06T06:52:49Z"},{"date_updated":"2022-01-06T06:52:49Z","language":[{"iso":"ger"}],"title":"Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell","place":"Paderborn","publication_status":"published","department":[{"_id":"63"}],"_id":"16339","intvolume":" 369","conference":{"end_date":"2017-05-12","name":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017","start_date":"2017-05-11","location":"Paderborn"},"citation":{"apa":"Brandt, S., & Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Brandt S, Fischer M. Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2017:415-427.","chicago":"Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, 369:415–27. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017.","mla":"Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 415–27.","bibtex":"@inproceedings{Brandt_Fischer_2017, place={Paderborn}, title={Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}, volume={369}, booktitle={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Brandt, Sascha and Fischer, Matthias}, year={2017}, pages={415–427} }","short":"S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.","ieee":"S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427."},"type":"conference","year":"2017","page":"415-427","user_id":"11648","abstract":[{"text":"In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren.","lang":"ger"}],"volume":369,"status":"public","date_created":"2020-03-24T08:44:25Z","author":[{"first_name":"Sascha","full_name":"Brandt, Sascha","orcid":"https://orcid.org/0000-0003-3546-203X","last_name":"Brandt","id":"11648"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publication":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017"},{"place":"Vienna, Austria","title":"Gathering Anonymous, Oblivious Robots on a Grid","department":[{"_id":"63"}],"editor":[{"full_name":"Fernández Anta, Antonio","first_name":"Antonio","last_name":"Fernández Anta"},{"last_name":"Jurdzinski","first_name":"Tomasz","full_name":"Jurdzinski, Tomasz"},{"full_name":"Mosteiro, Miguel A.","first_name":"Miguel A.","last_name":"Mosteiro"},{"first_name":"Yanyong","full_name":"Zhang, Yanyong","last_name":"Zhang"}],"date_updated":"2022-01-06T06:52:49Z","doi":"10.1007/978-3-319-72751-6_13","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"15415","publication":"Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}","author":[{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publisher":"Springer","volume":10718,"date_created":"2020-03-27T14:32:39Z","status":"public","intvolume":" 10718","_id":"16347","page":"168-181","type":"conference","year":"2017","citation":{"mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.","bibtex":"@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria}, series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A. and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture Notes in Computer Science} }","apa":"Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13","ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.","ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski, M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, Springer, Vienna, Austria, 2017, pp. 168–181."}},{"language":[{"iso":"eng"}],"page":"285 - 300","type":"conference","citation":{"ieee":"F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, pp. 285–300.","short":"F. Biermeier, B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300.","mla":"Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.","bibtex":"@inproceedings{Biermeier_Feldkord_Malatyali_Meyer auf der Heide_2017, title={A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-89441-6_21}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Biermeier, Felix and Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2017}, pages={285–300} }","ama":"Biermeier F, Feldkord B, Malatyali M, Meyer auf der Heide F. A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2017:285-300. doi:10.1007/978-3-319-89441-6_21","apa":"Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21","chicago":"Biermeier, Felix, Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 285–300. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6_21."},"year":"2017","_id":"16348","date_updated":"2022-01-06T06:52:49Z","doi":"10.1007/978-3-319-89441-6_21","department":[{"_id":"63"}],"publication":"Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)","author":[{"last_name":"Biermeier","first_name":"Felix","full_name":"Biermeier, Felix"},{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Springer","date_created":"2020-03-30T09:25:18Z","status":"public","user_id":"15415","title":"A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries"},{"user_id":"15415","title":"A Continuous Strategy for Collisionless Gathering","date_created":"2020-03-30T09:43:05Z","status":"public","publication":"Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)","department":[{"_id":"63"}],"author":[{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"},{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"doi":"10.1007/978-3-319-72751-6_14 ","date_updated":"2022-01-06T06:52:49Z","_id":"16349","language":[{"iso":"eng"}],"page":"182-197","citation":{"ieee":"P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous Strategy for Collisionless Gathering,” in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.","short":"P. Podlipyan, S. Li, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.","bibtex":"@inproceedings{Podlipyan_Li_Markarian_Meyer auf der Heide_2017, title={A Continuous Strategy for Collisionless Gathering}, DOI={10.1007/978-3-319-72751-6_14 }, booktitle={Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)}, author={Podlipyan, Pavel and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={182–197} }","mla":"Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.” Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .","chicago":"Podlipyan, Pavel, Shouwei Li, Christine Markarian, and Friedhelm Meyer auf der Heide. “A Continuous Strategy for Collisionless Gathering.” In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 182–97, 2017. https://doi.org/10.1007/978-3-319-72751-6_14 .","ama":"Podlipyan P, Li S, Markarian C, Meyer auf der Heide F. A Continuous Strategy for Collisionless Gathering. In: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS). ; 2017:182-197. doi:10.1007/978-3-319-72751-6_14 ","apa":"Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14 "},"type":"conference","year":"2017"},{"language":[{"iso":"eng"}],"year":"2016","citation":{"ieee":"M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.","short":"M. Wahby, D.N. Hofstadler, M.K. Heinrich, P. Zahadat, H. Hamann, in: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.","mla":"Wahby, Mostafa, et al. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016, doi:10.1109/saso.2016.8.","bibtex":"@inproceedings{Wahby_Hofstadler_Heinrich_Zahadat_Hamann_2016, title={An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap}, DOI={10.1109/saso.2016.8}, booktitle={Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems}, author={Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich, Mary Katherine and Zahadat, Payam and Hamann, Heiko}, year={2016} }","chicago":"Wahby, Mostafa, Daniel Nicolas Hofstadler, Mary Katherine Heinrich, Payam Zahadat, and Heiko Hamann. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016. https://doi.org/10.1109/saso.2016.8.","apa":"Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., & Hamann, H. (2016). An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. https://doi.org/10.1109/saso.2016.8","ama":"Wahby M, Hofstadler DN, Heinrich MK, Zahadat P, Hamann H. An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. ; 2016. doi:10.1109/saso.2016.8"},"type":"conference","date_updated":"2022-01-06T06:54:17Z","_id":"19961","doi":"10.1109/saso.2016.8","publication":"Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"},{"full_name":"Hofstadler, Daniel Nicolas","first_name":"Daniel Nicolas","last_name":"Hofstadler"},{"first_name":"Mary Katherine","full_name":"Heinrich, Mary Katherine","last_name":"Heinrich"},{"full_name":"Zahadat, Payam","first_name":"Payam","last_name":"Zahadat"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"date_created":"2020-10-08T12:57:13Z","status":"public","publication_identifier":{"isbn":["9781509035342"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach."}],"user_id":"15415","title":"An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap"},{"author":[{"first_name":"Mary Katherine","full_name":"Heinrich, Mary Katherine","last_name":"Heinrich"},{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"},{"first_name":"Mohammad","full_name":"Divband Soorati, Mohammad","last_name":"Divband Soorati"},{"last_name":"Hofstadler","first_name":"Daniel Nicolas","full_name":"Hofstadler, Daniel Nicolas"},{"last_name":"Zahadat","first_name":"Payam","full_name":"Zahadat, Payam"},{"full_name":"Ayres, Phil","first_name":"Phil","last_name":"Ayres"},{"full_name":"Stoy, Kasper","first_name":"Kasper","last_name":"Stoy"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"publication":"Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)","department":[{"_id":"63"},{"_id":"238"}],"publication_identifier":{"isbn":["9781509036516"]},"publication_status":"published","status":"public","date_created":"2020-10-09T13:57:21Z","title":"Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures","user_id":"15415","year":"2016","citation":{"ieee":"M. K. Heinrich et al., “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures,” in Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.","short":"M.K. Heinrich, M. Wahby, M. Divband Soorati, D.N. Hofstadler, P. Zahadat, P. Ayres, K. Stoy, H. Hamann, in: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.","bibtex":"@inproceedings{Heinrich_Wahby_Divband Soorati_Hofstadler_Zahadat_Ayres_Stoy_Hamann_2016, title={Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures}, DOI={10.1109/fas-w.2016.43}, booktitle={Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)}, author={Heinrich, Mary Katherine and Wahby, Mostafa and Divband Soorati, Mohammad and Hofstadler, Daniel Nicolas and Zahadat, Payam and Ayres, Phil and Stoy, Kasper and Hamann, Heiko}, year={2016} }","mla":"Heinrich, Mary Katherine, et al. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016, doi:10.1109/fas-w.2016.43.","apa":"Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat, P., Ayres, P., … Hamann, H. (2016). Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). https://doi.org/10.1109/fas-w.2016.43","ama":"Heinrich MK, Wahby M, Divband Soorati M, et al. Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). ; 2016. doi:10.1109/fas-w.2016.43","chicago":"Heinrich, Mary Katherine, Mostafa Wahby, Mohammad Divband Soorati, Daniel Nicolas Hofstadler, Payam Zahadat, Phil Ayres, Kasper Stoy, and Heiko Hamann. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016. https://doi.org/10.1109/fas-w.2016.43."},"type":"conference","language":[{"iso":"eng"}],"_id":"19968","date_updated":"2022-01-06T06:54:17Z","doi":"10.1109/fas-w.2016.43"},{"publication_status":"published","publication_identifier":{"issn":["2296-9144"]},"status":"public","date_created":"2020-10-09T14:04:05Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Khaluf, Yara","first_name":"Yara","last_name":"Khaluf"},{"last_name":"Botev","full_name":"Botev, Jean","first_name":"Jean"},{"full_name":"Divband Soorati, Mohammad","first_name":"Mohammad","last_name":"Divband Soorati"},{"last_name":"Ferrante","full_name":"Ferrante, Eliseo","first_name":"Eliseo"},{"last_name":"Kosak","full_name":"Kosak, Oliver","first_name":"Oliver"},{"last_name":"Montanier","full_name":"Montanier, Jean-Marc","first_name":"Jean-Marc"},{"first_name":"Sanaz","full_name":"Mostaghim, Sanaz","last_name":"Mostaghim"},{"last_name":"Redpath","full_name":"Redpath, Richard","first_name":"Richard"},{"first_name":"Jon","full_name":"Timmis, Jon","last_name":"Timmis"},{"full_name":"Veenstra, Frank","first_name":"Frank","last_name":"Veenstra"},{"last_name":"Wahby","full_name":"Wahby, Mostafa","first_name":"Mostafa"},{"last_name":"Zamuda","full_name":"Zamuda, Aleš","first_name":"Aleš"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Frontiers in Robotics and AI","title":"Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems","user_id":"15415","citation":{"ieee":"H. Hamann et al., “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems,” Frontiers in Robotics and AI, 2016.","short":"H. Hamann, Y. Khaluf, J. Botev, M. Divband Soorati, E. Ferrante, O. Kosak, J.-M. Montanier, S. Mostaghim, R. Redpath, J. Timmis, F. Veenstra, M. Wahby, A. Zamuda, Frontiers in Robotics and AI (2016).","mla":"Hamann, Heiko, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016, doi:10.3389/frobt.2016.00014.","bibtex":"@article{Hamann_Khaluf_Botev_Divband Soorati_Ferrante_Kosak_Montanier_Mostaghim_Redpath_Timmis_et al._2016, title={Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems}, DOI={10.3389/frobt.2016.00014}, journal={Frontiers in Robotics and AI}, author={Hamann, Heiko and Khaluf, Yara and Botev, Jean and Divband Soorati, Mohammad and Ferrante, Eliseo and Kosak, Oliver and Montanier, Jean-Marc and Mostaghim, Sanaz and Redpath, Richard and Timmis, Jon and et al.}, year={2016} }","apa":"Hamann, H., Khaluf, Y., Botev, J., Divband Soorati, M., Ferrante, E., Kosak, O., … Zamuda, A. (2016). Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. https://doi.org/10.3389/frobt.2016.00014","ama":"Hamann H, Khaluf Y, Botev J, et al. Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. 2016. doi:10.3389/frobt.2016.00014","chicago":"Hamann, Heiko, Yara Khaluf, Jean Botev, Mohammad Divband Soorati, Eliseo Ferrante, Oliver Kosak, Jean-Marc Montanier, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016. https://doi.org/10.3389/frobt.2016.00014."},"year":"2016","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.3389/frobt.2016.00014","_id":"19969","date_updated":"2022-01-06T06:54:17Z"},{"_id":"19979","date_updated":"2022-01-06T06:54:17Z","doi":"10.1109/IROS.2016.7759845","language":[{"iso":"eng"}],"type":"conference","citation":{"bibtex":"@inproceedings{Hamann_Divband Soorati_2016, title={Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures}, DOI={10.1109/IROS.2016.7759845}, booktitle={IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2016} }","mla":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016, doi:10.1109/IROS.2016.7759845.","chicago":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016. https://doi.org/10.1109/IROS.2016.7759845.","ama":"Hamann H, Divband Soorati M. Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). ; 2016. doi:10.1109/IROS.2016.7759845","apa":"Hamann, H., & Divband Soorati, M. (2016). Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). https://doi.org/10.1109/IROS.2016.7759845","ieee":"H. Hamann and M. Divband Soorati, “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.","short":"H. Hamann, M. Divband Soorati, in: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016."},"year":"2016","user_id":"15415","title":"Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Divband Soorati","full_name":"Divband Soorati, Mohammad","first_name":"Mohammad"}],"publication":"IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-12T13:06:07Z"},{"volume":30,"status":"public","date_created":"2020-10-13T08:33:37Z","author":[{"last_name":"Dorigo","full_name":"Dorigo, Marco","first_name":"Marco"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"},{"first_name":"Eliseo","full_name":"Ferrante, Eliseo","last_name":"Ferrante"}],"publication":"Journal of Autonomous Agents and Multi-Agent Systems","department":[{"_id":"63"},{"_id":"238"}],"title":"Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems","user_id":"15415","type":"journal_article","citation":{"mla":"Dorigo, Marco, et al. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, 2016, pp. 553–80, doi:10.1007/s10458-015-9323-3.","bibtex":"@article{Dorigo_Hamann_Valentini_Ferrante_2016, title={Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems}, volume={30}, DOI={10.1007/s10458-015-9323-3}, number={3}, journal={Journal of Autonomous Agents and Multi-Agent Systems}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Ferrante, Eliseo}, year={2016}, pages={553–580} }","chicago":"Dorigo, Marco, Heiko Hamann, Gabriele Valentini, and Eliseo Ferrante. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems 30, no. 3 (2016): 553–80. https://doi.org/10.1007/s10458-015-9323-3.","apa":"Dorigo, M., Hamann, H., Valentini, G., & Ferrante, E. (2016). Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems, 30(3), 553–580. https://doi.org/10.1007/s10458-015-9323-3","ama":"Dorigo M, Hamann H, Valentini G, Ferrante E. Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems. 2016;30(3):553-580. doi:10.1007/s10458-015-9323-3","ieee":"M. Dorigo, H. Hamann, G. Valentini, and E. Ferrante, “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems,” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, pp. 553–580, 2016.","short":"M. Dorigo, H. Hamann, G. Valentini, E. Ferrante, Journal of Autonomous Agents and Multi-Agent Systems 30 (2016) 553–580."},"year":"2016","page":"553-580","language":[{"iso":"eng"}],"doi":"10.1007/s10458-015-9323-3","issue":"3","date_updated":"2022-01-06T06:54:17Z","_id":"19983","intvolume":" 30"},{"file":[{"content_type":"application/pdf","date_updated":"2018-03-21T10:45:57Z","success":1,"relation":"main_file","file_size":880390,"file_id":"1525","creator":"florida","access_level":"closed","date_created":"2018-03-21T10:45:57Z","file_name":"200-thesis.pdf"}],"file_date_updated":"2018-03-21T10:45:57Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:31Z","status":"public","has_accepted_license":"1","user_id":"15415","ddc":["040"],"supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"type":"dissertation","citation":{"short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016.","ieee":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","chicago":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","ama":"Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.","apa":"Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.","mla":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","bibtex":"@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }"},"year":"2016","_id":"200","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"related_material":{"link":[{"relation":"confirmation","url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915"}]},"title":"Existence and Properties of Pure Nash Equilibria in Budget Games","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:18Z"},{"language":[{"iso":"eng"}],"year":"2016","citation":{"chicago":"Hamann, Heiko, Gabriele Valentini, and Marco Dorigo. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham, 2016. https://doi.org/10.1007/978-3-319-44427-7_15.","apa":"Hamann, H., Valentini, G., & Dorigo, M. (2016). Population Coding: A New Design Paradigm for Embodied Distributed Systems. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham. https://doi.org/10.1007/978-3-319-44427-7_15","ama":"Hamann H, Valentini G, Dorigo M. Population Coding: A New Design Paradigm for Embodied Distributed Systems. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham; 2016. doi:10.1007/978-3-319-44427-7_15","mla":"Hamann, Heiko, et al. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_15.","bibtex":"@inproceedings{Hamann_Valentini_Dorigo_2016, place={Cham}, title={Population Coding: A New Design Paradigm for Embodied Distributed Systems}, DOI={10.1007/978-3-319-44427-7_15}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Hamann, Heiko and Valentini, Gabriele and Dorigo, Marco}, year={2016} }","short":"H. Hamann, G. Valentini, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, Cham, 2016.","ieee":"H. Hamann, G. Valentini, and M. Dorigo, “Population Coding: A New Design Paradigm for Embodied Distributed Systems,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016."},"type":"conference","date_updated":"2022-01-06T06:54:18Z","_id":"20000","doi":"10.1007/978-3-319-44427-7_15","department":[{"_id":"63"},{"_id":"238"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"},{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"}],"date_created":"2020-10-15T09:55:35Z","status":"public","publication_identifier":{"isbn":["9783319444260","9783319444277"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Cham","user_id":"15415","title":"Population Coding: A New Design Paradigm for Embodied Distributed Systems"},{"title":"Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems","user_id":"15415","publication":"ACM Symposium on Virtual Reality Software and Technology (VRST)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"von Mammen","full_name":"von Mammen, Sebastian","first_name":"Sebastian"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Heider","first_name":"Michael","full_name":"Heider, Michael"}],"publication_identifier":{"isbn":["9781450344913"]},"publication_status":"published","date_created":"2020-10-15T10:00:23Z","status":"public","date_updated":"2022-01-06T06:54:18Z","_id":"20001","doi":"10.1145/2993369.2993400","type":"conference","citation":{"ama":"von Mammen S, Hamann H, Heider M. Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In: ACM Symposium on Virtual Reality Software and Technology (VRST). ; 2016. doi:10.1145/2993369.2993400","apa":"von Mammen, S., Hamann, H., & Heider, M. (2016). Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In ACM Symposium on Virtual Reality Software and Technology (VRST). https://doi.org/10.1145/2993369.2993400","chicago":"Mammen, Sebastian von, Heiko Hamann, and Michael Heider. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” In ACM Symposium on Virtual Reality Software and Technology (VRST), 2016. https://doi.org/10.1145/2993369.2993400.","bibtex":"@inproceedings{von Mammen_Hamann_Heider_2016, title={Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems}, DOI={10.1145/2993369.2993400}, booktitle={ACM Symposium on Virtual Reality Software and Technology (VRST)}, author={von Mammen, Sebastian and Hamann, Heiko and Heider, Michael}, year={2016} }","mla":"von Mammen, Sebastian, et al. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” ACM Symposium on Virtual Reality Software and Technology (VRST), 2016, doi:10.1145/2993369.2993400.","short":"S. von Mammen, H. Hamann, M. Heider, in: ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.","ieee":"S. von Mammen, H. Hamann, and M. Heider, “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems,” in ACM Symposium on Virtual Reality Software and Technology (VRST), 2016."},"year":"2016","language":[{"iso":"eng"}]},{"_id":"20002","date_updated":"2022-01-06T06:54:18Z","doi":"10.1145/2908812.2908815","citation":{"short":"M. Rybář, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.","ieee":"M. Rybář and H. Hamann, “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.","chicago":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016. https://doi.org/10.1145/2908812.2908815.","apa":"Rybář, M., & Hamann, H. (2016). Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). https://doi.org/10.1145/2908812.2908815","ama":"Rybář M, Hamann H. Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). ; 2016. doi:10.1145/2908812.2908815","mla":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016, doi:10.1145/2908812.2908815.","bibtex":"@inproceedings{Rybář_Hamann_2016, title={Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes}, DOI={10.1145/2908812.2908815}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)}, author={Rybář, Milan and Hamann, Heiko}, year={2016} }"},"year":"2016","type":"conference","language":[{"iso":"eng"}],"title":"Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)","author":[{"full_name":"Rybář, Milan","first_name":"Milan","last_name":"Rybář"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"publication_status":"published","publication_identifier":{"isbn":["9781450342063"]},"date_created":"2020-10-15T10:05:11Z","status":"public"},{"_id":"20003","date_updated":"2022-01-06T06:54:18Z","intvolume":" 9882","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Khaluf_Hamann_2016, title={On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations}, volume={9882}, booktitle={ANTS 2016}, author={Khaluf, Yara and Hamann, Heiko}, year={2016}, pages={298} }","mla":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” ANTS 2016, vol. 9882, 2016, p. 298.","ama":"Khaluf Y, Hamann H. On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In: ANTS 2016. Vol 9882. ; 2016:298.","apa":"Khaluf, Y., & Hamann, H. (2016). On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In ANTS 2016 (Vol. 9882, p. 298).","chicago":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” In ANTS 2016, 9882:298, 2016.","ieee":"Y. Khaluf and H. Hamann, “On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations,” in ANTS 2016, 2016, vol. 9882, p. 298.","short":"Y. Khaluf, H. Hamann, in: ANTS 2016, 2016, p. 298."},"year":"2016","type":"conference","page":"298","user_id":"15415","title":"On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations","status":"public","date_created":"2020-10-15T10:16:39Z","volume":9882,"author":[{"first_name":"Yara","full_name":"Khaluf, Yara","last_name":"Khaluf"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"ANTS 2016"},{"status":"public","date_created":"2020-10-15T10:22:20Z","publication_identifier":{"isbn":["9783319444260","9783319444277"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"},{"first_name":"Davide","full_name":"Brambilla, Davide","last_name":"Brambilla"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","title":"Collective Perception of Environmental Features in a Robot Swarm","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Valentini_Brambilla_Hamann_Dorigo_2016, title={Collective Perception of Environmental Features in a Robot Swarm}, DOI={10.1007/978-3-319-44427-7_6}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Valentini, Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco}, year={2016} }","mla":"Valentini, Gabriele, et al. “Collective Perception of Environmental Features in a Robot Swarm.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_6.","apa":"Valentini, G., Brambilla, D., Hamann, H., & Dorigo, M. (2016). Collective Perception of Environmental Features in a Robot Swarm. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. https://doi.org/10.1007/978-3-319-44427-7_6","ama":"Valentini G, Brambilla D, Hamann H, Dorigo M. Collective Perception of Environmental Features in a Robot Swarm. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. ; 2016. doi:10.1007/978-3-319-44427-7_6","chicago":"Valentini, Gabriele, Davide Brambilla, Heiko Hamann, and Marco Dorigo. “Collective Perception of Environmental Features in a Robot Swarm.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016. https://doi.org/10.1007/978-3-319-44427-7_6.","ieee":"G. Valentini, D. Brambilla, H. Hamann, and M. Dorigo, “Collective Perception of Environmental Features in a Robot Swarm,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.","short":"G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016."},"year":"2016","type":"conference","doi":"10.1007/978-3-319-44427-7_6","date_updated":"2022-01-06T06:54:18Z","_id":"20004"},{"_id":"210","date_updated":"2022-01-06T06:54:42Z","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"type":"mastersthesis","year":"2016","citation":{"mla":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","apa":"Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn.","ama":"Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.","chicago":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","ieee":"L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016."},"user_id":"14052","title":"Congestion Games with Mixed Objectives","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:41:33Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"author":[{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"}],"publisher":"Universität Paderborn"}]