[{"external_id":{"arxiv":["1903.00115"]},"date_published":"2019-06-01T00:00:00Z","type":"journal_article","publisher":"Oxford University Press","status":"public","month":"06","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","methods: data analysis","techniques: image processing","stars: oscillations","stars: statistics"],"extern":"1","language":[{"iso":"eng"}],"quality_controlled":"1","day":"01","page":"5616-5630","issue":"4","oa":1,"volume":485,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hon, Marc","first_name":"Marc","last_name":"Hon"},{"first_name":"Dennis","last_name":"Stello","full_name":"Stello, Dennis"},{"full_name":"García, Rafael A","first_name":"Rafael A","last_name":"García"},{"full_name":"Mathur, Savita","last_name":"Mathur","first_name":"Savita"},{"first_name":"Sanjib","last_name":"Sharma","full_name":"Sharma, Sanjib"},{"full_name":"Colman, Isabel L","last_name":"Colman","first_name":"Isabel L"},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet"}],"publication":"Monthly Notices of the Royal Astronomical Society","date_updated":"2022-08-22T07:35:19Z","intvolume":"       485","arxiv":1,"oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","title":"A search for red giant solar-like oscillations in all Kepler data","article_type":"original","acknowledgement":"Funding for this Discovery mission is provided by NASA’s Science mission Directorate. We thank the entire Kepler team without whom this investigation would not be possible. DS is the recipient of an Australian Research Council Future Fellowship (project number FT1400147). RAG acknowledges the support from CNES. SM acknowledges support from NASA grant NNX15AF13G, NSF grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697. ILC acknowledges scholarship support from the University of Sydney. We would like to thank Nicholas Barbara and Timothy Bedding for providing us with a list of variable stars that helped to validate a number of detections in this study. We also thank the group at the University of Sydney for fruitful discussions. Finally, we gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research.","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.00115"}],"doi":"10.1093/mnras/stz622","scopus_import":"1","_id":"11615","date_created":"2022-07-18T14:26:03Z","abstract":[{"text":"The recently published Kepler mission Data Release 25 (DR25) reported on ∼197 000 targets observed during the mission. Despite this, no wide search for red giants showing solar-like oscillations have been made across all stars observed in Kepler’s long-cadence mode. In this work, we perform this task using custom apertures on the Kepler pixel files and detect oscillations in 21 914 stars, representing the largest sample of solar-like oscillating stars to date. We measure their frequency at maximum power, νmax, down to νmax≃4μHz and obtain log (g) estimates with a typical uncertainty below 0.05 dex, which is superior to typical measurements from spectroscopy. Additionally, the νmax distribution of our detections show good agreement with results from a simulated model of the Milky Way, with a ratio of observed to predicted stars of 0.992 for stars with 10<νmax<270μHz. Among our red giant detections, we find 909 to be dwarf/subgiant stars whose flux signal is polluted by a neighbouring giant as a result of using larger photometric apertures than those used by the NASA Kepler science processing pipeline. We further find that only 293 of the polluting giants are known Kepler targets. The remainder comprises over 600 newly identified oscillating red giants, with many expected to belong to the Galactic halo, serendipitously falling within the Kepler pixel files of targeted stars.","lang":"eng"}],"year":"2019","citation":{"mla":"Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4, Oxford University Press, 2019, pp. 5616–30, doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>.","short":"M. Hon, D. Stello, R.A. García, S. Mathur, S. Sharma, I.L. Colman, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society 485 (2019) 5616–5630.","chicago":"Hon, Marc, Dennis Stello, Rafael A García, Savita Mathur, Sanjib Sharma, Isabel L Colman, and Lisa Annabelle Bugnet. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2019. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>.","apa":"Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L., &#38; Bugnet, L. A. (2019). A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stz622\">https://doi.org/10.1093/mnras/stz622</a>","ama":"Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations in all Kepler data. <i>Monthly Notices of the Royal Astronomical Society</i>. 2019;485(4):5616-5630. doi:<a href=\"https://doi.org/10.1093/mnras/stz622\">10.1093/mnras/stz622</a>","ista":"Hon M, Stello D, García RA, Mathur S, Sharma S, Colman IL, Bugnet LA. 2019. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 485(4), 5616–5630.","ieee":"M. Hon <i>et al.</i>, “A search for red giant solar-like oscillations in all Kepler data,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 485, no. 4. Oxford University Press, pp. 5616–5630, 2019."}},{"day":"30","quality_controlled":"1","issue":"6","publisher":"IOP Publishing","date_published":"2019-05-30T00:00:00Z","external_id":{"arxiv":["1901.01643"]},"type":"journal_article","language":[{"iso":"eng"}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"extern":"1","month":"05","status":"public","doi":"10.3847/1538-3881/ab1488","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01643"}],"scopus_import":"1","article_type":"original","publication_identifier":{"issn":["0004-6256"]},"acknowledgement":"The authors wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the indigenous Hawai'ian community. We are most fortunate to have the opportunity to conduct observations from this mountain. We thank Andrei Tokovinin for helpful information on the Speckle observations obtained with SOAR. D.H. acknowledges support by the National Aeronautics and Space Administration through the TESS Guest Investigator Program (80NSSC18K1585) and by the National Science Foundation (AST-1717000). A.C. acknowledges support by the National Science Foundation under the Graduate Research Fellowship Program. W.J.C., W.H.B., A.M., O.J.H., and G.R.D. acknowledge support from the Science and Technology Facilities Council and UK Space Agency. H.K. and F.G. acknowledge support from the European Social Fund via the Lithuanian Science Council grant No. 09.3.3-LMT-K-712-01-0103. Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (grant DNRF106). A.J. acknowledges support from FONDECYT project 1171208, CONICYT project BASAL AFB-170002, and by the Ministry for the Economy, Development, and Tourism's Programa Iniciativa Científica Milenio through grant IC 120009, awarded to the Millennium Institute of Astrophysics (MAS). R.B. acknowledges support from FONDECYT Post-doctoral Fellowship Project 3180246, and from the Millennium Institute of Astrophysics (MAS). A.M.S. is supported by grants ESP2017-82674-R (MINECO) and SGR2017-1131 (AGAUR). R.A.G. and L.B. acknowledge the support of the PLATO grant from the CNES. The research leading to the presented results has received funding from the European Research Council under the European Community's Seventh Framework Programme (FP72007-2013)ERC grant agreement No. 338251 (StellarAges). S.M. acknowledges support from the European Research Council through the SPIRE grant 647383. This work was also supported by FCT (Portugal) through national funds and by FEDER through COMPETE2020 by these grants: UID/FIS/04434/2013 and POCI-01-0145-FEDER-007672, PTDC/FIS-AST/30389/2017, and POCI-01-0145-FEDER-030389. T.L.C. acknowledges support from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 792848 (PULSATION). E.C. is funded by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 664931. V.S.A. acknowledges support from the Independent Research Fund Denmark (Research grant 7027-00096B). D.S. acknowledges support from the Australian Research Council. S.B. acknowledges NASA grant NNX16AI09G and NSF grant AST-1514676. T.R.W. acknowledges support from the Australian Research Council through grant DP150100250. A.M. acknowledges support from the ERC Consolidator Grant funding scheme (project ASTEROCHRONOMETRY, G.A. n. 772293). S.M. acknowledges support from the Ramon y Cajal fellowship number RYC-2015-17697. M.S.L. is supported by the Carlsberg Foundation (grant agreement No. CF17-0760). A.M. and P.R. acknowledge support from the HBCSE-NIUS programme. J.K.T. and J.T. acknowledge that support for this work was provided by NASA through Hubble Fellowship grants HST-HF2-51399.001 and HST-HF2-51424.001 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555. T.S.R. acknowledges financial support from Premiale 2015 MITiC (PI B. Garilli). This project has been supported by the NKFIH K-115709 grant and the Lendület Program of the Hungarian Academy of Sciences, project No. LP2018-7/2018.\r\n\r\nBased on observations made with the Hertzsprung SONG telescope operated on the Spanish Observatorio del Teide on the island of Tenerife by the Aarhus and Copenhagen Universities and by the Instituto de Astrofísica de Canarias. Funding for the TESS mission is provided by NASA's Science Mission directorate. We acknowledge the use of public TESS Alert data from pipelines at the TESS Science Office and at the TESS Science Processing Operations Center. This research has made use of the Exoplanet Follow-up Observation Program website, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program. This paper includes data collected by the TESS mission, which are publicly available from the Mikulski Archive for Space Telescopes (MAST).\r\n\r\nSoftware: Astropy (Astropy Collaboration et al. 2018), Matplotlib (Hunter 2007), DIAMONDS (Corsaro & De Ridder 2014), isoclassify (Huber et al. 2017), EXOFASTv2 (Eastman 2017), ktransit (Barclay 2018).","title":"A hot Saturn orbiting an oscillating late subgiant discovered by TESS","publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","article_number":"245","year":"2019","citation":{"ieee":"D. Huber <i>et al.</i>, “A hot Saturn orbiting an oscillating late subgiant discovered by TESS,” <i>The Astronomical Journal</i>, vol. 157, no. 6. IOP Publishing, 2019.","ista":"Huber D et al. 2019. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 157(6), 245.","ama":"Huber D, Chaplin WJ, Chontos A, et al. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. <i>The Astronomical Journal</i>. 2019;157(6). doi:<a href=\"https://doi.org/10.3847/1538-3881/ab1488\">10.3847/1538-3881/ab1488</a>","short":"D. Huber, W.J. Chaplin, A. Chontos, H. Kjeldsen, J. Christensen-Dalsgaard, T.R. Bedding, W. Ball, R. Brahm, N. Espinoza, T. Henning, A. Jordán, P. Sarkis, E. Knudstrup, S. Albrecht, F. Grundahl, M.F. Andersen, P.L. Pallé, I. Crossfield, B. Fulton, A.W. Howard, H.T. Isaacson, L.M. Weiss, R. Handberg, M.N. Lund, A.M. Serenelli, J. Rørsted Mosumgaard, A. Stokholm, A. Bieryla, L.A. Buchhave, D.W. Latham, S.N. Quinn, E. Gaidos, T. Hirano, G.R. Ricker, R.K. Vanderspek, S. Seager, J.M. Jenkins, J.N. Winn, H.M. Antia, T. Appourchaux, S. Basu, K.J. Bell, O. Benomar, A. Bonanno, D.L. Buzasi, T.L. Campante, Z. Çelik Orhan, E. Corsaro, M.S. Cunha, G.R. Davies, S. Deheuvels, S.K. Grunblatt, A. Hasanzadeh, M.P. Di Mauro, R. A. García, P. Gaulme, L. Girardi, J.A. Guzik, M. Hon, C. Jiang, T. Kallinger, S.D. Kawaler, J.S. Kuszlewicz, Y. Lebreton, T. Li, M. Lucas, M.S. Lundkvist, A.W. Mann, S. Mathis, S. Mathur, A. Mazumdar, T.S. Metcalfe, A. Miglio, M.J.P. F. G. Monteiro, B. Mosser, A. Noll, B. Nsamba, J.M. Joel Ong, S. Örtel, F. Pereira, P. Ranadive, C. Régulo, T.S. Rodrigues, I.W. Roxburgh, V.S. Aguirre, B. Smalley, M. Schofield, S.G. Sousa, K.G. Stassun, D. Stello, J. Tayar, T.R. White, K. Verma, M. Vrard, M. Yıldız, D. Baker, M. Bazot, C. Beichmann, C. Bergmann, L.A. Bugnet, B. Cale, R. Carlino, S.M. Cartwright, J.L. Christiansen, D.R. Ciardi, O. Creevey, J.A. Dittmann, J.-D.D. Nascimento, V.V. Eylen, G. Fürész, J. Gagné, P. Gao, K. Gazeas, F. Giddens, O.J. Hall, S. Hekker, M.J. Ireland, N. Latouf, D. LeBrun, A.M. Levine, W. Matzko, E. Natinsky, E. Page, P. Plavchan, M. Mansouri-Samani, S. McCauliff, S.E. Mullally, B. Orenstein, A.G. Soto, M. Paegert, J.L. van Saders, C. Schnaible, D.R. Soderblom, R. Szabó, A. Tanner, C.G. Tinney, J. Teske, A. Thomas, R. Trampedach, D. Wright, T.T. Yuan, F. Zohrabi, The Astronomical Journal 157 (2019).","apa":"Huber, D., Chaplin, W. J., Chontos, A., Kjeldsen, H., Christensen-Dalsgaard, J., Bedding, T. R., … Zohrabi, F. (2019). A hot Saturn orbiting an oscillating late subgiant discovered by TESS. <i>The Astronomical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-3881/ab1488\">https://doi.org/10.3847/1538-3881/ab1488</a>","chicago":"Huber, Daniel, William J. Chaplin, Ashley Chontos, Hans Kjeldsen, Jørgen Christensen-Dalsgaard, Timothy R. Bedding, Warrick Ball, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” <i>The Astronomical Journal</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.3847/1538-3881/ab1488\">https://doi.org/10.3847/1538-3881/ab1488</a>.","mla":"Huber, Daniel, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” <i>The Astronomical Journal</i>, vol. 157, no. 6, 245, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.3847/1538-3881/ab1488\">10.3847/1538-3881/ab1488</a>."},"abstract":[{"lang":"eng","text":"We present the discovery of HD 221416 b, the first transiting planet identified by the Transiting Exoplanet Survey Satellite (TESS) for which asteroseismology of the host star is possible. HD 221416 b (HIP 116158, TOI-197) is a bright (V = 8.2 mag), spectroscopically classified subgiant that oscillates with an average frequency of about 430 μHz and displays a clear signature of mixed modes. The oscillation amplitude confirms that the redder TESS bandpass compared to Kepler has a small effect on the oscillations, supporting the expected yield of thousands of solar-like oscillators with TESS 2 minute cadence observations. Asteroseismic modeling yields a robust determination of the host star radius (R⋆ = 2.943 ± 0.064 R⊙), mass (M⋆ = 1.212 ± 0.074 M⊙), and age (4.9 ± 1.1 Gyr), and demonstrates that it has just started ascending the red-giant branch. Combining asteroseismology with transit modeling and radial-velocity observations, we show that the planet is a \"hot Saturn\" (Rp = 9.17 ± 0.33 R⊕) with an orbital period of ∼14.3 days, irradiance of F = 343 ± 24 F⊕, and moderate mass (Mp = 60.5 ± 5.7 M⊕) and density (ρp = 0.431 ± 0.062 g cm−3). The properties of HD 221416 b show that the host-star metallicity–planet mass correlation found in sub-Saturns (4–8 R⊕) does not extend to larger radii, indicating that planets in the transition between sub-Saturns and Jupiters follow a relatively narrow range of densities. With a density measured to ∼15%, HD 221416 b is one of the best characterized Saturn-size planets to date, augmenting the small number of known transiting planets around evolved stars and demonstrating the power of TESS to characterize exoplanets and their host stars using asteroseismology."}],"_id":"11616","date_created":"2022-07-18T14:29:07Z","author":[{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"last_name":"Chaplin","first_name":"William J.","full_name":"Chaplin, William J."},{"full_name":"Chontos, Ashley","first_name":"Ashley","last_name":"Chontos"},{"last_name":"Kjeldsen","first_name":"Hans","full_name":"Kjeldsen, Hans"},{"first_name":"Jørgen","last_name":"Christensen-Dalsgaard","full_name":"Christensen-Dalsgaard, Jørgen"},{"full_name":"Bedding, Timothy R.","last_name":"Bedding","first_name":"Timothy R."},{"last_name":"Ball","first_name":"Warrick","full_name":"Ball, Warrick"},{"last_name":"Brahm","first_name":"Rafael","full_name":"Brahm, Rafael"},{"full_name":"Espinoza, Nestor","last_name":"Espinoza","first_name":"Nestor"},{"first_name":"Thomas","last_name":"Henning","full_name":"Henning, Thomas"},{"first_name":"Andrés","last_name":"Jordán","full_name":"Jordán, Andrés"},{"first_name":"Paula","last_name":"Sarkis","full_name":"Sarkis, Paula"},{"first_name":"Emil","last_name":"Knudstrup","full_name":"Knudstrup, Emil"},{"full_name":"Albrecht, Simon","first_name":"Simon","last_name":"Albrecht"},{"last_name":"Grundahl","first_name":"Frank","full_name":"Grundahl, Frank"},{"full_name":"Andersen, Mads Fredslund","first_name":"Mads Fredslund","last_name":"Andersen"},{"first_name":"Pere L.","last_name":"Pallé","full_name":"Pallé, Pere L."},{"full_name":"Crossfield, Ian","first_name":"Ian","last_name":"Crossfield"},{"last_name":"Fulton","first_name":"Benjamin","full_name":"Fulton, Benjamin"},{"full_name":"Howard, Andrew W.","first_name":"Andrew W.","last_name":"Howard"},{"last_name":"Isaacson","first_name":"Howard T.","full_name":"Isaacson, Howard T."},{"full_name":"Weiss, Lauren M.","first_name":"Lauren M.","last_name":"Weiss"},{"full_name":"Handberg, Rasmus","first_name":"Rasmus","last_name":"Handberg"},{"first_name":"Mikkel N.","last_name":"Lund","full_name":"Lund, Mikkel N."},{"last_name":"Serenelli","first_name":"Aldo M.","full_name":"Serenelli, Aldo M."},{"full_name":"Rørsted Mosumgaard, Jakob","first_name":"Jakob","last_name":"Rørsted Mosumgaard"},{"first_name":"Amalie","last_name":"Stokholm","full_name":"Stokholm, Amalie"},{"first_name":"Allyson","last_name":"Bieryla","full_name":"Bieryla, Allyson"},{"full_name":"Buchhave, Lars A.","last_name":"Buchhave","first_name":"Lars A."},{"first_name":"David W.","last_name":"Latham","full_name":"Latham, David W."},{"full_name":"Quinn, Samuel N.","first_name":"Samuel N.","last_name":"Quinn"},{"first_name":"Eric","last_name":"Gaidos","full_name":"Gaidos, Eric"},{"full_name":"Hirano, Teruyuki","first_name":"Teruyuki","last_name":"Hirano"},{"first_name":"George R.","last_name":"Ricker","full_name":"Ricker, George R."},{"full_name":"Vanderspek, Roland K.","last_name":"Vanderspek","first_name":"Roland K."},{"first_name":"Sara","last_name":"Seager","full_name":"Seager, Sara"},{"first_name":"Jon M.","last_name":"Jenkins","full_name":"Jenkins, Jon M."},{"last_name":"Winn","first_name":"Joshua N.","full_name":"Winn, Joshua N."},{"first_name":"H. M.","last_name":"Antia","full_name":"Antia, H. M."},{"first_name":"Thierry","last_name":"Appourchaux","full_name":"Appourchaux, Thierry"},{"last_name":"Basu","first_name":"Sarbani","full_name":"Basu, Sarbani"},{"full_name":"Bell, Keaton J.","last_name":"Bell","first_name":"Keaton J."},{"full_name":"Benomar, Othman","last_name":"Benomar","first_name":"Othman"},{"full_name":"Bonanno, Alfio","last_name":"Bonanno","first_name":"Alfio"},{"first_name":"Derek L.","last_name":"Buzasi","full_name":"Buzasi, Derek L."},{"last_name":"Campante","first_name":"Tiago L.","full_name":"Campante, Tiago L."},{"full_name":"Çelik Orhan, Z.","first_name":"Z.","last_name":"Çelik Orhan"},{"first_name":"Enrico","last_name":"Corsaro","full_name":"Corsaro, Enrico"},{"first_name":"Margarida S.","last_name":"Cunha","full_name":"Cunha, Margarida S."},{"last_name":"Davies","first_name":"Guy R.","full_name":"Davies, Guy R."},{"full_name":"Deheuvels, Sebastien","last_name":"Deheuvels","first_name":"Sebastien"},{"first_name":"Samuel K.","last_name":"Grunblatt","full_name":"Grunblatt, Samuel K."},{"first_name":"Amir","last_name":"Hasanzadeh","full_name":"Hasanzadeh, Amir"},{"full_name":"Di Mauro, Maria Pia","first_name":"Maria Pia","last_name":"Di Mauro"},{"first_name":"Rafael","last_name":"A. García","full_name":"A. García, Rafael"},{"full_name":"Gaulme, Patrick","first_name":"Patrick","last_name":"Gaulme"},{"first_name":"Léo","last_name":"Girardi","full_name":"Girardi, Léo"},{"full_name":"Guzik, Joyce A.","last_name":"Guzik","first_name":"Joyce A."},{"last_name":"Hon","first_name":"Marc","full_name":"Hon, Marc"},{"full_name":"Jiang, Chen","last_name":"Jiang","first_name":"Chen"},{"first_name":"Thomas","last_name":"Kallinger","full_name":"Kallinger, Thomas"},{"first_name":"Steven D.","last_name":"Kawaler","full_name":"Kawaler, Steven D."},{"last_name":"Kuszlewicz","first_name":"James S.","full_name":"Kuszlewicz, James S."},{"full_name":"Lebreton, Yveline","first_name":"Yveline","last_name":"Lebreton"},{"last_name":"Li","first_name":"Tanda","full_name":"Li, Tanda"},{"full_name":"Lucas, Miles","last_name":"Lucas","first_name":"Miles"},{"full_name":"Lundkvist, Mia S.","last_name":"Lundkvist","first_name":"Mia S."},{"first_name":"Andrew W.","last_name":"Mann","full_name":"Mann, Andrew W."},{"full_name":"Mathis, Stéphane","first_name":"Stéphane","last_name":"Mathis"},{"last_name":"Mathur","first_name":"Savita","full_name":"Mathur, Savita"},{"first_name":"Anwesh","last_name":"Mazumdar","full_name":"Mazumdar, Anwesh"},{"last_name":"Metcalfe","first_name":"Travis S.","full_name":"Metcalfe, Travis S."},{"full_name":"Miglio, Andrea","last_name":"Miglio","first_name":"Andrea"},{"full_name":"F. G. Monteiro, Mário J. P.","last_name":"F. G. Monteiro","first_name":"Mário J. P."},{"full_name":"Mosser, Benoit","last_name":"Mosser","first_name":"Benoit"},{"first_name":"Anthony","last_name":"Noll","full_name":"Noll, Anthony"},{"first_name":"Benard","last_name":"Nsamba","full_name":"Nsamba, Benard"},{"first_name":"Jia Mian","last_name":"Joel Ong","full_name":"Joel Ong, Jia Mian"},{"last_name":"Örtel","first_name":"S.","full_name":"Örtel, S."},{"full_name":"Pereira, Filipe","last_name":"Pereira","first_name":"Filipe"},{"full_name":"Ranadive, Pritesh","last_name":"Ranadive","first_name":"Pritesh"},{"full_name":"Régulo, Clara","last_name":"Régulo","first_name":"Clara"},{"full_name":"Rodrigues, Thaíse S.","first_name":"Thaíse S.","last_name":"Rodrigues"},{"full_name":"Roxburgh, Ian W.","first_name":"Ian W.","last_name":"Roxburgh"},{"first_name":"Victor Silva","last_name":"Aguirre","full_name":"Aguirre, Victor Silva"},{"full_name":"Smalley, Barry","first_name":"Barry","last_name":"Smalley"},{"last_name":"Schofield","first_name":"Mathew","full_name":"Schofield, Mathew"},{"last_name":"Sousa","first_name":"Sérgio G.","full_name":"Sousa, Sérgio G."},{"full_name":"Stassun, Keivan G.","last_name":"Stassun","first_name":"Keivan G."},{"full_name":"Stello, Dennis","last_name":"Stello","first_name":"Dennis"},{"last_name":"Tayar","first_name":"Jamie","full_name":"Tayar, Jamie"},{"first_name":"Timothy R.","last_name":"White","full_name":"White, Timothy R."},{"full_name":"Verma, Kuldeep","last_name":"Verma","first_name":"Kuldeep"},{"full_name":"Vrard, Mathieu","first_name":"Mathieu","last_name":"Vrard"},{"full_name":"Yıldız, M.","last_name":"Yıldız","first_name":"M."},{"full_name":"Baker, David","first_name":"David","last_name":"Baker"},{"first_name":"Michaël","last_name":"Bazot","full_name":"Bazot, Michaël"},{"full_name":"Beichmann, Charles","first_name":"Charles","last_name":"Beichmann"},{"first_name":"Christoph","last_name":"Bergmann","full_name":"Bergmann, Christoph"},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet"},{"full_name":"Cale, Bryson","last_name":"Cale","first_name":"Bryson"},{"last_name":"Carlino","first_name":"Roberto","full_name":"Carlino, Roberto"},{"last_name":"Cartwright","first_name":"Scott M.","full_name":"Cartwright, Scott M."},{"last_name":"Christiansen","first_name":"Jessie L.","full_name":"Christiansen, Jessie L."},{"last_name":"Ciardi","first_name":"David R.","full_name":"Ciardi, David R."},{"full_name":"Creevey, Orlagh","first_name":"Orlagh","last_name":"Creevey"},{"full_name":"Dittmann, Jason A.","first_name":"Jason A.","last_name":"Dittmann"},{"last_name":"Nascimento","first_name":"Jose-Dias Do","full_name":"Nascimento, Jose-Dias Do"},{"last_name":"Eylen","first_name":"Vincent Van","full_name":"Eylen, Vincent Van"},{"last_name":"Fürész","first_name":"Gabor","full_name":"Fürész, Gabor"},{"first_name":"Jonathan","last_name":"Gagné","full_name":"Gagné, Jonathan"},{"last_name":"Gao","first_name":"Peter","full_name":"Gao, Peter"},{"full_name":"Gazeas, Kosmas","last_name":"Gazeas","first_name":"Kosmas"},{"full_name":"Giddens, Frank","last_name":"Giddens","first_name":"Frank"},{"first_name":"Oliver J.","last_name":"Hall","full_name":"Hall, Oliver J."},{"full_name":"Hekker, Saskia","first_name":"Saskia","last_name":"Hekker"},{"last_name":"Ireland","first_name":"Michael J.","full_name":"Ireland, Michael J."},{"last_name":"Latouf","first_name":"Natasha","full_name":"Latouf, Natasha"},{"first_name":"Danny","last_name":"LeBrun","full_name":"LeBrun, Danny"},{"full_name":"Levine, Alan M.","first_name":"Alan M.","last_name":"Levine"},{"last_name":"Matzko","first_name":"William","full_name":"Matzko, William"},{"full_name":"Natinsky, Eva","last_name":"Natinsky","first_name":"Eva"},{"first_name":"Emma","last_name":"Page","full_name":"Page, Emma"},{"first_name":"Peter","last_name":"Plavchan","full_name":"Plavchan, Peter"},{"last_name":"Mansouri-Samani","first_name":"Masoud","full_name":"Mansouri-Samani, Masoud"},{"full_name":"McCauliff, Sean","last_name":"McCauliff","first_name":"Sean"},{"full_name":"Mullally, Susan E.","last_name":"Mullally","first_name":"Susan E."},{"full_name":"Orenstein, Brendan","first_name":"Brendan","last_name":"Orenstein"},{"last_name":"Soto","first_name":"Aylin Garcia","full_name":"Soto, Aylin Garcia"},{"full_name":"Paegert, Martin","first_name":"Martin","last_name":"Paegert"},{"last_name":"van Saders","first_name":"Jennifer L.","full_name":"van Saders, Jennifer L."},{"full_name":"Schnaible, Chloe","last_name":"Schnaible","first_name":"Chloe"},{"full_name":"Soderblom, David R.","first_name":"David R.","last_name":"Soderblom"},{"last_name":"Szabó","first_name":"Róbert","full_name":"Szabó, Róbert"},{"full_name":"Tanner, Angelle","first_name":"Angelle","last_name":"Tanner"},{"full_name":"Tinney, C. G.","last_name":"Tinney","first_name":"C. G."},{"full_name":"Teske, Johanna","last_name":"Teske","first_name":"Johanna"},{"full_name":"Thomas, Alexandra","first_name":"Alexandra","last_name":"Thomas"},{"first_name":"Regner","last_name":"Trampedach","full_name":"Trampedach, Regner"},{"full_name":"Wright, Duncan","last_name":"Wright","first_name":"Duncan"},{"full_name":"Yuan, Thomas T.","first_name":"Thomas T.","last_name":"Yuan"},{"full_name":"Zohrabi, Farzaneh","last_name":"Zohrabi","first_name":"Farzaneh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":157,"arxiv":1,"intvolume":"       157","publication":"The Astronomical Journal","date_updated":"2022-08-22T07:38:34Z"},{"issue":"1","quality_controlled":"1","day":"19","status":"public","month":"09","extern":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis","stars: activity","stars: low-mass","stars: rotation","starspots","techniques: photometric"],"language":[{"iso":"eng"}],"type":"journal_article","date_published":"2019-09-19T00:00:00Z","external_id":{"arxiv":["1908.05222"]},"publisher":"IOP Publishing","date_created":"2022-07-19T09:21:58Z","_id":"11623","abstract":[{"lang":"eng","text":"Brightness variations due to dark spots on the stellar surface encode information about stellar surface rotation and magnetic activity. In this work, we analyze the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M and K in order to measure their surface rotation and photometric activity level. Rotation-period estimates are obtained by the combination of a wavelet analysis and autocorrelation function of the light curves. Reliable rotation estimates are determined by comparing the results from the different rotation diagnostics and four data sets. We also measure the photometric activity proxy Sph using the amplitude of the flux variations on an appropriate timescale. We report rotation periods and photometric activity proxies for about 60% of the sample, including 4431 targets for which McQuillan et al. did not report a rotation period. For the common targets with rotation estimates in this study and in McQuillan et al., our rotation periods agree within 99%. In this work, we also identify potential polluters, such as misclassified red giants and classical pulsator candidates. Within the parameter range we study, there is a mild tendency for hotter stars to have shorter rotation periods. The photometric activity proxy spans a wider range of values with increasing effective temperature. The rotation period and photometric activity proxy are also related, with Sph being larger for fast rotators. Similar to McQuillan et al., we find a bimodal distribution of rotation periods."}],"citation":{"ama":"Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. <i>The Astrophysical Journal Supplement Series</i>. 2019;244(1). doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>","ista":"Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 244(1), 21.","ieee":"A. R. G. Santos <i>et al.</i>, “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” <i>The Astrophysical Journal Supplement Series</i>, vol. 244, no. 1. IOP Publishing, 2019.","mla":"Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” <i>The Astrophysical Journal Supplement Series</i>, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">10.3847/1538-4365/ab3b56</a>.","short":"A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S. Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement Series 244 (2019).","chicago":"Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L. van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>.","apa":"Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J. L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. <i>The Astrophysical Journal Supplement Series</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4365/ab3b56\">https://doi.org/10.3847/1538-4365/ab3b56</a>"},"year":"2019","article_number":"21","oa_version":"Preprint","article_processing_charge":"No","title":"Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars","publication_status":"published","acknowledgement":"The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg, and Isabel L. Colman for helping on the classification of stars. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the National Aeronautics and Space Administration (NASA) Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at the Max Planck Institute for Solar System Research. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy (van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities: MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -","publication_identifier":{"issn":["0067-0049"]},"article_type":"original","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.05222"}],"doi":"10.3847/1538-4365/ab3b56","date_updated":"2022-08-22T08:10:38Z","publication":"The Astrophysical Journal Supplement Series","intvolume":"       244","arxiv":1,"volume":244,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Santos","first_name":"A. R. G.","full_name":"Santos, A. R. G."},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet"},{"full_name":"van Saders, J. L.","last_name":"van Saders","first_name":"J. L."},{"full_name":"Metcalfe, T. S.","last_name":"Metcalfe","first_name":"T. S."},{"full_name":"Simonian, G. V. A.","first_name":"G. V. A.","last_name":"Simonian"},{"full_name":"Pinsonneault, M. H.","last_name":"Pinsonneault","first_name":"M. H."}]},{"author":[{"first_name":"S. N.","last_name":"Breton","full_name":"Breton, S. N."},{"first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle"},{"full_name":"Santos, A. R. G.","first_name":"A. R. G.","last_name":"Santos"},{"full_name":"Saux, A. Le","last_name":"Saux","first_name":"A. Le"},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"first_name":"P. L.","last_name":"Palle","full_name":"Palle, P. L."},{"full_name":"Garcia, R. A.","last_name":"Garcia","first_name":"R. A."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","external_id":{"arxiv":["1906.09609"]},"date_published":"2019-06-23T00:00:00Z","oa":1,"language":[{"iso":"eng"}],"arxiv":1,"extern":"1","keyword":["asteroseismology","rotation","solar-like stars","kepler","machine learning","random forest"],"month":"06","date_updated":"2022-08-22T08:16:53Z","status":"public","publication":"arXiv","main_file_link":[{"url":"https://arxiv.org/abs/1906.09609","open_access":"1"}],"doi":"10.48550/arXiv.1906.09609","day":"23","publication_status":"submitted","title":"Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques","article_processing_charge":"No","oa_version":"Preprint","citation":{"ama":"Breton SN, Bugnet LA, Santos ARG, et al. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09609\">10.48550/arXiv.1906.09609</a>","ista":"Breton SN, Bugnet LA, Santos ARG, Saux AL, Mathur S, Palle PL, Garcia RA. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv, 1906.09609.","ieee":"S. N. Breton <i>et al.</i>, “Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques,” <i>arXiv</i>. .","short":"S.N. Breton, L.A. Bugnet, A.R.G. Santos, A.L. Saux, S. Mathur, P.L. Palle, R.A. Garcia, ArXiv (n.d.).","chicago":"Breton, S. N., Lisa Annabelle Bugnet, A. R. G. Santos, A. Le Saux, S. Mathur, P. L. Palle, and R. A. Garcia. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1906.09609\">https://doi.org/10.48550/arXiv.1906.09609</a>.","apa":"Breton, S. N., Bugnet, L. A., Santos, A. R. G., Saux, A. L., Mathur, S., Palle, P. L., &#38; Garcia, R. A. (n.d.). Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1906.09609\">https://doi.org/10.48550/arXiv.1906.09609</a>","mla":"Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” <i>ArXiv</i>, 1906.09609, doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09609\">10.48550/arXiv.1906.09609</a>."},"year":"2019","article_number":"1906.09609","abstract":[{"lang":"eng","text":"For a solar-like star, the surface rotation evolves with time, allowing in principle to estimate the age of a star from its surface rotation period. Here we are interested in measuring surface rotation periods of solar-like stars observed by the NASA mission Kepler. Different methods have been developed to track rotation signals in Kepler photometric light curves: time-frequency analysis based on wavelet techniques, autocorrelation and composite spectrum. We use the learning abilities of random forest classifiers to take decisions during two crucial steps of the analysis. First, given some input parameters, we discriminate the considered Kepler targets between rotating MS stars, non-rotating MS stars, red giants, binaries and pulsators. We then use a second classifier only on the MS rotating targets to decide the best data analysis treatment."}],"date_created":"2022-07-20T11:18:53Z","_id":"11627"},{"title":"Automatic classification of K2 pulsating stars using machine learning techniques","publication_status":"submitted","article_processing_charge":"No","oa_version":"Preprint","doi":"10.48550/arXiv.1906.09611","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1906.09611","open_access":"1"}],"day":"23","date_created":"2022-07-21T06:57:10Z","_id":"11630","citation":{"chicago":"Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>.","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).","apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., &#38; Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, 1906.09611, doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>.","ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>","ieee":"A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” <i>arXiv</i>. .","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611."},"year":"2019","article_number":"1906.09611","abstract":[{"text":"The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars.","lang":"eng"}],"type":"preprint","external_id":{"arxiv":["1906.09611"]},"date_published":"2019-06-23T00:00:00Z","oa":1,"author":[{"full_name":"Saux, A. Le","last_name":"Saux","first_name":"A. Le"},{"first_name":"Lisa Annabelle","last_name":"Bugnet","orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle"},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"first_name":"S. N.","last_name":"Breton","full_name":"Breton, S. N."},{"first_name":"R. A.","last_name":"Garcia","full_name":"Garcia, R. A."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","date_updated":"2022-08-22T08:20:29Z","publication":"arXiv","status":"public","arxiv":1,"language":[{"iso":"eng"}],"extern":"1","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Ancona","first_name":"Bertie","full_name":"Ancona, Bertie"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Roditty, Liam","first_name":"Liam","last_name":"Roditty"},{"full_name":"Williams, Virginia Vassilevska","first_name":"Virginia Vassilevska","last_name":"Williams"},{"full_name":"Wein, Nicole","first_name":"Nicole","last_name":"Wein"}],"volume":132,"oa":1,"intvolume":"       132","arxiv":1,"date_updated":"2023-02-16T10:48:24Z","publication":"46th International Colloquium on Automata, Languages, and Programming","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-109-2"]},"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ICALP.2019.13","open_access":"1"}],"doi":"10.4230/LIPICS.ICALP.2019.13","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Algorithms and hardness for diameter in dynamic graphs","abstract":[{"text":"The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported.\r\nThis paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include:\r\n- Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal.","lang":"eng"}],"citation":{"short":"B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In <i>46th International Colloquium on Automata, Languages, and Programming</i>, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>.","apa":"Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., &#38; Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In <i>46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>","mla":"Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” <i>46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">10.4230/LIPICS.ICALP.2019.13</a>.","ama":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: <i>46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">10.4230/LIPICS.ICALP.2019.13</a>","ista":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.","ieee":"B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in <i>46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132."},"year":"2019","article_number":"13","date_created":"2022-08-12T08:14:51Z","_id":"11826","conference":{"start_date":"2019-07-09","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Patras, Greece","end_date":"2019-07-12"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","external_id":{"arxiv":["811.12527"]},"date_published":"2019-07-04T00:00:00Z","alternative_title":["LIPIcs"],"extern":"1","language":[{"iso":"eng"}],"status":"public","month":"07","day":"04","quality_controlled":"1"},{"publisher":"Springer Nature","pmid":1,"date_published":"2019-10-04T00:00:00Z","external_id":{"pmid":["31583641"]},"type":"book_chapter","language":[{"iso":"eng"}],"extern":"1","alternative_title":["Methods in Molecular Biology"],"month":"10","status":"public","page":"215–231","day":"04","quality_controlled":"1","author":[{"first_name":"Sonja","last_name":"Biedermann","full_name":"Biedermann, Sonja"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"},{"full_name":"Schuster, Bernhard","first_name":"Bernhard","last_name":"Schuster"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"MIMB","volume":2074,"intvolume":"      2074","publication":"Protein-Protein Interaction Networks","date_updated":"2023-02-17T09:34:26Z","doi":"10.1007/978-1-4939-9873-9_16","scopus_import":"1","publication_identifier":{"issn":["1064-3745"],"eissn":["1940-6029"],"eisbn":["9781493998739"],"isbn":["9781493998722"]},"title":"Vienna Graph Clustering","publication_status":"published","article_processing_charge":"No","oa_version":"None","year":"2019","citation":{"ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. <i>Protein-Protein Interaction Networks</i>. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:<a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">10.1007/978-1-4939-9873-9_16</a>","ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in <i>Protein-Protein Interaction Networks</i>, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.","mla":"Biedermann, Sonja, et al. “Vienna Graph Clustering.” <i>Protein-Protein Interaction Networks</i>, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:<a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">10.1007/978-1-4939-9873-9_16</a>.","apa":"Biedermann, S., Henzinger, M. H., Schulz, C., &#38; Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar &#38; F. Rojas Ringeling (Eds.), <i>Protein-Protein Interaction Networks</i> (Vol. 2074, pp. 215–231). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">https://doi.org/10.1007/978-1-4939-9873-9_16</a>","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In <i>Protein-Protein Interaction Networks</i>, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">https://doi.org/10.1007/978-1-4939-9873-9_16</a>.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231."},"abstract":[{"lang":"eng","text":"This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks."}],"editor":[{"first_name":"Stefan","last_name":"Canzar","full_name":"Canzar, Stefan"},{"full_name":"Rojas Ringeling, Francisca","last_name":"Rojas Ringeling","first_name":"Francisca"}],"_id":"11847","date_created":"2022-08-16T06:54:48Z"},{"external_id":{"arxiv":["1904.05474"]},"date_published":"2019-06-20T00:00:00Z","type":"conference","publisher":"Association for Computing Machinery","month":"06","status":"public","language":[{"iso":"eng"}],"extern":"1","quality_controlled":"1","page":"43–44","day":"20","oa":1,"author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems","date_updated":"2023-02-17T09:41:45Z","arxiv":1,"title":"Efficient distributed workload (re-)embedding","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.05474"}],"doi":"10.1145/3309697.3331503","scopus_import":"1","publication_identifier":{"isbn":["978-1-4503-6678-6"]},"conference":{"end_date":"2019-06-28","location":"Phoenix, AZ, United States","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","start_date":"2019-06-24"},"_id":"11850","date_created":"2022-08-16T07:14:57Z","year":"2019","citation":{"mla":"Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2019, pp. 43–44, doi:<a href=\"https://doi.org/10.1145/3309697.3331503\">10.1145/3309697.3331503</a>.","chicago":"Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, 43–44. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3309697.3331503\">https://doi.org/10.1145/3309697.3331503</a>.","short":"M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.","apa":"Henzinger, M. H., Neumann, S., &#38; Schmid, S. (2019). Efficient distributed workload (re-)embedding. In <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i> (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3309697.3331503\">https://doi.org/10.1145/3309697.3331503</a>","ista":"Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44.","ieee":"M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, Phoenix, AZ, United States, 2019, pp. 43–44.","ama":"Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2019:43–44. doi:<a href=\"https://doi.org/10.1145/3309697.3331503\">10.1145/3309697.3331503</a>"},"abstract":[{"text":"Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.","lang":"eng"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1808.05458"}],"doi":"10.1109/ipdps.2019.00013","scopus_import":"1","publication_identifier":{"eisbn":["978-1-7281-1246-6"],"isbn":["978-1-7281-1247-3"],"eissn":["1530-2075"]},"publication_status":"published","title":"Shared-memory exact minimum cuts","article_processing_charge":"No","oa_version":"Preprint","article_number":"8820968","year":"2019","citation":{"apa":"Henzinger, M. H., Noe, A., &#38; Schulz, C. (2019). Shared-memory exact minimum cuts. In <i>33rd International Parallel and Distributed Processing Symposium</i>. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ipdps.2019.00013\">https://doi.org/10.1109/ipdps.2019.00013</a>","short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019.","chicago":"Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In <i>33rd International Parallel and Distributed Processing Symposium</i>. Institute of Electrical and Electronics Engineers, 2019. <a href=\"https://doi.org/10.1109/ipdps.2019.00013\">https://doi.org/10.1109/ipdps.2019.00013</a>.","mla":"Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” <i>33rd International Parallel and Distributed Processing Symposium</i>, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:<a href=\"https://doi.org/10.1109/ipdps.2019.00013\">10.1109/ipdps.2019.00013</a>.","ama":"Henzinger MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: <i>33rd International Parallel and Distributed Processing Symposium</i>. Institute of Electrical and Electronics Engineers; 2019. doi:<a href=\"https://doi.org/10.1109/ipdps.2019.00013\">10.1109/ipdps.2019.00013</a>","ieee":"M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in <i>33rd International Parallel and Distributed Processing Symposium</i>, Rio de Janeiro, Brazil, 2019.","ista":"Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968."},"abstract":[{"lang":"eng","text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem."}],"conference":{"name":"IPDPS: International Parallel and Distributed Processing Symposium","location":"Rio de Janeiro, Brazil","end_date":"2019-05-24","start_date":"2019-05-20"},"_id":"11851","date_created":"2022-08-16T07:25:23Z","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Noe, Alexander","first_name":"Alexander","last_name":"Noe"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"11851"}]},"arxiv":1,"publication":"33rd International Parallel and Distributed Processing Symposium","date_updated":"2023-02-21T16:30:34Z","day":"01","quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","date_published":"2019-05-01T00:00:00Z","external_id":{"arxiv":["1808.05458"]},"type":"conference","language":[{"iso":"eng"}],"extern":"1","month":"05","status":"public"},{"oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","title":"A new deterministic algorithm for dynamic set cover","publication_identifier":{"eisbn":["978-1-7281-4952-3"],"isbn":["978-1-7281-4953-0"],"issn":["2575-8454"]},"doi":"10.1109/focs.2019.00033","main_file_link":[{"url":"https://arxiv.org/abs/1909.11600","open_access":"1"}],"scopus_import":"1","_id":"11853","date_created":"2022-08-16T08:00:00Z","conference":{"end_date":"2019-11-12","name":"FOCS: Annual Symposium on Foundations of Computer Science","location":"Baltimore, MD, United States","start_date":"2019-11-09"},"abstract":[{"text":"We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.","lang":"eng"}],"year":"2019","citation":{"ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in <i>60th Annual Symposium on Foundations of Computer Science</i>, Baltimore, MD, United States, 2019, pp. 406–423.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: <i>60th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In <i>60th Annual Symposium on Foundations of Computer Science</i> (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In <i>60th Annual Symposium on Foundations of Computer Science</i>, 406–23. Institute of Electrical and Electronics Engineers, 2019. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>.","mla":"Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” <i>60th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"publication":"60th Annual Symposium on Foundations of Computer Science","date_updated":"2023-02-17T09:50:37Z","arxiv":1,"quality_controlled":"1","day":"01","page":"406-423","date_published":"2019-11-01T00:00:00Z","external_id":{"arxiv":["1909.11600"]},"type":"conference","publisher":"Institute of Electrical and Electronics Engineers","status":"public","month":"11","extern":"1","language":[{"iso":"eng"}]},{"quality_controlled":"1","day":"01","page":"343–354","status":"public","month":"06","extern":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["1904.04341"]},"date_published":"2019-06-01T00:00:00Z","type":"conference","publisher":"Association for Computing Machinery","_id":"11865","date_created":"2022-08-16T09:11:17Z","conference":{"start_date":"2019-06-23","end_date":"2019-06-26","location":"Phoenix, AZ, United States","name":"STOC: Symposium on Theory of Computing"},"abstract":[{"lang":"eng","text":"We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs."}],"year":"2019","citation":{"ieee":"M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, Phoenix, AZ, United States, 2019, pp. 343–354.","ista":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.","ama":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>. Association for Computing Machinery; 2019:343–354. doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>","chicago":"Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, 343–354. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>.","apa":"Daga, M., Henzinger, M. H., Nanongkai, D., &#38; Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i> (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>","short":"M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.","mla":"Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, Association for Computing Machinery, 2019, pp. 343–354, doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>."},"oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","title":"Distributed edge connectivity in sublinear time","publication_identifier":{"isbn":["978-1-4503-6705-9"],"issn":["0737-8017"]},"doi":"10.1145/3313276.3316346","main_file_link":[{"url":"https://arxiv.org/abs/1904.04341","open_access":"1"}],"scopus_import":"1","publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","date_updated":"2023-02-17T10:26:25Z","arxiv":1,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Daga, Mohit","first_name":"Mohit","last_name":"Daga"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"},{"full_name":"Saranurak, Thatchaphol","first_name":"Thatchaphol","last_name":"Saranurak"}]},{"publication_identifier":{"eisbn":["978-1-61197-548-2"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.10932"}],"doi":"10.1137/1.9781611975482.115","scopus_import":"1","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","abstract":[{"lang":"eng","text":"Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms."}],"year":"2019","citation":{"ama":"Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>","ista":"Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.","ieee":"A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2019, pp. 1899–1918.","apa":"Bernstein, A., Forster, S., &#38; Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>","chicago":"Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1899–1918. Society for Industrial and Applied Mathematics, 2019. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>.","short":"A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918.","mla":"Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>."},"_id":"11871","date_created":"2022-08-16T09:50:33Z","conference":{"end_date":"2019-01-09","name":"SODA: Symposium on Discrete Algorithms","location":"San Diego, CA, United States","start_date":"2019-01-06"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bernstein","first_name":"Aaron","full_name":"Bernstein, Aaron"},{"full_name":"Forster, Sebastian","last_name":"Forster","first_name":"Sebastian"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"}],"oa":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11871"}]},"arxiv":1,"publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2023-02-21T16:31:21Z","day":"01","page":"1899-1918","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","date_published":"2019-01-01T00:00:00Z","external_id":{"arxiv":["1810.10932"]},"type":"conference","extern":"1","language":[{"iso":"eng"}],"status":"public","month":"01"},{"_id":"11898","date_created":"2022-08-17T09:02:15Z","abstract":[{"text":"We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model.","lang":"eng"}],"year":"2019","citation":{"mla":"Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>, vol. 779, Elsevier, 2019, pp. 72–87, doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>.","short":"S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>.","ama":"Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. 2019;779:72-87. doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>","ieee":"S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” <i>Theoretical Computer Science</i>, vol. 779. Elsevier, pp. 72–87, 2019.","ista":"Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87."},"oa_version":"Preprint","article_processing_charge":"No","title":"New amortized cell-probe lower bounds for dynamic problems","publication_status":"published","article_type":"original","publication_identifier":{"issn":["0304-3975"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.02304"}],"doi":"10.1016/j.tcs.2019.01.043","scopus_import":"1","publication":"Theoretical Computer Science","date_updated":"2022-09-09T11:29:04Z","intvolume":"       779","arxiv":1,"oa":1,"volume":779,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Neumann","first_name":"Stefan","full_name":"Neumann, Stefan"}],"quality_controlled":"1","day":"02","page":"72-87","status":"public","month":"08","extern":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["1902.02304"]},"date_published":"2019-08-02T00:00:00Z","type":"journal_article","publisher":"Elsevier"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"},{"last_name":"Malik","first_name":"Jamal A.","full_name":"Malik, Jamal A."},{"full_name":"Cavedon, Cristian","last_name":"Cavedon","first_name":"Cristian"},{"full_name":"Gisbertz, Sebastian","first_name":"Sebastian","last_name":"Gisbertz"},{"full_name":"Savateev, Aleksandr","first_name":"Aleksandr","last_name":"Savateev"},{"full_name":"Cruz, Daniel","first_name":"Daniel","last_name":"Cruz"},{"full_name":"Heil, Tobias","first_name":"Tobias","last_name":"Heil"},{"full_name":"Zhang, Guigang","first_name":"Guigang","last_name":"Zhang"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."}],"volume":58,"intvolume":"        58","publication":"Angewandte Chemie International Edition","date_updated":"2023-02-21T10:09:16Z","article_type":"letter_note","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"doi":"10.1002/anie.201902785","scopus_import":"1","oa_version":"None","article_processing_charge":"No","publication_status":"published","title":"Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides","abstract":[{"lang":"eng","text":"Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales."}],"year":"2019","citation":{"short":"B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T. Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019) 9575–9580.","apa":"Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>","chicago":"Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” <i>Angewandte Chemie International Edition</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>.","mla":"Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” <i>Angewandte Chemie International Edition</i>, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>.","ieee":"B. Pieber <i>et al.</i>, “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” <i>Angewandte Chemie International Edition</i>, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.","ista":"Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 58(28), 9575–9580.","ama":"Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. <i>Angewandte Chemie International Edition</i>. 2019;58(28):9575-9580. doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>"},"_id":"11957","date_created":"2022-08-24T10:50:19Z","publisher":"Wiley","pmid":1,"external_id":{"pmid":["31050132"]},"date_published":"2019-07-08T00:00:00Z","type":"journal_article","extern":"1","language":[{"iso":"eng"}],"status":"public","month":"07","day":"08","page":"9575-9580","quality_controlled":"1","issue":"28"},{"intvolume":"        21","publication":"Organic Letters","date_updated":"2023-02-21T10:10:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Cavedon, Cristian","first_name":"Cristian","last_name":"Cavedon"},{"first_name":"Amiera","last_name":"Madani","full_name":"Madani, Amiera"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."},{"last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X"}],"oa":1,"volume":21,"abstract":[{"lang":"eng","text":"A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well."}],"year":"2019","citation":{"ama":"Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. 2019;21(13):5331-5334. doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>","ieee":"C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” <i>Organic Letters</i>, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.","ista":"Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334.","apa":"Cavedon, C., Madani, A., Seeberger, P. H., &#38; Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>","short":"C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334.","chicago":"Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>.","mla":"Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>."},"_id":"11982","date_created":"2022-08-25T11:18:00Z","article_type":"letter_note","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"doi":"10.1021/acs.orglett.9b01957","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.orglett.9b01957"}],"scopus_import":"1","article_processing_charge":"No","oa_version":"Published Version","publication_status":"published","title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","extern":"1","language":[{"iso":"eng"}],"status":"public","month":"07","publisher":"American Chemical Society","pmid":1,"external_id":{"pmid":["31247752"]},"date_published":"2019-07-05T00:00:00Z","type":"journal_article","issue":"13","day":"05","page":"5331-5334","quality_controlled":"1"},{"date_published":"2019-12-20T00:00:00Z","type":"journal_article","publisher":"American Chemical Society","month":"12","status":"public","language":[{"iso":"eng"}],"extern":"1","quality_controlled":"1","page":"2764-2770","day":"20","issue":"12","oa":1,"volume":23,"author":[{"full_name":"Guberman, Mónica","first_name":"Mónica","last_name":"Guberman"},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Organic Process Research and Development","date_updated":"2023-02-21T10:10:23Z","intvolume":"        23","title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","publication_status":"published","oa_version":"Published Version","article_processing_charge":"No","doi":"10.1021/acs.oprd.9b00456","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"scopus_import":"1","article_type":"letter_note","publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"_id":"11984","date_created":"2022-08-25T11:30:33Z","year":"2019","citation":{"ista":"Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770.","ieee":"M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” <i>Organic Process Research and Development</i>, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019.","ama":"Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. 2019;23(12):2764-2770. doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>","chicago":"Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>.","apa":"Guberman, M., Pieber, B., &#38; Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>","short":"M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770.","mla":"Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>."},"abstract":[{"lang":"eng","text":"Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product."}]},{"file_date_updated":"2020-07-14T12:45:45Z","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","title":"Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex","publication_status":"published","article_type":"review","acknowledgement":" This work was supported by IST Austria institutional funds; NÖ Forschung und Bildung \r\nn[f+b]   (C13-002)   to   SH;   a   program   grant   from   the   Human   Frontiers   Science   Program (RGP0053/2014)  to SH;  the  People  Programme  (Marie  Curie  Actions)  of  the  European  Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No 618444 to SH, and the  European  Research  Council  (ERC)  under  the  European  Union’s  Horizon  2020  research  and innovation programme (grant agreement No 725780 LinPro)to SH.\r\n","doi":"10.1111/jnc.14601","scopus_import":"1","_id":"27","file":[{"checksum":"db027721a95d36f5de36aadcd0bdf7e6","content_type":"application/pdf","creator":"kschuh","file_id":"7239","date_updated":"2020-07-14T12:45:45Z","relation":"main_file","date_created":"2020-01-07T13:35:52Z","file_size":889709,"access_level":"open_access","file_name":"2019_Wiley_Amberg.pdf"}],"date_created":"2018-12-11T11:44:14Z","abstract":[{"text":"The cerebral cortex is composed of a large variety of distinct cell-types including projection neurons, interneurons and glial cells which emerge from distinct neural stem cell (NSC) lineages. The vast majority of cortical projection neurons and certain classes of glial cells are generated by radial glial progenitor cells (RGPs) in a highly orchestrated manner. Recent studies employing single cell analysis and clonal lineage tracing suggest that NSC and RGP lineage progression are regulated in a profound deterministic manner. In this review we focus on recent advances based mainly on correlative phenotypic data emerging from functional genetic studies in mice. We establish hypotheses to test in future research and outline a conceptual framework how epigenetic cues modulate the generation of cell-type diversity during cortical development. This article is protected by copyright. All rights reserved.","lang":"eng"}],"year":"2019","citation":{"ama":"Amberg N, Laukoter S, Hippenmeyer S. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. 2019;149(1):12-26. doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>","ista":"Amberg N, Laukoter S, Hippenmeyer S. 2019. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 149(1), 12–26.","ieee":"N. Amberg, S. Laukoter, and S. Hippenmeyer, “Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex,” <i>Journal of Neurochemistry</i>, vol. 149, no. 1. Wiley, pp. 12–26, 2019.","mla":"Amberg, Nicole, et al. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>, vol. 149, no. 1, Wiley, 2019, pp. 12–26, doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>.","short":"N. Amberg, S. Laukoter, S. Hippenmeyer, Journal of Neurochemistry 149 (2019) 12–26.","chicago":"Amberg, Nicole, Susanne Laukoter, and Simon Hippenmeyer. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>.","apa":"Amberg, N., Laukoter, S., &#38; Hippenmeyer, S. (2019). Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. Wiley. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>"},"oa":1,"volume":149,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0002-3183-8207","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","full_name":"Amberg, Nicole","first_name":"Nicole","last_name":"Amberg"},{"full_name":"Laukoter, Susanne","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7903-3010","last_name":"Laukoter","first_name":"Susanne"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","first_name":"Simon","last_name":"Hippenmeyer"}],"publication":"Journal of Neurochemistry","date_updated":"2023-09-11T13:40:26Z","ec_funded":1,"department":[{"_id":"SiHi"}],"intvolume":"       149","quality_controlled":"1","day":"01","page":"12-26","project":[{"grant_number":"LS13-002","name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain","_id":"25D92700-B435-11E9-9278-68D0E5697425"},{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014"},{"_id":"25D61E48-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7","grant_number":"618444"},{"grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","_id":"260018B0-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","issue":"1","date_published":"2019-04-01T00:00:00Z","external_id":{"isi":["000462680200002"]},"type":"journal_article","publisher":"Wiley","status":"public","month":"04","isi":1,"language":[{"iso":"eng"}],"ddc":["570"]},{"publication":"Stochastic Processes and their Applications","date_updated":"2023-08-24T14:20:49Z","department":[{"_id":"JaMa"}],"intvolume":"       129","arxiv":1,"oa":1,"volume":129,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Gerencser","first_name":"Mate","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gyöngy","first_name":"István","full_name":"Gyöngy, István"}],"_id":"301","date_created":"2018-12-11T11:45:42Z","abstract":[{"text":"A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense.","lang":"eng"}],"year":"2019","citation":{"short":"M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012.","apa":"Gerencser, M., &#38; Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and Their Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>","chicago":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>.","mla":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>.","ieee":"M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” <i>Stochastic Processes and their Applications</i>, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019.","ista":"Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012.","ama":"Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and their Applications</i>. 2019;129(3):995-1012. doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>"},"oa_version":"Preprint","article_processing_charge":"No","title":"A Feynman–Kac formula for stochastic Dirichlet problems","publication_status":"published","article_type":"original","main_file_link":[{"url":"https://arxiv.org/abs/1611.04177","open_access":"1"}],"doi":"10.1016/j.spa.2018.04.003","scopus_import":"1","status":"public","month":"03","isi":1,"language":[{"iso":"eng"}],"date_published":"2019-03-01T00:00:00Z","external_id":{"arxiv":["1611.04177"],"isi":["000458945300012"]},"type":"journal_article","publisher":"Elsevier","issue":"3","quality_controlled":"1","day":"01","page":"995-1012"},{"ddc":["510"],"language":[{"iso":"eng"}],"isi":1,"month":"04","publist_id":"7546","status":"public","publisher":"Springer","type":"journal_article","external_id":{"isi":["000463613800001"]},"date_published":"2019-04-01T00:00:00Z","issue":"3-4","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"page":"697–758","day":"01","quality_controlled":"1","intvolume":"       173","department":[{"_id":"JaMa"}],"date_updated":"2023-08-24T14:38:32Z","publication":"Probability Theory and Related Fields","author":[{"last_name":"Gerencser","first_name":"Mate","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hairer, Martin","first_name":"Martin","last_name":"Hairer"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":173,"oa":1,"citation":{"short":"M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758.","apa":"Gerencser, M., &#38; Hairer, M. (2019). Singular SPDEs in domains with boundaries. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-018-0841-1\">https://doi.org/10.1007/s00440-018-0841-1</a>","chicago":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” <i>Probability Theory and Related Fields</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00440-018-0841-1\">https://doi.org/10.1007/s00440-018-0841-1</a>.","mla":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” <i>Probability Theory and Related Fields</i>, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:<a href=\"https://doi.org/10.1007/s00440-018-0841-1\">10.1007/s00440-018-0841-1</a>.","ieee":"M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” <i>Probability Theory and Related Fields</i>, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.","ista":"Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758.","ama":"Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. <i>Probability Theory and Related Fields</i>. 2019;173(3-4):697–758. doi:<a href=\"https://doi.org/10.1007/s00440-018-0841-1\">10.1007/s00440-018-0841-1</a>"},"year":"2019","abstract":[{"lang":"eng","text":"We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition."}],"date_created":"2018-12-11T11:45:48Z","file":[{"relation":"main_file","file_size":893182,"date_updated":"2020-07-14T12:46:03Z","date_created":"2018-12-17T16:25:24Z","access_level":"open_access","file_name":"2018_ProbTheory_Gerencser.pdf","checksum":"288d16ef7291242f485a9660979486e3","content_type":"application/pdf","creator":"dernst","file_id":"5722"}],"_id":"319","scopus_import":"1","doi":"10.1007/s00440-018-0841-1","acknowledgement":"MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n","publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"article_type":"original","title":"Singular SPDEs in domains with boundaries","publication_status":"published","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:03Z"},{"language":[{"iso":"eng"}],"month":"09","isi":1,"status":"public","publist_id":"7424","publisher":"Elsevier","date_published":"2019-09-01T00:00:00Z","external_id":{"isi":["000470955300005"],"arxiv":["1712.05324"]},"type":"journal_article","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"page":"67-78","day":"01","quality_controlled":"1","arxiv":1,"intvolume":"       576","department":[{"_id":"LaEr"}],"publication":"Linear Algebra and Its Applications","ec_funded":1,"date_updated":"2023-08-24T14:31:47Z","author":[{"full_name":"Virosztek, Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511","last_name":"Virosztek","first_name":"Daniel"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"volume":576,"year":"2019","citation":{"chicago":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">https://doi.org/10.1016/j.laa.2018.03.002</a>.","apa":"Virosztek, D. (2019). Jointly convex quantum Jensen divergences. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">https://doi.org/10.1016/j.laa.2018.03.002</a>","short":"D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78.","mla":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” <i>Linear Algebra and Its Applications</i>, vol. 576, Elsevier, 2019, pp. 67–78, doi:<a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">10.1016/j.laa.2018.03.002</a>.","ama":"Virosztek D. Jointly convex quantum Jensen divergences. <i>Linear Algebra and Its Applications</i>. 2019;576:67-78. doi:<a href=\"https://doi.org/10.1016/j.laa.2018.03.002\">10.1016/j.laa.2018.03.002</a>","ieee":"D. Virosztek, “Jointly convex quantum Jensen divergences,” <i>Linear Algebra and Its Applications</i>, vol. 576. Elsevier, pp. 67–78, 2019.","ista":"Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 576, 67–78."},"abstract":[{"lang":"eng","text":"We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently."}],"_id":"405","date_created":"2018-12-11T11:46:17Z","main_file_link":[{"url":"https://arxiv.org/abs/1712.05324","open_access":"1"}],"doi":"10.1016/j.laa.2018.03.002","scopus_import":"1","article_type":"original","acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office – NKFIH (grant no. K124152)","title":"Jointly convex quantum Jensen divergences","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No"}]