Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.”10.1007/978-3-642-15193-4_60__From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60.

Grzablewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55.

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.

Seebach, Hella, et al. “Designing Self-Healing in Automotive Systems.”10.1007/978-3-642-16576-4_4__Lecture Notes in Computer Science, 2010, doi:10.1007/978-3-642-16576-4_4.

Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.”10.1007/978-3-642-17572-5_37__Workshop on Internet and Network Economics (WINE), 2010, doi:10.1007/978-3-642-17572-5_37.

Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.”10.1007/978-3-642-17289-2_60__Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.

Böttcher, Stefan, et al. “Searchable Compression of Office Documents by XML Schema Subtraction.”10.1007/978-3-642-15684-7_9__Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, Springer, 2010, pp. 103–12, doi:10.1007/978-3-642-15684-7_9.

Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.”10.1007/978-3-642-13284-1_14__Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.

Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.”10.1007/978-3-540-30545-3_23__Practical Aspects of Knowledge Management, 2010, doi:10.1007/978-3-540-30545-3_23.

Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”10.1007/978-3-642-05434-1_25__Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”10.1007/978-3-642-04052-8_43__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:10.1007/978-3-642-04052-8_43.

Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.”10.1007/978-3-642-05089-3_8__FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.

Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.”10.1007/978-3-642-10841-9_6__Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.

Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.”10.1007/978-3-642-01399-7_69__NETWORKING 2009, Springer Berlin Heidelberg, 2009, pp. 883–94, doi:10.1007/978-3-642-01399-7_69.

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”10.1007/978-3-642-04052-8_43__Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-04052-8_43.

Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.”10.1007/978-3-540-70575-8_66__Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66.

Degener, Bastian, et al. “The Kinetic Facility Location Problem.”10.1007/978-3-540-69903-3_34__Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.

Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.”10.1007/978-3-540-69134-1_44__The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456, doi:10.1007/978-3-540-69134-1_44.