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, Di, et al. “Capacity Releasing Diffusion for Speed and Locality.” Proceedings of the 34th International Conference on Machine Learning, vol. 70, ML Research Press, 2017, pp. 3598–607.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 11665 | OA
Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:10.1145/3146550.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 11676 | OA
Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 1175 | OA
Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger, Monika H., et al. “Conditional Hardness for Sensitivity Problems.” 8th Innovations in Theoretical Computer Science Conference, vol. 67, 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ITCS.2017.26.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11833 | OA
Goranci, Gramoz, et al. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” 25th Annual European Symposium on Algorithms, vol. 87, 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.45.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11832 | OA
Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” 25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11874 | OA
Bhattacharya, Sayan, et al. “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, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:10.1137/1.9781611974782.30.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11873 | OA
Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:10.1137/1.9781611974782.125.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11831 | OA
Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications