--- _id: '22014' author: - first_name: Janina full_name: Seutter, Janina id: '64464' last_name: Seutter - first_name: Michelle full_name: Müller, Michelle id: '50286' last_name: Müller - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Seutter J, Müller M, Neumann J, Kundisch D. Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community. In: Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021).' apa: Seutter, J., Müller, M., Neumann, J., & Kundisch, D. (n.d.). Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community. International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021), Virtual Conference/Workshop. bibtex: '@inproceedings{Seutter_Müller_Neumann_Kundisch, title={Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community}, publisher={Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021)}, author={Seutter, Janina and Müller, Michelle and Neumann, Jürgen and Kundisch, Dennis} }' chicago: Seutter, Janina, Michelle Müller, Jürgen Neumann, and Dennis Kundisch. “Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community.” Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021), n.d. ieee: J. Seutter, M. Müller, J. Neumann, and D. Kundisch, “Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community,” presented at the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021), Virtual Conference/Workshop. mla: Seutter, Janina, et al. Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community. Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021). short: 'J. Seutter, M. Müller, J. Neumann, D. Kundisch, in: Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021), n.d.' conference: location: Virtual Conference/Workshop name: International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021) date_created: 2021-05-07T09:59:29Z date_updated: 2024-12-03T12:23:06Z department: - _id: '276' language: - iso: eng project: - _id: '1' grant_number: '160364472' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' grant_number: '160364472' name: SFB 901 - Subproject A4 publication_status: accepted publisher: Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021) status: public title: Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community type: conference_abstract user_id: '50286' year: '2021' ... --- _id: '23411' author: - first_name: Michelle full_name: Müller, Michelle id: '50286' last_name: Müller - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: Müller M, Neumann J, Kundisch D. Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies. apa: Müller, M., Neumann, J., & Kundisch, D. (n.d.). Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies. Conference on Information Systems and Technology (CIST), Newport Beach, California, USA. bibtex: '@inproceedings{Müller_Neumann_Kundisch, title={Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies}, author={Müller, Michelle and Neumann, Jürgen and Kundisch, Dennis} }' chicago: Müller, Michelle, Jürgen Neumann, and Dennis Kundisch. “Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies,” n.d. ieee: M. Müller, J. Neumann, and D. Kundisch, “Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies,” presented at the Conference on Information Systems and Technology (CIST), Newport Beach, California, USA. mla: Müller, Michelle, et al. Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies. short: 'M. Müller, J. Neumann, D. Kundisch, in: n.d.' conference: end_date: 2021-10-24 location: Newport Beach, California, USA name: Conference on Information Systems and Technology (CIST) start_date: 2021-10-23 date_created: 2021-08-16T08:20:23Z date_updated: 2024-12-03T12:32:21Z department: - _id: '276' language: - iso: eng project: - _id: '1' grant_number: '160364472' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' grant_number: '160364472' name: SFB 901 - Subproject A4 publication_status: accepted status: public title: Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies type: conference user_id: '50286' year: '2021' ... --- _id: '19782' author: - first_name: Michelle full_name: Müller, Michelle id: '50286' last_name: Müller - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Müller M, Neumann J, Gutt D, Kundisch D. Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies. In: Proceedings of the 41th International Conference on Information Systems (ICIS). ; 2020.' apa: Müller, M., Neumann, J., Gutt, D., & Kundisch, D. (2020). Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies. In Proceedings of the 41th International Conference on Information Systems (ICIS). Virtual Conference/Workshop. bibtex: '@inproceedings{Müller_Neumann_Gutt_Kundisch_2020, title={Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies}, booktitle={Proceedings of the 41th International Conference on Information Systems (ICIS)}, author={Müller, Michelle and Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2020} }' chicago: Müller, Michelle, Jürgen Neumann, Dominik Gutt, and Dennis Kundisch. “Toss a Coin to Your Host - How Guests End up Paying for the Cost of Regulatory Policies.” In Proceedings of the 41th International Conference on Information Systems (ICIS), 2020. ieee: M. Müller, J. Neumann, D. Gutt, and D. Kundisch, “Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies,” in Proceedings of the 41th International Conference on Information Systems (ICIS), Virtual Conference/Workshop, 2020. mla: Müller, Michelle, et al. “Toss a Coin to Your Host - How Guests End up Paying for the Cost of Regulatory Policies.” Proceedings of the 41th International Conference on Information Systems (ICIS), 2020. short: 'M. Müller, J. Neumann, D. Gutt, D. Kundisch, in: Proceedings of the 41th International Conference on Information Systems (ICIS), 2020.' conference: location: Virtual Conference/Workshop name: 41th International Conference on Information Systems (ICIS) date_created: 2020-09-30T09:08:41Z date_updated: 2022-01-06T06:54:12Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Proceedings of the 41th International Conference on Information Systems (ICIS) status: public title: Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies type: conference user_id: '16205' year: '2020' ... --- _id: '20221' author: - first_name: Paresh Kishor full_name: Yeole, Paresh Kishor last_name: Yeole citation: ama: Yeole PK. Plurality Consensus in Hybrid Networks.; 2020. apa: Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks. bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }' chicago: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020. ieee: P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020. mla: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020. short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020. date_created: 2020-10-29T07:45:57Z date_updated: 2022-01-06T06:54:23Z department: - _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 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Plurality Consensus in Hybrid Networks type: mastersthesis user_id: '15504' year: '2020' ... --- _id: '20240' author: - first_name: Simon full_name: Hoof, Simon id: '59676' last_name: Hoof citation: ama: "Hoof S. Essays on Cooperation in Differential Games.; 2020. doi:\t10.17619/UNIPB/1-1047" apa: "Hoof, S. (2020). Essays on Cooperation in Differential Games. https://doi.org/\t10.17619/UNIPB/1-1047" bibtex: "@book{Hoof_2020, title={Essays on Cooperation in Differential Games}, DOI={\t10.17619/UNIPB/1-1047}, author={Hoof, Simon}, year={2020} }" chicago: "Hoof, Simon. Essays on Cooperation in Differential Games, 2020. https://doi.org/\t10.17619/UNIPB/1-1047." ieee: S. Hoof, Essays on Cooperation in Differential Games. 2020. mla: "Hoof, Simon. Essays on Cooperation in Differential Games. 2020, doi:\t10.17619/UNIPB/1-1047." short: S. Hoof, Essays on Cooperation in Differential Games, 2020. date_created: 2020-11-02T09:56:14Z date_updated: 2022-01-06T06:54:24Z department: - _id: '205' doi: "\t10.17619/UNIPB/1-1047" language: - iso: eng 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: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake title: Essays on Cooperation in Differential Games type: dissertation user_id: '15504' year: '2020' ... --- _id: '2834' author: - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt - first_name: Tobias full_name: von Rechenberg, Tobias last_name: von Rechenberg - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: Gutt D, von Rechenberg T, Kundisch D. Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty. Journal of Business Research. 2020;106:277-287. doi:10.1016/j.jbusres.2018.06.019 apa: Gutt, D., von Rechenberg, T., & Kundisch, D. (2020). Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty. Journal of Business Research, 106, 277–287. https://doi.org/10.1016/j.jbusres.2018.06.019 bibtex: '@article{Gutt_von Rechenberg_Kundisch_2020, title={Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty}, volume={106}, DOI={10.1016/j.jbusres.2018.06.019}, journal={Journal of Business Research}, publisher={Elsevier}, author={Gutt, Dominik and von Rechenberg, Tobias and Kundisch, Dennis}, year={2020}, pages={277–287} }' chicago: 'Gutt, Dominik, Tobias von Rechenberg, and Dennis Kundisch. “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty.” Journal of Business Research 106 (2020): 277–87. https://doi.org/10.1016/j.jbusres.2018.06.019.' ieee: D. Gutt, T. von Rechenberg, and D. Kundisch, “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty,” Journal of Business Research, vol. 106, pp. 277–287, 2020. mla: Gutt, Dominik, et al. “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty.” Journal of Business Research, vol. 106, Elsevier, 2020, pp. 277–87, doi:10.1016/j.jbusres.2018.06.019. short: D. Gutt, T. von Rechenberg, D. Kundisch, Journal of Business Research 106 (2020) 277–287. date_created: 2018-05-23T15:08:23Z date_updated: 2022-01-06T06:58:02Z ddc: - '000' department: - _id: '276' doi: 10.1016/j.jbusres.2018.06.019 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:29:22Z date_updated: 2018-11-02T15:29:22Z file_id: '5304' file_name: gutt-main.pdf file_size: 572670 relation: main_file success: 1 file_date_updated: 2018-11-02T15:29:22Z has_accepted_license: '1' intvolume: ' 106' language: - iso: eng page: 277-287 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Journal of Business Research publication_status: epub_ahead publisher: Elsevier status: public title: Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty type: journal_article user_id: '16205' volume: 106 year: '2020' ... --- _id: '21287' abstract: - lang: eng text: Peer-to-peer markets are especially suitable for the analysis of online ratings as they represent two-sided markets that match buyers to sellers and thus lead to reduced scope for opportunistic behavior. We decompose the online ratings by focusing on the customer’s decision-making process in a leading peer-to-peer ridesharing platform. Using data from the leading peer-to-peer ridesharing platform BlaBlaCar, we analyze 17,584 users registered between 2004 and 2014 and their online ratings focusing on the decomposition of the explicit determinants reflecting the variance of online ratings. We find clear evidence to suggest that a driver’s attitude towards music, pets, smoking, and conversation has a significantly positive influence on his received online ratings. However, we also show that the interaction of female drivers and their attitude towards pets has a significantly negative effect on average ratings. article_number: '6185' author: - first_name: Daniel full_name: Kaimann, Daniel id: '18949' last_name: Kaimann citation: ama: 'Kaimann D. Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets. Sustainability. 2020;12(15). doi:10.3390/su12156185' apa: 'Kaimann, D. (2020). Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets. Sustainability, 12(15). https://doi.org/10.3390/su12156185' bibtex: '@article{Kaimann_2020, title={Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets}, volume={12}, DOI={10.3390/su12156185}, number={156185}, journal={Sustainability}, author={Kaimann, Daniel}, year={2020} }' chicago: 'Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets.” Sustainability 12, no. 15 (2020). https://doi.org/10.3390/su12156185.' ieee: 'D. Kaimann, “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets,” Sustainability, vol. 12, no. 15, 2020.' mla: 'Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets.” Sustainability, vol. 12, no. 15, 6185, 2020, doi:10.3390/su12156185.' short: D. Kaimann, Sustainability 12 (2020). date_created: 2021-02-26T13:15:09Z date_updated: 2022-01-06T06:54:52Z department: - _id: '183' doi: 10.3390/su12156185 intvolume: ' 12' issue: '15' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Sustainability publication_identifier: issn: - 2071-1050 publication_status: published status: public title: 'Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets' type: journal_article user_id: '18949' volume: 12 year: '2020' ... --- _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: '17836' citation: ama: Werneck Richa A, Scheideler C, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3 apa: Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3 bibtex: '@book{Werneck Richa_Scheideler_2020, series={Lecture Notes in Computer Science}, title={Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}, volume={12156}, DOI={10.1007/978-3-030-54921-3}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }' chicago: Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3. ieee: A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020. mla: Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3. short: A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 2020. date_created: 2020-08-12T07:54:22Z date_updated: 2022-01-06T06:53:20Z department: - _id: '79' doi: 10.1007/978-3-030-54921-3 editor: - first_name: Andrea full_name: Werneck Richa, Andrea last_name: Werneck Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler intvolume: ' 12156' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-030-54920-6 publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings type: conference_editor user_id: '15504' volume: 12156 year: '2020' ... --- _id: '17839' citation: ama: 'Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM; 2020. doi:10.1145/3350755' apa: 'Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM. https://doi.org/10.1145/3350755' bibtex: '@book{Scheideler_Spear_2020, title={SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}, DOI={10.1145/3350755}, publisher={ACM}, year={2020} }' chicago: 'Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020. https://doi.org/10.1145/3350755.' ieee: 'C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.' mla: 'Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.' short: 'C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.' date_created: 2020-08-12T07:57:10Z date_updated: 2022-01-06T06:53:20Z department: - _id: '79' doi: 10.1145/3350755 editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Michael full_name: Spear, Michael last_name: Spear 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_identifier: isbn: - 978-1-4503-6935-0 publisher: ACM status: public title: 'SPAA ''20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020' type: conference_editor user_id: '15504' year: '2020' ... --- _id: '20495' author: - first_name: Moritz full_name: Jochmaring, Moritz last_name: Jochmaring citation: ama: Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020. apa: Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks. bibtex: '@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }' chicago: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020. ieee: M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid networks. 2020. mla: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020. short: M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020. date_created: 2020-11-25T07:03:16Z date_updated: 2022-01-06T06:54:27Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: A self stabilizing protocol for well-formed trees in hybrid networks type: mastersthesis user_id: '15504' year: '2020' ... --- _id: '20755' abstract: - lang: eng text: "We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31' apa: Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31 bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }' chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31. ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020. mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31. short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.' date_created: 2020-12-16T10:20:18Z date_updated: 2022-01-06T06:54:36Z ddc: - '000' department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2020.31 external_id: arxiv: - '2007.01191' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2020-12-16T10:18:50Z date_updated: 2020-12-16T10:18:50Z file_id: '20756' file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf file_size: 867373 relation: main_file success: 1 file_date_updated: 2020-12-16T10:18:50Z has_accepted_license: '1' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: SFB 901 publication: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS) publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik status: public title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs type: conference user_id: '23538' year: '2020' ... --- _id: '18066' author: - first_name: Michael full_name: Skowronek, Michael last_name: Skowronek citation: ama: Skowronek M. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn; 2020. apa: Skowronek, M. (2020). Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn. bibtex: '@book{Skowronek_2020, title={Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität Paderborn}, author={Skowronek, Michael}, year={2020} }' chicago: Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020. ieee: M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020. mla: Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020. short: M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020. date_created: 2020-08-20T07:40:58Z date_updated: 2022-01-06T06:53:25Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks type: bachelorsthesis user_id: '477' year: '2020' ... --- _id: '18648' author: - first_name: Andreas full_name: Guggenmos, Andreas last_name: Guggenmos citation: ama: Guggenmos A. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn; 2020. apa: Guggenmos, A. (2020). Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn. bibtex: '@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }' chicago: Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020. ieee: A. Guggenmos, Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020. mla: Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020. short: A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020. date_created: 2020-08-31T07:14:51Z date_updated: 2022-01-06T06:53:50Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Algorithmen für selbststabilisierende Skip+-Delaunaygraphen type: bachelorsthesis user_id: '477' year: '2020' ... --- _id: '4627' author: - first_name: Daniel full_name: Kaimann, Daniel id: '18949' last_name: Kaimann citation: ama: 'Kaimann D. Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. Applied Economics Letters. 2020;27(16):1366-1370. doi:10.1080/13504851.2019.1683136' apa: 'Kaimann, D. (2020). Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. Applied Economics Letters, 27(16), 1366–1370. https://doi.org/10.1080/13504851.2019.1683136' bibtex: '@article{Kaimann_2020, title={Ancillary market signaling: A two-stage model of economic reputation on ancillary market success}, volume={27}, DOI={10.1080/13504851.2019.1683136}, number={16}, journal={Applied Economics Letters}, author={Kaimann, Daniel}, year={2020}, pages={1366–1370} }' chicago: 'Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” Applied Economics Letters 27, no. 16 (2020): 1366–70. https://doi.org/10.1080/13504851.2019.1683136.' ieee: 'D. Kaimann, “Ancillary market signaling: A two-stage model of economic reputation on ancillary market success,” Applied Economics Letters, vol. 27, no. 16, pp. 1366–1370, 2020.' mla: 'Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” Applied Economics Letters, vol. 27, no. 16, 2020, pp. 1366–70, doi:10.1080/13504851.2019.1683136.' short: D. Kaimann, Applied Economics Letters 27 (2020) 1366–1370. date_created: 2018-10-10T11:46:19Z date_updated: 2022-01-06T07:01:15Z ddc: - '330' department: - _id: '183' doi: 10.1080/13504851.2019.1683136 file: - access_level: closed content_type: application/pdf creator: dkaimann date_created: 2018-11-08T10:18:19Z date_updated: 2018-11-08T10:18:19Z file_id: '5429' file_name: AEL_2018_Kaimann.pdf file_size: 163015 relation: main_file success: 1 file_date_updated: 2018-11-08T10:18:19Z has_accepted_license: '1' intvolume: ' 27' issue: '16' language: - iso: eng page: 1366-1370 project: - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 - _id: '1' name: SFB 901 publication: Applied Economics Letters status: public title: 'Ancillary market signaling: A two-stage model of economic reputation on ancillary market success' type: journal_article user_id: '18949' volume: 27 year: '2020' ... --- _id: '16902' abstract: - lang: eng text: "The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190 apa: Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190 bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }' chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, 2020. https://doi.org/10.1145/3397190. ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020. mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190. short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020). date_created: 2020-04-29T07:09:50Z date_updated: 2022-01-06T06:52:58Z department: - _id: '79' doi: 10.1145/3397190 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 Computing Surveys publisher: ACM status: public title: Survey on Algorithms for Self-Stabilizing Overlay Networks type: journal_article user_id: '23538' year: '2020' ... --- _id: '16910' author: - first_name: Nadja full_name: Stroh-Maraun, Nadja id: '13264' last_name: Stroh-Maraun citation: ama: Stroh-Maraun N. Mechanisms, Preferences, and Heterogeneity in Matching Markets. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-958 apa: Stroh-Maraun, N. (2020). Mechanisms, Preferences, and Heterogeneity in Matching Markets. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-958 bibtex: '@book{Stroh-Maraun_2020, title={Mechanisms, Preferences, and Heterogeneity in Matching Markets}, DOI={10.17619/UNIPB/1-958}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2020} }' chicago: Stroh-Maraun, Nadja. Mechanisms, Preferences, and Heterogeneity in Matching Markets. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-958. ieee: N. Stroh-Maraun, Mechanisms, Preferences, and Heterogeneity in Matching Markets. Universität Paderborn, 2020. mla: Stroh-Maraun, Nadja. Mechanisms, Preferences, and Heterogeneity in Matching Markets. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-958. short: N. Stroh-Maraun, Mechanisms, Preferences, and Heterogeneity in Matching Markets, Universität Paderborn, 2020. date_created: 2020-04-29T08:29:45Z date_updated: 2022-01-06T06:52:58Z department: - _id: '205' doi: 10.17619/UNIPB/1-958 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake title: Mechanisms, Preferences, and Heterogeneity in Matching Markets type: dissertation user_id: '477' year: '2020' ... --- _id: '16951' author: - first_name: Janina full_name: Seutter, Janina id: '64464' last_name: Seutter - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann citation: ama: 'Seutter J, Neumann J. Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior. In: Proceedings of the 28th European Conference on Information Systems (ECIS).' apa: Seutter, J., & Neumann, J. (n.d.). Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior. In Proceedings of the 28th European Conference on Information Systems (ECIS). Virtual Conference/Workshop. bibtex: '@inproceedings{Seutter_Neumann, title={Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior}, booktitle={Proceedings of the 28th European Conference on Information Systems (ECIS)}, author={Seutter, Janina and Neumann, Jürgen} }' chicago: Seutter, Janina, and Jürgen Neumann. “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior.” In Proceedings of the 28th European Conference on Information Systems (ECIS), n.d. ieee: J. Seutter and J. Neumann, “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior,” in Proceedings of the 28th European Conference on Information Systems (ECIS), Virtual Conference/Workshop. mla: Seutter, Janina, and Jürgen Neumann. “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior.” Proceedings of the 28th European Conference on Information Systems (ECIS). short: 'J. Seutter, J. Neumann, in: Proceedings of the 28th European Conference on Information Systems (ECIS), n.d.' conference: location: Virtual Conference/Workshop name: 28th European Conference on Information Systems (ECIS) date_created: 2020-05-14T09:33:34Z date_updated: 2022-01-06T06:52:59Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Proceedings of the 28th European Conference on Information Systems (ECIS) publication_status: accepted status: public title: Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior type: conference user_id: '16205' year: '2020' ... --- _id: '16952' author: - first_name: Martin full_name: Poniatowski, Martin id: '32441' last_name: Poniatowski - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann citation: ama: 'Poniatowski M, Neumann J. Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior. In: Proceedings of the 28th European Conference on Information Systems (ECIS).' apa: Poniatowski, M., & Neumann, J. (n.d.). Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior. In Proceedings of the 28th European Conference on Information Systems (ECIS). Virtual Conference/Workshop. bibtex: '@inproceedings{Poniatowski_Neumann, title={Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior}, booktitle={Proceedings of the 28th European Conference on Information Systems (ECIS)}, author={Poniatowski, Martin and Neumann, Jürgen} }' chicago: Poniatowski, Martin, and Jürgen Neumann. “Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior.” In Proceedings of the 28th European Conference on Information Systems (ECIS), n.d. ieee: M. Poniatowski and J. Neumann, “Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior,” in Proceedings of the 28th European Conference on Information Systems (ECIS), Virtual Conference/Workshop. mla: Poniatowski, Martin, and Jürgen Neumann. “Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior.” Proceedings of the 28th European Conference on Information Systems (ECIS). short: 'M. Poniatowski, J. Neumann, in: Proceedings of the 28th European Conference on Information Systems (ECIS), n.d.' conference: location: Virtual Conference/Workshop name: 28th European Conference on Information Systems (ECIS) date_created: 2020-05-14T09:36:33Z date_updated: 2022-01-06T06:52:59Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Proceedings of the 28th European Conference on Information Systems (ECIS) publication_status: accepted status: public title: Getting Personal with Review Systems – Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior type: conference user_id: '16205' 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' ...