Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.”10.3847/1538-4365/ab3b56__The Astrophysical Journal Supplement Series, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:10.3847/1538-4365/ab3b56.
LibreCat: https://research-explorer.ista.ac.at/record/11623
DOI: 10.3847/1538-4365/ab3b56
arXiv: 1908.05222

Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.”10.48550/arXiv.1906.09609__ArXiv, 1906.09609, doi:10.48550/arXiv.1906.09609.
LibreCat: https://research-explorer.ista.ac.at/record/11627
DOI: 10.48550/arXiv.1906.09609
arXiv: 1906.09609

Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.”10.48550/arXiv.1906.09611__ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611.
LibreCat: https://research-explorer.ista.ac.at/record/11630
DOI: 10.48550/arXiv.1906.09611
arXiv: 1906.09611

Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”10.4230/LIPICS.ICALP.2019.13__46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.
LibreCat: https://research-explorer.ista.ac.at/record/11826
DOI: 10.4230/LIPICS.ICALP.2019.13
arXiv: 811.12527

Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.”10.1145/3309697.3331503__SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.
LibreCat: https://research-explorer.ista.ac.at/record/11850
DOI: 10.1145/3309697.3331503
arXiv: 1904.05474

Biedermann, Sonja, et al. “Vienna Graph Clustering.”10.1007/978-1-4939-9873-9_16__Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16.
LibreCat: https://research-explorer.ista.ac.at/record/11847
DOI: 10.1007/978-1-4939-9873-9_16
PMID: 31583641

Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.”10.1109/focs.2019.00033__60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
LibreCat: https://research-explorer.ista.ac.at/record/11853
DOI: 10.1109/focs.2019.00033
arXiv: 1909.11600

Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.”10.1109/ipdps.2019.00013__33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013.
LibreCat: https://research-explorer.ista.ac.at/record/11851
DOI: 10.1109/ipdps.2019.00013
arXiv: 1808.05458

Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.”10.1145/3313276.3316346__Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.
LibreCat: https://research-explorer.ista.ac.at/record/11865
DOI: 10.1145/3313276.3316346
arXiv: 1904.04341

Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.”10.1137/1.9781611975482.115__30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
LibreCat: https://research-explorer.ista.ac.at/record/11871
DOI: 10.1137/1.9781611975482.115
arXiv: 1810.10932