Cygan, M.; Kratsch, S.; Pilipczuk, M.; Pilipczuk, M.; Wahlström, M.: Clique Cover and Graph Separation: New Incompressibility Results. ACM Transactions on Computation Theory 6 (2), 6, S. 1 - 19 (2014)

Dabala, L.; Kellnhofer, P.; Ritschel, T.; Didyk, P.; Templin, K.; Rokita, P.; Myszkowski, K.; Seidel, H.-P.: Manipulating Refractive and Reflective Binocular Disparity. Computer Graphics Forum 33 (2), S. 53 - 62 (2014)

de Melo, G.; Weikum, G.: Taxonomic Data Integration from Multilingual Wikipedia Editions. Knowledge and Information Systems 39 (1), S. 1 - 39 (2014)

Deplus, R.; Blanchon, L.; Rajavelu, A.; Boukaba, A.; Defrance, M.; Luciani, J.; Rothe, F.; Dedeurwaerder, S.; Denis, H.; Brinkman, A. B. et al.; Simmer, F.; Müller, F.; Bertin, B.; Berdasco, M.; Putmans, P.; Calonne, E.; Litchfield, D. W.; de Launoit, Y.; Jurkowski, T. P.; Stunnenberg, H. G.; Bock, C.; Sotiriou, C.; Fraga, M. F.; Esteller, M.; Jeltsch, A.; Fuks, F.: Regulation of DNA Methylation Patterns by CK2-mediated Phosphorylation of Dnmt3a. Cell Reports 8 (3), S. 743 - 753 (2014)

Dietzen, M.; Zotenko, E.; Hildebrandt, A.; Lengauer, T.: Correction to On the Applicability of Elastic Network Normal Modes in Small-molecule Docking. Journal of Chemical Information and Modeling 54 (12), S. 3453 - 3453 (2014)

Doerr, B.: A Lower Bound for the Discrepancy of a Random Point Set. Journal of Complexity 30 (1), S. 16 - 20 (2014)

Doerr, B.; Doerr, C.: Ranking-based Black-box Complexity. Algorithmica 68 (3), S. 571 - 609 (2014)

Doerr, B.; Doerr, C.; Kötzing, T.: The Unbiased Black-box Complexity of Partition is Polynomial. Artificial Intelligence 216, S. 275 - 286 (2014)

Doerr, B.; Friedrich, T.; Sauerwald, T.: Quasirandom Rumor Spreading. ACM Transactions on Algorithms 11 (2), 9, S. 1 - 35 (2014)

Doerr, B.; Wahlström, M.: Randomized Rounding in the Presence of a Cardinality Constraint. ACM Journal of Experimental Algorithmics 19 (1), 1.2, S. 1 - 18 (2014)

Doerr, B.; Winzen, C.: Reducing the Arity in Unbiased Black-Box Complexity. Theoretical Computer Science 545, S. 108 - 121 (2014)

Doerr, C.; Ramakrishna, G.; Schmidt, J. M.: Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. Journal of Graph Algorithms and Applications 18 (3), S. 325 - 346 (2014)

Duan, R.; Pettie, S.: Linear-time Approximation for Maximum Weight Matching. Journal of the ACM 61 (1), 1, S. 1 - 23 (2014)

Dutta, K.; Subramanian, C. R.: Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms. Discussiones Mathematicae Graph Theory 34 (3), S. 467 - 495 (2014)

Elek, O.; Bauszat, P.; Ritschel, T.; Magnor, M.; Seidel, H.-P.: Spectral Ray Differentials. Computer Graphics Forum 33 (4), S. 113 - 122 (2014)

Elek, O.; Ritschel, T.; Dachsbacher, C.; Seidel, H.-P.: Principal-ordinates Propagation for Real-time Rendering of Participating Media. Computers & Graphics 45, S. 28 - 39 (2014)

Erdős, D.; Gemulla, R.; Terzi, E.: Reconstructing Graphs from Neighborhood Data. ACM Transactions on Knowledge Discovery from Data 8 (4), 23, S. 1 - 22 (2014)

Fakcharoenphol, J.; Laekhanukit, B.; Nanongkai, D.: Faster Algorithms for Semi-Matching Problems. ACM Transactions on Algorithms 10 (3), 14, S. 1 - 23 (2014)

Farzan, A.; Kamali, S.: Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Algorithmica 69 (1), S. 92 - 116 (2014)

Farzan, A.; Munro, J. I.: A Uniform Paradigm to Succinctly Encode Various Families of Trees. Algorithmica 68 (1), S. 16 - 40 (2014)