Ábrahám, E.; Abbott, J.; Becker, B.; Bigatti, A. M.; Brain, M.; Buchberger, B.; Cimatti, A.; Davenport, J. H.; England, M.; Fontaine, P. et al.; Forrest, S.; Griggio, A.; Kroening, D.; Seiler, W. M.; Sturm, T.: SC2: Satisfiability Checking meets Symbolic Computation (Project Paper). (2016), 15 S.

Abraham, I.; Chechik, S.; Krinninger, S.: Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time revisited. (2016), 21 S.

Abraham, I.; Durfee, D.; Koutis, I.; Krinninger, S.; Peng, R.: On Fully Dynamic Graph Sparsifiers. (2016), 67 S.

Babu, J.; Basavaraju, M.; Chandran, L. S.; Francis, M. C.: On Induced Colourful Paths in Triangle-free Graphs. (2016), 11 S.

Becker, R.; Karrenbauer, A.; Krinninger, S.; Lenzen, C.: Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016), 30 S.

Becker, R.; Karrenbauer, A.; Mehlhorn, K.: An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. (2016), 17 S.

Becker, R.; Sagraloff, M.; Sharma, V.; Yap, C.: A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. (2016), 53 S.

Bei, X.; Garg, J.; Hoefer, M.; Mehlhorn, K.: Computing Equilibria in Markets with Budget-Additive Utilities. (2016), 21 pages S.

Bhattacharyya, A.; Malinowski, M.; Fritz, M.: Spatio-Temporal Image Boundary Extrapolation. (2016), 10 S.

Blanchette, J. C.; Böhme, S.; Popescu, A.; Smallbone, N.: Encoding Monomorphic and Polymorphic Types. (2016), LMCS-2014-1018 S.

Bodwin, G.; Krinninger, S.: Fully Dynamic Spanners with Worst-Case Update Time. (2016), 22 S.

Brand, C.; Sagraloff, M.: On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. (2016), 21 S.

Bringmann, K.; Grønlund, A.; Larsen, K. G.: A Dichotomy for Regular Expression Membership Testing. (2016), 31 S.

Bringmann, K.; Keusch, R.; Lengler, J.: Geometric Inhomogeneous Random Graphs. (2016), 22 S.

Bringmann, K.; Keusch, R.; Lengler, J.: Average Distance in a General Class of Scale-Free Networks with Underlying Geometry. (2016), 25 pages. arXiv admin note: text overlap with arXiv:1511.00576 S.

Bringmann, K.; Keusch, R.; Lengler, J.; Maus, Y.; Molla, A.: Greedy Routing and the Algorithmic Small-World Phenomenom. (2016), 59 pages, 1 figure S.

Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.: The Landscape of Bounds for Binary Search Trees. (2016), 32 S.

Cheung, Y. K.; Cole, R.: A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. (2016), 41 pages S.

Chiantini, L.; Ikenmeyer, C.; Landsberg, J. M.; Ottaviani, G.: The Geometry of Rank Decompositions of Matrix Multiplication I: 2x2 Matrices. (2016), 9 S.

Choudhary, A.; Kerber, M.; Raghvendra, S.: Polynomial-Sized Topological Approximations Using The Permutahedron. (2016), 24 S.