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.

5767 Publications


2017 | Conference Paper | IST-REx-ID: 11651 | OA
Wang D, Fountoulakis K, Henzinger MH, Mahoney MW, Rao Satish. 2017. Capacity releasing diffusion for speed and locality. Proceedings of the 34th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 70, 3598–3607.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 11665 | OA
Henzinger MH, Krinninger S, Nanongkai D. 2017. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 13(4), 51.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 11676 | OA
Dvořák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 1175 | OA
Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11833 | OA
Goranci G, Henzinger MH, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11832 | OA
Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11874 | OA
Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11873 | OA
Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11831 | OA
Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications