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.
5760 Publications
2019 | Conference Paper | IST-REx-ID: 11826 | 
Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 11850 |
Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 11853 |
Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 11865 |
Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 11871 |
Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv