Zimmermann, Steffen, et al. “How Do Different Sources of the Variance of Online Consumer Ratings Matter?” Workshop on IS Design and Economic Behavior (ISDEB), 2016.

Harks, Tobias, et al. “Routing Games With Progressive Filling.”10.1109/TNET.2015.2468571__IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.

Drees, Maximilian, et al. “Strategic Online Facility Location.”10.1007/978-3-319-48749-6_43__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.

Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.”10.1007/s10878-015-9915-5__Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.

Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.”10.1007/978-3-662-53426-7_6__Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.

Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.”10.1007/978-3-319-42634-1_8__Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.

Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.”10.1016/j.tcs.2016.04.013__Theoretical Computer Science, vol. 634, Elsevier, 2016, pp. 67–96, doi:10.1016/j.tcs.2016.04.013.

Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1002/cpe.3716__Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.

Brangewitz, Sonja, et al. Strategic Formation of Customer Relationship Networks. Vol. 91, Universität Paderborn, 2015.

Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility.” Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster, 2015.

Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.”10.1109/EWSDN.2015.57__Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7, doi:10.1109/EWSDN.2015.57.

Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”10.4230/LIPIcs.OPODIS.2015.24__Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.

Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1007/978-3-319-21741-3_14__Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.

Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.”10.1007/978-3-319-15612-5_16__Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.

Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria in Mix-Weighted Congestion Games on Parallel Links.”10.1016/j.ipl.2015.07.012__Information Processing Letters, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:10.1016/j.ipl.2015.07.012.

Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.”10.1109/EWSDN.2015.58__Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42, doi:10.1109/EWSDN.2015.58.

Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?” INFORMS Annual Meeting, 2015.

Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”10.1145/2767386.2767454__Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.

Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.”10.1145/2614687__Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1016/j.tcs.2014.11.027__Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.

Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.”10.1002/cb.1553__Journal of Consumer Behaviour, vol. 14, no. 6, Wiley Online Library, 2015, pp. 366–77, doi:10.1002/cb.1553.

Herrmann, Philipp, et al. “How Do Different Sources of the Variance of Consumer Ratings Matter?” Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth, 2015.

Brangewitz, Sonja, and Jochen Manegold. Competition and Product Innovation of Intermediaries in a Differentiated Duopoly. Universität Paderborn, 2015.

Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.”10.1007/978-3-662-48433-3_14__Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.

Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.”10.1007/978-3-662-48054-0_21__Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.

Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”10.1007/978-3-319-21398-9_22__Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.

Fahr, Rene, and Behnud Mir Djawadi. “‘and They Are Really Lying’: Clean Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.”10.1016/j.joep.2015.03.002__Journal of Economic Psychology, Elsevier, 2015, pp. 48–59, doi:10.1016/j.joep.2015.03.002.

Monien, Burkhard, et al. “Weighted Boolean Formula Games.”10.1007/978-3-319-24024-4_6__The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday, 2015, pp. 49–86, doi:10.1007/978-3-319-24024-4_6.

Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.”10.1016/j.ejor.2014.07.019__European Journal of Operational Research, vol. 240, no. 2, Elsevier, 2015, pp. 505–17, doi:10.1016/j.ejor.2014.07.019.

Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.”10.1109/ICC.2015.7249298__2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127, doi:10.1109/ICC.2015.7249298.

Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus Variance.”10.1007/s00224-014-9542-z__Theory of Computing Systems, vol. 57, no. 3, Springer, 2015, pp. 617–54, doi:10.1007/s00224-014-9542-z.

Herrmann, Philipp, et al. Different Sources of the Variance of Online Consumer Ratings and Their Impact on Price and Demand. 2015.

Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.”10.1007/s00199-014-0846-7__Economic Theory, vol. 57, no. 3, Springer Nature, 2014, pp. 529–54, doi:10.1007/s00199-014-0846-7.

Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined Networks.”10.1109/IFIPNetworking.2014.6857078__Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014, pp. 1–9, doi:10.1109/IFIPNetworking.2014.6857078.

Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.”10.1109/ICC.2014.6883825__Proceedings of the IEEE International Conference on Communications 2014, 2014, pp. 3270–76, doi:10.1109/ICC.2014.6883825.

Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.

Kaimann, Daniel, and Joe Cox. The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry. Universität Paderborn, 2014.

Keller, Matthias, et al. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.”10.1109/UCC.2014.49__Proceedings of 7th International Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395, doi:10.1109/UCC.2014.49.

Blazovics, Laszlo, et al. “Surrounding Robots -- A Discrete Localized Solution for the Intruder Problem.”10.20965/jaciii.2014.p0315__Journal of Advanced Computational Intelligence and Intelligent Informatics, no. 3, Fuji Technology Press Ltd., 2014, pp. 315--319, doi:10.20965/jaciii.2014.p0315.

Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.”10.1109/CloudNet.2014.6968961__Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13, doi:10.1109/CloudNet.2014.6968961.

Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.”10.1109/CTS.2014.6867595__Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405, doi:10.1109/CTS.2014.6867595.

