Turner OJ, Cirasuolo M, Harrison CM, McLure RJ, Dunlop JS, Swinbank AM, Johnson HL, Sobral D, Matthee JJ, Sharples RM. 2017. The KMOS Deep Survey (KDS) – I. Dynamical measurements of typical star-forming galaxies at z  3.5. Monthly Notices of the Royal Astronomical Society. 471(2), 1280–1320.
LibreCat: https://research-explorer.ista.ac.at/record/11573
DOI: 10.1093/mnras/stx1366
arXiv: 1704.06263

Bugnet LA, Garcia RA, Davies GR, Mathur S, Corsaro E. FliPer: Checking the reliability of global seismic parameters from automatic pipelines. arXiv, 1711.02890.
LibreCat: https://research-explorer.ista.ac.at/record/11633
DOI: 10.48550/arXiv.1711.02890
arXiv: 1711.02890

Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao   Satish. 2017. Capacity releasing diffusion for speed and locality. Proceedings of the 34th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 70, 3598–3607.
LibreCat: https://research-explorer.ista.ac.at/record/11651
arXiv: 1706.05826

Henzinger MH, Krinninger S, Nanongkai D. 2017. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 13(4), 51.
LibreCat: https://research-explorer.ista.ac.at/record/11665
DOI: 10.1145/3146550
arXiv: 1512.08147

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

Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.
LibreCat: https://research-explorer.ista.ac.at/record/11772
DOI: 10.1007/978-3-319-73117-9_3

Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.
LibreCat: https://research-explorer.ista.ac.at/record/11829
DOI: 10.4230/LIPICS.ITCS.2017.26
arXiv: 1703.01638

Goranci G, Henzinger MH, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.
LibreCat: https://research-explorer.ista.ac.at/record/11833
DOI: 10.4230/LIPICS.ESA.2017.45
arXiv: 1712.06473

Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.
LibreCat: https://research-explorer.ista.ac.at/record/11832
DOI: 10.4230/LIPICS.ESA.2017.48
arXiv: 1707.02577

Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(lo n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.
LibreCat: https://research-explorer.ista.ac.at/record/11874
DOI: 10.1137/1.9781611974782.30
arXiv: 1704.02844

Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.
LibreCat: https://research-explorer.ista.ac.at/record/11873
DOI: 10.1137/1.9781611974782.125
arXiv: 1704.01254

Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.
LibreCat: https://research-explorer.ista.ac.at/record/11831
DOI: 10.4230/LIPICS.ESA.2017.44
arXiv: 1702.01136

Bhattacharya S, Dvoák W, Henzinger MH, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986.
LibreCat: https://research-explorer.ista.ac.at/record/11903
DOI: 10.1007/s00224-017-9759-8

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

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

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

Budanur NB, Cvitanovi P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.
LibreCat: https://research-explorer.ista.ac.at/record/1211
DOI: 10.1007/s10955-016-1672-z

Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 13(11), 1095–1099.
LibreCat: https://research-explorer.ista.ac.at/record/123
DOI: 10.1038/nphys4194
arXiv: 1705.03530

Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198