B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
LibreCat: https://research-explorer.ista.ac.at/record/11826
DOI: 10.4230/LIPICS.ICALP.2019.13
arXiv: 811.12527

K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.
LibreCat: https://research-explorer.ista.ac.at/record/7401
DOI: 10.4230/LIPICS.SOCG.2019.39
arXiv: 1903.08637

K. Huszár and J. Spreer, “-manifold triangulations with small treewidth,” in 35th International Symposium on Computational Geometry, Portland, Oregon, United States, 2019, vol. 129, p. 44:1-44:20.
LibreCat: https://research-explorer.ista.ac.at/record/6556
DOI: 10.4230/LIPIcs.SoCG.2019.44
arXiv: 1812.05528

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
LibreCat: https://research-explorer.ista.ac.at/record/11828
DOI: 10.4230/LIPICS.ESA.2018.40
arXiv: 1802.09111

G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
LibreCat: https://research-explorer.ista.ac.at/record/11827
DOI: 10.4230/LIPICS.ESA.2018.39
arXiv: 1909.06653

S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.
LibreCat: https://research-explorer.ista.ac.at/record/11911
DOI: 10.4230/LIPICS.SEA.2018.3
arXiv: 1802.07034

K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.
LibreCat: https://research-explorer.ista.ac.at/record/6005
DOI: 10.4230/LIPICS.MFCS.2018.23

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

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

G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Y. K. Cheung, G. Goranci, and M. H. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in 43rd International Colloquium on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55.
LibreCat: https://research-explorer.ista.ac.at/record/11836
DOI: 10.4230/LIPICS.ICALP.2016.131
arXiv: 1604.08342

G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
LibreCat: https://research-explorer.ista.ac.at/record/11834
DOI: 10.4230/LIPICS.ESA.2016.46
arXiv: 1611.06500

M. H. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
LibreCat: https://research-explorer.ista.ac.at/record/11835
DOI: 10.4230/LIPICS.ESA.2016.48
arXiv: 1611.05248

S. Bhattacharya, W. Dvorák, M. H. Henzinger, and  Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102.
LibreCat: https://research-explorer.ista.ac.at/record/11837
DOI: 10.4230/LIPICS.STACS.2015.90