[{"citation":{"ieee":"A. Mäcker, <i>On Scheduling with Setup Times</i>. Universität Paderborn, 2019.","apa":"Mäcker, A. (2019). <i>On Scheduling with Setup Times</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-828\">https://doi.org/10.17619/UNIPB/1-828</a>","chicago":"Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. Universität Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-828\">https://doi.org/10.17619/UNIPB/1-828</a>.","short":"A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019.","mla":"Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>.","bibtex":"@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling with Setup Times}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>}, author={Mäcker, Alexander}, year={2019} }","ama":"Mäcker A. <i>On Scheduling with Setup Times</i>. Universität Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-828\">10.17619/UNIPB/1-828</a>"},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"related_material":{"link":[{"url":"https://doi.org/10.17619/UNIPB/1-828","relation":"confirmation"}]},"date_created":"2019-11-07T14:17:05Z","place":"Universität Paderborn","department":[{"_id":"63"}],"type":"dissertation","author":[{"id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander","last_name":"Mäcker"}],"title":"On Scheduling with Setup Times","status":"public","year":"2019","date_updated":"2022-01-06T06:52:08Z","_id":"14851","language":[{"iso":"eng"}],"user_id":"15415","ddc":["000"],"doi":"10.17619/UNIPB/1-828"},{"publication":"IEEE Transactions on Software Engineering","citation":{"ama":"Dann A, Hermann B, Bodden E. ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>. Published online 2019:1-1. doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>","bibtex":"@article{Dann_Hermann_Bodden_2019, title={ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules}, DOI={<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>}, journal={IEEE Transactions on Software Engineering}, author={Dann, Andreas and Hermann, Ben and Bodden, Eric}, year={2019}, pages={1–1} }","mla":"Dann, Andreas, et al. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>.","chicago":"Dann, Andreas, Ben Hermann, and Eric Bodden. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>.","short":"A. Dann, B. Hermann, E. Bodden, IEEE Transactions on Software Engineering (2019) 1–1.","apa":"Dann, A., Hermann, B., &#38; Bodden, E. (2019). ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>","ieee":"A. Dann, B. Hermann, and E. Bodden, “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2019, doi: <a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2019-11-12T12:20:56Z","type":"journal_article","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"year":"2019","status":"public","title":"ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules","author":[{"full_name":"Dann, Andreas","last_name":"Dann","first_name":"Andreas"},{"orcid":"0000-0001-9848-2017","first_name":"Ben","last_name":"Hermann","full_name":"Hermann, Ben","id":"66173"},{"id":"59256","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric"}],"publication_identifier":{"issn":["0098-5589","1939-3520","2326-3881"]},"date_updated":"2022-01-06T06:52:10Z","publication_status":"published","page":"1-1","_id":"14896","language":[{"iso":"eng"}],"doi":"10.1109/tse.2019.2931331","user_id":"5786"},{"status":"public","has_accepted_license":"1","_id":"15007","user_id":"477","ddc":["000"],"file_date_updated":"2020-02-28T12:47:07Z","citation":{"bibtex":"@inproceedings{Melnikov_Hüllermeier_2019, title={Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA}, DOI={<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>}, booktitle={Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)}, author={Melnikov, Vitaly and Hüllermeier, Eyke}, year={2019} }","ama":"Melnikov V, Hüllermeier E. Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In: <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>","mla":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019, doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>.","short":"V. Melnikov, E. Hüllermeier, in: Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101), 2019.","chicago":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>.","ieee":"V. Melnikov and E. Hüllermeier, “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA,” in <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019.","apa":"Melnikov, V., &#38; Hüllermeier, E. (2019). Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>"},"project":[{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"oa":"1","year":"2019","title":"Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA","author":[{"full_name":"Melnikov, Vitaly","last_name":"Melnikov","first_name":"Vitaly","id":"58747"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"publication_status":"published","date_updated":"2022-01-06T06:52:14Z","language":[{"iso":"eng"}],"doi":"10.1016/j.jmva.2019.02.017","publication":"Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)","file":[{"date_created":"2020-02-28T12:47:07Z","creator":"lettmann","file_id":"16156","content_type":"application/pdf","relation":"main_file","date_updated":"2020-02-28T12:47:07Z","file_name":"learning-to-aggregate-owa.pdf","file_size":2331320,"access_level":"open_access"}],"date_created":"2019-11-15T10:43:26Z","type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}]},{"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:14Z","year":"2019","title":"Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking","author":[{"last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209"},{"last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"publication_identifier":{"isbn":["978-3-7315-0979-0"]},"type":"conference","department":[{"_id":"355"}],"file":[{"date_created":"2020-05-25T08:01:31Z","creator":"ahetzer","content_type":"application/pdf","file_id":"17060","date_updated":"2020-05-25T08:01:31Z","relation":"main_file","file_size":468825,"access_level":"open_access","file_name":"ci_workshop_tornede.pdf"}],"date_created":"2019-11-15T13:29:25Z","publication":"Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019","user_id":"38209","ddc":["006"],"editor":[{"full_name":"Hoffmann, Frank","first_name":"Frank","last_name":"Hoffmann"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"full_name":"Mikut, Ralf","first_name":"Ralf","last_name":"Mikut"}],"page":"135-146","_id":"15011","publisher":"KIT Scientific Publishing, Karlsruhe","has_accepted_license":"1","status":"public","conference":{"end_date":"2019-11-29","name":"29. Workshop Computational Intelligence","start_date":"2019-11-28","location":"Dortmund"},"oa":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"file_date_updated":"2020-05-25T08:01:31Z","citation":{"bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2019, title={Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking}, booktitle={Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019}, publisher={KIT Scientific Publishing, Karlsruhe}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, editor={Hoffmann, Frank and Hüllermeier, Eyke and Mikut, RalfEditors}, year={2019}, pages={135–146} }","ama":"Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In: Hoffmann F, Hüllermeier E, Mikut R, eds. <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>. KIT Scientific Publishing, Karlsruhe; 2019:135-146.","mla":"Tornede, Alexander, et al. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, edited by Frank Hoffmann et al., KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–46.","chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” In <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, edited by Frank Hoffmann, Eyke Hüllermeier, and Ralf Mikut, 135–46. KIT Scientific Publishing, Karlsruhe, 2019.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: F. Hoffmann, E. Hüllermeier, R. Mikut (Eds.), Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–146.","ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking,” in <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, Dortmund, 2019, pp. 135–146.","apa":"Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2019). Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In F. Hoffmann, E. Hüllermeier, &#38; R. Mikut (Eds.), <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i> (pp. 135–146). Dortmund: KIT Scientific Publishing, Karlsruhe."}},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"volume":128,"publisher":"CIE Working Paper Series, Paderborn University","_id":"15202","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2019-11-28T09:50:10Z","citation":{"apa":"Haake, C.-J., Upmann, T., &#38; Duman, P. (2019). <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i> (Vol. 128). CIE Working Paper Series, Paderborn University.","ieee":"C.-J. Haake, T. Upmann, and P. Duman, <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>, vol. 128. CIE Working Paper Series, Paderborn University, 2019.","short":"C.-J. Haake, T. Upmann, P. Duman, The Decomposability of the Nash Bargaining Solution in Labor Markets, CIE Working Paper Series, Paderborn University, 2019.","chicago":"Haake, Claus-Jochen, Thorsten Upmann, and Papatya Duman. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol. 128. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2019.","mla":"Haake, Claus-Jochen, et al. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol. 128, CIE Working Paper Series, Paderborn University, 2019.","ama":"Haake C-J, Upmann T, Duman P. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol 128. CIE Working Paper Series, Paderborn University; 2019.","bibtex":"@book{Haake_Upmann_Duman_2019, series={Working Papers CIE}, title={The Decomposability of the Nash Bargaining Solution in Labor Markets}, volume={128}, publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen and Upmann, Thorsten and Duman, Papatya}, year={2019}, collection={Working Papers CIE} }"},"date_updated":"2022-01-06T06:52:16Z","intvolume":"       128","title":"The Decomposability of the Nash Bargaining Solution in Labor Markets","year":"2019","author":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"full_name":"Upmann, Thorsten","first_name":"Thorsten","last_name":"Upmann"},{"id":"72752","last_name":"Duman","first_name":"Papatya","full_name":"Duman, Papatya"}],"series_title":"Working Papers CIE","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this paper, we analyze the two-dimensional Nash bargaining solution (NBS) deploying a standard labor market negotiations model (see McDonald and Solow, 1981; Creedy and McDonald, 1991). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the (Cartesian) product of the solutions of these problems replicates the solution of the two-dimensional problem, if the NBS is applied. However, this decomposition fails for any solution concept that does not satisfy the axiom of Independence of Irrelevant Alternatives (IIA axiom). Our decomposition result has significant implications for actual negotiations, as it allows for the decomposition of a multi-issue bargaining problem into a set of simpler problems, in particular a set of single-issue bargaining problems. In this way, the decomposition may help facilitate negotiations in labor markets and also in other environments."}],"type":"working_paper","keyword":["Labor market negotiations","Efficient bargains","Nash bargaining solution","Sequential bargaining","Restricted bargaining games"],"department":[{"_id":"205"},{"_id":"475"}],"file":[{"creator":"stela","date_created":"2019-11-28T09:50:10Z","file_size":1068284,"access_level":"closed","file_name":"WP - The Decomposability of the Nash Bargaining Solution in Labor Markets.pdf","date_updated":"2019-11-28T09:50:10Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"15203"}],"date_created":"2019-11-28T09:49:08Z"},{"citation":{"mla":"Aslan, Fatma, et al. <i>Duality for General TU-Games Redefined</i>. Vol. 121, CIE Working Paper Series, Paderborn University, 2019.","ama":"Aslan F, Duman P, Trockel W. <i>Duality for General TU-Games Redefined</i>. Vol 121. CIE Working Paper Series, Paderborn University; 2019.","bibtex":"@book{Aslan_Duman_Trockel_2019, series={Working Papers CIE}, title={Duality for General TU-games Redefined}, volume={121}, publisher={CIE Working Paper Series, Paderborn University}, author={Aslan, Fatma and Duman, Papatya and Trockel, Walter}, year={2019}, collection={Working Papers CIE} }","apa":"Aslan, F., Duman, P., &#38; Trockel, W. (2019). <i>Duality for General TU-games Redefined</i> (Vol. 121). CIE Working Paper Series, Paderborn University.","ieee":"F. Aslan, P. Duman, and W. Trockel, <i>Duality for General TU-games Redefined</i>, vol. 121. CIE Working Paper Series, Paderborn University, 2019.","chicago":"Aslan, Fatma, Papatya Duman, and Walter Trockel. <i>Duality for General TU-Games Redefined</i>. Vol. 121. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2019.","short":"F. Aslan, P. Duman, W. Trockel, Duality for General TU-Games Redefined, CIE Working Paper Series, Paderborn University, 2019."},"file_date_updated":"2019-11-28T10:01:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","has_accepted_license":"1","_id":"15204","publisher":"CIE Working Paper Series, Paderborn University","volume":121,"ddc":["040"],"user_id":"65453","abstract":[{"text":"We criticize some conceptual weaknesses in the recent literature on coalitional TUgames and propose, based on our critics, a new definition of dual TU-games that coincides with the one in the literature on the class of super-additive games. We justify our new definition in four alternative ways: 1. Via an adequate definition of ecient payo vectors. 2. Via a modification of the Bondareva-Shapley duality. 3. Via an explicit consideration of \\coalition building\". 4. Via associating general TU-games to coalition-production economies. Rather than imputations, we base our analysis on a modification of aspirations.","lang":"eng"}],"date_created":"2019-11-28T10:00:41Z","file":[{"date_created":"2019-11-28T10:01:40Z","creator":"stela","success":1,"content_type":"application/pdf","file_id":"15205","access_level":"closed","file_size":369323,"file_name":"WP - Duality for General TU-games Redefined.pdf","date_updated":"2019-11-28T10:01:40Z","relation":"main_file"}],"department":[{"_id":"205"},{"_id":"475"}],"keyword":["TU-games","duality","core","c-Core","cohesive games","complete game efficiency"],"type":"working_paper","author":[{"first_name":"Fatma","last_name":"Aslan","full_name":"Aslan, Fatma"},{"full_name":"Duman, Papatya","first_name":"Papatya","last_name":"Duman"},{"last_name":"Trockel","first_name":"Walter","full_name":"Trockel, Walter"}],"year":"2019","title":"Duality for General TU-games Redefined","intvolume":"       121","date_updated":"2022-01-06T06:52:17Z","language":[{"iso":"eng"}],"series_title":"Working Papers CIE"},{"file_date_updated":"2020-01-24T08:12:58Z","citation":{"chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>.","short":"B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>","bibtex":"@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem}, volume={6}, DOI={<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>}, number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2019} }","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019, doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","has_accepted_license":"1","_id":"13873","ddc":["000"],"user_id":"15504","volume":6,"publication":"ACM Transactions on Parallel Computing (TOPC)","issue":"3","file":[{"date_created":"2020-01-24T08:12:58Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"15632","file_size":633652,"access_level":"closed","file_name":"DissertationFeldkord.pdf","date_updated":"2020-01-24T08:12:58Z","relation":"main_file"}],"date_created":"2019-10-16T07:06:22Z","type":"journal_article","department":[{"_id":"63"}],"year":"2019","title":"The Mobile Server Problem","author":[{"last_name":"Feldkord","first_name":"Björn","full_name":"Feldkord, Björn","id":"22704"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:51:46Z","publication_status":"published","intvolume":"         6","article_number":"14","language":[{"iso":"eng"}],"doi":"10.1145/3364204"},{"doi":"10.5220/0007369503150321","user_id":"477","page":"315-321","language":[{"iso":"eng"}],"_id":"13942","publisher":"SciTePress","date_updated":"2022-01-06T06:51:47Z","year":"2019","title":"Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location","status":"public","author":[{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2019-10-21T13:42:50Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","citation":{"apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i> (pp. 315–321). SciTePress. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 2019, pp. 315–321.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 315–21. SciTePress, 2019. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>.","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, SciTePress, 2019, pp. 315–21, doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>.","ama":"Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321. doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>}, booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }"}},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2019-10-21T13:57:06Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication":"Theoretical Computer Science","citation":{"ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>. 2019;786:2-12. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>.","bibtex":"@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient parallel algorithms for parameterized problems}, volume={786}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>}, journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2019}, pages={2–12} }","mla":"Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>, <i>786</i>, 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer Science</i>, vol. 786, pp. 2–12, 2019."},"user_id":"15415","doi":"10.1016/j.tcs.2018.11.006","volume":786,"page":"2-12","language":[{"iso":"eng"}],"_id":"13946","date_updated":"2022-01-06T06:51:48Z","intvolume":"       786","year":"2019","title":"Efficient parallel algorithms for parameterized problems","status":"public","author":[{"full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N.","last_name":"Abu-Khzam"},{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}]},{"citation":{"chicago":"Szopinski, Daniel, Thomas John, and Dennis Kundisch. “Teaching Business Model Innovation to Large and Interdisciplinary IS/IT Classes: A Didactic Approach Involving Peer Feedback via Self-Recorded Video Presentations.” In <i>TREO Talks in Conjunction with the 40th International Conference on Information Systems (ICIS)</i>, 2019.","short":"D. Szopinski, T. John, D. Kundisch, in: TREO Talks in Conjunction with the 40th International Conference on Information Systems (ICIS), 2019.","ieee":"D. Szopinski, T. John, and D. Kundisch, “Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations,” in <i>TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)</i>, Munich, Germany, 2019.","apa":"Szopinski, D., John, T., &#38; Kundisch, D. (2019). Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations. In <i>TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)</i>. Munich, Germany.","bibtex":"@inproceedings{Szopinski_John_Kundisch_2019, title={Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations}, booktitle={TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)}, author={Szopinski, Daniel and John, Thomas and Kundisch, Dennis}, year={2019} }","ama":"Szopinski D, John T, Kundisch D. Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations. In: <i>TREO Talks in Conjunction with the 40th International Conference on Information Systems (ICIS)</i>. ; 2019.","mla":"Szopinski, Daniel, et al. “Teaching Business Model Innovation to Large and Interdisciplinary IS/IT Classes: A Didactic Approach Involving Peer Feedback via Self-Recorded Video Presentations.” <i>TREO Talks in Conjunction with the 40th International Conference on Information Systems (ICIS)</i>, 2019."},"file_date_updated":"2019-10-28T10:01:38Z","publication":"TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"date_created":"2019-10-28T10:07:35Z","file":[{"creator":"abursig","date_created":"2019-10-28T10:01:38Z","file_name":"ICIS2019_TREOTalk_BuinessModelTeaching_final.pdf","file_size":131638,"access_level":"closed","relation":"main_file","date_updated":"2019-10-28T10:01:38Z","file_id":"14018","content_type":"application/pdf","success":1}],"department":[{"_id":"276"}],"type":"conference_abstract","author":[{"last_name":"Szopinski","first_name":"Daniel","full_name":"Szopinski, Daniel","id":"36372"},{"full_name":"John, Thomas","first_name":"Thomas","last_name":"John","id":"3952"},{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"}],"conference":{"name":"TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)","location":"Munich, Germany"},"year":"2019","title":"Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:51:49Z","language":[{"iso":"eng"}],"_id":"14017","user_id":"16205","ddc":["006"]},{"has_accepted_license":"1","date_updated":"2022-01-06T06:51:52Z","author":[{"first_name":"Daniel","last_name":"Szopinski","full_name":"Szopinski, Daniel","id":"36372"}],"conference":{"name":"Bosch Business Model Innovation Summit 2019","location":"Renningen, Germany"},"status":"public","title":"Activate software-based business model development tools: An exploratory study","year":"2019","user_id":"36372","ddc":["040"],"_id":"14019","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"citation":{"chicago":"Szopinski, Daniel. “Activate Software-Based Business Model Development Tools: An Exploratory Study,” 2019.","short":"D. Szopinski, in: 2019.","apa":"Szopinski, D. (2019). Activate software-based business model development tools: An exploratory study. Presented at the Bosch Business Model Innovation Summit 2019, Renningen, Germany.","ieee":"D. Szopinski, “Activate software-based business model development tools: An exploratory study,” presented at the Bosch Business Model Innovation Summit 2019, Renningen, Germany, 2019.","ama":"Szopinski D. Activate software-based business model development tools: An exploratory study. In: ; 2019.","bibtex":"@inproceedings{Szopinski_2019, title={Activate software-based business model development tools: An exploratory study}, author={Szopinski, Daniel}, year={2019} }","mla":"Szopinski, Daniel. <i>Activate Software-Based Business Model Development Tools: An Exploratory Study</i>. 2019."},"file_date_updated":"2020-09-28T08:39:56Z","department":[{"_id":"276"}],"type":"conference_abstract","date_created":"2019-10-28T10:12:05Z","file":[{"date_created":"2020-09-28T08:39:56Z","creator":"dsz","content_type":"application/pdf","success":1,"file_id":"19713","date_updated":"2020-09-28T08:39:56Z","relation":"main_file","file_size":953054,"access_level":"closed","file_name":"Bosch BMI Summit 2019.pdf"}]},{"department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2019-11-04T10:09:35Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, L’Aquila, Italy, 2019, pp. 345–348.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 345–48, 2019. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp. 345–48, doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2019:345-348. doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }"},"publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","user_id":"477","doi":"10.1007/978-3-030-24922-9\\_26","_id":"14539","language":[{"iso":"eng"}],"page":"345-348","date_updated":"2022-01-06T06:52:00Z","author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"},{"id":"43647","first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"conference":{"end_date":"2019-07-04","location":"L'Aquila, Italy","name":"SIROCCO 2019","start_date":"2019-07-01"},"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","year":"2019","status":"public"},{"ddc":["000"],"user_id":"36372","_id":"14543","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:52:02Z","conference":{"location":"Munich, Germany","name":"Workshop on Information Technology and Systems (WITS)"},"author":[{"full_name":"Szopinski, Daniel","last_name":"Szopinski","first_name":"Daniel","id":"36372"},{"last_name":"John","first_name":"Thomas","full_name":"John, Thomas","id":"3952"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"year":"2019","status":"public","title":"Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback","department":[{"_id":"276"}],"type":"conference_abstract","date_created":"2019-11-05T13:05:09Z","file":[{"success":1,"content_type":"application/pdf","file_id":"15312","access_level":"closed","file_size":139199,"file_name":"WITS2019_MEDG_Coverpage.pdf","date_updated":"2019-12-12T16:51:08Z","relation":"main_file","date_created":"2019-12-12T16:51:08Z","creator":"dsz"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"citation":{"ieee":"D. Szopinski, T. John, and D. Kundisch, “Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback,” presented at the Workshop on Information Technology and Systems (WITS), Munich, Germany, 2019.","apa":"Szopinski, D., John, T., &#38; Kundisch, D. (2019). Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback. Presented at the Workshop on Information Technology and Systems (WITS), Munich, Germany.","short":"D. Szopinski, T. John, D. Kundisch, in: 2019.","chicago":"Szopinski, Daniel, Thomas John, and Dennis Kundisch. “Digital Tools for Teaching Business Model Innovation in Information Systems: A Newly Developed Didactic Approach Comprising Video-Based Peer Feedback,” 2019.","mla":"Szopinski, Daniel, et al. <i>Digital Tools for Teaching Business Model Innovation in Information Systems: A Newly Developed Didactic Approach Comprising Video-Based Peer Feedback</i>. 2019.","bibtex":"@inproceedings{Szopinski_John_Kundisch_2019, title={Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback}, author={Szopinski, Daniel and John, Thomas and Kundisch, Dennis}, year={2019} }","ama":"Szopinski D, John T, Kundisch D. Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback. In: ; 2019."},"file_date_updated":"2019-12-12T16:51:08Z"},{"department":[{"_id":"78"},{"_id":"34"},{"_id":"7"}],"type":"mastersthesis","date_created":"2019-11-05T14:32:46Z","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"}],"supervisor":[{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"citation":{"ieee":"T. Hansmeier, <i>Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers</i>. Universität Paderborn, 2019.","apa":"Hansmeier, T. (2019). <i>Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers</i>. Universität Paderborn.","mla":"Hansmeier, Tim. <i>Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers</i>. Universität Paderborn, 2019.","bibtex":"@book{Hansmeier_2019, title={Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers}, publisher={Universität Paderborn}, author={Hansmeier, Tim}, year={2019} }","ama":"Hansmeier T. <i>Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers</i>. Universität Paderborn; 2019.","short":"T. Hansmeier, Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers, Universität Paderborn, 2019.","chicago":"Hansmeier, Tim. <i>Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers</i>. Universität Paderborn, 2019."},"user_id":"477","language":[{"iso":"eng"}],"_id":"14546","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:02Z","author":[{"id":"49992","first_name":"Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","full_name":"Hansmeier, Tim"}],"title":"Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers","status":"public","year":"2019"},{"department":[{"_id":"75"}],"type":"dissertation","date_created":"2019-09-03T12:16:32Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"supervisor":[{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"citation":{"bibtex":"@book{Dräxler_2019, title={Scaling, placement, and routing for pliable virtualized composed services}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2019} }","ama":"Dräxler S. <i>Scaling, Placement, and Routing for Pliable Virtualized Composed Services</i>. Universität Paderborn; 2019.","mla":"Dräxler, Sevil. <i>Scaling, Placement, and Routing for Pliable Virtualized Composed Services</i>. Universität Paderborn, 2019.","short":"S. Dräxler, Scaling, Placement, and Routing for Pliable Virtualized Composed Services, Universität Paderborn, 2019.","chicago":"Dräxler, Sevil. <i>Scaling, Placement, and Routing for Pliable Virtualized Composed Services</i>. Universität Paderborn, 2019.","ieee":"S. Dräxler, <i>Scaling, placement, and routing for pliable virtualized composed services</i>. Universität Paderborn, 2019.","apa":"Dräxler, S. (2019). <i>Scaling, placement, and routing for pliable virtualized composed services</i>. Universität Paderborn."},"user_id":"477","publisher":"Universität Paderborn","_id":"13124","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:28Z","author":[{"id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler"}],"year":"2019","title":"Scaling, placement, and routing for pliable virtualized composed services","status":"public"},{"citation":{"short":"T. Görzen, Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd, Universität Paderborn, 2019.","chicago":"Görzen, Thomas. <i>Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd</i>. Universität Paderborn, 2019.","ieee":"T. Görzen, <i>Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd</i>. Universität Paderborn, 2019.","apa":"Görzen, T. (2019). <i>Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd</i>. Universität Paderborn.","bibtex":"@book{Görzen_2019, title={Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd}, publisher={Universität Paderborn}, author={Görzen, Thomas}, year={2019} }","ama":"Görzen T. <i>Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd</i>. Universität Paderborn; 2019.","mla":"Görzen, Thomas. <i>Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd</i>. Universität Paderborn, 2019."},"supervisor":[{"last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"date_created":"2019-09-03T12:20:11Z","type":"dissertation","department":[{"_id":"7"},{"_id":"276"}],"year":"2019","title":"Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd","status":"public","author":[{"full_name":"Görzen, Thomas","first_name":"Thomas","last_name":"Görzen","id":"47700"}],"date_updated":"2022-01-06T06:51:28Z","_id":"13125","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"_id":"13126","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","author":[{"first_name":"Lial","last_name":"Khaluf","full_name":"Khaluf, Lial"}],"title":"Organic Programming of Dynamic Real-Time Applications","year":"2019","status":"public","date_updated":"2022-01-06T06:51:28Z","date_created":"2019-09-03T12:23:44Z","department":[{"_id":"7"},{"_id":"70"}],"type":"dissertation","supervisor":[{"full_name":"Rammig, Franz","first_name":"Franz","last_name":"Rammig"}],"citation":{"ama":"Khaluf L. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn; 2019.","bibtex":"@book{Khaluf_2019, title={Organic Programming of Dynamic Real-Time Applications}, publisher={Universität Paderborn}, author={Khaluf, Lial}, year={2019} }","mla":"Khaluf, Lial. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019.","chicago":"Khaluf, Lial. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019.","short":"L. Khaluf, Organic Programming of Dynamic Real-Time Applications, Universität Paderborn, 2019.","apa":"Khaluf, L. (2019). <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn.","ieee":"L. Khaluf, <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}]},{"year":"2019","title":"Rational Secure Multiparty Computation","author":[{"full_name":"Bröcher, Henrik","first_name":"Henrik","last_name":"Bröcher","id":"41047"}],"date_updated":"2022-01-06T06:51:28Z","language":[{"iso":"eng"}],"extern":"1","file":[{"content_type":"application/pdf","file_id":"13129","date_updated":"2020-10-30T15:59:34Z","relation":"main_file","access_level":"open_access","file_size":746819,"file_name":"thesis_broecher.pdf","date_created":"2019-09-04T07:59:31Z","creator":"bhenrik"}],"date_created":"2019-09-04T08:04:12Z","type":"mastersthesis","department":[{"_id":"64"}],"status":"public","has_accepted_license":"1","publisher":"Universität Paderborn","_id":"13128","user_id":"25078","ddc":["000"],"file_date_updated":"2020-10-30T15:59:34Z","citation":{"ama":"Bröcher H. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn; 2019.","bibtex":"@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2019} }","mla":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","chicago":"Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019.","short":"H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn, 2019.","apa":"Bröcher, H. (2019). <i>Rational Secure Multiparty Computation</i>. Universität Paderborn.","ieee":"H. Bröcher, <i>Rational Secure Multiparty Computation</i>. Universität Paderborn, 2019."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"}],"oa":"1"},{"date_created":"2019-09-04T08:44:46Z","place":"Bonn","type":"conference_abstract","department":[{"_id":"355"}],"publication":"INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft","citation":{"ama":"Mohr F, Wever MD, Tornede A, Hüllermeier E. From Automated to On-The-Fly Machine Learning. In: <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik. Bonn: Gesellschaft für Informatik e.V.; 2019:273-274.","bibtex":"@inproceedings{Mohr_Wever_Tornede_Hüllermeier_2019, place={Bonn}, series={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik}, title={From Automated to On-The-Fly Machine Learning}, booktitle={INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}, publisher={Gesellschaft für Informatik e.V.}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}, year={2019}, pages={273–274}, collection={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik} }","mla":"Mohr, Felix, et al. “From Automated to On-The-Fly Machine Learning.” <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>, Gesellschaft für Informatik e.V., 2019, pp. 273–74.","chicago":"Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier. “From Automated to On-The-Fly Machine Learning.” In <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>, 273–74. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft Für Informatik. Bonn: Gesellschaft für Informatik e.V., 2019.","short":"F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, in: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., Bonn, 2019, pp. 273–274.","apa":"Mohr, F., Wever, M. D., Tornede, A., &#38; Hüllermeier, E. (2019). From Automated to On-The-Fly Machine Learning. In <i>INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft</i> (pp. 273–274). Bonn: Gesellschaft für Informatik e.V.","ieee":"F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “From Automated to On-The-Fly Machine Learning,” in <i>INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft</i>, Kassel, 2019, pp. 273–274."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"page":" 273-274 ","series_title":"INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik","_id":"13132","language":[{"iso":"eng"}],"publisher":"Gesellschaft für Informatik e.V.","user_id":"38209","title":"From Automated to On-The-Fly Machine Learning","year":"2019","status":"public","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","full_name":"Wever, Marcel Dominik"},{"id":"38209","last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"}],"conference":{"start_date":"2019-09-23","name":"Informatik 2019","location":"Kassel","end_date":"2019-09-26"},"date_updated":"2022-01-06T06:51:28Z"},{"citation":{"ieee":"S. Gottschalk, F. Rittmeier, and G. Engels, “Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach,” in <i>Software Business</i>,  Jyväskylä, 2019, vol. 370, no. 1, pp. 192–207.","apa":"Gottschalk, S., Rittmeier, F., &#38; Engels, G. (2019). Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach. In S. Hyrynsalmi, M. Suoranta, A. Nguyen-Duc, P. Tyrväinen, &#38; P. Abrahamsson (Eds.), <i>Software Business</i> (Vol. 370, pp. 192–207). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-33742-1_16\">https://doi.org/10.1007/978-3-030-33742-1_16</a>","short":"S. Gottschalk, F. Rittmeier, G. Engels, in: S. Hyrynsalmi, M. Suoranta, A. Nguyen-Duc, P. Tyrväinen, P. Abrahamsson (Eds.), Software Business, Springer International Publishing, Cham, 2019, pp. 192–207.","chicago":"Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach.” In <i>Software Business</i>, edited by Sami Hyrynsalmi, Mari Suoranta, Anh Nguyen-Duc, Pasi Tyrväinen, and Pekka Abrahamsson, 370:192–207. Lecture Notes in Business Information Processing. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-33742-1_16\">https://doi.org/10.1007/978-3-030-33742-1_16</a>.","mla":"Gottschalk, Sebastian, et al. “Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach.” <i>Software Business</i>, edited by Sami Hyrynsalmi et al., vol. 370, no. 1, Springer International Publishing, 2019, pp. 192–207, doi:<a href=\"https://doi.org/10.1007/978-3-030-33742-1_16\">10.1007/978-3-030-33742-1_16</a>.","bibtex":"@inproceedings{Gottschalk_Rittmeier_Engels_2019, place={Cham}, series={Lecture Notes in Business Information Processing}, title={Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach}, volume={370}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-33742-1_16\">10.1007/978-3-030-33742-1_16</a>}, number={1}, booktitle={Software Business}, publisher={Springer International Publishing}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}, editor={Hyrynsalmi, Sami and Suoranta, Mari and Nguyen-Duc, Anh and Tyrväinen, Pasi and Abrahamsson, PekkaEditors}, year={2019}, pages={192–207}, collection={Lecture Notes in Business Information Processing} }","ama":"Gottschalk S, Rittmeier F, Engels G. Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach. In: Hyrynsalmi S, Suoranta M, Nguyen-Duc A, Tyrväinen P, Abrahamsson P, eds. <i>Software Business</i>. Vol 370. Lecture Notes in Business Information Processing. Cham: Springer International Publishing; 2019:192-207. doi:<a href=\"https://doi.org/10.1007/978-3-030-33742-1_16\">10.1007/978-3-030-33742-1_16</a>"},"file_date_updated":"2019-12-06T13:47:25Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"place":"Cham","oa":"1","conference":{"name":"10th International Conference on Software Business","start_date":"2019-11-18","location":" Jyväskylä","end_date":"2019-11-20"},"status":"public","has_accepted_license":"1","_id":"13138","publisher":"Springer International Publishing","page":"192-207","volume":370,"editor":[{"first_name":"Sami","last_name":"Hyrynsalmi","full_name":"Hyrynsalmi, Sami"},{"full_name":"Suoranta, Mari","first_name":"Mari","last_name":"Suoranta"},{"last_name":"Nguyen-Duc","first_name":"Anh","full_name":"Nguyen-Duc, Anh"},{"full_name":"Tyrväinen, Pasi","last_name":"Tyrväinen","first_name":"Pasi"},{"last_name":"Abrahamsson","first_name":"Pekka","full_name":"Abrahamsson, Pekka"}],"user_id":"47208","ddc":["000"],"publication":"Software Business","issue":"1","abstract":[{"lang":"eng","text":"Mobile app stores like Apple's AppStore or Google's PlayStore are highly competitive markets for third-party developers wanting to develop successful applications. During the development process, many developers focus on the multitude of product functions but neglect the business model as an equally important part. As a result, developers often fail to meet customer needs, leading to unnecessary development costs and poor market penetration. This, in turn, raises the question of how we intertwine the business model and product functions during the development process to ensure a better alignment between the two.\r\nIn this paper, we show this intertwined development by adapting the concept of Twin Peaks to the business model and product functions. Based on feature modeling as an abstraction layer, we introduce the concept of a Business Model Decision Line (BMDL) to structure the business model decisions and their relation to product functions structured in a Software Product Line (SPL). The basis of our feature models is the analysis of top listed applications in the app stores of Apple and Google. To create and modify both models, we provide an incremental feature structuring and iterative feature selection process. This combination of abstraction layer and development process supports third-party developers to build successful applications both from a business and a product perspective. \r\n"}],"date_created":"2019-09-04T21:23:07Z","file":[{"date_created":"2019-11-14T14:48:42Z","creator":"sego","file_id":"14989","content_type":"application/pdf","file_name":"ICSOB.pdf","access_level":"open_access","file_size":391814,"relation":"main_file","date_updated":"2019-12-06T13:47:25Z"}],"department":[{"_id":"66"}],"type":"conference","keyword":["Intertwined Development","Twin Peaks","Feature Model","Business Model","Product Functions"],"publication_identifier":{"unknown":["978-3-030-33741-4"]},"author":[{"id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk"},{"first_name":"Florian","last_name":"Rittmeier","full_name":"Rittmeier, Florian","id":"5281"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"year":"2019","title":"Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach","intvolume":"       370","publication_status":"published","date_updated":"2022-01-06T06:51:29Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Business Information Processing","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-33742-1_16"}],"doi":"10.1007/978-3-030-33742-1_16"}]