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.
5750 Publications
2018 | Journal Article | IST-REx-ID: 11620 | 
Van Eylen V, Dai F, Mathur S, Gandolfi D, Albrecht S, Fridlund M, García RA, Guenther E, Hjorth M, Justesen AB, Livingston J, Lund MN, Pérez Hernández F, Prieto-Arranz J, Regulo C, Bugnet LA, Everett ME, Hirano T, Nespral D, Nowak G, Palle E, Silva Aguirre V, Trifonov T, Winn JN, Barragán O, Beck PG, Chaplin WJ, Cochran WD, Csizmadia S, Deeg H, Endl M, Heeren P, Grziwa S, Hatzes AP, Hidalgo D, Korth J, Mathis S, Montañes Rodriguez P, Narita N, Patzold M, Persson CM, Rodler F, Smith AMS. 2018. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 478(4), 4866–4880.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Preprint | IST-REx-ID: 11631 |
Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., & Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. arXiv. https://doi.org/10.48550/arXiv.1811.12140
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 11657 |
Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. Association for Computing Machinery. https://doi.org/10.1145/3274662
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 11667 |
Dütting, P., Henzinger, M. H., & Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/3232860
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 11664 |
Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3174803
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 11757 |
Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005
[Published Version]
View
| DOI
| Download Published Version (ext.)
2018 | Conference Paper | IST-REx-ID: 11828 |
Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11827 |
Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure for dynamic facility location. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.39
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
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
2018 | Journal Article | IST-REx-ID: 2015 |
Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 306 |
De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596
[Published Version]
View
| Files available
| DOI