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.
8915 Publications
2018 | Submitted | Preprint | IST-REx-ID: 11631 | 
Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11657 |
Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11664 |
Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11667 |
Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11757 |
Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2018 | Published | Journal Article | IST-REx-ID: 11768 |
Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 65(6), 1–40.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 11827 |
Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 11828 |
Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 11872 |
Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 11882 |
Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11890 |
Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 11911 |
Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 11958
Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 57(31), 9976–9979.
View
| DOI
| PubMed | Europe PMC
2018 | Published | Journal Article | IST-REx-ID: 12 |
Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 1215 |
Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.
[Published Version]
View
| Files available
| DOI
2018 | Published | Conference Paper | IST-REx-ID: 5965 |
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 5966 |
Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 5967 |
Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 5971 |
Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 5975 |
Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv