Celikik, M.; Bast, H.; Manolache, G.: Efficient Index-based Snippet Generation. ACM Transactions on Information Systems 32 (2), 6, S. 6:1 - 6:24 (2009)

Chan, T.-H. H.: Metric Embeddings with Relaxed Guarantees. SIAM Journal on Computing 38, S. 2303 - 2329 (2009)

Chan, T.-H. H.: Small Hop-diameter Sparse Spanners for Doubling Metrics. Discrete and Computational Geometry 41 (1), S. 28 - 44 (2009)

Christodoulou, G.; Koutsoupias, E.: Mechanism Design for Scheduling. Bulletin of the European Association for Theoretical Computer Science 97, S. 40 - 59 (2009)

Christodoulou, G.; Koutsoupias, E.; Nanavati, A.: Coordination Mechanisms. Theoretical computer science 410 (36), S. 3327 - 3336 (2009)

Christodoulou, G.; Koutsoupias, E.; Vidali, A.: A Lower Bound for Scheduling Mechanisms. Algorithmica 55 (4), S. 729 - 740 (2009)

Cooley, O.; Fountoulakis, N.; Kühn, D.; Osthus, D.: Embeddings and Ramsey Numbers of Sparse k-uniform Hypergraphs. Combinatorica 29 (3), S. 263 - 297 (2009)

Demartini, G.; Denoyer, L.; Doucet, A.; Fachry, K. N.; Gallinari, P.; Geva, S.; Huang, W.-C.; Iofciu, T.; Kamps, J.; Kazai, G. et al.; Koolen, M.; Landoni, M.; Nordlie, R.; Pharo, N.; Schenkel, R.; Theobald, M.; Trotman, A.; de Vries, A. P.; Woodley, A.; Zhu, J.: Report on INEX 2008. SIGIR Forum 43 (1), S. 22 - 28 (2009)

Doerr, B.; Fouz, M.: A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. Electronic Notes in Discrete Mathematics 34, S. 335 - 339 (2009)

Doerr, B.; Friedrich, T.: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability and Computing 18, S. 123 - 144 (2009)

Doerr, B.; Friedrich, T.; Sauerwald, T.: Quasirandom Rumor Spreading on Expanders. Electronic Notes in Discrete Mathematics 34, S. 243 - 247 (2009)

Dumitriu, D.; Funke, S.; Kutz, M.; Milosavjevic, N.: How Much Geometry It Takes to Reconstruct a 2-Manifold in R^3. ACM Journal of Experimental Algorithms 14, S. 2.2 - 2.17 (2009)

Eisemann, E.; Paris, S.; Durand, F.: A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics. ACM Transactions on Graphics (Proc. of Siggraph) 28 (3), 83, S. 83,1 - 83,8 (2009)

Elbassioni, K.: Algorithms for Dualization over Products of Partially Ordered Sets. SIAM Journal on Discrete Mathematics 23 (1), S. 487 - 510 (2009)

Elbassioni, K. M.; Krohn, E.; Matijevic, D.; Mestre, J.; Severdija, D.: Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60, S. 451 - 463 (2009)

Epstein, L.; van Stee, R.; Tamir, T.: Paging with Request Sets. Theory of Computing Systems 44 (1), S. 67 - 81 (2009)

Feldmann, A.; Kind, M.; Maennel, O.; Schaffrath, G.; Werle, C.: Network Virtualization -- An Enabler for Overcoming Ossification. ERCIM News 2009 (77), S. 21 - 22 (2009)

Fietzke, A.; Weidenbach, C.: Labelled Splitting. Annals of Mathematics and Artificial Intelligence 55 (1-2), S. 3 - 33 (2009)

Friedrich, T.; He, J.; Hebbinghaus, N.; Neumann, F.; Witt, C.: Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 17 (1), S. 3 - 19 (2009)

Friedrich, T.; Hebbinghaus, N.; Neumann, F.: Comparison of Simple Diversity Mechanisms on Plateau Functions. Theoretical computer science 420 (26), S. 2455 - 2462 (2009)