Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.”10.1051/0004-6361/201833106__Astronomy &; Astrophysics, vol. 620, , EDP Sciences, 2018, doi:10.1051/0004-6361/201833106.

Van Eylen, V., et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.”10.1093/mnras/sty1390__Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4, Oxford University Press, 2018, pp. 4866–80, doi:10.1093/mnras/sty1390.

Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.”10.48550/arXiv.1811.12140__ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.

Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.”10.1145/3274662__ACM Journal of Experimental Algorithmics, vol. 23, Association for Computing Machinery, 2018, pp. 1–22, doi:10.1145/3274662.

Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”10.1145/3232860__ACM Transactions on Economics and Computation, vol. 6, no. 2, 5, Association for Computing Machinery, 2018, doi:10.1145/3232860.

Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.”10.1145/3174803__ACM Transactions on Algorithms, vol. 14, no. 2, 17, Association for Computing Machinery, 2018, doi:10.1145/3174803.

Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.”10.1016/j.ic.2018.02.005__Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:10.1016/j.ic.2018.02.005.

Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.”10.4230/LIPICS.ESA.2018.40__26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.

Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.”10.4230/LIPICS.ESA.2018.39__26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.

Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.”10.1145/3218657__Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657.