Böttcher, S., Hartel, R., &; Messinger, C. (2010). Searchable Compression of Office Documents by XML Schema Subtraction. In Database and XML Technologies - 7th International XML Database Symposium, XSym 2010 (pp. 103–112). Springer.https://doi.org/10.1007/978-3-642-15684-7_9 
LibreCat: /record/15137
DOI: 10.1007/978-3-642-15684-7_9

Degener, B., Kempkes, B., Kling, P., &; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-13284-1_14 
LibreCat: /record/16365
DOI: 10.1007/978-3-642-13284-1_14

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14162-1 
LibreCat: /record/16403
DOI: 10.1007/978-3-642-14162-1

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14165-2 
LibreCat: /record/16404
DOI: 10.1007/978-3-642-14165-2

Trier, M., &; Müller, C. (2010). Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In Practical Aspects of Knowledge Management. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30545-3_23 
LibreCat: /record/13301
DOI: 10.1007/978-3-540-30545-3_23

Bonorden, O., Degener, B., Kempkes, B., &; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-05434-1_25 
LibreCat: /record/19724
DOI: 10.1007/978-3-642-05434-1_25

Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-04052-8_43 
LibreCat: /record/2920
DOI: 10.1007/978-3-642-04052-8_43

Schrieb, J., Wehrheim, H., &; Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-05089-3_8 
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

Briest, P., Hoefer, M., Gualà, L., &; Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-10841-9_6 
LibreCat: /record/23744
DOI: 10.1007/978-3-642-10841-9_6

Biermann, T., Schwabe, A., &; Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In NETWORKING 2009 (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-01399-7_69 
LibreCat: /record/1830
DOI: 10.1007/978-3-642-01399-7_69