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.
5757 Publications
2018 | Journal Article | IST-REx-ID: 11768 | 
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11872 |
Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11882 |
Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975055.5
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 11890 |
Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11911 |
Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SEA.2018.3
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 1215 |
Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2
[Published Version]
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 176 |
Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. World Scientific Publishing. https://doi.org/10.1142/S1793042119500283
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 178 |
Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/da.4375
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 185 |
Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 188 |
Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35
[Published Version]
View
| Files available
| DOI