Harks, Tobias, et al. “Routing Games with Progressive Filling.”10.1109/TNET.2015.2468571__Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.

Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.”10.1145/2627566.2627570__Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52, doi:10.1145/2627566.2627570.

Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.”10.1007/s00224-012-9431-2__Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612, doi:10.1007/s00224-012-9431-2.

Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.”10.1007/978-3-319-12691-3_3__Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.

Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”10.1007/978-3-319-13129-0_34__Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.

Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”10.1109/SCC.2014.35__Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.

Mauleon, Ana, et al. Constitutions and Social Networks. Universität Paderborn, 2014.

Mir Djawadi, Behnud, et al. “Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.”10.1016/j.jval.2014.08.2669__Value in Health, no. 8, Elsevier, 2014, pp. 814–22, doi:10.1016/j.jval.2014.08.2669.

Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.”10.1007/s00199-014-0846-7__Economic Theory, no. 3, Springer, 2014, pp. 529–54, doi:10.1007/s00199-014-0846-7.

Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.”10.1007/978-3-662-44803-8_10__Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.

Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.

Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.”10.1007/978-3-319-13129-0_3__Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.

Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.”10.4230/LIPIcs.APPROX-RANDOM.2014.242__Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57, doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.

Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.”10.1007/978-3-319-13129-0_43__Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43.

Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.”10.1007/978-3-319-09620-9_1__Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.

Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.”10.5220/0005110406250630__Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–30, doi:10.5220/0005110406250630.

Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.”10.1007/s00224-013-9504-x__Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.

Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.”10.1016/j.future.2014.03.005__Future Generation Computer Systems, Elsevier, 2014, pp. 44--52, doi:10.1016/j.future.2014.03.005.

Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.”10.1145/2620728.2620730__Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014, pp. 115--120, doi:10.1145/2620728.2620730.

Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.”10.1007/978-3-319-11764-5_4__Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.

Abshoff, Sebastian, et al. “Multilevel Network Games.”10.1007/978-3-319-13129-0_36__Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.

Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.

Jungmann, Alexander, et al. “Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services.” International Journal On Advances in Intelligent Systems (IntSys), vol. 7, no. 3&;4, IARIA, 2014, pp. 572--594.

Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.”10.1109/P2P.2014.6934300__Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.

Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.”10.1016/j.econlet.2013.08.013__Economics Letters, vol. 121, no. 2, Elsevier, 2013, pp. 224–27, doi:10.1016/j.econlet.2013.08.013.

Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.”10.1145/2486001.2491710__Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–42, doi:10.1145/2486001.2491710.

Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn, 2013.

Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.”10.1007/s00224-013-9454-3__Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.

Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”10.1007/978-3-642-45346-5_3__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, 2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.

Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.”10.1007/s11573-013-0652-x__Journal of Business Economics, vol. 83, no. 2, Springer, 2013, pp. 101–19, doi:10.1007/s11573-013-0652-x.

Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P and Cloud Systems: The Wikipedia Case.”10.1109/ICC.2013.6655082__Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.

Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.”10.1109/INFCOM.2013.6567022__Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 2193–201, doi:10.1109/INFCOM.2013.6567022.

Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.”10.1007/978-3-319-03850-6_2__Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.

Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.”10.1109/LANMAN.2013.6528271__Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6, doi:10.1109/LANMAN.2013.6528271.

Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.”10.1109/NetSys.2013.10__Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10.

Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.”10.1109/IPDPS.2013.40__Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.

Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64, CIE Working Paper Series, Paderborn University, 2013.

Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.”10.1109/INFCOMW.2013.6970733__Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.

Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?”10.1016/j.dam.2013.05.022__Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:10.1016/j.dam.2013.05.022.

Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013.

Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.”10.1109/ICCCN.2013.6614118__Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.

Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1109/HPCSim.2013.6641399__Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106, doi:10.1109/HPCSim.2013.6641399.

Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.”10.1109/NetSys.2013.11__Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34, doi:10.1109/NetSys.2013.11.

Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.”10.1109/P2P.2013.6688720__Proceedings of the International Conference on Peer-to-Peer Computing (P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.

Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.”10.1016/j.econlet.2013.08.013__Economics Letters, no. 2, Elsevier, 2013, pp. 224–27, doi:10.1016/j.econlet.2013.08.013.

Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.

Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.”10.1109/NetSys.2013.9__Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.

Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.”10.1109/UCC.2013.85__Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–34, doi:10.1109/UCC.2013.85.

Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.”10.1007/978-3-642-45346-5_16__Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27, doi:10.1007/978-3-642-45346-5_16.

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1007/978-3-319-03578-9_14__Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.

Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.”10.1007/s10726-012-9286-6__Group Decision and Negotiation, vol. 22, no. 4, Springer Nature, 2012, pp. 657–80, doi:10.1007/s10726-012-9286-6.

Haake, Claus-Jochen, et al. “On the Institutional Design of Burden Sharing When Financing External Border Enforcement in the EU.”10.1007/s10368-012-0226-3__International Economics and Economic Policy, vol. 10, no. 4, Springer Nature, 2012, pp. 583–612, doi:10.1007/s10368-012-0226-3.

Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.”10.1016/j.tcs.2012.07.029__Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.

Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.”10.1016/j.tcs.2011.12.079__Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.

Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012.

Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.”10.1145/2229163.2229174__Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.

Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.”10.1007/978-3-642-33996-7_21__Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21.

Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012.

Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012.