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

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

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

M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in 8th Innovations in Theoretical Computer Science Conference, Berkley, CA, United States, 2017, vol. 67.
LibreCat: https://research-explorer.ista.ac.at/record/11829
DOI: 10.4230/LIPICS.ITCS.2017.26
arXiv: 1703.01638

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

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

S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “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, Barcelona, Spain, 2017, vol. 0, pp. 470–489.
LibreCat: https://research-explorer.ista.ac.at/record/11874
DOI: 10.1137/1.9781611974782.30
arXiv: 1704.02844

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

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

S. Bhattacharya, W. Dvoák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/11903
DOI: 10.1007/s00224-017-9759-8

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

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

B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” Journal of Flow Chemistry, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/11976
DOI: 10.1556/1846.2017.00016

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

S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke, “Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,” Nature Physics, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/123
DOI: 10.1038/nphys4194
arXiv: 1705.03530

S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “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, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198

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

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

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

Y. Xu et al., “Disorder enabled band structure engineering of a topological insulator surface,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/391
DOI: 10.1038/ncomms14081