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.
LibreCat: https://research-explorer.ista.ac.at/record/11651
arXiv: 1706.05826

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).
LibreCat: https://research-explorer.ista.ac.at/record/11665
DOI: 10.1145/3146550
arXiv: 1512.08147

Maximizing a submodular function with viability constraints
W. Dvoák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
LibreCat: https://research-explorer.ista.ac.at/record/11676
DOI: 10.1007/s00453-015-0066-y
arXiv: 1611.05753

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.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

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.
LibreCat: https://research-explorer.ista.ac.at/record/11772
DOI: 10.1007/978-3-319-73117-9_3

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.
LibreCat: https://research-explorer.ista.ac.at/record/11829
DOI: 10.4230/LIPICS.ITCS.2017.26
arXiv: 1703.01638

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.
LibreCat: https://research-explorer.ista.ac.at/record/11833
DOI: 10.4230/LIPICS.ESA.2017.45
arXiv: 1712.06473

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.
LibreCat: https://research-explorer.ista.ac.at/record/11832
DOI: 10.4230/LIPICS.ESA.2017.48
arXiv: 1707.02577

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.
LibreCat: https://research-explorer.ista.ac.at/record/11874
DOI: 10.1137/1.9781611974782.30
arXiv: 1704.02844

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.
LibreCat: https://research-explorer.ista.ac.at/record/11873
DOI: 10.1137/1.9781611974782.125
arXiv: 1704.01254

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.
LibreCat: https://research-explorer.ista.ac.at/record/11831
DOI: 10.4230/LIPICS.ESA.2017.44
arXiv: 1702.01136

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.
LibreCat: https://research-explorer.ista.ac.at/record/11903
DOI: 10.1007/s00224-017-9759-8

Existence of traveling waves for the generalized F–KPP equation
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.
LibreCat: https://research-explorer.ista.ac.at/record/1191
DOI: 10.1007/s11538-016-0244-3

The Hitchhiker’s Guide to flow chemistry
M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893.
LibreCat: https://research-explorer.ista.ac.at/record/11961
DOI: 10.1021/acs.chemrev.7b00183
PMID: 28570059

Integrated flow processing - challenges in continuous multistep synthesis
B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.
LibreCat: https://research-explorer.ista.ac.at/record/11976
DOI: 10.1556/1846.2017.00016

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.
LibreCat: https://research-explorer.ista.ac.at/record/1211
DOI: 10.1007/s10955-016-1672-z

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.
LibreCat: https://research-explorer.ista.ac.at/record/123
DOI: 10.1038/nphys4194
arXiv: 1705.03530

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.
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198

Hanani-Tutte for radial planarity
R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.
LibreCat: https://research-explorer.ista.ac.at/record/1113
DOI: 10.7155/jgaa.00408
arXiv: 1608.08662

Twisted Linnik implies optimal covering exponent for 
T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017).
LibreCat: https://research-explorer.ista.ac.at/record/169
DOI: 10.1093/imrn/rnx116
arXiv: 1609.06097