[{"author":[{"first_name":"Christina","last_name":"Unger","full_name":"Unger, Christina"},{"last_name":"Forascu","full_name":"Forascu, Corina","first_name":"Corina"},{"first_name":"Vanessa","last_name":"López","full_name":"López, Vanessa"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"},{"full_name":"Cabrio, Elena","last_name":"Cabrio","first_name":"Elena"},{"full_name":"Cimiano, Philipp","last_name":"Cimiano","first_name":"Philipp"},{"first_name":"Sebastian","last_name":"Walter","full_name":"Walter, Sebastian"}],"date_created":"2021-10-18T20:33:35Z","volume":1391,"publisher":"CEUR-WS.org","date_updated":"2022-01-06T06:57:20Z","title":"Question Answering over Linked Data (QALD-5)","citation":{"ama":"Unger C, Forascu C, López V, et al. Question Answering over Linked Data (QALD-5). In: Cappellato L, Ferro N, J. F. Jones G, SanJuan E, eds. <i>Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse, France, September 8-11, 2015</i>. Vol 1391. {CEUR} Workshop Proceedings. CEUR-WS.org; 2015.","ieee":"C. Unger <i>et al.</i>, “Question Answering over Linked Data (QALD-5),” in <i>Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015</i>, 2015, vol. 1391.","chicago":"Unger, Christina, Corina Forascu, Vanessa López, Axel-Cyrille Ngonga Ngomo, Elena Cabrio, Philipp Cimiano, and Sebastian Walter. “Question Answering over Linked Data (QALD-5).” In <i>Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse, France, September 8-11, 2015</i>, edited by Linda Cappellato, Nicola Ferro, Gareth J. F. Jones, and Eric SanJuan, Vol. 1391. {CEUR} Workshop Proceedings. CEUR-WS.org, 2015.","mla":"Unger, Christina, et al. “Question Answering over Linked Data (QALD-5).” <i>Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse, France, September 8-11, 2015</i>, edited by Linda Cappellato et al., vol. 1391, CEUR-WS.org, 2015.","bibtex":"@inproceedings{Unger_Forascu_López_Ngonga Ngomo_Cabrio_Cimiano_Walter_2015, series={{CEUR} Workshop Proceedings}, title={Question Answering over Linked Data (QALD-5)}, volume={1391}, booktitle={Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015}, publisher={CEUR-WS.org}, author={Unger, Christina and Forascu, Corina and López, Vanessa and Ngonga Ngomo, Axel-Cyrille and Cabrio, Elena and Cimiano, Philipp and Walter, Sebastian}, editor={Cappellato, Linda and Ferro, Nicola and J. F. Jones, Gareth and SanJuan, Eric}, year={2015}, collection={{CEUR} Workshop Proceedings} }","short":"C. Unger, C. Forascu, V. López, A.-C. Ngonga Ngomo, E. Cabrio, P. Cimiano, S. Walter, in: L. Cappellato, N. Ferro, G. J. F. Jones, E. SanJuan (Eds.), Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse, France, September 8-11, 2015, CEUR-WS.org, 2015.","apa":"Unger, C., Forascu, C., López, V., Ngonga Ngomo, A.-C., Cabrio, E., Cimiano, P., &#38; Walter, S. (2015). Question Answering over Linked Data (QALD-5). In L. Cappellato, N. Ferro, G. J. F. Jones, &#38; E. SanJuan (Eds.), <i>Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015</i> (Vol. 1391). CEUR-WS.org."},"intvolume":"      1391","year":"2015","series_title":"{CEUR} Workshop Proceedings","user_id":"15526","_id":"26434","language":[{"iso":"eng"}],"type":"conference","publication":"Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015","status":"public","editor":[{"full_name":"Cappellato, Linda","last_name":"Cappellato","first_name":"Linda"},{"full_name":"Ferro, Nicola","last_name":"Ferro","first_name":"Nicola"},{"last_name":"J. F. Jones","full_name":"J. F. Jones, Gareth","first_name":"Gareth"},{"first_name":"Eric","last_name":"SanJuan","full_name":"SanJuan, Eric"}]},{"title":"Online Resource Leasing","doi":"10.1145/2767386.2767454","date_updated":"2022-01-06T06:57:22Z","author":[{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:41:44Z","year":"2015","citation":{"apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344."},"page":"343-344","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-21T09:33:11Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"266","user_id":"15504","department":[{"_id":"63"}],"abstract":[{"text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". ","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-21T09:33:11Z","date_updated":"2018-03-21T09:33:11Z","access_level":"closed","file_id":"1478","file_name":"266-p343-markarian.pdf","file_size":679580,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)"},{"status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>The growth hormone (GH) insulin-like growth factor (IGF) axis has been linked to insulin metabolism and cancer risk. Experimental evidence indicates that the GH–IGF axis itself can be influenced by dietary flavonoids. As fruit and vegetable (FV) intake is a major source of flavonoid consumption, FV’s beneficial health effects may be explained via flavonoids’ influence on the GH–IGF axis, but observational evidence is currently rare. We used data from Dortmund Nutritional and Anthropometric Longitudinally Designed Study participants to analyse prospective associations between FV, fruit intake and flavonoid intake from FV (FlavFV) with IGF-1 and its binding proteins IGFBP-2 and IGFBP-3. Subjects needed to provide a fasting blood sample in adulthood (18–39 years) and at least two 3-d weighed dietary records in early life (0·5−2 years,<jats:italic>n</jats:italic>191), mid-childhood (3−7 years,<jats:italic>n</jats:italic>265) or adolescence (girls: 9−15 years, boys: 10−16 years,<jats:italic>n</jats:italic>261). Additional analyses were conducted among those providing at least three 24-h urine samples in adolescence (<jats:italic>n</jats:italic>236) to address the predictor urinary hippuric acid (HA), a biomarker of polyphenol intake. Higher fruit intake in mid-childhood and adolescence was related to higher IGFBP-2 in adulthood (<jats:italic>P</jats:italic>=0·03 and<jats:italic>P</jats:italic>=0·045). Comparable trends (<jats:italic>P</jats:italic>=0·045−0·09) were discernable for FV intake (but not FlavFV) in all three time windows. Similarly, higher adolescent HA excretion tended to be related (<jats:italic>P</jats:italic>=0·06) to higher adult IGFBP-2 levels. Regarding IGFBP-3, a marginal (<jats:italic>P</jats:italic>=0·08) positive association was observed with FlavFV in mid-childhood only. None of the investigated dietary factors was related to IGF-1. In conclusion, higher fruit and FV intakes during growth may be relevant for adult IGFBP-2, but probably not for IGFBP-3 or IGF-1.</jats:p>"}],"publication":"British Journal of Nutrition","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"17"},{"_id":"22"},{"_id":"571"}],"user_id":"61597","_id":"26921","page":"527-537","citation":{"bibtex":"@article{Krupp_Remer_Penczynski_Bolzenius_Wudy_Buyken_2015, title={Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood}, DOI={<a href=\"https://doi.org/10.1017/s0007114515004742\">10.1017/s0007114515004742</a>}, journal={British Journal of Nutrition}, author={Krupp, Danika and Remer, Thomas and Penczynski, Katharina J. and Bolzenius, Katja and Wudy, Stefan A. and Buyken, Anette}, year={2015}, pages={527–537} }","short":"D. Krupp, T. Remer, K.J. Penczynski, K. Bolzenius, S.A. Wudy, A. Buyken, British Journal of Nutrition (2015) 527–537.","mla":"Krupp, Danika, et al. “Relevance of Fruits, Vegetables and Flavonoids from Fruits and Vegetables during Early Life, Mid-Childhood and Adolescence for Levels of Insulin-like Growth Factor (IGF-1) and Its Binding Proteins IGFBP-2 and IGFBP-3 in Young Adulthood.” <i>British Journal of Nutrition</i>, 2015, pp. 527–37, doi:<a href=\"https://doi.org/10.1017/s0007114515004742\">10.1017/s0007114515004742</a>.","apa":"Krupp, D., Remer, T., Penczynski, K. J., Bolzenius, K., Wudy, S. A., &#38; Buyken, A. (2015). Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood. <i>British Journal of Nutrition</i>, 527–537. <a href=\"https://doi.org/10.1017/s0007114515004742\">https://doi.org/10.1017/s0007114515004742</a>","chicago":"Krupp, Danika, Thomas Remer, Katharina J. Penczynski, Katja Bolzenius, Stefan A. Wudy, and Anette Buyken. “Relevance of Fruits, Vegetables and Flavonoids from Fruits and Vegetables during Early Life, Mid-Childhood and Adolescence for Levels of Insulin-like Growth Factor (IGF-1) and Its Binding Proteins IGFBP-2 and IGFBP-3 in Young Adulthood.” <i>British Journal of Nutrition</i>, 2015, 527–37. <a href=\"https://doi.org/10.1017/s0007114515004742\">https://doi.org/10.1017/s0007114515004742</a>.","ieee":"D. Krupp, T. Remer, K. J. Penczynski, K. Bolzenius, S. A. Wudy, and A. Buyken, “Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood,” <i>British Journal of Nutrition</i>, pp. 527–537, 2015, doi: <a href=\"https://doi.org/10.1017/s0007114515004742\">10.1017/s0007114515004742</a>.","ama":"Krupp D, Remer T, Penczynski KJ, Bolzenius K, Wudy SA, Buyken A. Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood. <i>British Journal of Nutrition</i>. Published online 2015:527-537. doi:<a href=\"https://doi.org/10.1017/s0007114515004742\">10.1017/s0007114515004742</a>"},"year":"2015","publication_identifier":{"issn":["0007-1145","1475-2662"]},"publication_status":"published","doi":"10.1017/s0007114515004742","title":"Relevance of fruits, vegetables and flavonoids from fruits and vegetables during early life, mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood","author":[{"first_name":"Danika","last_name":"Krupp","full_name":"Krupp, Danika"},{"full_name":"Remer, Thomas","last_name":"Remer","first_name":"Thomas"},{"first_name":"Katharina J.","full_name":"Penczynski, Katharina J.","last_name":"Penczynski"},{"first_name":"Katja","full_name":"Bolzenius, Katja","last_name":"Bolzenius"},{"last_name":"Wudy","full_name":"Wudy, Stefan A.","first_name":"Stefan A."},{"first_name":"Anette","last_name":"Buyken","id":"65985","full_name":"Buyken, Anette"}],"date_created":"2021-10-26T14:31:53Z","date_updated":"2022-01-06T06:57:30Z"},{"title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","date_created":"2017-10-17T12:41:54Z","publisher":"ACM","year":"2015","issue":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_created":"2018-03-20T07:40:55Z","creator":"florida","date_updated":"2018-03-20T07:40:55Z","file_id":"1433","access_level":"closed","file_name":"320-a2-caragiannis.pdf","file_size":260503,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.","lang":"eng"}],"publication":"Transactions on Economics and Computation","doi":"10.1145/2614687","author":[{"first_name":"Ioannis","last_name":"Caragiannis","full_name":"Caragiannis, Ioannis"},{"last_name":"Fanelli","full_name":"Fanelli, Angelo","first_name":"Angelo"},{"first_name":"Nick","last_name":"Gravin","full_name":"Gravin, Nick"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"volume":3,"date_updated":"2022-01-06T06:59:04Z","citation":{"ama":"Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>","chicago":"Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i> 3, no. 1 (2015). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>.","ieee":"I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2015.","apa":"Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>","bibtex":"@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).","mla":"Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>."},"intvolume":"         3","has_accepted_license":"1","file_date_updated":"2018-03-20T07:40:55Z","article_number":"2","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"320","status":"public","type":"journal_article"},{"ddc":["040"],"file_date_updated":"2018-03-20T07:38:02Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"327","user_id":"477","department":[{"_id":"79"}],"abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.","lang":"eng"}],"file":[{"access_level":"closed","file_id":"1427","file_name":"327-KKS15-TOCS_01.pdf","file_size":398044,"creator":"florida","date_created":"2018-03-20T07:38:02Z","date_updated":"2018-03-20T07:38:02Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Theoretical Computer Science","title":"A deterministic worst-case message complexity optimal solution for resource discovery","doi":"10.1016/j.tcs.2014.11.027","publisher":"Elsevier","date_updated":"2022-01-06T06:59:08Z","date_created":"2017-10-17T12:41:55Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"year":"2015","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>"},"page":"67-79","has_accepted_license":"1"},{"publication":"Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)","abstract":[{"lang":"eng","text":"Opinion mining from physician rating websites depends on the quality of the extracted information. Sometimes reviews are user-error prone and the assigned stars or grades contradict the associated content. We therefore aim at detecting random individual error within reviews. Such errors comprise the disagreement in polarity of review texts and the respective ratings. The challenges that thereby arise are (1) the content and sentiment analysis of the review texts and (2) the removal of the random individual errors contained therein. To solve these tasks, we assign polarities to automatically recognized opinion phrases in reviews and then check for divergence in rating and text polarity. The novelty of our approach is that we improve user-generated data quality by excluding error-prone reviews on German physician websites from average ratings."}],"file":[{"file_id":"1463","access_level":"closed","file_name":"293-IEA_AIE2015.pdf","file_size":292847,"creator":"florida","date_created":"2018-03-21T09:21:30Z","date_updated":"2018-03-21T09:21:30Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"quality_controlled":"1","year":"2015","publisher":"Springer","date_created":"2017-10-17T12:41:49Z","title":"Filtering Reviews by Random Individual Error","type":"book_chapter","editor":[{"full_name":"Ali, Moonis ","last_name":"Ali","first_name":"Moonis "},{"first_name":"Young Sig","full_name":"Kwon, Young Sig","last_name":"Kwon"},{"last_name":"Lee","full_name":"Lee, Chang-Hwan","first_name":"Chang-Hwan"},{"full_name":"Kim, Juntae ","last_name":"Kim","first_name":"Juntae "},{"first_name":"Yongdai ","last_name":"Kim","full_name":"Kim, Yongdai "}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"_id":"293","user_id":"42496","series_title":"Lecture Notes in Artificial Intelligence","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"file_date_updated":"2018-03-21T09:21:30Z","publication_status":"published","has_accepted_license":"1","publication_identifier":{"eisbn":["978-3-319-19066-2"],"isbn":["978-3-319-19065-5"]},"place":"Cham, Switzerland","citation":{"ama":"Geierhos M, Bäumer FS, Schulze S, Stuß V. Filtering Reviews by Random Individual Error. In: Ali M, Kwon YS, Lee C-H, Kim J, Kim Y, eds. <i>Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)</i>. Vol 9101. Lecture Notes in Artificial Intelligence. Cham, Switzerland: Springer; 2015:305-315. doi:<a href=\"https://doi.org/10.1007/978-3-319-19066-2_30\">10.1007/978-3-319-19066-2_30</a>","ieee":"M. Geierhos, F. S. Bäumer, S. Schulze, and V. Stuß, “Filtering Reviews by Random Individual Error,” in <i>Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)</i>, vol. 9101, M. Ali, Y. S. Kwon, C.-H. Lee, J. Kim, and Y. Kim, Eds. Cham, Switzerland: Springer, 2015, pp. 305–315.","chicago":"Geierhos, Michaela, Frederik Simon Bäumer, Sabine Schulze, and Valentina Stuß. “Filtering Reviews by Random Individual Error.” In <i>Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)</i>, edited by Moonis  Ali, Young Sig Kwon, Chang-Hwan Lee, Juntae  Kim, and Yongdai  Kim, 9101:305–15. Lecture Notes in Artificial Intelligence. Cham, Switzerland: Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-19066-2_30\">https://doi.org/10.1007/978-3-319-19066-2_30</a>.","short":"M. Geierhos, F.S. Bäumer, S. Schulze, V. Stuß, in: M. Ali, Y.S. Kwon, C.-H. Lee, J. Kim, Y. Kim (Eds.), Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015), Springer, Cham, Switzerland, 2015, pp. 305–315.","mla":"Geierhos, Michaela, et al. “Filtering Reviews by Random Individual Error.” <i>Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)</i>, edited by Moonis  Ali et al., vol. 9101, Springer, 2015, pp. 305–15, doi:<a href=\"https://doi.org/10.1007/978-3-319-19066-2_30\">10.1007/978-3-319-19066-2_30</a>.","bibtex":"@inbook{Geierhos_Bäumer_Schulze_Stuß_2015, place={Cham, Switzerland}, series={Lecture Notes in Artificial Intelligence}, title={Filtering Reviews by Random Individual Error}, volume={9101}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-19066-2_30\">10.1007/978-3-319-19066-2_30</a>}, booktitle={Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)}, publisher={Springer}, author={Geierhos, Michaela and Bäumer, Frederik Simon and Schulze, Sabine and Stuß, Valentina}, editor={Ali, Moonis  and Kwon, Young Sig and Lee, Chang-Hwan and Kim, Juntae  and Kim, Yongdai Editors}, year={2015}, pages={305–315}, collection={Lecture Notes in Artificial Intelligence} }","apa":"Geierhos, M., Bäumer, F. S., Schulze, S., &#38; Stuß, V. (2015). Filtering Reviews by Random Individual Error. In M. Ali, Y. S. Kwon, C.-H. Lee, J. Kim, &#38; Y. Kim (Eds.), <i>Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)</i> (Vol. 9101, pp. 305–315). Cham, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-19066-2_30\">https://doi.org/10.1007/978-3-319-19066-2_30</a>"},"intvolume":"      9101","page":"305-315","date_updated":"2022-01-06T06:58:47Z","author":[{"last_name":"Geierhos","orcid":"0000-0002-8180-5606","id":"42496","full_name":"Geierhos, Michaela","first_name":"Michaela"},{"first_name":"Frederik Simon","last_name":"Bäumer","id":"38837","full_name":"Bäumer, Frederik Simon"},{"last_name":"Schulze","full_name":"Schulze, Sabine","first_name":"Sabine"},{"first_name":"Valentina","full_name":"Stuß, Valentina","last_name":"Stuß"}],"volume":9101,"doi":"10.1007/978-3-319-19066-2_30","conference":{"name":"28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)","start_date":"2015-06-10","end_date":"2015-06-12","location":"Seoul, South Korea"}},{"file_date_updated":"2018-03-20T07:46:19Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"304","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"304-Dissertation_-_Koutsopoulos.pdf","file_id":"1441","file_size":2275834,"date_created":"2018-03-20T07:46:19Z","creator":"florida","date_updated":"2018-03-20T07:46:19Z"}],"status":"public","type":"dissertation","title":"Dynamics and Efficiency in Topological Self-Stabilization","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"}],"date_created":"2017-10-17T12:41:51Z","date_updated":"2022-01-06T06:58:53Z","publisher":"Universität Paderborn","citation":{"mla":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","bibtex":"@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }","short":"A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015.","apa":"Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn.","ieee":"A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","chicago":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ama":"Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn; 2015."},"year":"2015","has_accepted_license":"1"},{"title":"Distributed Data Structures and the Power of topological Self-Stabilization","date_updated":"2022-01-06T06:58:54Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:51Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"}],"year":"2015","citation":{"ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015.","apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn.","bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-13T09:14:43Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"305","user_id":"15504","department":[{"_id":"79"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-13T09:14:43Z","date_updated":"2018-03-13T09:14:43Z","access_level":"closed","file_name":"305-Dissertation_-_Kniesburges.pdf","file_id":"1206","file_size":1709094}],"status":"public","type":"dissertation"},{"type":"dissertation","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:30:02Z","date_created":"2018-03-21T09:30:02Z","creator":"florida","file_size":448614,"access_level":"closed","file_name":"270-Dissertation_-_Abshoff.pdf","file_id":"1476"}],"_id":"270","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:30:02Z","has_accepted_license":"1","year":"2015","citation":{"bibtex":"@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }","mla":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","apa":"Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn.","ieee":"S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn, 2015.","chicago":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","ama":"Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn; 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:32Z","date_created":"2017-10-17T12:41:44Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks"},{"title":"Non-preemptive Scheduling on Machines with Setup Times","doi":"10.1007/978-3-319-21840-3_45","date_updated":"2022-01-06T06:57:39Z","date_created":"2017-10-17T12:41:45Z","author":[{"full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker","first_name":"Alexander"},{"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"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"year":"2015","page":"542--553","citation":{"chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, 2015, pp. 542--553.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553. doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553). <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne et al., 2015, pp. 542--553, doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-21T09:28:34Z","_id":"274","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","abstract":[{"text":"Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.","lang":"eng"}],"editor":[{"last_name":"Dehne","full_name":"Dehne, Frank","first_name":"Frank"},{"full_name":"Sack, Jörg Rüdiger","last_name":"Sack","first_name":"Jörg Rüdiger"},{"last_name":"Stege","full_name":"Stege, Ulrike","first_name":"Ulrike"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:28:34Z","date_updated":"2018-03-21T09:28:34Z","access_level":"closed","file_id":"1473","file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","file_size":215498}],"publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","type":"conference"},{"citation":{"bibtex":"@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network Creation Games: Think Global - Act Local}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>}, booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015}, pages={248--260}, collection={LNCS} }","short":"A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.","mla":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260, doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>.","apa":"Cord-Landwehr, A., &#38; Lenzner, P. (2015). Network Creation Games: Think Global - Act Local. In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i> (pp. 248--260). <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>","ieee":"A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260.","chicago":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 248--260. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>.","ama":"Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local. In: <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>. LNCS. ; 2015:248--260. doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>"},"page":"248--260","year":"2015","has_accepted_license":"1","doi":"10.1007/978-3-662-48054-0_21","title":"Network Creation Games: Think Global - Act Local","date_created":"2017-10-17T12:41:45Z","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"last_name":"Lenzner","full_name":"Lenzner, Pascal","first_name":"Pascal"}],"date_updated":"2022-01-06T06:57:40Z","file":[{"date_updated":"2018-03-21T09:27:12Z","creator":"florida","date_created":"2018-03-21T09:27:12Z","file_size":279995,"file_name":"275-978-3-662-48054-0_21.pdf","access_level":"closed","file_id":"1472","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"text":"We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:27:12Z","ddc":["040"],"user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"275"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:43Z","author":[{"full_name":"Hohenberger, Till","last_name":"Hohenberger","first_name":"Till"}],"date_created":"2017-10-17T12:41:45Z","title":"Network Creation Games with Interest Groups","year":"2015","citation":{"ama":"Hohenberger T. <i>Network Creation Games with Interest Groups</i>. Universität Paderborn; 2015.","ieee":"T. Hohenberger, <i>Network Creation Games with Interest Groups</i>. Universität Paderborn, 2015.","chicago":"Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>. Universität Paderborn, 2015.","apa":"Hohenberger, T. (2015). <i>Network Creation Games with Interest Groups</i>. Universität Paderborn.","bibtex":"@book{Hohenberger_2015, title={Network Creation Games with Interest Groups}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2015} }","mla":"Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>. Universität Paderborn, 2015.","short":"T. Hohenberger, Network Creation Games with Interest Groups, Universität Paderborn, 2015."},"_id":"276","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"477","type":"mastersthesis","status":"public"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"278","user_id":"477","department":[{"_id":"79"}],"year":"2015","citation":{"bibtex":"@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann, Michael}, year={2015} }","mla":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","short":"M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs, Universität Paderborn, 2015.","apa":"Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn.","ama":"Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn; 2015.","chicago":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","ieee":"M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015."},"title":"Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:45Z","author":[{"first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538"}],"date_created":"2017-10-17T12:41:46Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"user_id":"7728","department":[{"_id":"157"}],"_id":"21505","language":[{"iso":"eng"}],"type":"conference","status":"public","author":[{"first_name":"David","id":"7728","full_name":"Hein, David","last_name":"Hein"},{"first_name":"Patrick","full_name":"Giese, Patrick","last_name":"Giese"},{"first_name":"Gerson","last_name":"Meschut","orcid":"0000-0002-2763-1246","id":"32056","full_name":"Meschut, Gerson"},{"last_name":"Gumbsch","full_name":"Gumbsch, Peter","first_name":"Peter"},{"first_name":"Silke","full_name":"Sommer, Silke","last_name":"Sommer"},{"first_name":"Matthias","full_name":"Bier, Matthias","last_name":"Bier"}],"date_created":"2021-03-15T14:15:21Z","date_updated":"2022-01-06T06:55:02Z","conference":{"name":"5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen Fügetechnik”","start_date":"2015-12-08","end_date":"2015-12-09","location":"Paderborn"},"title":"Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung","citation":{"apa":"Hein, D., Giese, P., Meschut, G., Gumbsch, P., Sommer, S., &#38; Bier, M. (2015). Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung. In FOSTA, EFB, DVS (Ed.). Presented at the 5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen Fügetechnik,” Paderborn.","bibtex":"@inproceedings{Hein_Giese_Meschut_Gumbsch_Sommer_Bier_2015, title={Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung}, author={Hein, David and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter and Sommer, Silke and Bier, Matthias}, editor={FOSTA, EFB, DVSEditor}, year={2015} }","short":"D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, M. Bier, in: FOSTA, EFB, DVS (Ed.), 2015.","mla":"Hein, David, et al. <i>Charakterisierung Und Modellierung von Mechanischen Fügeverbindungen Mit Einseitiger Zugänglichkeit Für Den Profilintensiven Leichtbau Unter Crashbelastung</i>. Edited by FOSTA, EFB, DVS, 2015.","ama":"Hein D, Giese P, Meschut G, Gumbsch P, Sommer S, Bier M. Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung. In: FOSTA, EFB, DVS, ed. ; 2015.","ieee":"D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, and M. Bier, “Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung,” presented at the 5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen Fügetechnik,” Paderborn, 2015.","chicago":"Hein, David, Patrick Giese, Gerson Meschut, Peter Gumbsch, Silke Sommer, and Matthias Bier. “Charakterisierung Und Modellierung von Mechanischen Fügeverbindungen Mit Einseitiger Zugänglichkeit Für Den Profilintensiven Leichtbau Unter Crashbelastung.” edited by FOSTA, EFB, DVS, 2015."},"corporate_editor":["FOSTA, EFB, DVS"],"year":"2015"},{"author":[{"first_name":"David","last_name":"Hein","id":"7728","full_name":"Hein, David"},{"last_name":"Giese","full_name":"Giese, Patrick","first_name":"Patrick"},{"first_name":"Gerson","id":"32056","full_name":"Meschut, Gerson","orcid":"0000-0002-2763-1246","last_name":"Meschut"},{"last_name":"Gumbsch","full_name":"Gumbsch, Peter","first_name":"Peter"},{"first_name":"Silke","full_name":"Sommer, Silke","last_name":"Sommer"},{"first_name":"Matthias","full_name":"Bier, Matthias","last_name":"Bier"},{"last_name":"Iwainsky","full_name":"Iwainsky, Alfred","first_name":"Alfred"},{"full_name":"Herfert, Daniel","last_name":"Herfert","first_name":"Daniel"},{"first_name":"Matthias","full_name":"Günther, Matthias","last_name":"Günther"}],"date_created":"2021-03-15T14:20:14Z","date_updated":"2022-01-06T06:55:02Z","conference":{"end_date":"2015-12-09","location":"Paderborn","name":"5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen Fügetechnik”","start_date":"2015-12-08"},"title":"Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen","citation":{"apa":"Hein, D., Giese, P., Meschut, G., Gumbsch, P., Sommer, S., Bier, M., … Günther, M. (2015). Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen. In FOSTA, EFB, DVS (Ed.), <i>5. Fügetechnisches Gemeinschaftskolloquium</i>. Paderborn.","bibtex":"@inproceedings{Hein_Giese_Meschut_Gumbsch_Sommer_Bier_Iwainsky_Herfert_Günther_2015, title={Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen}, booktitle={5. Fügetechnisches Gemeinschaftskolloquium}, author={Hein, David and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter and Sommer, Silke and Bier, Matthias and Iwainsky, Alfred and Herfert, Daniel and Günther, Matthias}, editor={FOSTA, EFB, DVSEditor}, year={2015} }","mla":"Hein, David, et al. “Daten- Und Prognosebasierte Generierung von Modellparametern Für Die Crashsimulation Mechanisch Gefügter Verbindungen.” <i>5. Fügetechnisches Gemeinschaftskolloquium</i>, edited by FOSTA, EFB, DVS, 2015.","short":"D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, M. Bier, A. Iwainsky, D. Herfert, M. Günther, in: FOSTA, EFB, DVS (Ed.), 5. Fügetechnisches Gemeinschaftskolloquium, 2015.","ieee":"D. Hein <i>et al.</i>, “Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen,” in <i>5. Fügetechnisches Gemeinschaftskolloquium</i>, Paderborn, 2015.","chicago":"Hein, David, Patrick Giese, Gerson Meschut, Peter Gumbsch, Silke Sommer, Matthias Bier, Alfred Iwainsky, Daniel Herfert, and Matthias Günther. “Daten- Und Prognosebasierte Generierung von Modellparametern Für Die Crashsimulation Mechanisch Gefügter Verbindungen.” In <i>5. Fügetechnisches Gemeinschaftskolloquium</i>, edited by FOSTA, EFB, DVS, 2015.","ama":"Hein D, Giese P, Meschut G, et al. Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen. In: FOSTA, EFB, DVS, ed. <i>5. Fügetechnisches Gemeinschaftskolloquium</i>. ; 2015."},"corporate_editor":["FOSTA, EFB, DVS"],"year":"2015","user_id":"7728","department":[{"_id":"157"}],"_id":"21506","language":[{"iso":"eng"}],"type":"conference","publication":"5. Fügetechnisches Gemeinschaftskolloquium","status":"public"},{"year":"2015","place":"Darmstadt","citation":{"apa":"Eke, N. O. (2015). <i>Das deutsche Drama im Überblick</i>. Darmstadt: Wissenschaftliche Buchgesellschaft.","bibtex":"@book{Eke_2015, place={Darmstadt}, title={Das deutsche Drama im Überblick}, publisher={Wissenschaftliche Buchgesellschaft}, author={Eke, Norbert Otto}, year={2015} }","short":"N.O. Eke, Das deutsche Drama im Überblick, Wissenschaftliche Buchgesellschaft, Darmstadt, 2015.","mla":"Eke, Norbert Otto. <i>Das deutsche Drama im Überblick</i>. Wissenschaftliche Buchgesellschaft, 2015.","chicago":"Eke, Norbert Otto. <i>Das deutsche Drama im Überblick</i>. Darmstadt: Wissenschaftliche Buchgesellschaft, 2015.","ieee":"N. O. Eke, <i>Das deutsche Drama im Überblick</i>. Darmstadt: Wissenschaftliche Buchgesellschaft, 2015.","ama":"Eke NO. <i>Das deutsche Drama im Überblick</i>. Darmstadt: Wissenschaftliche Buchgesellschaft; 2015."},"page":"236","title":"Das deutsche Drama im Überblick","date_updated":"2022-01-06T06:53:56Z","publisher":"Wissenschaftliche Buchgesellschaft","date_created":"2020-09-04T09:44:46Z","author":[{"first_name":"Norbert Otto","last_name":"Eke","id":"104","full_name":"Eke, Norbert Otto"}],"status":"public","type":"book","language":[{"iso":"ger"}],"_id":"18998","user_id":"14932","department":[{"_id":"465"}]},{"language":[{"iso":"ger"}],"user_id":"14932","department":[{"_id":"465"}],"_id":"19229","status":"public","editor":[{"first_name":"Axel","last_name":"Dunker","full_name":"Dunker, Axel"},{"full_name":"Kyora, Sabine","last_name":"Kyora","first_name":"Sabine"}],"type":"book_chapter","publication":"Arno Schmidt und der Kanon","title":"Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur","author":[{"last_name":"Eke","full_name":"Eke, Norbert Otto","id":"104","first_name":"Norbert Otto"}],"date_created":"2020-09-10T06:02:53Z","date_updated":"2022-01-06T06:54:00Z","publisher":"edition text & kritik","citation":{"ama":"Eke NO. Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur. In: Dunker A, Kyora S, eds. <i>Arno Schmidt und der Kanon</i>. München: edition text &#38; kritik; 2015:83-99.","ieee":"N. O. Eke, “Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur,” in <i>Arno Schmidt und der Kanon</i>, A. Dunker and S. Kyora, Eds. München: edition text &#38; kritik, 2015, pp. 83–99.","chicago":"Eke, Norbert Otto. “Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur.” In <i>Arno Schmidt und der Kanon</i>, edited by Axel Dunker and Sabine Kyora, 83–99. München: edition text &#38; kritik, 2015.","apa":"Eke, N. O. (2015). Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur. In A. Dunker &#38; S. Kyora (Eds.), <i>Arno Schmidt und der Kanon</i> (pp. 83–99). München: edition text &#38; kritik.","bibtex":"@inbook{Eke_2015, place={München}, title={Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur}, booktitle={Arno Schmidt und der Kanon}, publisher={edition text &#38; kritik}, author={Eke, Norbert Otto}, editor={Dunker, Axel and Kyora, SabineEditors}, year={2015}, pages={83–99} }","short":"N.O. Eke, in: A. Dunker, S. Kyora (Eds.), Arno Schmidt und der Kanon, edition text &#38; kritik, München, 2015, pp. 83–99.","mla":"Eke, Norbert Otto. “Arno Schmidts ‚Ort‘ innerhalb der Nachkriegsliteratur.” <i>Arno Schmidt und der Kanon</i>, edited by Axel Dunker and Sabine Kyora, edition text &#38; kritik, 2015, pp. 83–99."},"page":"83-99","place":"München","year":"2015"},{"place":"Paderborn","year":"2015","page":"325-338","citation":{"ama":"Eke NO. Der Witz als ästhetische Entautomatisierung. Shoah und Lachen. In: Meyer-Sickendiek B, Och G, eds. <i>Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie</i>. Paderborn: Fink; 2015:325-338.","ieee":"N. O. Eke, “Der Witz als ästhetische Entautomatisierung. Shoah und Lachen,” in <i>Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie</i>, B. Meyer-Sickendiek and G. Och, Eds. Paderborn: Fink, 2015, pp. 325–338.","chicago":"Eke, Norbert Otto. “Der Witz als ästhetische Entautomatisierung. Shoah und Lachen.” In <i>Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie</i>, edited by Burkhard Meyer-Sickendiek and Gunnar Och, 325–38. Paderborn: Fink, 2015.","apa":"Eke, N. O. (2015). Der Witz als ästhetische Entautomatisierung. Shoah und Lachen. In B. Meyer-Sickendiek &#38; G. Och (Eds.), <i>Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie</i> (pp. 325–338). Paderborn: Fink.","mla":"Eke, Norbert Otto. “Der Witz als ästhetische Entautomatisierung. Shoah und Lachen.” <i>Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie</i>, edited by Burkhard Meyer-Sickendiek and Gunnar Och, Fink, 2015, pp. 325–38.","bibtex":"@inbook{Eke_2015, place={Paderborn}, title={Der Witz als ästhetische Entautomatisierung. Shoah und Lachen}, booktitle={Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie}, publisher={Fink}, author={Eke, Norbert Otto}, editor={Meyer-Sickendiek, Burkhard and Och, GunnarEditors}, year={2015}, pages={325–338} }","short":"N.O. Eke, in: B. Meyer-Sickendiek, G. Och (Eds.), Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie, Fink, Paderborn, 2015, pp. 325–338."},"title":"Der Witz als ästhetische Entautomatisierung. Shoah und Lachen","date_updated":"2022-01-06T06:54:00Z","publisher":"Fink","date_created":"2020-09-10T06:05:55Z","author":[{"first_name":"Norbert Otto","last_name":"Eke","full_name":"Eke, Norbert Otto","id":"104"}],"editor":[{"full_name":"Meyer-Sickendiek, Burkhard","last_name":"Meyer-Sickendiek","first_name":"Burkhard"},{"last_name":"Och","full_name":"Och, Gunnar","first_name":"Gunnar"}],"status":"public","publication":"Der jüdische Witz. Zur unabgegoltenen Problematik einer alten Kategorie","type":"book_chapter","language":[{"iso":"ger"}],"_id":"19230","department":[{"_id":"465"}],"user_id":"14932"},{"title":"„Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung","date_updated":"2022-01-06T06:54:00Z","date_created":"2020-09-10T06:09:36Z","author":[{"first_name":"Norbert Otto","last_name":"Eke","full_name":"Eke, Norbert Otto","id":"104"}],"year":"2015","citation":{"mla":"Eke, Norbert Otto. “„Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung.” <i>Text + Kritik X/15</i>, no. H. 208, 2015, pp. 12–24.","bibtex":"@article{Eke_2015, title={„Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung}, number={H. 208}, journal={Text + Kritik X/15}, author={Eke, Norbert Otto}, year={2015}, pages={12–24} }","short":"N.O. Eke, Text + Kritik X/15 (2015) 12–24.","apa":"Eke, N. O. (2015). „Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung. <i>Text + Kritik X/15</i>, (H. 208), 12–24.","ieee":"N. O. Eke, “„Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung,” <i>Text + Kritik X/15</i>, no. H. 208, pp. 12–24, 2015.","chicago":"Eke, Norbert Otto. “„Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung.” <i>Text + Kritik X/15</i>, no. H. 208 (2015): 12–24.","ama":"Eke NO. „Das Eigentliche ist das Unsagbare“. Angela Krauß‘ Poetik der Aussparung. <i>Text + Kritik X/15</i>. 2015;(H. 208):12-24."},"page":"12-24","issue":"H. 208","language":[{"iso":"ger"}],"_id":"19231","user_id":"14932","department":[{"_id":"465"}],"status":"public","type":"journal_article","publication":"Text + Kritik X/15"},{"status":"public","editor":[{"full_name":"Tommek, Heribert","last_name":"Tommek","first_name":"Heribert"},{"first_name":"Matteo","full_name":"Galli, Matteo","last_name":"Galli"},{"last_name":"Geisenhanslüke","full_name":"Geisenhanslüke, Achim","first_name":"Achim"}],"type":"book_chapter","publication":"Wendejahr 1995. Transformationen der deutschsprachigen Literatur","language":[{"iso":"ger"}],"user_id":"14932","department":[{"_id":"465"}],"_id":"19232","citation":{"short":"N.O. Eke, in: H. Tommek, M. Galli, A. Geisenhanslüke (Eds.), Wendejahr 1995. Transformationen der deutschsprachigen Literatur, de Gruyter, Berlin/Boston, 2015, pp. 72–90.","mla":"Eke, Norbert Otto. “Aus dem Labyrinth finden. Jüdisches Gedächtnis.” <i>Wendejahr 1995. Transformationen der deutschsprachigen Literatur</i>, edited by Heribert Tommek et al., de Gruyter, 2015, pp. 72–90.","bibtex":"@inbook{Eke_2015, place={Berlin/Boston}, title={Aus dem Labyrinth finden. Jüdisches Gedächtnis}, booktitle={Wendejahr 1995. Transformationen der deutschsprachigen Literatur}, publisher={de Gruyter}, author={Eke, Norbert Otto}, editor={Tommek, Heribert and Galli, Matteo and Geisenhanslüke, AchimEditors}, year={2015}, pages={72–90} }","apa":"Eke, N. O. (2015). Aus dem Labyrinth finden. Jüdisches Gedächtnis. In H. Tommek, M. Galli, &#38; A. Geisenhanslüke (Eds.), <i>Wendejahr 1995. Transformationen der deutschsprachigen Literatur</i> (pp. 72–90). Berlin/Boston: de Gruyter.","ama":"Eke NO. Aus dem Labyrinth finden. Jüdisches Gedächtnis. In: Tommek H, Galli M, Geisenhanslüke A, eds. <i>Wendejahr 1995. Transformationen der deutschsprachigen Literatur</i>. Berlin/Boston: de Gruyter; 2015:72-90.","chicago":"Eke, Norbert Otto. “Aus dem Labyrinth finden. Jüdisches Gedächtnis.” In <i>Wendejahr 1995. Transformationen der deutschsprachigen Literatur</i>, edited by Heribert Tommek, Matteo Galli, and Achim Geisenhanslüke, 72–90. Berlin/Boston: de Gruyter, 2015.","ieee":"N. O. Eke, “Aus dem Labyrinth finden. Jüdisches Gedächtnis,” in <i>Wendejahr 1995. Transformationen der deutschsprachigen Literatur</i>, H. Tommek, M. Galli, and A. Geisenhanslüke, Eds. Berlin/Boston: de Gruyter, 2015, pp. 72–90."},"page":"72-90","year":"2015","place":"Berlin/Boston","title":"Aus dem Labyrinth finden. Jüdisches Gedächtnis","author":[{"full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke","first_name":"Norbert Otto"}],"date_created":"2020-09-10T06:14:35Z","date_updated":"2022-01-06T06:54:00Z","publisher":"de Gruyter"}]