--- _id: '17370' 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." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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.' date_created: 2020-07-14T07:53:20Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400281 external_id: arxiv: - '2005.08391' file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2020-07-14T07:56:52Z date_updated: 2020-07-14T07:56:52Z file_id: '17373' file_name: 3350755.3400281.pdf file_size: 1271416 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:52Z has_accepted_license: '1' keyword: - Online Multi-Commodity Facility Location - Competitive Ratio - Online Optimization - Facility Location Problem language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: The Online Multi-Commodity Facility Location Problem type: conference user_id: '39241' year: '2020' ... --- _id: '17371' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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' 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} }' 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.' 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.' 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.' date_created: 2020-07-14T07:53:47Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400263 external_id: arxiv: - '2010.02043 ' file: - access_level: closed content_type: application/pdf creator: janniksu date_created: 2020-07-14T07:56:04Z date_updated: 2020-07-14T07:56:04Z file_id: '17372' file_name: 3350755.3400263.pdf file_size: 1078544 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:04Z has_accepted_license: '1' language: - iso: eng publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: 'Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up' type: conference user_id: '38705' year: '2020' ... --- _id: '16968' 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 author: - first_name: Michael full_name: Braun, Michael last_name: Braun - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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} }' 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. 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. 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. 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.' conference: end_date: 2020-07-01 location: Paderborn name: SIROCCO 2020 start_date: 2020-06-29 date_created: 2020-05-18T06:48:35Z date_updated: 2022-01-06T06:53:00Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-030-54921-3_4 external_id: arxiv: - arXiv:2005.07495 file: - access_level: closed content_type: application/pdf creator: janniksu date_created: 2020-07-31T08:22:16Z date_updated: 2020-07-31T08:22:16Z file_id: '17504' file_name: localGathering.pdf file_size: 505712 relation: main_file success: 1 file_date_updated: 2020-07-31T08:22:16Z has_accepted_license: '1' language: - iso: eng publication: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO) publisher: Springer status: public title: Local Gathering of Mobile Robots in Three Dimensions type: conference user_id: '38705' year: '2020' ... --- _id: '15631' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord citation: 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 bibtex: '@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={10.17619/UNIPB/1-869}, author={Feldkord, Björn}, year={2020} }' chicago: Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-869. ieee: B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020. mla: Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869. short: B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020. date_created: 2020-01-23T14:20:25Z date_updated: 2022-01-06T06:52:31Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-869 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2020-01-24T08:19:38Z date_updated: 2020-01-24T08:19:38Z file_id: '15634' file_name: DissertationFeldkord.pdf file_size: 633652 relation: main_file success: 1 file_date_updated: 2020-01-24T08:19:38Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Mobile Resource Allocation type: dissertation user_id: '15415' year: '2020' ... --- _id: '15025' 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. author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Lorijn full_name: van Rooijen, Lorijn id: '58843' last_name: van Rooijen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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 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 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} }' 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.' 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.' 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. date_created: 2019-11-18T14:19:19Z date_updated: 2022-01-06T06:52:15Z department: - _id: '34' - _id: '355' - _id: '26' - _id: '63' - _id: '238' doi: 10.1162/evco_a_00266 intvolume: ' 28' issue: '2' language: - iso: eng page: 165–193 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Evolutionary Computation publication_status: published publisher: MIT Press Journals related_material: link: - relation: confirmation url: https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266 status: public title: Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets type: journal_article user_id: '15415' volume: 28 year: '2020' ... --- _id: '15169' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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.' 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} }' 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. 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. 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. short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.' conference: end_date: 07.01.2020 location: Kolkata, Indien name: '21st International Conference on Distributed Computing and Networking ' start_date: 04.01.2020 date_created: 2019-11-25T12:18:41Z date_updated: 2022-01-06T06:52:16Z department: - _id: '63' - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN) publication_status: accepted publisher: ACM status: public title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks type: conference user_id: '477' year: '2020' ... --- _id: '16299' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jonas full_name: Harbig, Jonas last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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 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} }' 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.' 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. 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. date_created: 2020-03-13T12:55:53Z date_updated: 2022-01-06T06:52:48Z department: - _id: '63' doi: 10.1016/j.tcs.2020.02.018 intvolume: ' 815' language: - iso: eng page: 289-309 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: journal_article user_id: '38705' volume: 815 year: '2020' ... --- _id: '13868' author: - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide 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). 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} }' 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. 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. 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.' date_created: 2019-10-15T12:19:49Z date_updated: 2022-01-06T06:51:45Z department: - _id: '63' language: - iso: eng project: - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subproject C4 publication: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) status: public title: Approximating Weighted Completion Time for Order Scheduling with Setup Times type: conference user_id: '44428' year: '2020' ... --- _id: '13770' author: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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' 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} }' 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.' 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.' 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.' short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481. date_created: 2019-10-10T13:41:06Z date_updated: 2022-12-02T09:27:17Z ddc: - '004' department: - _id: '276' - _id: '75' - _id: '63' - _id: '77' doi: 10.1007/s12599-019-00627-x file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-12-12T10:24:47Z date_updated: 2019-12-12T10:24:47Z file_id: '15311' file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf file_size: 454532 relation: main_file success: 1 file_date_updated: 2019-12-12T10:24:47Z has_accepted_license: '1' intvolume: ' 62' issue: '6' language: - iso: eng page: 467-481 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '3' name: SFB 901 - Project Area B - _id: '4' name: SFB 901 - Project Area C - _id: '82' name: SFB 901 - Project Area T - _id: '5' name: SFB 901 - Subproject A1 - _id: '6' name: SFB 901 - Subproject A2 - _id: '7' name: SFB 901 - Subproject A3 - _id: '8' name: SFB 901 - Subproject A4 - _id: '9' name: SFB 901 - Subproject B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '11' name: SFB 901 - Subproject B3 - _id: '12' name: SFB 901 - Subproject B4 - _id: '13' name: SFB 901 - Subproject C1 - _id: '14' name: SFB 901 - Subproject C2 - _id: '15' name: SFB 901 - Subproject C3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '17' name: SFB 901 - Subproject C5 - _id: '83' name: SFB 901 -Subproject T1 - _id: '84' name: SFB 901 -Subproject T2 - _id: '107' name: SFB 901 -Subproject T3 - _id: '158' name: 'SFB 901 - T4: SFB 901 -Subproject T4' publication: Business & Information Systems Engineering publication_status: published publisher: Springer status: public title: 'A Case for a New IT Ecosystem: On-The-Fly Computing' type: journal_article user_id: '477' volume: 62 year: '2020' ... --- _id: '17432' author: - first_name: Surender full_name: Baswana, Surender last_name: Baswana - first_name: Shiv full_name: Gupta, Shiv last_name: Gupta - first_name: Ayush full_name: Tulsyan, Ayush last_name: Tulsyan citation: 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' 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)} }' 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.' 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.' 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.' 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.' date_created: 2020-07-29T07:33:56Z date_updated: 2022-01-06T06:53:12Z department: - _id: '63' doi: 10.4230/LIPICS.MFCS.2019.65 language: - iso: eng page: 65:1--65:16 publication: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient' type: conference user_id: '15415' year: '2019' ... --- _id: '17667' abstract: - lang: eng 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.' author: - first_name: Ralph full_name: Koning, Ralph last_name: Koning - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Lydia full_name: Meijer, Lydia last_name: Meijer - first_name: Cees full_name: de Laat, Cees last_name: de Laat - first_name: Paola full_name: Grosso, Paola last_name: Grosso citation: 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' 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 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. 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. 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. 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.' 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) date_created: 2020-08-06T15:23:23Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1109/CSCloud/EdgeCom.2019.000-9 extern: '1' 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 language: - iso: eng main_file_link: - url: https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors page: 113-123 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) publication_identifier: issn: - 'null' quality_controlled: '1' 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) status: public title: Approaches for Collaborative Security Defences in Multi Network Environments type: conference user_id: '83983' year: '2019' ... --- _id: '18975' author: - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali citation: 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' 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} }' chicago: 'Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-766.' ieee: 'M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.' mla: 'Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.' short: 'M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.' date_created: 2020-09-04T07:39:47Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' doi: 10.17619/UNIPB/1-766 language: - iso: eng place: Universität Paderborn related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-766 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: 'Big Data: Sublinear Algorithms for Distributed Data Streams' type: dissertation user_id: '15415' year: '2019' ... --- _id: '8080' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 citation: 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 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 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} }' 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. mla: Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588. short: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019. date_created: 2019-02-25T13:03:02Z date_updated: 2022-01-06T07:03:50Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.17619/UNIPB/1-588 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-03-28T13:40:51Z date_updated: 2019-03-28T13:40:51Z file_id: '8715' file_name: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games.pdf file_size: 3116177 relation: main_file success: 1 file_date_updated: 2019-03-28T13:40:51Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games type: dissertation user_id: '15415' year: '2019' ... --- _id: '8866' author: - first_name: Klaus full_name: Jansen, Klaus last_name: Jansen - first_name: Marten full_name: Maack, Marten last_name: Maack - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker 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. 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} }' 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. 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. 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. 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.' date_created: 2019-04-09T11:28:46Z date_updated: 2022-01-06T07:04:04Z department: - _id: '63' language: - iso: eng page: 145 - 154 project: - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '1' name: SFB 901 publication: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Scheduling on (Un-)Related Machines with Setup Times type: conference user_id: '13536' year: '2019' ... --- _id: '5471' 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." author: - first_name: Philip full_name: Lazos, Philip last_name: Lazos - first_name: Paul full_name: Goldberg, Paul last_name: Goldberg - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik - first_name: Matthias full_name: Gerstgrasser, Matthias last_name: Gerstgrasser - first_name: Bart full_name: de Keijzer, Bart last_name: de Keijzer citation: 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' 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 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} }' 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. 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.' 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. 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.' conference: end_date: 2019-02-01 location: Honolulu, Hawaii, USA name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) start_date: 2019-01-27 date_created: 2018-11-12T09:38:16Z date_updated: 2022-01-06T07:01:55Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.1609/aaai.v33i01.33011973 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-12-06T13:57:51Z date_updated: 2018-12-06T13:57:51Z file_id: '6018' file_name: 1811.05130.pdf file_size: 315877 relation: main_file success: 1 file_date_updated: 2018-12-06T13:57:51Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) publication_status: published status: public title: ' Multi-unit Bilateral Trade' type: conference user_id: '15415' year: '2019' ... --- _id: '12870' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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.' date_created: 2019-07-22T09:00:05Z date_updated: 2022-01-06T06:51:20Z department: - _id: '63' doi: 10.1007/978-3-030-39479-0_9 external_id: arxiv: - '1907.09834' language: - iso: eng page: 120 - 137 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) publication_status: published publisher: Springer status: public title: Managing Multiple Mobile Resources type: conference user_id: '22704' year: '2019' ... --- _id: '14851' author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker citation: ama: Mäcker A. On Scheduling with Setup Times. Universität Paderborn; 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 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} }' 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. mla: Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828. short: A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019. date_created: 2019-11-07T14:17:05Z date_updated: 2022-01-06T06:52:08Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-828 language: - iso: eng place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subproject C4 - _id: '4' name: SFB 901 - Project Area C related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-828 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: On Scheduling with Setup Times type: dissertation user_id: '15415' year: '2019' ... --- _id: '16341' 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." author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: 0000-0003-3546-203X - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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. 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} }' 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. 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. mla: Brandt, Sascha, et al. “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). date_created: 2020-03-24T08:59:44Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' external_id: arxiv: - '1904.08225' language: - iso: eng main_file_link: - open_access: '1' oa: '1' publication: arXiv:1904.08225 status: public title: Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels type: preprint user_id: '15415' year: '2019' ... --- _id: '13873' article_number: '14' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide 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 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} }' 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. ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 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). date_created: 2019-10-16T07:06:22Z date_updated: 2022-01-06T06:51:46Z ddc: - '000' department: - _id: '63' doi: 10.1145/3364204 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2020-01-24T08:12:58Z date_updated: 2020-01-24T08:12:58Z file_id: '15632' file_name: DissertationFeldkord.pdf file_size: 633652 relation: main_file success: 1 file_date_updated: 2020-01-24T08:12:58Z has_accepted_license: '1' intvolume: ' 6' issue: '3' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: ACM Transactions on Parallel Computing (TOPC) publication_status: published status: public title: The Mobile Server Problem type: journal_article user_id: '15504' volume: 6 year: '2019' ... --- _id: '13937' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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' 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} }' 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.' 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.' 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. date_created: 2019-10-21T08:54:14Z date_updated: 2022-01-06T06:51:47Z department: - _id: '63' doi: 10.1007/s00591-019-00249-0 intvolume: ' 66' issue: '2' language: - iso: ger page: 259-260 publication: Mathematische Semesterberichte publication_status: published status: public title: 'Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln' type: journal_article user_id: '15415' volume: 66 year: '2019' ...