Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.

Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware
B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.

Searchable Compression of Office Documents by XML Schema Subtraction
S. Böttcher, R. Hartel, C. Messinger, in: Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, Springer, 2010, pp. 103–112.

A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.

Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes
M. Trier, C. Müller, in: Practical Aspects of Knowledge Management, Berlin, Heidelberg, 2010.

Complexity and Approximation of a Geometric Local Robot Assignment Problem
O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.

Reinforcement Learning for Blackjack
S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 300–301.

Three-Valued Spotlight Abstractions
J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.

On Stackelberg Pricing with Computationally Bounded Consumers
P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.

Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE
T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 883–894.

Reinforcement Learning for Blackjack
S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.

Uniform Budgets and the Envy-Free Pricing Problem
P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.

The Kinetic Facility Location Problem
B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.

Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.

On Faster Integer Calculations Using Non-arithmetic Primitives
K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.

The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
M. Bienkowski, J. Kutyowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.

Low Secret Exponent RSA Revisited
J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.