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.

75 Publications


2018 | Published | Conference Paper | IST-REx-ID: 11828 | OA
Dynamic effective resistances and approximate schur complement on separable graphs
G. Goranci, M. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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.)
 

2010 | Published | Conference Paper | IST-REx-ID: 11838 | OA
Sponsored search, market equilibria, and the Hungarian Method
P. Dütting, M. Henzinger, I. Weber, in:, 27th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 287–298.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2009 | Published | Conference Paper | IST-REx-ID: 11912 | OA
A comparison of techniques for sampling web pages
Eda Baykan, M. Henzinger, S.F. Keller, S. de Castelberg, M. Kinzler, in:, 26th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2009, pp. 13–30.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Export / Embed