[{"department":[{"_id":"63"},{"_id":"79"}],"type":"conference","keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"date_created":"2018-09-17T13:12:18Z","file":[{"creator":"ups","date_created":"2018-11-02T14:38:37Z","access_level":"closed","file_size":500005,"file_name":"ASelf-stabilizingHashedPatrici.pdf","date_updated":"2018-11-02T14:38:37Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5277"}],"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","doi":"10.1007/978-3-030-03232-6_1","language":[{"iso":"eng"}],"series_title":"Lecture Notes of Computer Science","intvolume":"     11201","date_updated":"2022-01-06T07:01:02Z","author":[{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","id":"39241"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"A Self-Stabilizing Hashed Patricia Trie","year":"2018","external_id":{"arxiv":["1809.04923"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, 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} }","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","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."},"file_date_updated":"2018-11-02T14:38:37Z","editor":[{"full_name":"Izumi, Taisuke","last_name":"Izumi","first_name":"Taisuke"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}],"volume":11201,"ddc":["000"],"user_id":"39241","_id":"4411","publisher":"Springer, Cham","has_accepted_license":"1","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)"},"status":"public"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:11Z","author":[{"last_name":"Jung","first_name":"Daniel","full_name":"Jung, Daniel","id":"37827"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina","id":"43647"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"last_name":"Sundermeier","first_name":"Jannik","full_name":"Sundermeier, Jannik","id":"38705"}],"title":"Competitive Routing in Hybrid Communication Networks","year":"2018","department":[{"_id":"63"},{"_id":"79"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"type":"conference","date_created":"2018-10-02T07:06:05Z","file":[{"file_id":"6621","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf","access_level":"closed","file_size":349034,"date_created":"2019-01-11T10:32:38Z","creator":"ups"}],"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"}],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","ddc":["000"],"user_id":"38705","_id":"4563","publisher":"Springer","has_accepted_license":"1","conference":{"location":"Helsinki","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","start_date":"2018-08-23","end_date":"2018-08-24"},"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, 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} }","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 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."},"file_date_updated":"2019-01-11T10:32:38Z"},{"year":"2018","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","author":[{"id":"37827","first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel"},{"id":"43647","full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Sundermeier, Jannik","last_name":"Sundermeier","first_name":"Jannik","id":"38705"}],"publication_identifier":{"isbn":["9781450357999"]},"date_updated":"2022-01-06T07:01:12Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210663","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"file_id":"5254","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-02T13:48:10Z","file_name":"p231-jung-1.pdf","access_level":"closed","file_size":1025077,"date_created":"2018-11-02T13:48:10Z","creator":"ups"}],"date_created":"2018-10-02T07:34:47Z","type":"conference","department":[{"_id":"63"},{"_id":"79"}],"status":"public","conference":{"start_date":"2018-07-17","name":"SPAA'18","location":"Wien","end_date":"2018-07-18"},"has_accepted_license":"1","publisher":"ACM Press","_id":"4565","ddc":["000"],"user_id":"38705","file_date_updated":"2018-11-02T13:48:10Z","citation":{"mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, 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} }","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","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."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"department":[{"_id":"63"}],"type":"conference","date_created":"2019-02-06T14:16:19Z","file":[{"creator":"jschaef","date_created":"2019-02-06T14:18:35Z","relation":"main_file","date_updated":"2019-02-06T14:18:35Z","file_name":"p359-meyer-auf-der-heide.pdf","file_size":1504739,"access_level":"closed","file_id":"7576","content_type":"application/pdf"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18","doi":"10.1145/3210377.3210662","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:40Z","publication_status":"published","publication_identifier":{"isbn":["9781450357999"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"id":"30291","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer","first_name":"Johannes Sebastian"}],"year":"2018","title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>.","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.","apa":"Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. Vienna: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>}, 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.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>."},"file_date_updated":"2019-02-06T14:18:35Z","ddc":["000"],"user_id":"30291","publisher":"ACM Press","_id":"7570","has_accepted_license":"1","conference":{"name":"30th Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","location":"Vienna","end_date":"2018-07-18"},"status":"public"},{"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"type":"conference","department":[{"_id":"63"},{"_id":"79"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"5863","date_updated":"2018-11-27T10:03:33Z","relation":"main_file","access_level":"closed","file_size":1122875,"file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","date_created":"2018-11-27T10:03:33Z","creator":"tillk"}],"date_created":"2018-09-11T05:26:59Z","abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:00Z","year":"2018","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer"},{"id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik","last_name":"Sundermeier"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"file_date_updated":"2018-11-27T10:03:33Z","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={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, 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} }","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 <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","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: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","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.","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 <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>"},"ddc":["000"],"user_id":"14955","_id":"4375","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-08-21","start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","location":"Helsinki"}},{"citation":{"mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-11-07T09:20:59Z","type":"bachelorsthesis","department":[{"_id":"63"}],"status":"public","title":"Mobile Facility Leasing","year":"2018","author":[{"first_name":"Marcel","last_name":"Geromel","full_name":"Geromel, Marcel"}],"date_updated":"2022-01-06T07:01:51Z","language":[{"iso":"eng"}],"_id":"5403","publisher":"Universität Paderborn","user_id":"477"},{"_id":"5404","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","title":"Online Algorithmen für das k-Page Migration Problem","year":"2018","status":"public","author":[{"first_name":"Patrick Irenäus","last_name":"Kolpaczki","full_name":"Kolpaczki, Patrick Irenäus"}],"date_updated":"2022-01-06T07:01:51Z","date_created":"2018-11-07T09:23:17Z","type":"bachelorsthesis","department":[{"_id":"63"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn.","ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. 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. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"external_id":{"arxiv":["1607.05143"]},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-10-31T16:57:32Z","citation":{"mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167."},"ddc":["000"],"user_id":"14052","volume":36,"page":"1145-1167","_id":"669","publisher":"Springer Nature","has_accepted_license":"1","status":"public","type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"5226","access_level":"closed","file_size":605207,"file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","date_updated":"2018-10-31T16:57:32Z","relation":"main_file","date_created":"2018-10-31T16:57:32Z","creator":"feldi"}],"date_created":"2017-10-26T14:11:04Z","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."}],"issue":"4","publication":"Journal of Combinatorial Optimization","doi":"10.1007/s10878-017-0189-y","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:15Z","publication_status":"published","intvolume":"        36","title":"Congestion games with mixed objectives","year":"2018","publication_identifier":{"issn":["1382-6905","1573-2886"]},"author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"},{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}]},{"publisher":"Universität Paderborn","_id":"1186","user_id":"14052","author":[{"full_name":"Kemper, Arne","last_name":"Kemper","first_name":"Arne"}],"status":"public","year":"2018","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","date_updated":"2022-01-06T06:51:11Z","date_created":"2018-03-02T13:47:57Z","department":[{"_id":"63"},{"_id":"541"}],"type":"mastersthesis","supervisor":[{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"citation":{"ieee":"A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","apa":"Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn.","chicago":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","mla":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. 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} }","ama":"Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn; 2018."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}]},{"type":"bachelorsthesis","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2018-03-02T13:49:39Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"citation":{"short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","chicago":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018.","ieee":"M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn, 2018.","apa":"Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn.","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} }","ama":"Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn; 2018.","mla":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018."},"user_id":"14052","_id":"1187","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:11Z","title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","year":"2018","status":"public","author":[{"first_name":"Marcel","last_name":"Nachtigall","full_name":"Nachtigall, Marcel"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"citation":{"ieee":"J. Kempf, <i>Learning deterministic bandit behaviour form compositions</i>. Universität Paderborn, 2018.","apa":"Kempf, J. (2018). <i>Learning deterministic bandit behaviour form compositions</i>. Universität Paderborn.","mla":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. 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} }","short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.","ama":"Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn; 2018.","chicago":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn, 2018."},"department":[{"_id":"63"},{"_id":"541"}],"type":"bachelorsthesis","date_created":"2018-03-02T13:51:14Z","date_updated":"2022-01-06T06:51:11Z","author":[{"full_name":"Kempf, Jérôme","first_name":"Jérôme","last_name":"Kempf"}],"status":"public","title":"Learning deterministic bandit behaviour form compositions","year":"2018","user_id":"14052","_id":"1188","publisher":"Universität Paderborn"},{"publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","citation":{"short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","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 <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>.","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, Cham, 2018.","apa":"Feldkord, B., Malatyali, M., &#38; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>","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={<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>}, 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: <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>","mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-03T07:04:59Z","place":"Cham","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","year":"2018","publication_identifier":{"isbn":["9783319125671","9783319125688"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Feldkord","first_name":"Björn","full_name":"Feldkord, Björn","id":"22704"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"user_id":"15415","doi":"10.1007/978-3-319-98355-4_18","_id":"16392","language":[{"iso":"eng"}]},{"ddc":["000"],"user_id":"14052","_id":"1369","publisher":"Springer Nature","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2018-10-31T16:56:13Z","citation":{"apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, 2018. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>.","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }"},"doi":"10.1007/s10878-018-0269-7","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:42Z","publication_status":"epub_ahead","title":"Pure Nash equilibria in restricted budget games","year":"2018","publication_identifier":{"issn":["1382-6905","1573-2886"]},"author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias","full_name":"Feldotto, Matthias"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"file":[{"date_created":"2018-10-31T16:56:13Z","creator":"feldi","content_type":"application/pdf","file_id":"5225","date_updated":"2018-10-31T16:56:13Z","relation":"main_file","access_level":"closed","file_size":561187,"file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf"}],"date_created":"2018-03-18T11:12:49Z","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"}],"publication":"Journal of Combinatorial Optimization"},{"date_created":"2018-03-13T10:26:16Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","citation":{"ieee":"D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018.","mla":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>.","apa":"Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }","ama":"Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>","short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.","chicago":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","grant_number":"160364472","name":"SFB 901 - Subproject A1"}],"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"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."}],"_id":"1209","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"1112","doi":"10.17619/UNIPB/1-271","author":[{"first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel","id":"37827"}],"publication_identifier":{"isbn":["978-3-942647-99-1"]},"year":"2018","status":"public","title":"Local Strategies for Swarm Formations on a Grid","date_updated":"2024-07-12T12:05:00Z"},{"type":"dissertation","department":[{"_id":"63"}],"place":"Universität Paderborn","date_created":"2020-09-21T13:52:09Z","related_material":{"link":[{"url":"10.17619/UNIPB/1-252 ","relation":"confirmation"}]},"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"apa":"Li, S. (2017). <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>","ieee":"S. Li, <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn, 2017.","chicago":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>.","short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.","mla":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>.","ama":"Li S. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>","bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>}, author={Li, Shouwei}, year={2017} }"},"doi":"10.17619/UNIPB/1-252","user_id":"15415","_id":"19604","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:07Z","title":"Parallel fixed parameter tractable problems","status":"public","year":"2017","author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"}]},{"_id":"2851","language":[{"iso":"eng"}],"ddc":["000"],"doi":"10.1007/978-3-319-89920-6_57","user_id":"14052","conference":{"end_date":"Sept 8, 2017","location":"Berlin","start_date":"Sept 6, 2017"},"author":[{"id":"37612","full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"}],"title":"Leasing with Uncertainty","year":"2017","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:08Z","date_created":"2018-05-24T08:44:43Z","file":[{"file_id":"5537","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-13T13:16:30Z","file_name":"Markarian2018_Chapter_LeasingWithUncertainty.pdf","access_level":"closed","file_size":257103,"date_created":"2018-11-13T13:16:30Z","creator":"feldi"}],"department":[{"_id":"63"}],"type":"conference","citation":{"ieee":"C. Markarian, “Leasing with Uncertainty,” in <i>International Conference on Operations Research (OR)</i>, Berlin, 2017.","apa":"Markarian, C. (2017). Leasing with Uncertainty. In <i>International Conference on Operations Research (OR)</i>. Berlin. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>","mla":"Markarian, Christine. “Leasing with Uncertainty.” <i>International Conference on Operations Research (OR)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>.","bibtex":"@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>}, booktitle={International Conference on Operations Research (OR)}, author={Markarian, Christine}, year={2017} }","ama":"Markarian C. Leasing with Uncertainty. In: <i>International Conference on Operations Research (OR)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>","short":"C. Markarian, in: International Conference on Operations Research (OR), 2017.","chicago":"Markarian, Christine. “Leasing with Uncertainty.” In <i>International Conference on Operations Research (OR)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>."},"publication":"International Conference on Operations Research (OR)","file_date_updated":"2018-11-13T13:16:30Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"abstract":[{"lang":"eng","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."}],"citation":{"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.","chicago":"Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>.","apa":"Khaluf, Y., Markarian, C., Simoens, P., &#38; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>","ieee":"Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","ama":"Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>","bibtex":"@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>}, 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.” <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>."},"publication":"International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)","department":[{"_id":"63"}],"type":"conference","date_created":"2021-09-14T12:41:58Z","place":"Cham","publication_status":"published","date_updated":"2022-01-06T06:56:19Z","author":[{"full_name":"Khaluf, Yara","first_name":"Yara","last_name":"Khaluf"},{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"},{"last_name":"Simoens","first_name":"Pieter","full_name":"Simoens, Pieter"},{"full_name":"Reina, Andreagiovanni","first_name":"Andreagiovanni","last_name":"Reina"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"title":"Scheduling Access to Shared Space in Multi-robot Systems","status":"public","year":"2017","user_id":"15415","doi":"10.1007/978-3-319-59930-4_12","_id":"24398","language":[{"iso":"eng"}]},{"series_title":"LNCS","doi":"10.1007/978-3-319-57586-5_19","author":[{"last_name":"Feldotto","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"year":"2017","title":"Congestion Games with Complementarities","date_updated":"2022-01-06T06:50:58Z","date_created":"2017-10-17T12:41:13Z","file":[{"date_created":"2018-03-21T13:05:37Z","creator":"florida","file_id":"1566","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:05:37Z","file_name":"112-FeldottoLederSkopalik2017.pdf","access_level":"closed","file_size":264089}],"department":[{"_id":"63"},{"_id":"541"}],"type":"conference","publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","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"}],"_id":"112","page":"222--233","ddc":["040"],"user_id":"14052","status":"public","has_accepted_license":"1","external_id":{"arxiv":["1701.07304"]},"citation":{"mla":"Feldotto, Matthias, et al. “Congestion Games with Complementarities.” <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>}, 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} }","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>. LNCS. ; 2017:222--233. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233.","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2017). Congestion Games with Complementarities. In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i> (pp. 222--233). <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 222--233. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>."},"file_date_updated":"2018-03-21T13:05:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"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"}],"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","date_created":"2017-10-17T12:41:13Z","file":[{"relation":"main_file","date_updated":"2018-10-31T17:01:32Z","file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","file_size":279055,"access_level":"closed","file_id":"5231","content_type":"application/pdf","success":1,"creator":"feldi","date_created":"2018-10-31T17:01:32Z"}],"date_updated":"2022-01-06T06:50:59Z","author":[{"id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"last_name":"Gairing","first_name":"Martin","full_name":"Gairing, Martin"},{"full_name":"Kotsialou, Grammateia","last_name":"Kotsialou","first_name":"Grammateia"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}],"year":"2017","title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","doi":"10.1007/978-3-319-71924-5_14","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>.","bibtex":"@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>}, 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} }","ama":"Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>","ieee":"M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017.","apa":"Feldotto, M., Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","chicago":"Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>."},"file_date_updated":"2018-10-31T17:01:32Z","external_id":{"arxiv":["1710.01634"]},"has_accepted_license":"1","status":"public","user_id":"14052","ddc":["000"],"_id":"113"},{"author":[{"id":"83983","first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb"},{"full_name":"Trajanovski, Stojan","last_name":"Trajanovski","first_name":"Stojan"},{"first_name":"Paola","last_name":"Grosso","full_name":"Grosso, Paola"},{"last_name":"de Laat","first_name":"Cees","full_name":"de Laat, Cees"}],"publication_identifier":{"isbn":["978-3-319-71150-8"]},"year":"2017","title":"Filtering Undesirable Flows in Networks","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-71150-8_1","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","extern":"1","date_created":"2020-08-06T15:19:48Z","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"status":"public","_id":"17652","publisher":"Springer International Publishing","page":"3-17","user_id":"83983","citation":{"bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>}, 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} }","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>","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 <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 2017, pp. 3–17.","mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>"},"place":"Cham"}]