Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

62 Publications


2019 | Published | Conference Paper | IST-REx-ID: 11826 | OA
Algorithms and hardness for diameter in dynamic graphs
B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6528 | OA
Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2019 | Published | Conference Paper | IST-REx-ID: 6556 | OA
3-manifold triangulations with small treewidth
K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6647 | OA
The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6725 | OA
Testing the complexity of a valued CSP language
V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 7401 | OA
Z_2-Genus of graphs and minimum rank of partial symmetric matrices
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11827 | OA
A tree structure for dynamic facility location
G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11828 | OA
Dynamic effective resistances and approximate schur complement on separable graphs
G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11911 | OA
Memetic graph clustering
S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 7407 | OA
Proofs of catalytic space
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11831 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11832 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 11833 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11834 | OA
Incremental exact min-cut in poly-logarithmic amortized update time
G. Goranci, M.H. Henzinger, M. Thorup, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11835 | OA
Incremental and fully dynamic subgraph connectivity for emergency planning
M.H. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11836 | OA
Graph minors for preserving terminal distances approximately - lower and upper bounds
Y.K. Cheung, G. Goranci, M.H. Henzinger, in:, 43rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 11837 | OA
Welfare maximization with friends-of-friends network externalities
S. Bhattacharya, W. Dvorák, M.H. Henzinger, Martin Starnberger, in:, 32nd International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Export / Embed