Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms
M. Wysokiski, J. Kaczmarczyk, Journal of Physics: Condensed Matter 29 (2017).

FliPer: Checking the reliability of global seismic parameters from automatic pipelines
L.A. Bugnet, R.A. Garcia, G.R. Davies, S. Mathur, E. Corsaro, ArXiv (n.d.).

Capacity releasing diffusion for speed and locality
D. Wang, K. Fountoulakis, M.H. Henzinger, M.W. Mahoney,  Satish Rao , in:, Proceedings of the 34th International Conference on Machine Learning, ML Research Press, 2017, pp. 3598–3607.

Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks
M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).

Maximizing a submodular function with viability constraints
W. Dvoák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.

D inf s optimality in copula models
E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.

The Voronoi functional is maximized by the Delaunay triangulation in the plane
H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910.

Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.

Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.

The state of the art in dynamic graph algorithms
M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.

Simulating auxiliary inputs, revisited
M. Skórski, in:, Springer, 2017, pp. 159–179.

Algebraic vertices of non-convex polyhedra
A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.

Conditional hardness for sensitivity problems
M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Improved guarantees for vertex sparsification in planar graphs
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Dynamic clustering to minimize the sum of radii
M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

The power of vertex sparsifiers in dynamic graph algorithms
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.

Local flow partitioning for faster edge connectivity
M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.

Fully dynamic approximate maximum matching and minimum vertex cover in o(lo n) worst case update time
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.