The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z  3.5
O.J. Turner, M. Cirasuolo, C.M. Harrison, R.J. McLure, J.S. Dunlop, A.M. Swinbank, H.L. Johnson, D. Sobral, J.J. Matthee, R.M. Sharples, Monthly Notices of the Royal Astronomical Society 471 (2017) 1280–1320.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Welfare maximization with friends-of-friends network externalities
S. Bhattacharya, W. Dvoák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.

Existence of traveling waves for the generalized F–KPP equation
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.

The Hitchhiker’s Guide to flow chemistry
M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893.

Integrated flow processing - challenges in continuous multistep synthesis
B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.

Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system
N.B. Budanur, P. Cvitanovi, Journal of Statistical Physics 167 (2017) 636–655.

Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing
S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature Physics 13 (2017) 1095–1099.

Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time
S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.