[{"language":[{"iso":"eng"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"15400","status":"public","editor":[{"last_name":"Busa-Fekete","full_name":"Busa-Fekete, R.","first_name":"R."},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"last_name":"Mousseau","full_name":"Mousseau, V.","first_name":"V."},{"first_name":"Karlson","full_name":"Pfannschmidt, Karlson","last_name":"Pfannschmidt"}],"type":"conference","publication":"in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany","title":"On the identifiability of models  in multi-criteria preference learning","author":[{"full_name":"Labreuche, C.","last_name":"Labreuche","first_name":"C."},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"full_name":"Vojtas, P.","last_name":"Vojtas","first_name":"P."},{"first_name":"A.","last_name":"Fallah Tehrani","full_name":"Fallah Tehrani, A."}],"date_created":"2019-12-19T16:02:19Z","date_updated":"2022-01-06T06:52:23Z","citation":{"chicago":"Labreuche, C., Eyke Hüllermeier, P. Vojtas, and A. Fallah Tehrani. “On the Identifiability of Models  in Multi-Criteria Preference Learning.” In <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016.","ieee":"C. Labreuche, E. Hüllermeier, P. Vojtas, and A. Fallah Tehrani, “On the identifiability of models  in multi-criteria preference learning,” in <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, 2016.","ama":"Labreuche C, Hüllermeier E, Vojtas P, Fallah Tehrani A. On the identifiability of models  in multi-criteria preference learning. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>. ; 2016.","apa":"Labreuche, C., Hüllermeier, E., Vojtas, P., &#38; Fallah Tehrani, A. (2016). On the identifiability of models  in multi-criteria preference learning. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>.","short":"C. Labreuche, E. Hüllermeier, P. Vojtas, A. Fallah Tehrani, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany, 2016.","mla":"Labreuche, C., et al. “On the Identifiability of Models  in Multi-Criteria Preference Learning.” <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete et al., 2016.","bibtex":"@inproceedings{Labreuche_Hüllermeier_Vojtas_Fallah Tehrani_2016, title={On the identifiability of models  in multi-criteria preference learning}, booktitle={in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}, author={Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }"},"year":"2016"},{"title":"Preference -based reinforcement learning using dyad ranking","date_updated":"2022-01-06T06:52:23Z","author":[{"last_name":"Schäfer","full_name":"Schäfer, D.","first_name":"D."},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2019-12-19T16:33:45Z","year":"2016","citation":{"mla":"Schäfer, D., and Eyke Hüllermeier. “Preference -Based Reinforcement Learning Using Dyad Ranking.” <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, edited by R. Busa-Fekete et al., 2016.","short":"D. Schäfer, E. Hüllermeier, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany, 2016.","bibtex":"@inproceedings{Schäfer_Hüllermeier_2016, title={Preference -based reinforcement learning using dyad ranking}, booktitle={in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}, author={Schäfer, D. and Hüllermeier, Eyke}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }","apa":"Schäfer, D., &#38; Hüllermeier, E. (2016). Preference -based reinforcement learning using dyad ranking. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>.","ama":"Schäfer D, Hüllermeier E. Preference -based reinforcement learning using dyad ranking. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>. ; 2016.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Preference -Based Reinforcement Learning Using Dyad Ranking.” In <i>In Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016.","ieee":"D. Schäfer and E. Hüllermeier, “Preference -based reinforcement learning using dyad ranking,” in <i>in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany</i>, 2016."},"language":[{"iso":"eng"}],"_id":"15401","user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"editor":[{"first_name":"R.","last_name":"Busa-Fekete","full_name":"Busa-Fekete, R."},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"full_name":"Mousseau, V.","last_name":"Mousseau","first_name":"V."},{"first_name":"Karlson","full_name":"Pfannschmidt, Karlson","last_name":"Pfannschmidt"}],"status":"public","type":"conference","publication":"in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany"},{"status":"public","editor":[{"full_name":"Busa-Fekete, R.","last_name":"Busa-Fekete","first_name":"R."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"last_name":"Mousseau","full_name":"Mousseau, V.","first_name":"V."},{"last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson","first_name":"Karlson"}],"type":"conference","publication":"in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany","language":[{"iso":"eng"}],"user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"_id":"15402","citation":{"apa":"Couso, I., Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2016). Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In R. Busa-Fekete, E. Hüllermeier, V. Mousseau, &#38; K. Pfannschmidt (Eds.), <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>.","bibtex":"@inproceedings{Couso_Ahmadi Fahandar_Hüllermeier_2016, title={Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}, booktitle={in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}, author={Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, editor={Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, KarlsonEditors}, year={2016} }","mla":"Couso, Ines, et al. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete et al., 2016.","short":"I. Couso, M. Ahmadi Fahandar, E. Hüllermeier, in: R. Busa-Fekete, E. Hüllermeier, V. Mousseau, K. Pfannschmidt (Eds.), In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany, 2016.","ama":"Couso I, Ahmadi Fahandar M, Hüllermeier E. Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In: Busa-Fekete R, Hüllermeier E, Mousseau V, Pfannschmidt K, eds. <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>. ; 2016.","chicago":"Couso, Ines, Mohsen Ahmadi Fahandar, and Eyke Hüllermeier. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” In <i>In Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, edited by R. Busa-Fekete, Eyke Hüllermeier, V. Mousseau, and Karlson Pfannschmidt, 2016.","ieee":"I. Couso, M. Ahmadi Fahandar, and E. Hüllermeier, “Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators,” in <i>in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany</i>, 2016."},"year":"2016","title":"Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators","author":[{"first_name":"Ines","full_name":"Couso, Ines","last_name":"Couso"},{"first_name":"Mohsen","full_name":"Ahmadi Fahandar, Mohsen","last_name":"Ahmadi Fahandar"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"date_created":"2019-12-19T16:37:06Z","date_updated":"2022-01-06T06:52:23Z"},{"publication":"in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany","type":"conference","editor":[{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Hoffmann","full_name":"Hoffmann, F.","first_name":"F."},{"full_name":"Mikut, R.","last_name":"Mikut","first_name":"R."}],"status":"public","_id":"15403","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","language":[{"iso":"eng"}],"year":"2016","page":"1-8","citation":{"ieee":"S. Lu and E. Hüllermeier, “Support vector classification on noisy data using fuzzy superset losses,” in <i>in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, 2016, pp. 1–8.","chicago":"Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data Using Fuzzy Superset Losses.” In <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, edited by Eyke Hüllermeier, F. Hoffmann, and R. Mikut, 1–8. KIT Scientific Publishing, 2016.","ama":"Lu S, Hüllermeier E. Support vector classification on noisy data using fuzzy superset losses. In: Hüllermeier E, Hoffmann F, Mikut R, eds. <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>. KIT Scientific Publishing; 2016:1-8.","mla":"Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data Using Fuzzy Superset Losses.” <i>In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>, edited by Eyke Hüllermeier et al., KIT Scientific Publishing, 2016, pp. 1–8.","short":"S. Lu, E. Hüllermeier, in: E. Hüllermeier, F. Hoffmann, R. Mikut (Eds.), In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany, KIT Scientific Publishing, 2016, pp. 1–8.","bibtex":"@inproceedings{Lu_Hüllermeier_2016, title={Support vector classification on noisy data using fuzzy superset losses}, booktitle={in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}, publisher={KIT Scientific Publishing}, author={Lu, S. and Hüllermeier, Eyke}, editor={Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.Editors}, year={2016}, pages={1–8} }","apa":"Lu, S., &#38; Hüllermeier, E. (2016). Support vector classification on noisy data using fuzzy superset losses. In E. Hüllermeier, F. Hoffmann, &#38; R. Mikut (Eds.), <i>in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i> (pp. 1–8). KIT Scientific Publishing."},"publisher":"KIT Scientific Publishing","date_updated":"2022-01-06T06:52:23Z","author":[{"first_name":"S.","full_name":"Lu, S.","last_name":"Lu"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"date_created":"2019-12-19T16:40:33Z","title":"Support vector classification on noisy data using fuzzy superset losses"},{"date_updated":"2022-01-06T06:52:23Z","author":[{"first_name":"D.","last_name":"Schäfer","full_name":"Schäfer, D."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_created":"2019-12-19T16:43:27Z","title":"Plackett-Luce networks for dyad ranking","year":"2016","citation":{"bibtex":"@inproceedings{Schäfer_Hüllermeier_2016, title={Plackett-Luce networks for dyad ranking}, booktitle={in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2016} }","short":"D. Schäfer, E. Hüllermeier, in: In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany, 2016.","mla":"Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.” <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2016). Plackett-Luce networks for dyad ranking. In <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>.","ieee":"D. Schäfer and E. Hüllermeier, “Plackett-Luce networks for dyad ranking,” in <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.” In <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.","ama":"Schäfer D, Hüllermeier E. Plackett-Luce networks for dyad ranking. In: <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>. ; 2016."},"_id":"15404","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"user_id":"49109","language":[{"iso":"eng"}],"publication":"in Workshop LWDA \"Lernen, Wissen, Daten, Analysen\" Potsdam, Germany","type":"conference","status":"public"},{"place":"Baltimore","year":"2016","citation":{"short":"G. Domik, in: Pedagogy Data Visualization, IEEE VIS Workshop, Baltimore, 2016.","bibtex":"@inproceedings{Domik_2016, place={Baltimore}, title={A data visualization course at the university of paderborn}, booktitle={Pedagogy Data Visualization, IEEE VIS Workshop}, author={Domik, Gitta}, year={2016} }","mla":"Domik, Gitta. “A Data Visualization Course at the University of Paderborn.” <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.","apa":"Domik, G. (2016). A data visualization course at the university of paderborn. In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore.","chicago":"Domik, Gitta. “A Data Visualization Course at the University of Paderborn.” In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore, 2016.","ieee":"G. Domik, “A data visualization course at the university of paderborn,” in <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.","ama":"Domik G. A data visualization course at the university of paderborn. In: <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore; 2016."},"title":"A data visualization course at the university of paderborn","date_updated":"2022-01-06T06:52:25Z","date_created":"2020-01-07T07:54:37Z","author":[{"id":"90","full_name":"Domik, Gitta","last_name":"Domik","first_name":"Gitta"}],"status":"public","type":"conference","publication":"Pedagogy Data Visualization, IEEE VIS Workshop","language":[{"iso":"eng"}],"_id":"15435","user_id":"90","department":[{"_id":"65"}]},{"_id":"155","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-21T12:51:24Z","publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","type":"conference","abstract":[{"text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.","lang":"eng"}],"status":"public","file":[{"access_level":"closed","file_name":"155-SSS16-GLS.pdf","file_id":"1550","file_size":389136,"date_created":"2018-03-21T12:51:24Z","creator":"florida","date_updated":"2018-03-21T12:51:24Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T06:52:28Z","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"full_name":"Lefèvre, Jonas","last_name":"Lefèvre","first_name":"Jonas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:41:22Z","title":"Self-stabilizing Metric Graphs","doi":"10.1007/978-3-319-49259-9_20","has_accepted_license":"1","year":"2016","page":"248--262","citation":{"ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>.","ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>","short":"R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }","apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>"}},{"file":[{"file_size":753147,"access_level":"closed","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","file_id":"1549","date_updated":"2018-03-21T12:50:29Z","creator":"florida","date_created":"2018-03-21T12:50:29Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees."}],"type":"conference","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-03-21T12:50:29Z","ddc":["040"],"series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"157","citation":{"chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:563--577. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 563--577). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>"},"page":"563--577","year":"2016","has_accepted_license":"1","doi":"10.1007/978-3-319-48749-6_41","title":"Scheduling with Interjob Communication on Parallel Processors","date_created":"2017-10-17T12:41:22Z","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"date_updated":"2022-01-06T06:52:32Z"},{"publication_status":"published","publication_identifier":{"isbn":["9781467394062"]},"year":"2016","citation":{"ama":"Boschmann A, Agne A, Witschen LM, Thombansen G, Kraus F, Platzner M. FPGA-based acceleration of high density myoelectric signal processing. In: <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>","chicago":"Boschmann, Alexander, Andreas Agne, Linus Matthias Witschen, Georg Thombansen, Florian Kraus, and Marco Platzner. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>.","ieee":"A. Boschmann, A. Agne, L. M. Witschen, G. Thombansen, F. Kraus, and M. Platzner, “FPGA-based acceleration of high density myoelectric signal processing,” in <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, Mexiko City, Mexiko, 2016.","apa":"Boschmann, A., Agne, A., Witschen, L. M., Thombansen, G., Kraus, F., &#38; Platzner, M. (2016). FPGA-based acceleration of high density myoelectric signal processing. In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. Mexiko City, Mexiko: IEEE. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>","bibtex":"@inproceedings{Boschmann_Agne_Witschen_Thombansen_Kraus_Platzner_2016, title={FPGA-based acceleration of high density myoelectric signal processing}, DOI={<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>}, booktitle={2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}, year={2016} }","short":"A. Boschmann, A. Agne, L.M. Witschen, G. Thombansen, F. Kraus, M. Platzner, in: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2016.","mla":"Boschmann, Alexander, et al. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>."},"publisher":"IEEE","date_updated":"2022-01-06T06:52:38Z","date_created":"2020-02-11T07:48:56Z","author":[{"full_name":"Boschmann, Alexander","last_name":"Boschmann","first_name":"Alexander"},{"last_name":"Agne","full_name":"Agne, Andreas","first_name":"Andreas"},{"last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"},{"first_name":"Georg","full_name":"Thombansen, Georg","last_name":"Thombansen"},{"full_name":"Kraus, Florian","last_name":"Kraus","first_name":"Florian"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"title":"FPGA-based acceleration of high density myoelectric signal processing","conference":{"name":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","location":"Mexiko City, Mexiko"},"doi":"10.1109/reconfig.2015.7393312","type":"conference","publication":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","status":"public","_id":"15873","user_id":"49051","department":[{"_id":"78"}],"keyword":["Electromyography","Feature extraction","Delays","Hardware  Pattern recognition","Prosthetics","High definition video"],"language":[{"iso":"eng"}]},{"date_created":"2017-10-17T12:41:23Z","author":[{"last_name":"Harks","full_name":"Harks, Tobias","first_name":"Tobias"},{"last_name":"Höfer","full_name":"Höfer, Martin","first_name":"Martin"},{"last_name":"Schewior","full_name":"Schewior, Kevin","first_name":"Kevin"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T06:52:40Z","publisher":"IEEE","doi":"10.1109/TNET.2015.2468571","title":"Routing Games With Progressive Filling","issue":"4","has_accepted_license":"1","page":"2553 - 2562","citation":{"short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4 (2016): 2553–62. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>"},"year":"2016","department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","_id":"159","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-21T12:48:02Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"IEEE/ACM Transactions on Networking","type":"journal_article","status":"public","file":[{"date_updated":"2018-03-21T12:48:02Z","creator":"florida","date_created":"2018-03-21T12:48:02Z","file_size":1655309,"file_id":"1547","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}]},{"date_updated":"2022-01-06T06:52:03Z","publisher":"Universität Paderborn","author":[{"last_name":"Hamm","full_name":"Hamm, Julian","first_name":"Julian"}],"date_created":"2017-10-17T12:41:20Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","year":"2016","citation":{"chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016.","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"146","user_id":"477","department":[{"_id":"64"}],"type":"mastersthesis","status":"public"},{"main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-1154.pdf"}],"title":"UTCNN: a Deep Learning Model of Stance Classification on Social Media Text","date_created":"2019-11-11T12:28:24Z","author":[{"first_name":"Wei-Fan","last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan"},{"first_name":"Lun-Wei","full_name":"Ku, Lun-Wei","last_name":"Ku"}],"date_updated":"2022-01-06T06:52:09Z","citation":{"apa":"Chen, W.-F., &#38; Ku, L.-W. (2016). UTCNN: a Deep Learning Model of Stance Classification on Social Media Text. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i> (pp. 1635–1645).","short":"W.-F. Chen, L.-W. Ku, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics, 2016, pp. 1635–1645.","mla":"Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance Classification on Social Media Text.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 2016, pp. 1635–45.","bibtex":"@inproceedings{Chen_Ku_2016, title={UTCNN: a Deep Learning Model of Stance Classification on Social Media Text}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics}, author={Chen, Wei-Fan and Ku, Lun-Wei}, year={2016}, pages={1635–1645} }","ama":"Chen W-F, Ku L-W. UTCNN: a Deep Learning Model of Stance Classification on Social Media Text. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>. ; 2016:1635-1645.","chicago":"Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance Classification on Social Media Text.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 1635–45, 2016.","ieee":"W.-F. Chen and L.-W. Ku, “UTCNN: a Deep Learning Model of Stance Classification on Social Media Text,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 2016, pp. 1635–1645."},"page":"1635-1645","year":"2016","language":[{"iso":"eng"}],"extern":"1","user_id":"82920","department":[{"_id":"600"}],"_id":"14881","status":"public","type":"conference","publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics"},{"extern":"1","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"}],"_id":"14882","status":"public","type":"conference","publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations","main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-2057.pdf"}],"title":"WordForce: Visualizing Controversial Words in Debates","author":[{"last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan"},{"first_name":"Fang-Yu","last_name":"Lin","full_name":"Lin, Fang-Yu"},{"full_name":"Ku, Lun-Wei","last_name":"Ku","first_name":"Lun-Wei"}],"date_created":"2019-11-11T12:29:14Z","date_updated":"2022-01-06T06:52:09Z","citation":{"bibtex":"@inproceedings{Chen_Lin_Ku_2016, title={WordForce: Visualizing Controversial Words in Debates}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations}, author={Chen, Wei-Fan and Lin, Fang-Yu and Ku, Lun-Wei}, year={2016}, pages={273–277} }","short":"W.-F. Chen, F.-Y. Lin, L.-W. Ku, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations, 2016, pp. 273–277.","mla":"Chen, Wei-Fan, et al. “WordForce: Visualizing Controversial Words in Debates.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 2016, pp. 273–77.","apa":"Chen, W.-F., Lin, F.-Y., &#38; Ku, L.-W. (2016). WordForce: Visualizing Controversial Words in Debates. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i> (pp. 273–277).","ama":"Chen W-F, Lin F-Y, Ku L-W. WordForce: Visualizing Controversial Words in Debates. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>. ; 2016:273-277.","chicago":"Chen, Wei-Fan, Fang-Yu Lin, and Lun-Wei Ku. “WordForce: Visualizing Controversial Words in Debates.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 273–77, 2016.","ieee":"W.-F. Chen, F.-Y. Lin, and L.-W. Ku, “WordForce: Visualizing Controversial Words in Debates,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 2016, pp. 273–277."},"page":"273-277","year":"2016"},{"main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-3002.pdf"}],"title":"Chinese Textual Sentiment Analysis: Datasets, Resources and Tools","date_created":"2019-11-11T12:30:04Z","author":[{"last_name":"Ku","full_name":"Ku, Lun-Wei","first_name":"Lun-Wei"},{"id":"82920","full_name":"Chen, Wei-Fan","last_name":"Chen","first_name":"Wei-Fan"}],"date_updated":"2022-01-06T06:52:09Z","page":"5-8","citation":{"chicago":"Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 5–8, 2016.","ieee":"L.-W. Ku and W.-F. Chen, “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8.","ama":"Ku L-W, Chen W-F. Chinese Textual Sentiment Analysis: Datasets, Resources and Tools. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>. ; 2016:5-8.","apa":"Ku, L.-W., &#38; Chen, W.-F. (2016). Chinese Textual Sentiment Analysis: Datasets, Resources and Tools. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i> (pp. 5–8).","mla":"Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8.","short":"L.-W. Ku, W.-F. Chen, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts, 2016, pp. 5–8.","bibtex":"@inproceedings{Ku_Chen_2016, title={Chinese Textual Sentiment Analysis: Datasets, Resources and Tools}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts}, author={Ku, Lun-Wei and Chen, Wei-Fan}, year={2016}, pages={5–8} }"},"year":"2016","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"600"}],"user_id":"82920","_id":"14883","status":"public","publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts","type":"conference_abstract"},{"title":"Strategic Online Facility Location","doi":"10.1007/978-3-319-48749-6_43","date_updated":"2022-01-06T06:52:10Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"date_created":"2017-10-17T12:41:21Z","year":"2016","citation":{"ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>.","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.","apa":"Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 593--607). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>","mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607."},"page":"593--607","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-21T12:55:43Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"149","series_title":"LNCS","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"abstract":[{"lang":"eng","text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α)."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":236253,"access_level":"closed","file_id":"1553","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","date_updated":"2018-03-21T12:55:43Z","creator":"florida","date_created":"2018-03-21T12:55:43Z"}],"status":"public","type":"conference","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)"},{"doi":"10.17619/UNIPB/1-13","title":"Solving Heterogeneity for a Successful Service Market","date_created":"2017-10-17T12:41:21Z","author":[{"last_name":"Arifulina","full_name":"Arifulina, Svetlana","first_name":"Svetlana"}],"supervisor":[{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:13Z","citation":{"ieee":"S. Arifulina, <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016.","chicago":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>.","ama":"Arifulina S. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn; 2016. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>","apa":"Arifulina, S. (2016). <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>","short":"S. Arifulina, Solving Heterogeneity for a Successful Service Market, Universität Paderborn, 2016.","bibtex":"@book{Arifulina_2016, title={Solving Heterogeneity for a Successful Service Market}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>}, publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2016} }","mla":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>."},"year":"2016","has_accepted_license":"1","file_date_updated":"2018-03-21T12:54:05Z","ddc":["040"],"user_id":"477","department":[{"_id":"66"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"150","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"150-Dissertation_Svetlana_Arifulina.pdf","file_id":"1552","file_size":6340482,"creator":"florida","date_created":"2018-03-21T12:54:05Z","date_updated":"2018-03-21T12:54:05Z"}],"status":"public","type":"dissertation"},{"title":"Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels","author":[{"last_name":"Dunst","full_name":"Dunst, Alexander","first_name":"Alexander"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"},{"last_name":"Hohenstein","full_name":"Hohenstein, Sven","first_name":"Sven"},{"first_name":"Jochen","last_name":"Laubrock","full_name":"Laubrock, Jochen"}],"date_created":"2019-11-21T14:49:46Z","date_updated":"2022-01-06T06:52:15Z","page":"178-180","citation":{"ama":"Dunst A, Hartel R, Hohenstein S, Laubrock J. Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels. In: <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>. ; 2016:178-180.","ieee":"A. Dunst, R. Hartel, S. Hohenstein, and J. Laubrock, “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels,” in <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 2016, pp. 178–180.","chicago":"Dunst, Alexander, Rita Hartel, Sven Hohenstein, and Jochen Laubrock. “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels.” In <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 178–80, 2016.","apa":"Dunst, A., Hartel, R., Hohenstein, S., &#38; Laubrock, J. (2016). Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels. In <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i> (pp. 178–180).","mla":"Dunst, Alexander, et al. “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels.” <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 2016, pp. 178–80.","bibtex":"@inproceedings{Dunst_Hartel_Hohenstein_Laubrock_2016, title={Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels}, booktitle={Digital Humanities 2016, DH 2016, Conference Abstracts}, author={Dunst, Alexander and Hartel, Rita and Hohenstein, Sven and Laubrock, Jochen}, year={2016}, pages={178–180} }","short":"A. Dunst, R. Hartel, S. Hohenstein, J. Laubrock, in: Digital Humanities 2016, DH 2016, Conference Abstracts, 2016, pp. 178–180."},"year":"2016","language":[{"iso":"eng"}],"department":[{"_id":"69"}],"user_id":"14961","_id":"15085","status":"public","publication":"Digital Humanities 2016, DH 2016, Conference Abstracts","type":"conference"},{"publication_identifier":{"isbn":["9781509020201"]},"publication_status":"published","page":"1026-1037","citation":{"ama":"Böttcher S, Hartel R, Jacobs T, Maneth S. Incremental updates on compressed XML. In: <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>. IEEE; 2016:1026-1037. doi:<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>","ieee":"S. Böttcher, R. Hartel, T. Jacobs, and S. Maneth, “Incremental updates on compressed XML,” in <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, 2016, pp. 1026–1037.","chicago":"Böttcher, Stefan, Rita Hartel, Thomas Jacobs, and Sebastian Maneth. “Incremental Updates on Compressed XML.” In <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, 1026–37. IEEE, 2016. <a href=\"https://doi.org/10.1109/icde.2016.7498310\">https://doi.org/10.1109/icde.2016.7498310</a>.","bibtex":"@inproceedings{Böttcher_Hartel_Jacobs_Maneth_2016, title={Incremental updates on compressed XML}, DOI={<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>}, booktitle={2016 IEEE 32nd International Conference on Data Engineering (ICDE)}, publisher={IEEE}, author={Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas and Maneth, Sebastian}, year={2016}, pages={1026–1037} }","short":"S. Böttcher, R. Hartel, T. Jacobs, S. Maneth, in: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), IEEE, 2016, pp. 1026–1037.","mla":"Böttcher, Stefan, et al. “Incremental Updates on Compressed XML.” <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, IEEE, 2016, pp. 1026–37, doi:<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>.","apa":"Böttcher, S., Hartel, R., Jacobs, T., &#38; Maneth, S. (2016). Incremental updates on compressed XML. In <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i> (pp. 1026–1037). IEEE. <a href=\"https://doi.org/10.1109/icde.2016.7498310\">https://doi.org/10.1109/icde.2016.7498310</a>"},"year":"2016","author":[{"full_name":"Böttcher, Stefan","id":"624","last_name":"Böttcher","first_name":"Stefan"},{"last_name":"Hartel","full_name":"Hartel, Rita","id":"14961","first_name":"Rita"},{"full_name":"Jacobs, Thomas","last_name":"Jacobs","first_name":"Thomas"},{"first_name":"Sebastian","last_name":"Maneth","full_name":"Maneth, Sebastian"}],"date_created":"2019-11-21T14:52:52Z","publisher":"IEEE","date_updated":"2022-01-06T06:52:15Z","doi":"10.1109/icde.2016.7498310","title":"Incremental updates on compressed XML","publication":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","type":"conference","status":"public","department":[{"_id":"69"}],"user_id":"14961","_id":"15086","language":[{"iso":"eng"}]},{"publisher":"Springer","date_updated":"2022-01-06T06:52:15Z","date_created":"2019-11-21T16:42:47Z","author":[{"first_name":"Karlson","orcid":"0000-0001-9407-7903","last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson","id":"13472"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Held","full_name":"Held, S.","first_name":"S."},{"first_name":"R.","full_name":"Neiger, R.","last_name":"Neiger"}],"title":"Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts","year":"2016","citation":{"chicago":"Pfannschmidt, Karlson, Eyke Hüllermeier, S. Held, and R. Neiger. “Evaluating Tests in Medical  Diagnosis-Combining Machine Learning with Game-Theoretical Concepts.” In <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, 450–61. Springer, 2016.","ieee":"K. Pfannschmidt, E. Hüllermeier, S. Held, and R. Neiger, “Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts,” in <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, 2016, pp. 450–461.","ama":"Pfannschmidt K, Hüllermeier E, Held S, Neiger R. Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts. In: <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>. Springer; 2016:450-461.","short":"K. Pfannschmidt, E. Hüllermeier, S. Held, R. Neiger, in: In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands, Springer, 2016, pp. 450–461.","bibtex":"@inproceedings{Pfannschmidt_Hüllermeier_Held_Neiger_2016, title={Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts}, booktitle={In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands}, publisher={Springer}, author={Pfannschmidt, Karlson and Hüllermeier, Eyke and Held, S. and Neiger, R.}, year={2016}, pages={450–461} }","mla":"Pfannschmidt, Karlson, et al. “Evaluating Tests in Medical  Diagnosis-Combining Machine Learning with Game-Theoretical Concepts.” <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, Springer, 2016, pp. 450–61.","apa":"Pfannschmidt, K., Hüllermeier, E., Held, S., &#38; Neiger, R. (2016). Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts. In <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i> (pp. 450–461). Springer."},"page":"450-461","_id":"15111","user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"language":[{"iso":"eng"}],"type":"conference","publication":"In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands","status":"public"},{"department":[{"_id":"69"}],"user_id":"14961","_id":"15184","language":[{"iso":"eng"}],"publication":"DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma","type":"conference_abstract","status":"public","date_created":"2019-11-26T09:27:07Z","author":[{"first_name":"Alexander","last_name":"Dunst","full_name":"Dunst, Alexander"},{"last_name":"Hartel","full_name":"Hartel, Rita","id":"14961","first_name":"Rita"}],"date_updated":"2022-01-06T06:52:16Z","title":"Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane","citation":{"ama":"Dunst A, Hartel R. Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane. In: <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>. ; 2016.","ieee":"A. Dunst and R. Hartel, “Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane,” in <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>, 2016.","chicago":"Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen Am Beispiel Graphischer Romane.” In <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>, 2016.","apa":"Dunst, A., &#38; Hartel, R. (2016). Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane. In <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>.","bibtex":"@inproceedings{Dunst_Hartel_2016, title={Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane}, booktitle={DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma}, author={Dunst, Alexander and Hartel, Rita}, year={2016} }","mla":"Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen Am Beispiel Graphischer Romane.” <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>, 2016.","short":"A. Dunst, R. Hartel, in: DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma, 2016."},"year":"2016"}]