Bringmann, K.; Künnemann, M.; Nusser, A.: Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. (2019), 34 S.

Bringmann, K.; Künnemann, M.; Węgrzycki, K.: Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. (2019), 35 S.

Bund, J.; Lenzen, C.; Rosenbaum, W.: Fault Tolerant Gradient Clock Synchronization. (2019), 21 S.

Bund, J.; Lenzen, C.; Medina, M.: Optimal Metastability-Containing Sorting via Parallel Prefix Computation. (2019), 18 S.

Christmann, P.; Saha Roy, R.; Abujabal, A.; Singh, J.; Weikum, G.: Look before you Hop: Conversational Question Answering over Knowledge Graphs Using Judicious Context Expansion. (2019), 10 S.

Chu, C. X.; Razniewski, S.; Weikum, G.: TiFi: Taxonomy Induction for Fictional Domains [Extended version]. (2019), 11 S.

Dörfler, J.; Ikenmeyer, C.; Panova, G.: On Geometric Complexity Theory: Multiplicity Obstructions are Stronger than Occurrence Obstructions. (2019), 24 S.

Eden, T.; Ron, D.; Rosenbaum, W.: The Arboricity Captures the Complexity of Sampling Edges. (2019), 24 S.

Egger, B.; Smith, W. A. P.; Tewari, A.; Wuhrer, S.; Zollhöfer, M.; Beeler, T.; Bernard, F.; Bolkart, T.; Kortylewski, A.; Romdhani, S. et al.; Theobalt, C.; Blanz, V.; Vetter, T.: 3D Morphable Face Models -- Past, Present and Future. (2019), 37 S.

Elgharib, M.; Mallikarjun B R; Tewari, A.; Kim, H.; Liu, W.; Seidel, H.-P.; Theobalt, C.: EgoFace: Egocentric Face Performance Capture and Videorealistic Reenactment. (2019), 10 S.

Facca, E.; Karrenbauer, A.; Kolev, P.; Mehlhorn, K.: Convergence of the Non-Uniform Directed Physarum Model. (2019), 14 S.

Fried, O.; Tewari, A.; Zollhöfer, M.; Finkelstein, A.; Shechtman, E.; Goldman, D. B.; Genova, K.; Jin, Z.; Theobalt, C.; Agrawala, M.: Text-based Editing of Talking-head Video. (2019), 14 S.

Frohn, F.; Giesl, J.: Termination of Triangular Integer Loops is Decidable. (2019), 25 S.

Frohn, F.; Giesl, J.: Proving Non-Termination via Loop Acceleration. (2019), 11 S.

Frohn, F.; Hark, M.; Giesl, J.: On the Decidability of Termination for Polynomial Loops. (2019), 34 S.

Frohn, F.; Naaf, M.; Brockschmidt, M.; Giesl, J.: Inferring Lower Runtime Bounds for Integer Programs. (2019), 51 S.

Gao, Y.; Li, J.; Nanongkai, D.; Peng, R.; Saranurak, T.; Yingchareonthawornchai, S.: Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. (2019), 72 S.

Ghazimatin, A.; Saha Roy, R.; Weikum, G.: FAIRY: A Framework for Understanding Relationships between Users' Actions and their Social Feeds. (2019), 9 S.

Ghazimatin, A.; Balalau, O.; Saha Roy, R.; Weikum, G.: PRINCE: Provider-side Interpretability with Counterfactual Explanations in Recommender Systems. (2019), 9 S.

Golyanik, V.; Jonas, A.; Stricker, D.; Theobalt, C.: Intrinsic Dynamic Shape Prior for Fast, Sequential and Dense Non-Rigid Structure from Motion with Detection of Temporally-Disjoint Rigidity. (2019), 10 S.