Wissenschaftliche Publikationen

Döring, M.; Kreer, C.; Lehnen, N.; Klein, F.; Pfeifer, N.: Modeling the Amplification of Immunoglobulins through Machine Learning on Sequence-Specific Features. Scientific Reports 9, 10748 (2019)

Neininger, K.; Marschall, T.; Helms, V.: SNP and Indel Frequencies at Transcription Start Sites and at Canonical and Alternative Translation Initiation Sites in the Human Genome. PLoS One 14 (4), e0214816 (2019)

Khanchandani, P.; Lenzen, C.: Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision. Theory of Computing Systems 63 (2), S. 261 - 305 (2019)

Afshani, P.; Agrawal, M.; Doerr, B.; Doerr, C.; Larsen, K. G.; Mehlhorn, K.: The Query Complexity of a Permutation-based Variant of Mastermind. Discrete Applied Mathematics 260, S. 28 - 50 (2019)

Aharon, I.; Chen, R.; Zorin, D.; Weber, O.: Bounded Distortion Tetrahedral Metric Interpolation. ACM Transactions on Graphics 38 (6), 182 (2019)

Ahmad, M.; Helms, V.; Kalinina, O. V.; Lengauer, T.: Relative Principal Components Analysis: Application to Analyzing Biomolecular Conformational Changes. Journal of Chemical Theory and Computation 15 (4), S. 2166 - 2178 (2019)

Ahn, H.-K.; Ahn, T.; Bae, S. W.; Choi, J.; Kim, M.; Oh, E.; Shin, C.-S.; Yoon, S. D.: Minimum-width Annulus with Outliers: Circular, Square, and Rectangular Cases. Information Processing Letters 145, S. 16 - 23 (2019)

Ahn, H.-K.; Oh, E.; Schlipf, L.; Stehn, F.; Strash, D.: On Romeo and Juliet Problems: Minimizing Distance-to-Sight. Computational Geometry: Theory and Applications 84, S. 12 - 21 (2019)

Akrami, H.; Mehlhorn, K.; Odland, T.: Ratio-Balanced Maximum Flows. Information Processing Letters 150, S. 13 - 17 (2019)

Amiri, S. A.; Schmid, S.; Siebertz, S.: Distributed Dominating Set Approximations beyond Planar Graphs. ACM Transactions on Algorithms 15 (3), 39 (2019)

Amiri, S. A.; Kreutzer, S.; Marx, D.; Rabinovich, R.: Routing with Congestion in Acyclic Digraphs. Information Processing Letters 151, 105836 (2019)

Antoniadis, A.; Huang, C.-C.; Ott, S.: A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. Algorithmica 81 (9), S. 3725 - 3745 (2019)

Antoniadis, A.; Barcelo, N.; Nugent, M.; Pruhs, K.; Scquizzato, M.: A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. Algorithmica 81 (7), S. 2917 - 2933 (2019)

Bajpai, V.; Brunstrom, A.; Feldmann, A.; Kellerer, W.; Pras, A.; Schulzrinne, H.; Smaragdakis, G.; Wählisch, M.; Wehrle, K.: The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research. ACM SIGCOMM Computer Communication Review 49 (1), S. 24 - 30 (2019)

Ballard, G.; Ikenmeyer, C.; Landsberg, J. M.; Ryder, N.: The Geometry of Rank Decompositions of Matrix Multiplication II: 3 x 3 Matrices. Journal of Pure and Applied Algebra 223 (8), S. 3205 - 3224 (2019)

Becchetti, L.; Clementi, A.; Natale, E.; Pasquale, F.; Posta, G.: Self-Stabilizing Repeated Balls-into-Bins. Distributed Computing 32 (1), S. 59 - 68 (2019)

Becker, R.; Bonifaci, V.; Karrenbauer, A.; Kolev, P.; Mehlhorn, K.: Two Results on Slime Mold Computations. Theoretical Computer Science 773, S. 79 - 106 (2019)

Behjati Ardakani, F.; Schmidt, F.; Schulz, M. H.: Predicting Transcription Factor Binding Using Ensemble Random Forest Models. Faculty of 1000 Research 7, 1603 (2019)

Bei, X.; Garg, J.; Hoefer, M.; Mehlhorn, K.: Earning and Utility Limits in Fisher Markets. ACM Transactions on Economics and Computation 7 (2), 10 (2019)

Bemana, M.; Keinert, J.; Myszkowski, K.; Bätz, M.; Ziegler, M.; Seidel, H.-P.; Ritschel, T.: Learning to Predict Image-based Rendering Artifacts with Respect to a Hidden Reference Image. Computer Graphics Forum 38 (7), S. 579 - 589 (2019)