@inproceedings{412,
  abstract     = {{In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.}},
  author       = {{Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}},
  booktitle    = {{Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}},
  pages        = {{1--10}},
  title        = {{{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}},
  doi          = {{10.1109/P2P.2014.6934300}},
  year         = {{2014}},
}

@phdthesis{431,
  abstract     = {{In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems. Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen.}},
  author       = {{Kling, Peter}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Energy-efficient Scheduling Algorithms}}},
  year         = {{2014}},
}

@inproceedings{435,
  abstract     = {{We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.}},
  author       = {{Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}},
  booktitle    = {{Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)}},
  pages        = {{63----74}},
  title        = {{{Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}}},
  doi          = {{10.4230/LIPIcs.STACS.2014.63}},
  year         = {{2014}},
}

@book{16870,
  editor       = {{Flocchini, Paola and Gao, Jie and Kranakis, Evangelos and Meyer auf der Heide, Friedhelm}},
  isbn         = {{9783642453458}},
  issn         = {{0302-9743}},
  publisher    = {{Springer}},
  title        = {{{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}}},
  doi          = {{10.1007/978-3-642-45346-5}},
  volume       = {{8243}},
  year         = {{2014}},
}

@inbook{16394,
  author       = {{Lukovszki, Tamás and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783319144719}},
  issn         = {{0302-9743}},
  title        = {{{Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots}}},
  doi          = {{10.1007/978-3-319-14472-6_17}},
  year         = {{2014}},
}

@inbook{16395,
  author       = {{Abshoff, Sebastian and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Structural Information and Communication Complexity}},
  isbn         = {{9783319096193}},
  issn         = {{0302-9743}},
  title        = {{{Continuous Aggregation in Dynamic Ad-Hoc Networks}}},
  doi          = {{10.1007/978-3-319-09620-9_16}},
  year         = {{2014}},
}

@article{19981,
  author       = {{Mertsching, Bärbel and Divband Soorati, Mohammad and Kotthauser, Tobias}},
  journal      = {{IEEE International Conference on Robotics and Biomimetics (ROBIO)}},
  pages        = {{661--667}},
  title        = {{{Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds}}},
  year         = {{2013}},
}

@article{20148,
  author       = {{Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas}},
  journal      = {{Bulletin of Mathematical Biology}},
  number       = {{7}},
  pages        = {{1181--1206}},
  title        = {{{Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning}}},
  doi          = {{10.1007/s11538-013-9851-4 }},
  volume       = {{75}},
  year         = {{2013}},
}

@article{20150,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Ronald and Zahadat, Payam}},
  journal      = {{Chaos, Solitons & Fractals}},
  pages        = {{100--114}},
  title        = {{{Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems}}},
  doi          = {{10.1016/j.chaos.2013.01.011}},
  volume       = {{50}},
  year         = {{2013}},
}

@inproceedings{20151,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Schwarzer, Christopher and Michiels, Nico K. and Esparcia-Alcazar, Anna Isabel}},
  booktitle    = {{Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)}},
  pages        = {{579--588}},
  title        = {{{Virtual Spatiality in Agent Controllers: Encoding Compartmentalization}}},
  doi          = {{10.1007/978-3-642-37192-9_58}},
  volume       = {{7835}},
  year         = {{2013}},
}

@inproceedings{20160,
  author       = {{Hamann, Heiko}},
  booktitle    = {{7th IEEE Int. Conf. on Self-Adaptive and Self-Organizing Systems (SASO 2013)}},
  pages        = {{227--236}},
  publisher    = {{IEEE Press}},
  title        = {{{A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems}}},
  doi          = {{10.1109/SASO.2013.10}},
  year         = {{2013}},
}

@inproceedings{20161,
  author       = {{Hamann, Heiko and Lio, Pietro and Miglino, Orazio and Nicosia, Giuseppe and Nolfi, Stefano and Pavone, Mario}},
  booktitle    = {{12th European Conference on Artificial Life (ECAL 2013)}},
  publisher    = {{MIT Press}},
  title        = {{{Speciation Dynamics: Generating Selective Pressure Towards Diversity}}},
  year         = {{2013}},
}

@article{20162,
  author       = {{Hamann, Heiko}},
  journal      = {{Swarm Intelligence}},
  number       = {{3}},
  pages        = {{145--172}},
  title        = {{{Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance}}},
  doi          = {{10.1007/s11721-013-0080-0}},
  volume       = {{7}},
  year         = {{2013}},
}

@inproceedings{17439,
  abstract     = {{Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen, setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt, um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren.}},
  author       = {{Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}},
  pages        = {{49----60}},
  title        = {{{Darstellung heterogener 3-D-Szenen in Echtzeit}}},
  volume       = {{311}},
  year         = {{2013}},
}

@phdthesis{17440,
  author       = {{Eikel, Benjamin}},
  title        = {{{Spherical visibility sampling : preprocessed visibility for occlusion culling in complex 3D scenes}}},
  year         = {{2013}},
}

@inproceedings{17442,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}},
  pages        = {{7--16}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen}}},
  volume       = {{311}},
  year         = {{2013}},
}

@proceedings{17443,
  editor       = {{Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide, Friedhelm}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}},
  volume       = {{311}},
  year         = {{2013}},
}

@article{17663,
  abstract     = {{In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.}},
  author       = {{Cohen, R. and Nudelman, I. and Polevoy, Gleb}},
  issn         = {{1063-6692}},
  journal      = {{Networking, IEEE/ACM Transactions on}},
  keywords     = {{Approximation algorithms, Approximation methods, Bandwidth, Logic gates, Radar, Vectors, Wireless sensor networks, Dependent flow scheduling, sensor networks}},
  number       = {{5}},
  pages        = {{1461--1471}},
  title        = {{{On the Admission of Dependent Flows in Powerful Sensor Networks}}},
  doi          = {{10.1109/TNET.2012.2227792}},
  volume       = {{21}},
  year         = {{2013}},
}

@inproceedings{477,
  abstract     = {{We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.}},
  author       = {{Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}},
  pages        = {{22--34}},
  title        = {{{Token Dissemination in Geometric Dynamic Networks}}},
  doi          = {{10.1007/978-3-642-45346-5_3}},
  year         = {{2013}},
}

@inproceedings{499,
  abstract     = {{We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\alpha^{\alpha}$.}},
  author       = {{Kling, Peter and Pietrzyk, Peter}},
  booktitle    = {{Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  pages        = {{251--260 }},
  title        = {{{Profitable Scheduling on Multiple Speed-Scalable Processors}}},
  doi          = {{10.1145/2486159.2486183}},
  year         = {{2013}},
}