Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. Association for Computing Machinery.https://doi.org/10.1145/3146550 
LibreCat: https://research-explorer.ista.ac.at/record/11665
DOI: 10.1145/3146550
arXiv: 1512.08147

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

Alwen, J. F., De Rezende, S., Nordstrom, J., &; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In 44th International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature.https://doi.org/10.1007/978-3-319-73117-9_3 
LibreCat: https://research-explorer.ista.ac.at/record/11772
DOI: 10.1007/978-3-319-73117-9_3

Henzinger, M. H., Lincoln, A., Neumann, S., &; Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In 8th Innovations in Theoretical Computer Science Conference (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2017.26 
LibreCat: https://research-explorer.ista.ac.at/record/11829
DOI: 10.4230/LIPICS.ITCS.2017.26
arXiv: 1703.01638

Goranci, G., Henzinger, M. H., &; Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ESA.2017.45 
LibreCat: https://research-explorer.ista.ac.at/record/11833
DOI: 10.4230/LIPICS.ESA.2017.45
arXiv: 1712.06473

Henzinger, M. H., Leniowski, D., &; Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ESA.2017.48 
LibreCat: https://research-explorer.ista.ac.at/record/11832
DOI: 10.4230/LIPICS.ESA.2017.48
arXiv: 1707.02577

Bhattacharya, S., Henzinger, M. H., &; Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(lo n) worst case update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611974782.30 
LibreCat: https://research-explorer.ista.ac.at/record/11874
DOI: 10.1137/1.9781611974782.30
arXiv: 1704.02844

Henzinger, M. H., Rao, S., &; Wang, D. (2017). Local flow partitioning for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611974782.125 
LibreCat: https://research-explorer.ista.ac.at/record/11873
DOI: 10.1137/1.9781611974782.125
arXiv: 1704.01254

Goranci, G., Henzinger, M. H., &; Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ESA.2017.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, M. H., &; Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. Springer Nature.https://doi.org/10.1007/s00224-017-9759-8 
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. Springer.https://doi.org/10.1007/s11538-016-0244-3 
LibreCat: https://research-explorer.ista.ac.at/record/1191
DOI: 10.1007/s11538-016-0244-3

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

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

Budanur, N. B., &; Cvitanovi, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer.https://doi.org/10.1007/s10955-016-1672-z 
LibreCat: https://research-explorer.ista.ac.at/record/1211
DOI: 10.1007/s10955-016-1672-z

Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., &; Van Hecke, M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. Nature Publishing Group.https://doi.org/10.1038/nphys4194 
LibreCat: https://research-explorer.ista.ac.at/record/123
DOI: 10.1038/nphys4194
arXiv: 1705.03530

Bhattacharya, S., Chakrabarty, D., &; Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In 19th International Conference on Integer Programming and Combinatorial Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature.https://doi.org/10.1007/978-3-319-59250-3_8 
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00408 
LibreCat: https://research-explorer.ista.ac.at/record/1113
DOI: 10.7155/jgaa.00408
arXiv: 1608.08662

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

Browning, T. D., &; Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford University Press.https://doi.org/10.1093/imrn/rnx252 
LibreCat: https://research-explorer.ista.ac.at/record/172
DOI: 10.1093/imrn/rnx252
arXiv: 1509.07744