Bonifaci, V.; Korteweg, P.; Marchetti-Spaccamela, A.; Stougie, L.: Minimizing Flow Time in the Wireless Gathering Problem. ACM Transactions on Algorithms 7 (3), 33, pp. 33:1 - 33:20 (2011)

Bonifaci, V.; Korteweg, P.; Marchetti-Spaccamela, A.; Stougie, L.: The Distributed Wireless Gathering Problem. Theoretical Computer Science 412 (8-10), pp. 633 - 641 (2011)

Boros, E.; Elbassioni, K.; Gurvich, V.; Tiwary, H. R.: The Negative Cycles Polyhedron and Hardness of Checking Some Polyhedral Properties. Annals of Operations Research 188 (1), pp. 63 - 76 (2011)

Bulling, A.; Roggen, D.; Tröster, G.: What's in in the Eyes for Context-Awareness? IEEE Pervasive Computing 10 (2), pp. 48 - 57 (2011)

Bulling, A.; Ward, J. A.; Gellersen, H.; Tröster, G.: Eye Movement Analysis for Activity Recognition Using Electrooculography. IEEE Transactions on Pattern Analysis and Machine Intelligence 33 (4), pp. 741 - 753 (2011)

Burel, G.: Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo. Logical Methods in Computer Science 7 (1), 3, pp. 3:1 - 3:31 (2011)

Cerdeira, L. T.; Carneir, A. R.; Ramos, R. T. J.; de Almeida, S. S.; Alfonseca, V.; Schneider, M. P. C.; Baumbach, J.; Tauch, A.; McCulloch, J. A.; Azevedo, V. A. C. et al.; Silva, A.: Rapid hybrid de novo assembly of a microbial genome using only short reads: Corynebacterium pseudotuberculosis I19 as a case study. Journal of Microbiological Methods 86 (2), pp. 218 - 223 (2011)

Chan, H.-L.; Edmonds, J.; Lam, T.-W.; Lee, L.-K.; Marchetti-Spaccamela, A.; Pruhs, K.: Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61 (3), pp. 507 - 517 (2011)

Chan, T.-H. H.; Elbassioni, K.: A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discrete & Computational Geometry 46 (4), pp. 704 - 723 (2011)

Codoner, F.; Pou, C.; Thielen, A.; García, F.; Delgado, R.; Dalmau, D.; Álvarez-Tejado, M.; Ruiz, L.; Clotet, B.; Paredes, R.: Added value of deep sequencing relative to population sequencing in heavily pre-treated HIV-1-infected subjects. PLoS ONE 6 (5), pp. e19461,1 - e19461,5 (2011)

Damm, W.; Ihlemann, C.; Sofronie-Stokkermans, V.: PTIME parametric verification of safety properties for reasonable linear hybrid automata. Mathematics in Computer Science 5 (4), pp. 469 - 497 (2011)

Däumer, M.; Kaiser, R.; Klein, R.; Lengauer, T.; Thiele, B.; Thielen, A.: Genotypic tropism testing by massively parallel sequencing: qualitative and quantitative analysis. BMC Medical Informatics and Decision Making 11 (1), pp. 30,1 - 30,8 (2011)

De Sterck, H.; Miller, K.; Sanders, G.; Winlaw, M.: Recursively Accelerated Multilevel Aggregation for Markov Chains. SIAM Journal on Scientific Computing 32 (3), pp. 1652 - 1671 (2011)

Denev, D.; Mazeika, A.; Spaniol, M.; Weikum, G.: The SHARC Framework for Data Quality in Web Archiving. The VLDB Journal 20 (2), pp. 183 - 207 (2011)

Didyk, P.; Ritschel, T.; Eisemann, E.; Myszkowski, K.; Seidel, H.-P.: A Perceptual Model for Disparity. ACM Transactions on Graphics 30 (4), 96, pp. 1 - 10 (2011)

Doerr, B.; Eremeev, A.; Neumann, F.; Theile, M.; Thyssen, C.: Evolutionary Algorithms and Dynamic Programming. Theoretical Computer Science 412, pp. 6020 - 6035 (2011)

Doerr, B.; Fouz, M.: Asymptotically Optimal Randomized Rumor Spreading. Electronic Notes in Discrete Mathematics 38, pp. 297 - 302 (2011)

Doerr, B.; Fouz, M.: Quasi-random Rumor Spreading: Reducing Randomness Can be Costly. Information Processing Letters 111 (5), pp. 227 - 230 (2011)

Doerr, B.; Friedrich, T.; Künnemann, M.; Sauerwald, T.: Quasirandom Rumor Spreading: An Experimental Analysis. ACM Journal of Experimental Algorithmics 16, p. Article No. 3.3 (2011)

Doerr, B.; Happ, E.; Klein, C.: Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evolutionary Computation 19 (4), pp. 673 - 691 (2011)