@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},
}
@article{13917,
author = {Amrehn, Sabrina and Berghoff, Daniel and Nikitin, Andreas and Reichelt, Matthias and Wu, Xia and Meier, Torsten and Wagner, Thorsten},
issn = {1569-4410},
journal = {Photonics and Nanostructures - Fundamentals and Applications},
pages = {55--63},
title = {{Indium oxide inverse opal films synthesized by structure replication method}},
doi = {10.1016/j.photonics.2016.02.005},
volume = {19},
year = {2016},
}
@misc{136,
author = {Vollmers, Daniel},
publisher = {Universität Paderborn},
title = {{Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen}},
year = {2016},
}
@article{13479,
author = {Lücke, Andreas and Ortmann, Frank and Panhans, Michel and Sanna, Simone and Rauls, Eva and Gerstmann, Uwe and Schmidt, Wolf Gero},
issn = {1520-6106},
journal = {The Journal of Physical Chemistry B},
pages = {5572--5580},
title = {{Temperature-Dependent Hole Mobility and Its Limit in Crystal-Phase P3HT Calculated from First Principles}},
doi = {10.1021/acs.jpcb.6b03598},
volume = {120},
year = {2016},
}
@article{13481,
author = {Jeckelmann, Eric and Sanna, Simone and Schmidt, Wolf Gero and Speiser, Eugen and Esser, Norbert},
issn = {2469-9950},
journal = {Physical Review B},
number = {24},
title = {{Grand canonical Peierls transition in In/Si(111)}},
doi = {10.1103/physrevb.93.241407},
volume = {93},
year = {2016},
}
@inbook{13537,
author = {Hagengruber, Ruth},
booktitle = {Ethik/Philosophie Didaktik. Praxishandbuch für die Sekundarstufe I und II.},
editor = {Brüning, Barbara},
pages = {133–143},
publisher = {Cornelsen},
title = {{Philosophinnen in der Schule}},
year = {2016},
}
@article{13816,
author = {Yeom, Han Woong and Oh, Deok Mahn and Wippermann, Stefan and Schmidt, Wolf Gero},
issn = {1936-0851},
journal = {ACS Nano},
pages = {810--814},
title = {{Impurity-Mediated Early Condensation of a Charge Density Wave in an Atomic Wire Array}},
doi = {10.1021/acsnano.5b05925},
volume = {10},
year = {2016},
}
@inproceedings{143,
abstract = {We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].},
author = {Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)},
pages = {92--102},
title = {{The Monotone Circuit Value Problem with Bounded Genus Is in NC}},
doi = {10.1007/978-3-319-42634-1_8},
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{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{15184,
author = {Dunst, Alexander and Hartel, Rita},
booktitle = {DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma},
title = {{Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane}},
year = {2016},
}
@article{15259,
author = {Decker, Simon and Schmitz, Hendrik},
issn = {0167-6296},
journal = {Journal of Health Economics},
pages = {156--170},
title = {{Health shocks and risk aversion}},
doi = {10.1016/j.jhealeco.2016.09.006},
year = {2016},
}
@phdthesis{150,
author = {Arifulina, Svetlana},
publisher = {Universität Paderborn},
title = {{Solving Heterogeneity for a Successful Service Market}},
doi = {10.17619/UNIPB/1-13},
year = {2016},
}
@inproceedings{148,
abstract = {Successful business model innovation is impossible without innovative business model ideas. When generating such ideas, humans make use of two properties of the human cognitive system: First, their ability to build up knowledge (i.e., raw material for new ideas), and second, their ability to flexibly recombine that knowledge. While these properties enable humans to generate innovative ideas, the amounts of knowledge and cognitive flexibility that humans can possess are limited, which in turn limits human idea generation capability. With business model idea generators, a new class of information systems is proposed that can contribute to alleviating the limits that constrain human idea generation. The ideas that such idea generators produce can complement human business model ideas, thereby increase the probability for high-quality ideas, and eventually raise the odds of successful business model innovation. The contribution is a design theory that describes the architecture of the proposed idea generators.},
author = {John, Thomas},
booktitle = {Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland},
location = {Dublin, Ireland},
title = {{Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory}},
year = {2016},
}
@article{1457,
author = {Li, Guixin and Zentgraf, Thomas and Zhang, Shuang},
issn = {1745-2473},
journal = {Nature Physics},
number = {8},
pages = {736--740},
publisher = {Springer Nature},
title = {{Rotational Doppler effect in nonlinear optics}},
doi = {10.1038/nphys3699},
volume = {12},
year = {2016},
}
@inproceedings{16264,
author = {Wang, Z. and Tröster, Thomas},
location = {Kaiserslautern},
title = {{Parameterstudien an intrinsisch hergestellten Metall-FVK-Hybridstrukturen mittels RTM-Verfahren}},
year = {2016},
}
@inproceedings{16269,
author = {Wang, Z. and Lauter, C. and Löseke, Julian and Tröster, Thomas},
location = {Lisbon, Portugal},
title = {{CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications}},
year = {2016},
}
@inproceedings{1630,
author = {Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola, Matteo and Siracusa, Domenico and Schwabe, Arne},
booktitle = {NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium},
isbn = {9781509002238},
publisher = {IEEE},
title = {{A non-disruptive automated approach to update SDN applications at runtime}},
doi = {10.1109/noms.2016.7502946},
year = {2016},
}
@inproceedings{16358,
author = {Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
booktitle = {Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)},
publisher = {Springer},
title = {{The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}},
doi = {10.1007/978-3-319-53058-1_5 },
year = {2016},
}
@unpublished{16396,
abstract = {We consider a scheduling problem where machines need to be rented from the
cloud in order to process jobs. There are two types of machines available which
can be rented for machine-type dependent prices and for arbitrary durations.
However, a machine-type dependent setup time is required before a machine is
available for processing. Jobs arrive online over time, have machine-type
dependent sizes and have individual deadlines. The objective is to rent
machines and schedule jobs so as to meet all deadlines while minimizing the
rental cost.
Since we observe the slack of jobs to have a fundamental influence on the
competitiveness, we study the model when instances are parameterized by their
(minimum) slack. An instance is called to have a slack of $\beta$ if, for all
jobs, the difference between the job's release time and the latest point in
time at which it needs to be started is at least $\beta$. While for $\beta < s$
no finite competitiveness is possible, our main result is an
$O(\frac{c}{\varepsilon} + \frac{1}{\varepsilon^3})$-competitive online
algorithm for $\beta = (1+\varepsilon)s$ with $\frac{1}{s} \leq \varepsilon
\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of
the machine-types, respectively. It is complemented by a lower bound of
$\Omega(\frac{c}{\varepsilon})$.},
author = {Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
booktitle = {arXiv:1609.01184},
title = {{Cost-efficient Scheduling on Machines from the Cloud}},
year = {2016},
}