[{"title":"Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community","conference":{"name":"International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021)","location":"Virtual Conference/Workshop"},"date_updated":"2024-12-03T12:23:06Z","publisher":"Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021)","date_created":"2021-05-07T09:59:29Z","author":[{"last_name":"Seutter","full_name":"Seutter, Janina","id":"64464","first_name":"Janina"},{"first_name":"Michelle","last_name":"Müller","id":"50286","full_name":"Müller, Michelle"},{"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"}],"year":"2021","citation":{"apa":"Seutter, J., Müller, M., Neumann, J., &#38; Kundisch, D. (n.d.). <i>Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community</i>. International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021), Virtual Conference/Workshop.","mla":"Seutter, Janina, et al. <i>Do Smart Product Service Systems Crowd Out Interactions in Online Communities? – Empirical Evidence from a Cooking Community</i>. Proceedings of the International Conference on Challenges in Managing Smart Products and Services (CHIMSPAS 2021).","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} }","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.","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.","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.","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)."},"publication_status":"accepted","language":[{"iso":"eng"}],"_id":"22014","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - Project Area A"},{"grant_number":"160364472","_id":"8","name":"SFB 901 - Subproject A4"}],"department":[{"_id":"276"}],"user_id":"50286","status":"public","type":"conference_abstract"},{"conference":{"location":"Newport Beach, California, USA","end_date":"2021-10-24","start_date":"2021-10-23","name":"Conference on Information Systems and Technology (CIST)"},"title":"Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies","date_created":"2021-08-16T08:20:23Z","author":[{"id":"50286","full_name":"Müller, Michelle","last_name":"Müller","first_name":"Michelle"},{"full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann","first_name":"Jürgen"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"date_updated":"2024-12-03T12:32:21Z","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.","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.","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.","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} }","mla":"Müller, Michelle, et al. <i>Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies</i>.","short":"M. Müller, J. Neumann, D. Kundisch, in: n.d.","apa":"Müller, M., Neumann, J., &#38; Kundisch, D. (n.d.). <i>Toss a Coin to Your Host? – Why Guests Do Not Always End Up Paying for the Cost of Regulatory Policies</i>. Conference on Information Systems and Technology (CIST), Newport Beach, California, USA."},"year":"2021","publication_status":"accepted","language":[{"iso":"eng"}],"department":[{"_id":"276"}],"user_id":"50286","_id":"23411","project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"8","name":"SFB 901 - Subproject A4"}],"status":"public","type":"conference"},{"publication":"Proceedings of the 41th International Conference on Information Systems (ICIS)","type":"conference","status":"public","_id":"19782","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"276"}],"user_id":"16205","language":[{"iso":"eng"}],"year":"2020","citation":{"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 <i>Proceedings of the 41th International Conference on Information Systems (ICIS)</i>, 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 <i>Proceedings of the 41th International Conference on Information Systems (ICIS)</i>, Virtual Conference/Workshop, 2020.","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: <i>Proceedings of the 41th International Conference on Information Systems (ICIS)</i>. ; 2020.","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} }","mla":"Müller, Michelle, et al. “Toss a Coin to Your Host - How Guests End up Paying for the Cost of Regulatory Policies.” <i>Proceedings of the 41th International Conference on Information Systems (ICIS)</i>, 2020.","short":"M. Müller, J. Neumann, D. Gutt, D. Kundisch, in: Proceedings of the 41th International Conference on Information Systems (ICIS), 2020.","apa":"Müller, M., Neumann, J., Gutt, D., &#38; Kundisch, D. (2020). Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies. In <i>Proceedings of the 41th International Conference on Information Systems (ICIS)</i>. Virtual Conference/Workshop."},"date_updated":"2022-01-06T06:54:12Z","author":[{"first_name":"Michelle","id":"50286","full_name":"Müller, Michelle","last_name":"Müller"},{"first_name":"Jürgen","full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann"},{"first_name":"Dominik","last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2020-09-30T09:08:41Z","title":"Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies","conference":{"name":"41th International Conference on Information Systems (ICIS)","location":"Virtual Conference/Workshop"}},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"20221","user_id":"15504","department":[{"_id":"79"}],"year":"2020","citation":{"mla":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.","short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }","apa":"Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>.","ama":"Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.","chicago":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.","ieee":"P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020."},"title":"Plurality Consensus in Hybrid Networks","date_updated":"2022-01-06T06:54:23Z","author":[{"first_name":"Paresh Kishor","full_name":"Yeole, Paresh Kishor","last_name":"Yeole"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-10-29T07:45:57Z"},{"type":"dissertation","status":"public","user_id":"15504","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"20240","language":[{"iso":"eng"}],"citation":{"chicago":"Hoof, Simon. <i>Essays on Cooperation in Differential Games</i>, 2020. <a href=\"https://doi.org/\t10.17619/UNIPB/1-1047\">https://doi.org/\t10.17619/UNIPB/1-1047</a>.","ieee":"S. Hoof, <i>Essays on Cooperation in Differential Games</i>. 2020.","ama":"Hoof S. <i>Essays on Cooperation in Differential Games</i>.; 2020. doi:<a href=\"https://doi.org/\t10.17619/UNIPB/1-1047\">\t10.17619/UNIPB/1-1047</a>","short":"S. Hoof, Essays on Cooperation in Differential Games, 2020.","mla":"Hoof, Simon. <i>Essays on Cooperation in Differential Games</i>. 2020, doi:<a href=\"https://doi.org/\t10.17619/UNIPB/1-1047\">\t10.17619/UNIPB/1-1047</a>.","bibtex":"@book{Hoof_2020, title={Essays on Cooperation in Differential Games}, DOI={<a href=\"https://doi.org/\t10.17619/UNIPB/1-1047\">\t10.17619/UNIPB/1-1047</a>}, author={Hoof, Simon}, year={2020} }","apa":"Hoof, S. (2020). <i>Essays on Cooperation in Differential Games</i>. <a href=\"https://doi.org/\t10.17619/UNIPB/1-1047\">https://doi.org/\t10.17619/UNIPB/1-1047</a>"},"year":"2020","date_created":"2020-11-02T09:56:14Z","supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"author":[{"first_name":"Simon","last_name":"Hoof","id":"59676","full_name":"Hoof, Simon"}],"date_updated":"2022-01-06T06:54:24Z","doi":"\t10.17619/UNIPB/1-1047","title":"Essays on Cooperation in Differential Games"},{"intvolume":"       106","page":"277-287","citation":{"chicago":"Gutt, Dominik, Tobias von Rechenberg, and Dennis Kundisch. “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty.” <i>Journal of Business Research</i> 106 (2020): 277–87. <a href=\"https://doi.org/10.1016/j.jbusres.2018.06.019\">https://doi.org/10.1016/j.jbusres.2018.06.019</a>.","ieee":"D. Gutt, T. von Rechenberg, and D. Kundisch, “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty,” <i>Journal of Business Research</i>, vol. 106, pp. 277–287, 2020.","ama":"Gutt D, von Rechenberg T, Kundisch D. Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty. <i>Journal of Business Research</i>. 2020;106:277-287. doi:<a href=\"https://doi.org/10.1016/j.jbusres.2018.06.019\">10.1016/j.jbusres.2018.06.019</a>","apa":"Gutt, D., von Rechenberg, T., &#38; Kundisch, D. (2020). Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty. <i>Journal of Business Research</i>, <i>106</i>, 277–287. <a href=\"https://doi.org/10.1016/j.jbusres.2018.06.019\">https://doi.org/10.1016/j.jbusres.2018.06.019</a>","bibtex":"@article{Gutt_von Rechenberg_Kundisch_2020, title={Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty}, volume={106}, DOI={<a href=\"https://doi.org/10.1016/j.jbusres.2018.06.019\">10.1016/j.jbusres.2018.06.019</a>}, journal={Journal of Business Research}, publisher={Elsevier}, author={Gutt, Dominik and von Rechenberg, Tobias and Kundisch, Dennis}, year={2020}, pages={277–287} }","mla":"Gutt, Dominik, et al. “Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty.” <i>Journal of Business Research</i>, vol. 106, Elsevier, 2020, pp. 277–87, doi:<a href=\"https://doi.org/10.1016/j.jbusres.2018.06.019\">10.1016/j.jbusres.2018.06.019</a>.","short":"D. Gutt, T. von Rechenberg, D. Kundisch, Journal of Business Research 106 (2020) 277–287."},"year":"2020","has_accepted_license":"1","publication_status":"epub_ahead","doi":"10.1016/j.jbusres.2018.06.019","title":"Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty","volume":106,"date_created":"2018-05-23T15:08:23Z","author":[{"first_name":"Dominik","id":"14368","full_name":"Gutt, Dominik","last_name":"Gutt"},{"first_name":"Tobias","last_name":"von Rechenberg","full_name":"von Rechenberg, Tobias"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"publisher":"Elsevier","date_updated":"2022-01-06T06:58:02Z","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"gutt-main.pdf","file_id":"5304","access_level":"closed","file_size":572670,"creator":"ups","date_created":"2018-11-02T15:29:22Z","date_updated":"2018-11-02T15:29:22Z"}],"publication":"Journal of Business Research","type":"journal_article","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:29:22Z","ddc":["000"],"department":[{"_id":"276"}],"user_id":"16205","_id":"2834","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}]},{"title":"Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets","doi":"10.3390/su12156185","date_updated":"2022-01-06T06:54:52Z","date_created":"2021-02-26T13:15:09Z","author":[{"first_name":"Daniel","id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann"}],"volume":12,"year":"2020","citation":{"ieee":"D. Kaimann, “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets,” <i>Sustainability</i>, vol. 12, no. 15, 2020.","chicago":"Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets.” <i>Sustainability</i> 12, no. 15 (2020). <a href=\"https://doi.org/10.3390/su12156185\">https://doi.org/10.3390/su12156185</a>.","ama":"Kaimann D. Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets. <i>Sustainability</i>. 2020;12(15). doi:<a href=\"https://doi.org/10.3390/su12156185\">10.3390/su12156185</a>","apa":"Kaimann, D. (2020). Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets. <i>Sustainability</i>, <i>12</i>(15). <a href=\"https://doi.org/10.3390/su12156185\">https://doi.org/10.3390/su12156185</a>","short":"D. Kaimann, Sustainability 12 (2020).","bibtex":"@article{Kaimann_2020, title={Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets}, volume={12}, DOI={<a href=\"https://doi.org/10.3390/su12156185\">10.3390/su12156185</a>}, number={156185}, journal={Sustainability}, author={Kaimann, Daniel}, year={2020} }","mla":"Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer Markets.” <i>Sustainability</i>, vol. 12, no. 15, 6185, 2020, doi:<a href=\"https://doi.org/10.3390/su12156185\">10.3390/su12156185</a>."},"intvolume":"        12","publication_status":"published","publication_identifier":{"issn":["2071-1050"]},"issue":"15","article_number":"6185","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"21287","user_id":"18949","department":[{"_id":"183"}],"abstract":[{"text":"<jats:p>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.</jats:p>","lang":"eng"}],"status":"public","type":"journal_article","publication":"Sustainability"},{"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."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-07-14T07:56:52Z","creator":"tillk","date_created":"2020-07-14T07:56:52Z","file_size":1271416,"access_level":"closed","file_name":"3350755.3400281.pdf","file_id":"17373"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2005.08391"]},"year":"2020","title":"The Online Multi-Commodity Facility Location Problem","date_created":"2020-07-14T07:53:20Z","status":"public","type":"conference","file_date_updated":"2020-07-14T07:56:52Z","_id":"17370","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"39241","citation":{"ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 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 <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>.","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.","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450369350"]},"publication_status":"published","doi":"10.1145/3350755.3400281","date_updated":"2022-01-06T06:53:10Z","author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"volume":12156,"date_created":"2020-08-12T07:54:22Z","date_updated":"2022-01-06T06:53:20Z","publisher":"Springer","doi":"10.1007/978-3-030-54921-3","title":"Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings","publication_identifier":{"isbn":["978-3-030-54920-6"]},"intvolume":"     12156","citation":{"ama":"Werneck Richa A, Scheideler C, eds. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol 12156. Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>","ieee":"A. Werneck Richa and C. Scheideler, Eds., <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>, vol. 12156. Springer, 2020.","chicago":"Werneck Richa, Andrea, and Christian Scheideler, eds. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-54921-3\">https://doi.org/10.1007/978-3-030-54921-3</a>.","apa":"Werneck Richa, A., &#38; Scheideler, C. (Eds.). (2020). <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i> (Vol. 12156). Springer. <a href=\"https://doi.org/10.1007/978-3-030-54921-3\">https://doi.org/10.1007/978-3-030-54921-3</a>","mla":"Werneck Richa, Andrea, and Christian Scheideler, editors. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol. 12156, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>.","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={<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","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."},"year":"2020","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","_id":"17836","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"type":"conference_editor","status":"public","editor":[{"last_name":"Werneck Richa","full_name":"Werneck Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}]},{"doi":"10.1145/3350755","title":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020","date_created":"2020-08-12T07:57:10Z","publisher":"ACM","date_updated":"2022-01-06T06:53:20Z","citation":{"chicago":"Scheideler, Christian, and Michael Spear, eds. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020. <a href=\"https://doi.org/10.1145/3350755\">https://doi.org/10.1145/3350755</a>.","ieee":"C. Scheideler and M. Spear, Eds., <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020.","ama":"Scheideler C, Spear M, eds. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>","apa":"Scheideler, C., &#38; Spear, M. (Eds.). (2020). <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM. <a href=\"https://doi.org/10.1145/3350755\">https://doi.org/10.1145/3350755</a>","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={<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>}, publisher={ACM}, year={2020} }","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.","mla":"Scheideler, Christian, and Michael Spear, editors. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>."},"year":"2020","publication_identifier":{"isbn":["978-1-4503-6935-0"]},"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"17839","status":"public","editor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Spear","full_name":"Spear, Michael","first_name":"Michael"}],"type":"conference_editor"},{"type":"mastersthesis","status":"public","user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"20495","language":[{"iso":"eng"}],"citation":{"chicago":"Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>, 2020.","ieee":"M. Jochmaring, <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>. 2020.","ama":"Jochmaring M. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>.; 2020.","apa":"Jochmaring, M. (2020). <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>.","short":"M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.","bibtex":"@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }","mla":"Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>. 2020."},"year":"2020","date_created":"2020-11-25T07:03:16Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"last_name":"Jochmaring","full_name":"Jochmaring, Moritz","first_name":"Moritz"}],"date_updated":"2022-01-06T06:54:27Z","title":"A self stabilizing protocol for well-formed trees in hybrid networks"},{"title":"Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2020-12-16T10:20:18Z","year":"2020","ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2007.01191"]},"abstract":[{"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","lang":"eng"}],"file":[{"file_size":867373,"access_level":"closed","file_name":"Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf","file_id":"20756","date_updated":"2020-12-16T10:18:50Z","date_created":"2020-12-16T10:18:50Z","creator":"mfeldma2","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)","doi":"10.4230/LIPIcs.OPODIS.2020.31","date_updated":"2022-01-06T06:54:36Z","author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"citation":{"bibtex":"@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>}, 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} }","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.","mla":"Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>.","apa":"Feldmann, M., Hinnenthal, K., &#38; Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>","chicago":"Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>.","ieee":"M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2020.","ama":"Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>"},"has_accepted_license":"1","file_date_updated":"2020-12-16T10:18:50Z","_id":"20755","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"79"}],"user_id":"23538","status":"public","type":"conference"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18066","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. 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} }","mla":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","short":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.","ama":"Skowronek M. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn; 2020.","chicago":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","ieee":"M. Skowronek, <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020."},"year":"2020","title":"Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"full_name":"Skowronek, Michael","last_name":"Skowronek","first_name":"Michael"}],"date_created":"2020-08-20T07:40:58Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"18648","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2020-08-31T07:14:51Z","author":[{"last_name":"Guggenmos","full_name":"Guggenmos, Andreas","first_name":"Andreas"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:50Z","publisher":"Universität Paderborn","title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen","citation":{"ama":"Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn; 2020.","chicago":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","ieee":"A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","mla":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.","apa":"Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn."},"year":"2020"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"dkaimann","date_created":"2018-11-08T10:18:19Z","date_updated":"2018-11-08T10:18:19Z","file_id":"5429","access_level":"closed","file_name":"AEL_2018_Kaimann.pdf","file_size":163015}],"publication":"Applied Economics Letters","language":[{"iso":"eng"}],"ddc":["330"],"year":"2020","issue":"16","title":"Ancillary market signaling: A two-stage model of economic reputation on ancillary market success","date_created":"2018-10-10T11:46:19Z","status":"public","type":"journal_article","file_date_updated":"2018-11-08T10:18:19Z","user_id":"18949","department":[{"_id":"183"}],"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"1","name":"SFB 901"}],"_id":"4627","citation":{"chicago":"Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” <i>Applied Economics Letters</i> 27, no. 16 (2020): 1366–70. <a href=\"https://doi.org/10.1080/13504851.2019.1683136\">https://doi.org/10.1080/13504851.2019.1683136</a>.","ieee":"D. Kaimann, “Ancillary market signaling: A two-stage model of economic reputation on ancillary market success,” <i>Applied Economics Letters</i>, vol. 27, no. 16, pp. 1366–1370, 2020.","ama":"Kaimann D. Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. <i>Applied Economics Letters</i>. 2020;27(16):1366-1370. doi:<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>","apa":"Kaimann, D. (2020). Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. <i>Applied Economics Letters</i>, <i>27</i>(16), 1366–1370. <a href=\"https://doi.org/10.1080/13504851.2019.1683136\">https://doi.org/10.1080/13504851.2019.1683136</a>","mla":"Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” <i>Applied Economics Letters</i>, vol. 27, no. 16, 2020, pp. 1366–70, doi:<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>.","short":"D. Kaimann, Applied Economics Letters 27 (2020) 1366–1370.","bibtex":"@article{Kaimann_2020, title={Ancillary market signaling: A two-stage model of economic reputation on ancillary market success}, volume={27}, DOI={<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>}, number={16}, journal={Applied Economics Letters}, author={Kaimann, Daniel}, year={2020}, pages={1366–1370} }"},"page":"1366-1370","intvolume":"        27","has_accepted_license":"1","doi":"10.1080/13504851.2019.1683136","author":[{"first_name":"Daniel","full_name":"Kaimann, Daniel","id":"18949","last_name":"Kaimann"}],"volume":27,"date_updated":"2022-01-06T07:01:15Z"},{"type":"journal_article","publication":"ACM Computing Surveys","status":"public","abstract":[{"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","lang":"eng"}],"user_id":"23538","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"16902","language":[{"iso":"eng"}],"citation":{"short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>.","bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","apa":"Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>","ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, 2020. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>."},"year":"2020","date_created":"2020-04-29T07:09:50Z","author":[{"full_name":"Feldmann, Michael","id":"23538","last_name":"Feldmann","first_name":"Michael"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"date_updated":"2022-01-06T06:52:58Z","publisher":"ACM","doi":"10.1145/3397190","title":"Survey on Algorithms for Self-Stabilizing Overlay Networks"},{"citation":{"short":"N. Stroh-Maraun, Mechanisms, Preferences, and Heterogeneity in Matching Markets, Universität Paderborn, 2020.","mla":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>.","bibtex":"@book{Stroh-Maraun_2020, title={Mechanisms, Preferences, and Heterogeneity in Matching Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2020} }","apa":"Stroh-Maraun, N. (2020). <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>","chicago":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>.","ieee":"N. Stroh-Maraun, <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020.","ama":"Stroh-Maraun N. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>"},"year":"2020","date_created":"2020-04-29T08:29:45Z","author":[{"last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja","first_name":"Nadja"}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_updated":"2022-01-06T06:52:58Z","publisher":"Universität Paderborn","doi":"10.17619/UNIPB/1-958","title":"Mechanisms, Preferences, and Heterogeneity in Matching Markets","type":"dissertation","status":"public","user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"16910","language":[{"iso":"eng"}]},{"title":"Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior","conference":{"location":"Virtual Conference/Workshop","name":"28th European Conference on Information Systems (ECIS)"},"date_updated":"2022-01-06T06:52:59Z","author":[{"id":"64464","full_name":"Seutter, Janina","last_name":"Seutter","first_name":"Janina"},{"first_name":"Jürgen","last_name":"Neumann","id":"32456","full_name":"Neumann, Jürgen"}],"date_created":"2020-05-14T09:33:34Z","year":"2020","citation":{"short":"J. Seutter, J. Neumann, in: Proceedings of the 28th European Conference on Information Systems (ECIS), n.d.","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} }","mla":"Seutter, Janina, and Jürgen Neumann. “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior.” <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>.","apa":"Seutter, J., &#38; Neumann, J. (n.d.). Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior. In <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop.","chicago":"Seutter, Janina, and Jürgen Neumann. “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior.” In <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>, n.d.","ieee":"J. Seutter and J. Neumann, “Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior,” in <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop.","ama":"Seutter J, Neumann J. Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior. In: <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>."},"publication_status":"accepted","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"16951","user_id":"16205","department":[{"_id":"276"}],"status":"public","type":"conference","publication":"Proceedings of the 28th European Conference on Information Systems (ECIS)"},{"type":"conference","publication":"Proceedings of the 28th European Conference on Information Systems (ECIS)","status":"public","user_id":"16205","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"16952","language":[{"iso":"eng"}],"publication_status":"accepted","citation":{"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} }","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.” <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>.","short":"M. Poniatowski, J. Neumann, in: Proceedings of the 28th European Conference on Information Systems (ECIS), n.d.","apa":"Poniatowski, M., &#38; 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 <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop.","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 <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>, 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 <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop.","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: <i>Proceedings of the 28th European Conference on Information Systems (ECIS)</i>."},"year":"2020","date_created":"2020-05-14T09:36:33Z","author":[{"full_name":"Poniatowski, Martin","id":"32441","last_name":"Poniatowski","first_name":"Martin"},{"last_name":"Neumann","id":"32456","full_name":"Neumann, Jürgen","first_name":"Jürgen"}],"date_updated":"2022-01-06T06:52:59Z","conference":{"location":"Virtual Conference/Workshop","name":"28th European Conference on Information Systems (ECIS)"},"title":"Getting Personal with Review Systems –  Analyzing the Influence of Personality Traits on the Relationship between Review Templates and Reviewing Behavior"},{"status":"public","file":[{"date_updated":"2020-01-24T08:19:38Z","date_created":"2020-01-24T08:19:38Z","creator":"florida","file_size":633652,"file_id":"15634","access_level":"closed","file_name":"DissertationFeldkord.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"type":"dissertation","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-01-24T08:19:38Z","_id":"15631","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"15415","year":"2020","place":"Universität Paderborn","citation":{"apa":"Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>}, author={Feldkord, Björn}, year={2020} }","mla":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>.","ieee":"B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020.","chicago":"Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-869\">https://doi.org/10.17619/UNIPB/1-869</a>.","ama":"Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-869\">10.17619/UNIPB/1-869</a>"},"has_accepted_license":"1","title":"Mobile Resource Allocation","doi":"10.17619/UNIPB/1-869","date_updated":"2022-01-06T06:52:31Z","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704","first_name":"Björn"}],"date_created":"2020-01-23T14:20:25Z"}]