@inproceedings{12029,
  author       = {{Klingler, Florian and Dressler, Falko and Sommer, Christoph}},
  booktitle    = {{2015 IEEE Vehicular Networking Conference (VNC)}},
  isbn         = {{9781467394116}},
  title        = {{{IEEE 802.11p unicast considered harmful}}},
  doi          = {{10.1109/vnc.2015.7385550}},
  year         = {{2016}},
}

@inproceedings{12039,
  author       = {{Memedi, Agon and Hagenauer, Florian and Dressler, Falko and Sommer, Christoph}},
  booktitle    = {{2015 IEEE Vehicular Networking Conference (VNC)}},
  isbn         = {{9781467394116}},
  title        = {{{Cluster-based transmit power control in heterogeneous vehicular networks}}},
  doi          = {{10.1109/vnc.2015.7385547}},
  year         = {{2016}},
}

@misc{128,
  author       = {{Bernhardt, Katharina}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}}},
  year         = {{2016}},
}

@book{12892,
  author       = {{Beutner, Marc and Schneider, J.}},
  pages        = {{19}},
  publisher    = {{IK Verlag}},
  title        = {{{Handbuch für Lehrkräfte. Ein Handbuch zur Nutzung des SEEL-Online-Course-Creators}}},
  year         = {{2016}},
}

@misc{129,
  author       = {{Schmidt, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings}}},
  year         = {{2016}},
}

@inbook{12935,
  author       = {{Komprecht, Anna Maria and Röwenstrunk, Daniel}},
  booktitle    = {{„Ei, dem alten Herrn zoll’ ich Achtung gern“}},
  publisher    = {{Allitera Verlag, München}},
  title        = {{{Projektmanagement in digitalen Forschungsprojekten}}},
  doi          = {{10.25366/2018.33}},
  year         = {{2016}},
}

@book{12972,
  abstract     = {{Taking inspiration from self-awareness in humans, this book introduces the new notion of computational self-awareness as a fundamental concept for designing and operating computing systems. The basic ability of such self-aware computing systems is to collect information about their state and progress, learning and maintaining models containing knowledge that enables them to reason about their behaviour. Self-aware computing systems will have the ability to utilise this knowledge to effectively and autonomously adapt and explain their behaviour, in changing conditions. This book addresses these fundamental concepts from an engineering perspective, aiming at developing primitives for building systems and applications. It will be of value to researchers, professionals and graduate students in computer science and engineering.}},
  editor       = {{Lewis, Peter R. and Platzner, Marco and Rinner, Bernhard and Tørresen, Jim and Yao, Xin}},
  isbn         = {{9783319396743}},
  issn         = {{1619-7127}},
  publisher    = {{Springer}},
  title        = {{{Self-aware Computing Systems: An Engineering Approach}}},
  doi          = {{10.1007/978-3-319-39675-0}},
  year         = {{2016}},
}

@inproceedings{12975,
  author       = {{Kampmann, Matthias and Hellebrand, Sybille}},
  booktitle    = {{25th IEEE Asian Test Symposium (ATS'16)}},
  pages        = {{1--6}},
  publisher    = {{IEEE}},
  title        = {{{X Marks the Spot: Scan-Flip-Flop Clustering for Faster-than-at-Speed Test}}},
  doi          = {{10.1109/ats.2016.20}},
  year         = {{2016}},
}

@misc{130,
  author       = {{Kaczorkowski, Jessica}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce}}},
  year         = {{2016}},
}

@misc{153,
  author       = {{König, Jürgen}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Shared Resource Scheduling with Interconnected Services}}},
  year         = {{2016}},
}

@phdthesis{154,
  author       = {{Cord-Landwehr, Andreas}},
  isbn         = {{978-3-942647-72-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Selfish Network Creation - On Variants of Network Creation Games}}},
  volume       = {{353}},
  year         = {{2016}},
}

@inproceedings{15400,
  author       = {{Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}},
  booktitle    = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}},
  editor       = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}},
  title        = {{{On the identifiability of models  in multi-criteria preference learning}}},
  year         = {{2016}},
}

@inproceedings{15401,
  author       = {{Schäfer, D. and Hüllermeier, Eyke}},
  booktitle    = {{in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}},
  editor       = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}},
  title        = {{{Preference -based reinforcement learning using dyad ranking}}},
  year         = {{2016}},
}

@inproceedings{15402,
  author       = {{Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}},
  booktitle    = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}},
  editor       = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}},
  title        = {{{Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}}},
  year         = {{2016}},
}

@inproceedings{15403,
  author       = {{Lu, S. and Hüllermeier, Eyke}},
  booktitle    = {{in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}},
  editor       = {{Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.}},
  pages        = {{1--8}},
  publisher    = {{KIT Scientific Publishing}},
  title        = {{{Support vector classification on noisy data using fuzzy superset losses}}},
  year         = {{2016}},
}

@inproceedings{15404,
  author       = {{Schäfer, D. and Hüllermeier, Eyke}},
  booktitle    = {{in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany}},
  title        = {{{Plackett-Luce networks for dyad ranking}}},
  year         = {{2016}},
}

@inproceedings{15435,
  author       = {{Domik, Gitta}},
  booktitle    = {{Pedagogy Data Visualization, IEEE VIS Workshop}},
  title        = {{{A data visualization course at the university of paderborn}}},
  year         = {{2016}},
}

@inproceedings{155,
  abstract     = {{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.}},
  author       = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  pages        = {{248----262}},
  title        = {{{Self-stabilizing Metric Graphs}}},
  doi          = {{10.1007/978-3-319-49259-9_20}},
  year         = {{2016}},
}

@inproceedings{157,
  abstract     = {{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.}},
  author       = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}},
  booktitle    = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}},
  pages        = {{563----577}},
  title        = {{{Scheduling with Interjob Communication on Parallel Processors}}},
  doi          = {{10.1007/978-3-319-48749-6_41}},
  year         = {{2016}},
}

@article{15731,
  author       = {{Thonig, Danny and Rauch, Tomáš and Mirhosseini, Hossein and Henk, Jürgen and Mertig, Ingrid and Wortelen, Henry and Engelkamp, Bernd and Schmidt, Anke B. and Donath, Markus}},
  issn         = {{2469-9950}},
  journal      = {{Physical Review B}},
  title        = {{{Existence of topological nontrivial surface states in strained transition metals: W, Ta, Mo, and Nb}}},
  doi          = {{10.1103/physrevb.94.155132}},
  year         = {{2016}},
}

