[{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution (R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i) the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03) and ii) an unphysical [OII]/Hα ratio ([OII]/Hα > 22). We show that COLA1’s observed B-band flux is explained by a faint extended foreground LAE, for which we detect Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked LAE at z = 6.593, the first discovered at z > 6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3), has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission (r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission from Spitzer/IRAC indicates an extremely low metallicity of Z < 1/20 Z⊙ or reduced strength of nebular lines due to high escape of ionising photons. The small Lyα peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising photon escape fraction of ≈15 − 30%, providing the first direct evidence that such galaxies contribute actively to the reionisation of the Universe at z > 6. Based on simple estimates, we find that COLA1 could have provided just enough photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα line to be observed. However, we also discuss alternative scenarios explaining the detected double peaked nature of COLA1. Our results show that future high-resolution observations of statistical samples of double peaked LAEs at z > 5 are a promising probe of the occurrence of ionised regions around galaxies in the EoR."}],"month":"11","intvolume":" 619","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1805.11621","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"publication_status":"published","volume":619,"_id":"11508","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: high-redshift / galaxies: formation / dark ages / reionization / first stars / techniques: spectroscopic / intergalactic medium"],"article_type":"original","type":"journal_article","extern":"1","date_updated":"2022-07-19T09:32:08Z","acknowledgement":"JM acknowledges the award of a Huygens PhD fellowship from Leiden University. MG acknowledges support from NASA grant NNX17AK58G. APA, PhD::SPACE fellow, acknowledges support from the FCT through the fellowship PD/BD/52706/2014. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 294.A-5018, 098.A-0819, 099.A-0254 and 0100.A-0213. We are grateful for the excellent data-sets from the COSMOS and UltraVISTA survey teams. This research was supported by the Munich Institute for Astro- and Particle Physics (MIAPP) of the DFG cluster of excellence “Origin and Structure of the Universe”. We thank the referee for their comments that improved the paper. We also thank Christoph Behrens, Len Cowie, Koki Kakiichi, Peter Laursen, Charlotte Mason, Eros Vanzella, Lewis Weinberger and Johannes Zabl for discussions. We have benefited from the public available programming language Python, including the numpy, matplotlib, scipy and astropy packages (Hunter 2007; Astropy Collaboration 2013), the astronomical imaging tools Swarp (Bertin 2010) and ds9 and the Topcat analysis tool (Taylor 2013).","publisher":"EDP Sciences","quality_controlled":"1","oa":1,"day":"19","publication":"Astronomy & Astrophysics","year":"2018","date_published":"2018-11-19T00:00:00Z","doi":"10.1051/0004-6361/201833528","date_created":"2022-07-06T11:14:23Z","article_number":"A136","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Matthee, Jorryt J., et al. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” Astronomy & Astrophysics, vol. 619, A136, EDP Sciences, 2018, doi:10.1051/0004-6361/201833528.","ieee":"J. J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, and H. Röttgering, “Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe,” Astronomy & Astrophysics, vol. 619. EDP Sciences, 2018.","short":"J.J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, H. Röttgering, Astronomy & Astrophysics 619 (2018).","apa":"Matthee, J. J., Sobral, D., Gronke, M., Paulino-Afonso, A., Stefanon, M., & Röttgering, H. (2018). Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833528","ama":"Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. 2018;619. doi:10.1051/0004-6361/201833528","chicago":"Matthee, Jorryt J, David Sobral, Max Gronke, Ana Paulino-Afonso, Mauro Stefanon, and Huub Röttgering. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833528.","ista":"Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. 2018. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. 619, A136."},"title":"Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe","author":[{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X"},{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"first_name":"Max","last_name":"Gronke","full_name":"Gronke, Max"},{"first_name":"Ana","last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, Ana"},{"last_name":"Stefanon","full_name":"Stefanon, Mauro","first_name":"Mauro"},{"full_name":"Röttgering, Huub","last_name":"Röttgering","first_name":"Huub"}],"external_id":{"arxiv":["1805.11621"]},"article_processing_charge":"No"},{"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1705.01101"}],"month":"08","intvolume":" 478","abstract":[{"text":"We investigate the clustering properties of ∼7000 H β + [O III] and [O II] narrowband-selected emitters at z ∼ 0.8–4.7 from the High-z Emission Line Survey. We find clustering lengths, r0, of 1.5–4.0 h−1 Mpc and minimum dark matter halo masses of 1010.7–12.1 M⊙ for our z = 0.8–3.2 H β + [O III] emitters and r0 ∼ 2.0–8.3 h−1 Mpc and halo masses of 1011.5–12.6 M⊙ for our z = 1.5–4.7 [O II] emitters. We find r0 to strongly increase both with increasing line luminosity and redshift. By taking into account the evolution of the characteristic line luminosity, L⋆(z), and using our model predictions of halo mass given r0, we find a strong, redshift-independent increasing trend between L/L⋆(z) and minimum halo mass. The faintest H β + [O III] emitters are found to reside in 109.5 M⊙ haloes and the brightest emitters in 1013.0 M⊙ haloes. For [O II] emitters, the faintest emitters are found in 1010.5 M⊙ haloes and the brightest emitters in 1012.6 M⊙ haloes. A redshift-independent stellar mass dependency is also observed where the halo mass increases from 1011 to 1012.5 M⊙ for stellar masses of 108.5 to 1011.5 M⊙, respectively. We investigate the interdependencies of these trends by repeating our analysis in a Lline−Mstar grid space for our most populated samples (H β + [O III] z = 0.84 and [O II] z = 1.47) and find that the line luminosity dependency is stronger than the stellar mass dependency on halo mass. For L > L⋆ emitters at all epochs, we find a relatively flat trend with halo masses of 1012.5–13 M⊙, which may be due to quenching mechanisms in massive haloes that is consistent with a transitional halo mass predicted by models.","lang":"eng"}],"oa_version":"Published Version","issue":"3","volume":478,"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication_status":"published","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: haloes","galaxies: high-redshift","galaxies: star formation","cosmology: observations","large-scale structure of Universe"],"_id":"11549","date_updated":"2022-08-19T06:53:39Z","extern":"1","quality_controlled":"1","publisher":"Oxford University Press","acknowledgement":"We thank the anonymous referee for their useful comments and suggestions that improved this study. AAK thanks Anahita Alavi and Irene Shivaei for useful discussion in the making of this paper. AAK acknowledges that this work was supported by NASA Headquarters under the NASA Earth and Space Science Fellowship Program – Grant NNX16AO92H. DS acknowledges financial support from the Netherlands Organization for Scientific Research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. PNB is grateful for support from STFC via grant STM001229/1. IRS acknowledges support from STFC (ST/L00075X/1), the ERC Advanced Grant DUSTYGAL (321334), and a Royal Society/Wolfson Merit award. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G.","page":"2999-3015","date_published":"2018-08-01T00:00:00Z","doi":"10.1093/mnras/sty925","date_created":"2022-07-08T11:48:48Z","year":"2018","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","author":[{"first_name":"A A","last_name":"Khostovan","full_name":"Khostovan, A A"},{"first_name":"D","full_name":"Sobral, D","last_name":"Sobral"},{"full_name":"Mobasher, B","last_name":"Mobasher","first_name":"B"},{"first_name":"P N","last_name":"Best","full_name":"Best, P N"},{"first_name":"I","last_name":"Smail","full_name":"Smail, I"},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"full_name":"Darvish, B","last_name":"Darvish","first_name":"B"},{"first_name":"H","full_name":"Nayyeri, H","last_name":"Nayyeri"},{"first_name":"S","full_name":"Hemmati, S","last_name":"Hemmati"},{"first_name":"J P","last_name":"Stott","full_name":"Stott, J P"}],"external_id":{"arxiv":["1705.01101"]},"article_processing_charge":"No","title":"The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass","citation":{"chicago":"Khostovan, A A, D Sobral, B Mobasher, P N Best, I Smail, Jorryt J Matthee, B Darvish, H Nayyeri, S Hemmati, and J P Stott. “The Clustering of H β + [O III] and [O II] Emitters since z ∼ 5: Dependencies with Line Luminosity and Stellar Mass.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty925.","ista":"Khostovan AA, Sobral D, Mobasher B, Best PN, Smail I, Matthee JJ, Darvish B, Nayyeri H, Hemmati S, Stott JP. 2018. The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly Notices of the Royal Astronomical Society. 478(3), 2999–3015.","mla":"Khostovan, A. A., et al. “The Clustering of H β + [O III] and [O II] Emitters since z ∼ 5: Dependencies with Line Luminosity and Stellar Mass.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 3, Oxford University Press, 2018, pp. 2999–3015, doi:10.1093/mnras/sty925.","short":"A.A. Khostovan, D. Sobral, B. Mobasher, P.N. Best, I. Smail, J.J. Matthee, B. Darvish, H. Nayyeri, S. Hemmati, J.P. Stott, Monthly Notices of the Royal Astronomical Society 478 (2018) 2999–3015.","ieee":"A. A. Khostovan et al., “The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass,” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 3. Oxford University Press, pp. 2999–3015, 2018.","ama":"Khostovan AA, Sobral D, Mobasher B, et al. The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly Notices of the Royal Astronomical Society. 2018;478(3):2999-3015. doi:10.1093/mnras/sty925","apa":"Khostovan, A. A., Sobral, D., Mobasher, B., Best, P. N., Smail, I., Matthee, J. J., … Stott, J. P. (2018). The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty925"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"06","intvolume":" 477","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1802.10102","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Deep narrow-band surveys have revealed a large population of faint Ly α emitters (LAEs) in the distant Universe, but relatively little is known about the most luminous sources (LLyα≳1042.7 erg s−1; LLyα≳L∗Lyα). Here we present the spectroscopic follow-up of 21 luminous LAEs at z ∼ 2–3 found with panoramic narrow-band surveys over five independent extragalactic fields (≈4 × 106 Mpc3 surveyed at z ∼ 2.2 and z ∼ 3.1). We use WHT/ISIS, Keck/DEIMOS, and VLT/X-SHOOTER to study these sources using high ionization UV lines. Luminous LAEs at z ∼ 2–3 have blue UV slopes (β=−2.0+0.3−0.1) and high Ly α escape fractions (50+20−15 per cent) and span five orders of magnitude in UV luminosity (MUV ≈ −19 to −24). Many (70 per cent) show at least one high ionization rest-frame UV line such as C IV, N V, C III], He II or O III], typically blue-shifted by ≈100–200 km s−1 relative to Ly α. Their Ly α profiles reveal a wide variety of shapes, including significant blue-shifted components and widths from 200 to 4000 km s−1. Overall, 60 ± 11 per cent appear to be active galactic nucleus (AGN) dominated, and at LLyα > 1043.3 erg s−1 and/or MUV < −21.5 virtually all LAEs are AGNs with high ionization parameters (log U = 0.6 ± 0.5) and with metallicities of ≈0.5 − 1 Z⊙. Those lacking signatures of AGNs (40 ± 11 per cent) have lower ionization parameters (logU=−3.0+1.6−0.9 and log ξion = 25.4 ± 0.2) and are apparently metal-poor sources likely powered by young, dust-poor ‘maximal’ starbursts. Our results show that luminous LAEs at z ∼ 2–3 are a diverse population and that 2×L∗Lyα and 2×M∗UV mark a sharp transition in the nature of LAEs, from star formation dominated to AGN dominated."}],"issue":"2","volume":477,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication_status":"published","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: active","galaxies: evolution","galaxies: high-redshift","galaxies: ISM","galaxies: starburst","cosmology: observations"],"type":"journal_article","article_type":"original","_id":"11557","extern":"1","date_updated":"2022-08-19T07:01:08Z","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"acknowledgement":"We thank the anonymous reviewer for their timely and constructive comments that greatly helped us to improve the manuscript. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G, and the National Science Foundation, grant number 1716907. IRS acknowledges support from the ERC Advanced Grant DUSTYGAL (321334), STFC (ST/P000541/1), and a Royal Society/Wolfson Merit Award. PNB is grateful for support from STFC via grant ST/M001229/1. We thank Anne Verhamme, Kimihiko Nakajima, Ryan Trainor, Sangeeta Malhotra, Max Gronke, James Rhoads, Fang Xia An, Matthew Hayes, Takashi Kojima, Mark Dijkstra, and Anne Jaskot for many helpful and engaging discussions, particularly during the SnowCLAW Ly α workshop. We thank Bruno Ribeiro, Stephane Charlot, and Joseph Caruana for comments on the manuscript. The authors would also like to thank Ingrid Tengs, Meg Singleton, Ali Khostovan, and Sara Perez for participating in part of the observations. We also thank Joao Calhau, Leah Morabito, Sergio Santos, and Aayush Saxena for their assistance with the narrow-band observations which allowed to select some of the sour ces. Based on observations obtained with the William Herschel Telescope, program: W16AN004; the Very Large Telescope, programs: 098.A-0819 & 099.A-0254; and the Keck II telescope, program: C267D. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 294.A-5039, 092.A-0786, 093.A-0561, 097.A-0943, 098.A-0819, 099.A-0254 and 179.A-2005. The authors acknowledge the award of service time (SW2014b20) on the WHT. WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. The authors would also like to thank all the extremely helpful observatory staff that have greatly contributed towards our observations, particularly Fiona Riddick, Lilian Dominguez, Florencia Jimenez, and Ian Skillen. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY & SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2013). This research has made use of the VizieR catalogue access tool, CDS, Strasbourg, France.","date_published":"2018-06-01T00:00:00Z","doi":"10.1093/mnras/sty782","date_created":"2022-07-12T07:18:02Z","page":"2817-2840","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","year":"2018","title":"The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN","author":[{"first_name":"David","full_name":"Sobral, David","last_name":"Sobral"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"full_name":"Darvish, Behnam","last_name":"Darvish","first_name":"Behnam"},{"first_name":"Ian","full_name":"Smail, Ian","last_name":"Smail"},{"first_name":"Philip N","last_name":"Best","full_name":"Best, Philip N"},{"first_name":"Lara","last_name":"Alegre","full_name":"Alegre, Lara"},{"full_name":"Röttgering, Huub","last_name":"Röttgering","first_name":"Huub"},{"first_name":"Bahram","full_name":"Mobasher, Bahram","last_name":"Mobasher"},{"last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, Ana","first_name":"Ana"},{"last_name":"Stroe","full_name":"Stroe, Andra","first_name":"Andra"},{"first_name":"Iván","full_name":"Oteo, Iván","last_name":"Oteo"}],"external_id":{"arxiv":["1802.10102"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Sobral, David, Jorryt J Matthee, Behnam Darvish, Ian Smail, Philip N Best, Lara Alegre, Huub Röttgering, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty782.","ista":"Sobral D, Matthee JJ, Darvish B, Smail I, Best PN, Alegre L, Röttgering H, Mobasher B, Paulino-Afonso A, Stroe A, Oteo I. 2018. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. 477(2), 2817–2840.","mla":"Sobral, David, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices of the Royal Astronomical Society, vol. 477, no. 2, Oxford University Press, 2018, pp. 2817–40, doi:10.1093/mnras/sty782.","ieee":"D. Sobral et al., “The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN,” Monthly Notices of the Royal Astronomical Society, vol. 477, no. 2. Oxford University Press, pp. 2817–2840, 2018.","short":"D. Sobral, J.J. Matthee, B. Darvish, I. Smail, P.N. Best, L. Alegre, H. Röttgering, B. Mobasher, A. Paulino-Afonso, A. Stroe, I. Oteo, Monthly Notices of the Royal Astronomical Society 477 (2018) 2817–2840.","apa":"Sobral, D., Matthee, J. J., Darvish, B., Smail, I., Best, P. N., Alegre, L., … Oteo, I. (2018). The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty782","ama":"Sobral D, Matthee JJ, Darvish B, et al. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. 2018;477(2):2817-2840. doi:10.1093/mnras/sty782"}},{"author":[{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"full_name":"Santos, Sérgio","last_name":"Santos","first_name":"Sérgio"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X"},{"first_name":"Ana","last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, Ana"},{"first_name":"Bruno","last_name":"Ribeiro","full_name":"Ribeiro, Bruno"},{"last_name":"Calhau","full_name":"Calhau, João","first_name":"João"},{"full_name":"Khostovan, Ali A","last_name":"Khostovan","first_name":"Ali A"}],"external_id":{"arxiv":["1712.04451"]},"article_processing_charge":"No","title":"Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6","citation":{"mla":"Sobral, David, et al. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly Notices of the Royal Astronomical Society, vol. 476, no. 4, Oxford University Press, 2018, pp. 4725–52, doi:10.1093/mnras/sty378.","short":"D. Sobral, S. Santos, J.J. Matthee, A. Paulino-Afonso, B. Ribeiro, J. Calhau, A.A. Khostovan, Monthly Notices of the Royal Astronomical Society 476 (2018) 4725–4752.","ieee":"D. Sobral et al., “Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6,” Monthly Notices of the Royal Astronomical Society, vol. 476, no. 4. Oxford University Press, pp. 4725–4752, 2018.","ama":"Sobral D, Santos S, Matthee JJ, et al. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. 2018;476(4):4725-4752. doi:10.1093/mnras/sty378","apa":"Sobral, D., Santos, S., Matthee, J. J., Paulino-Afonso, A., Ribeiro, B., Calhau, J., & Khostovan, A. A. (2018). Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty378","chicago":"Sobral, David, Sérgio Santos, Jorryt J Matthee, Ana Paulino-Afonso, Bruno Ribeiro, João Calhau, and Ali A Khostovan. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty378.","ista":"Sobral D, Santos S, Matthee JJ, Paulino-Afonso A, Ribeiro B, Calhau J, Khostovan AA. 2018. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. 476(4), 4725–4752."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"acknowledgement":"We thank the anonymous referee for their constructive comments that helped us improve the manuscript. DS acknowledges the hospitality of the IAC and a Severo Ochoa visiting grant. SS and JC acknowledge studentships from the Lancaster University. JM acknowledges a Huygens PhD fellowship from Leiden University. APA acknowledges financial support from the Science and Technology Foundation (FCT, Portugal) through research grants UID/FIS/04434/2013 and fellowship PD/BD/52706/2014. The authors thank Alyssa Drake, Kimihiko Nakajima, Yuichi Harikane, Max Gronke, Irene Shivaei, Helmut Dannerbauer, Huub Rottgering, ¨ Marius Eide, and Masami Ouchi for many engaging and stimulating discussions. We also thank Sara Perez, Alex Bennett, and Tom Rose for their involvement in the early stages of this project. Based on data products from observations made with European Southern Observatory (ESO) Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 097.A 0943,\r\n098.A-0819, 099.A-0254, and 179.A-2005 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. Based on observations using the WFC on the 2.5 m INT, as part of programmes 2013AN002, 2013BN008, 2014AC88, 2014AN002, 2014BN006, 2014BC118, and 2016AN001. The INT is operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. This work is based in part on data products produced at TERAPIX available at the Canadian Astronomy Data Centre as part of the Canada–France– Hawaii Telescope Legacy Survey (CFHTLS), a collaborative project of NRC and CNRS.\r\nWe are grateful to the CFHTLS, COSMOS-UltraVISTA, and COSMOS survey teams. We are also unmeasurably thankful to the pioneering and continuous work from previous Ly α surveys’ teams. Without these previous Ly α and the wider reach legacy surveys, this research would have been impossible. We also thank the VUDS team for making available spectroscopic redshifts from data obtained with VIMOS at the European Southern Observatory Very Large Telescope, Paranal, Chile, under Large Programme 185.A-0791. Finally, the authors acknowledge the unique value of the publicly available programming language PYTHON, including the NUMPY and SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2005). We publicly release a catalogue with all LAEs used in this paper (SC4K), so it can be freely explored by the community (see five example entries in Table A1).","page":"4725-4752","doi":"10.1093/mnras/sty378","date_published":"2018-06-01T00:00:00Z","date_created":"2022-07-12T10:41:08Z","year":"2018","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","type":"journal_article","article_type":"original","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: formation","galaxies: high-redshift","galaxies: luminosity function","mass function","galaxies: statistics"],"_id":"11558","date_updated":"2022-08-19T07:04:45Z","extern":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.04451"}],"month":"06","intvolume":" 476","abstract":[{"text":"We present and explore deep narrow- and medium-band data obtained with the Subaru and the Isaac Newton Telescopes in the ∼2 deg2 COSMOS field. We use these data as an extremely wide, low-resolution (R ∼ 20–80) Integral Field Unit survey to slice through the COSMOS field and obtain a large sample of ∼4000 Ly α emitters (LAEs) from z ∼ 2 to 6 in 16 redshift slices (SC4K). We present new Ly α luminosity functions (LFs) covering a comoving volume of ∼108 Mpc3. SC4K extensively complements ultradeep surveys, jointly covering over 4 dex in Ly α luminosity and revealing a global (2.5 < z < 6) synergy LF with α=−1.93+0.12−0.12, log10Φ∗Lyα=−3.45+0.22−0.29 Mpc−3, and log10L∗Lyα=42.93+0.15−0.11 erg s−1. The Schechter component of the Ly α LF reveals a factor ∼5 rise in L∗Lyα and a ∼7 × decline in Φ∗Lyα from z ∼ 2 to 6. The data reveal an extra power-law (or Schechter) component above LLy α ≈ 1043.3 erg s−1 at z ∼ 2.2–3.5 and we show that it is partially driven by X-ray and radio active galactic nucleus (AGN), as their Ly α LF resembles the excess. The power-law component vanishes and/or is below our detection limits above z > 3.5, likely linked with the evolution of the AGN population. The Ly α luminosity density rises by a factor ∼2 from z ∼ 2 to 3 but is then found to be roughly constant (1.1+0.2−0.2×1040 erg s−1 Mpc−3) to z ∼ 6, despite the ∼0.7 dex drop in ultraviolet (UV) luminosity density. The Ly α/UV luminosity density ratio rises from 4 ± 1 per cent to 30 ± 6 per cent from z ∼ 2.2 to 6. Our results imply a rise of a factor of ≈2 in the global ionization efficiency (ξion) and a factor ≈4 ± 1 in the Ly α escape fraction from z ∼ 2 to 6, hinting for evolution in both the typical burstiness/stellar populations and even more so in the typical interstellar medium conditions allowing Ly α photons to escape.","lang":"eng"}],"oa_version":"Preprint","volume":476,"issue":"4","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication_status":"published","language":[{"iso":"eng"}]},{"date_updated":"2022-08-19T06:58:06Z","extern":"1","_id":"11555","type":"journal_article","article_type":"original","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: ISM","galaxies: formation"],"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"1","volume":478,"abstract":[{"lang":"eng","text":"We investigate the morphology of the [C II] emission in a sample of ‘normal’ star-forming galaxies at 5 < z < 7.2 in relation to their UV (rest-frame) counterpart. We use new Atacama Large Millimetre/submillimetre Array (ALMA) observations of galaxies at z ∼ 6–7, as well as a careful re-analysis of archival ALMA data. In total 29 galaxies were analysed, 21 of which are detected in [C II]. For several of the latter the [C II] emission breaks into multiple components. Only a fraction of these [C II] components, if any, is associated with the primary UV systems, while the bulk of the [C II] emission is associated either with fainter UV components, or not associated with any UV counterpart at the current limits. By taking into account the presence of all these components, we find that the L[CII]–SFR (star formation rate) relation at early epochs is fully consistent with the local relation, but it has a dispersion of 0.48 ± 0.07 dex, which is about two times larger than observed locally. We also find that the deviation from the local L[CII]–SFR relation has a weak anticorrelation with the EW(Ly α). The morphological analysis also reveals that [C II] emission is generally much more extended than the UV emission. As a consequence, these primordial galaxies are characterized by a [C II] surface brightness generally much lower than expected from the local Σ[CII]−ΣSFR relation. These properties are likely a consequence of a combination of different effects, namely gas metallicity, [C II] emission from obscured star-forming regions, strong variations of the ionization parameter, and circumgalactic gas in accretion or ejected by these primeval galaxies."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.03985"}],"month":"07","intvolume":" 478","citation":{"ieee":"S. Carniani et al., “Kiloparsec-scale gaseous clumps and star formation at z = 5–7,” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 1. Oxford University Press, pp. 1170–1184, 2018.","short":"S. Carniani, R. Maiolino, R. Amorin, L. Pentericci, A. Pallottini, A. Ferrara, C.J. Willott, R. Smit, J.J. Matthee, D. Sobral, P. Santini, M. Castellano, S. De Barros, A. Fontana, A. Grazian, L. Guaita, Monthly Notices of the Royal Astronomical Society 478 (2018) 1170–1184.","ama":"Carniani S, Maiolino R, Amorin R, et al. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. 2018;478(1):1170-1184. doi:10.1093/mnras/sty1088","apa":"Carniani, S., Maiolino, R., Amorin, R., Pentericci, L., Pallottini, A., Ferrara, A., … Guaita, L. (2018). Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty1088","mla":"Carniani, S., et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 1, Oxford University Press, 2018, pp. 1170–84, doi:10.1093/mnras/sty1088.","ista":"Carniani S, Maiolino R, Amorin R, Pentericci L, Pallottini A, Ferrara A, Willott CJ, Smit R, Matthee JJ, Sobral D, Santini P, Castellano M, De Barros S, Fontana A, Grazian A, Guaita L. 2018. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. 478(1), 1170–1184.","chicago":"Carniani, S, R Maiolino, R Amorin, L Pentericci, A Pallottini, A Ferrara, C J Willott, et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty1088."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Carniani","full_name":"Carniani, S","first_name":"S"},{"last_name":"Maiolino","full_name":"Maiolino, R","first_name":"R"},{"first_name":"R","full_name":"Amorin, R","last_name":"Amorin"},{"first_name":"L","last_name":"Pentericci","full_name":"Pentericci, L"},{"first_name":"A","full_name":"Pallottini, A","last_name":"Pallottini"},{"last_name":"Ferrara","full_name":"Ferrara, A","first_name":"A"},{"first_name":"C J","last_name":"Willott","full_name":"Willott, C J"},{"full_name":"Smit, R","last_name":"Smit","first_name":"R"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"first_name":"D","full_name":"Sobral, D","last_name":"Sobral"},{"last_name":"Santini","full_name":"Santini, P","first_name":"P"},{"full_name":"Castellano, M","last_name":"Castellano","first_name":"M"},{"first_name":"S","full_name":"De Barros, S","last_name":"De Barros"},{"first_name":"A","last_name":"Fontana","full_name":"Fontana, A"},{"last_name":"Grazian","full_name":"Grazian, A","first_name":"A"},{"first_name":"L","last_name":"Guaita","full_name":"Guaita, L"}],"external_id":{"arxiv":["1712.03985"]},"article_processing_charge":"No","title":"Kiloparsec-scale gaseous clumps and star formation at z = 5–7","year":"2018","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","page":"1170-1184","doi":"10.1093/mnras/sty1088","date_published":"2018-07-01T00:00:00Z","date_created":"2022-07-11T08:05:42Z","acknowledgement":"This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2012.1.00719.S, ADS/JAO.ALMA#2012.A.00040.S,\r\nADS/JAO.ALMA#2013.A.00433.S, ADS/JAO.ALMA#2011.0.00115.S,\r\nADS/JAO.ALMA#2012.1.00033.S, ADS/JAO.ALMA#2012.1.00523.S,\r\nADS/JAO.ALMA#2013.1.00815.S, ADS/JAO.ALMA#2015.1.00834.S.,\r\nADS/JAO.ALMA#2015.1.01105.S, AND ADS/JAO.ALMA#2016.1.01240.S\r\nwhich can be retrieved from the ALMA data archive:\r\nhttps://almascience.eso.org/ alma-data/archive. ALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with NRC (Canada) and NSC and ASIAA (Taiwan), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. We are grateful to G. Jones to for providing his [C II] flux maps. RM and SC acknowledge support by the Science and Technology Facilities Council (STFC). RM acknowledges ERC Advanced Grant 695671 ‘QUENCH’. AF acknowledges support from the ERC Advanced Grant INTERSTELLAR H2020/740120.","publisher":"Oxford University Press","quality_controlled":"1","oa":1},{"date_updated":"2022-08-19T08:35:45Z","extern":"1","_id":"11584","article_type":"original","type":"journal_article","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: formation","galaxies: star formation"],"publication_identifier":{"eissn":["1745-3933"],"issn":["1745-3925"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":479,"issue":"1","abstract":[{"lang":"eng","text":"Observations show that star-forming galaxies reside on a tight 3D plane between mass, gas-phase metallicity, and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5 M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass, SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted towards late times, are more α-enhanced, and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1802.06786","open_access":"1"}],"month":"09","intvolume":" 479","citation":{"chicago":"Matthee, Jorryt J, and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press, 2018. https://doi.org/10.1093/mnrasl/sly093.","ista":"Matthee JJ, Schaye J. 2018. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 479(1), L34–L39.","mla":"Matthee, Jorryt J., and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1, Oxford University Press, 2018, pp. L34–39, doi:10.1093/mnrasl/sly093.","ieee":"J. J. Matthee and J. Schaye, “Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement,” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1. Oxford University Press, pp. L34–L39, 2018.","short":"J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society: Letters 479 (2018) L34–L39.","ama":"Matthee JJ, Schaye J. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 2018;479(1):L34-L39. doi:10.1093/mnrasl/sly093","apa":"Matthee, J. J., & Schaye, J. (2018). Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press. https://doi.org/10.1093/mnrasl/sly093"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"first_name":"Joop","last_name":"Schaye","full_name":"Schaye, Joop"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.06786"]},"title":"Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement","year":"2018","day":"01","publication":"Monthly Notices of the Royal Astronomical Society: Letters","page":"L34 - L39","date_published":"2018-09-01T00:00:00Z","doi":"10.1093/mnrasl/sly093","date_created":"2022-07-14T12:49:47Z","acknowledgement":"We thank the anonymous referee for their constructive comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge the use of the TOPCAT software (Taylor 2013) for assisting in rapid exploration of multidimensional data sets and the use of PYTHON and its NUMPY, MATPLOTLIB, and PANDAS packages.","quality_controlled":"1","publisher":"Oxford University Press","oa":1},{"extern":"1","date_updated":"2022-08-22T07:43:29Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","planetary systems / planets and satellites","detection / planets and satellites","fundamental parameters / planets and satellites","terrestrial planets / stars","fundamental parameters"],"status":"public","article_type":"letter_note","type":"journal_article","_id":"11619","volume":619,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"intvolume":" 619","month":"11","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.07573"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"We report on the confirmation and mass determination of π Men c, the first transiting planet discovered by NASA’s TESS space mission. π Men is a naked-eye (V = 5.65 mag), quiet G0 V star that was previously known to host a sub-stellar companion (π Men b) on a longperiod (Porb = 2091 days), eccentric (e = 0.64) orbit. Using TESS time-series photometry, combined with Gaia data, published UCLES at AAT Doppler measurements, and archival HARPS at ESO-3.6m radial velocities, we found that π Men c is a close-in planet with an orbital period of Porb = 6.27 days, a mass of Mc = 4.52 ± 0.81 M⊕, and a radius of Rc = 2.06 ± 0.03 R⊕. Based on the planet’s orbital period and size, π Men c is a super-Earth located at, or close to, the radius gap, while its mass and bulk density suggest it may have held on to a significant atmosphere. Because of the brightness of the host star, this system is highly suitable for a wide range of further studies to characterize the planetary atmosphere and dynamical properties. We also performed an asteroseismic analysis of the TESS data and detected a hint of power excess consistent with the seismic values expected for this star, although this result depends on the photometric aperture used to extract the light curve. This marginal detection is expected from pre-launch simulations hinting at the asteroseismic potential of the TESS mission for longer, multi-sector observations and/or for more evolved bright stars.","lang":"eng"}],"title":"TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae","external_id":{"arxiv":["1809.07573"]},"article_processing_charge":"No","author":[{"last_name":"Gandolfi","full_name":"Gandolfi, D.","first_name":"D."},{"last_name":"Barragán","full_name":"Barragán, O.","first_name":"O."},{"full_name":"Livingston, J. H.","last_name":"Livingston","first_name":"J. H."},{"first_name":"M.","full_name":"Fridlund, M.","last_name":"Fridlund"},{"last_name":"Justesen","full_name":"Justesen, A. B.","first_name":"A. B."},{"first_name":"S.","last_name":"Redfield","full_name":"Redfield, S."},{"first_name":"L.","full_name":"Fossati, L.","last_name":"Fossati"},{"last_name":"Mathur","full_name":"Mathur, S.","first_name":"S."},{"first_name":"S.","full_name":"Grziwa, S.","last_name":"Grziwa"},{"first_name":"J.","last_name":"Cabrera","full_name":"Cabrera, J."},{"first_name":"R. A.","full_name":"García, R. A.","last_name":"García"},{"last_name":"Persson","full_name":"Persson, C. M.","first_name":"C. M."},{"first_name":"V.","full_name":"Van Eylen, V.","last_name":"Van Eylen"},{"full_name":"Hatzes, A. P.","last_name":"Hatzes","first_name":"A. P."},{"first_name":"D.","full_name":"Hidalgo, D.","last_name":"Hidalgo"},{"first_name":"S.","last_name":"Albrecht","full_name":"Albrecht, S."},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"last_name":"Cochran","full_name":"Cochran, W. D.","first_name":"W. D."},{"full_name":"Csizmadia, Sz.","last_name":"Csizmadia","first_name":"Sz."},{"first_name":"H.","last_name":"Deeg","full_name":"Deeg, H."},{"first_name":"Ph.","full_name":"Eigmüller, Ph.","last_name":"Eigmüller"},{"last_name":"Endl","full_name":"Endl, M.","first_name":"M."},{"last_name":"Erikson","full_name":"Erikson, A.","first_name":"A."},{"first_name":"M.","last_name":"Esposito","full_name":"Esposito, M."},{"last_name":"Guenther","full_name":"Guenther, E.","first_name":"E."},{"first_name":"J.","full_name":"Korth, J.","last_name":"Korth"},{"full_name":"Luque, R.","last_name":"Luque","first_name":"R."},{"last_name":"Montañes Rodríguez","full_name":"Montañes Rodríguez, P.","first_name":"P."},{"first_name":"D.","last_name":"Nespral","full_name":"Nespral, D."},{"first_name":"G.","last_name":"Nowak","full_name":"Nowak, G."},{"last_name":"Pätzold","full_name":"Pätzold, M.","first_name":"M."},{"full_name":"Prieto-Arranz, J.","last_name":"Prieto-Arranz","first_name":"J."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Gandolfi D, Barragán O, Livingston JH, Fridlund M, Justesen AB, Redfield S, Fossati L, Mathur S, Grziwa S, Cabrera J, García RA, Persson CM, Van Eylen V, Hatzes AP, Hidalgo D, Albrecht S, Bugnet LA, Cochran WD, Csizmadia S, Deeg H, Eigmüller P, Endl M, Erikson A, Esposito M, Guenther E, Korth J, Luque R, Montañes Rodríguez P, Nespral D, Nowak G, Pätzold M, Prieto-Arranz J. 2018. TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. 619, L10.","chicago":"Gandolfi, D., O. Barragán, J. H. Livingston, M. Fridlund, A. B. Justesen, S. Redfield, L. Fossati, et al. “TESS’s First Planet: A Super-Earth Transiting the Naked-Eye Star π Mensae.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201834289.","short":"D. Gandolfi, O. Barragán, J.H. Livingston, M. Fridlund, A.B. Justesen, S. Redfield, L. Fossati, S. Mathur, S. Grziwa, J. Cabrera, R.A. García, C.M. Persson, V. Van Eylen, A.P. Hatzes, D. Hidalgo, S. Albrecht, L.A. Bugnet, W.D. Cochran, S. Csizmadia, H. Deeg, P. Eigmüller, M. Endl, A. Erikson, M. Esposito, E. Guenther, J. Korth, R. Luque, P. Montañes Rodríguez, D. Nespral, G. Nowak, M. Pätzold, J. Prieto-Arranz, Astronomy & Astrophysics 619 (2018).","ieee":"D. Gandolfi et al., “TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae,” Astronomy & Astrophysics, vol. 619. EDP Sciences, 2018.","apa":"Gandolfi, D., Barragán, O., Livingston, J. H., Fridlund, M., Justesen, A. B., Redfield, S., … Prieto-Arranz, J. (2018). TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201834289","ama":"Gandolfi D, Barragán O, Livingston JH, et al. TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. 2018;619. doi:10.1051/0004-6361/201834289","mla":"Gandolfi, D., et al. “TESS’s First Planet: A Super-Earth Transiting the Naked-Eye Star π Mensae.” Astronomy & Astrophysics, vol. 619, L10, EDP Sciences, 2018, doi:10.1051/0004-6361/201834289."},"article_number":"L10","date_created":"2022-07-18T14:41:16Z","date_published":"2018-11-22T00:00:00Z","doi":"10.1051/0004-6361/201834289","publication":"Astronomy & Astrophysics","day":"22","year":"2018","oa":1,"publisher":"EDP Sciences","quality_controlled":"1"},{"date_updated":"2022-08-22T07:41:07Z","extern":"1","_id":"11618","article_type":"original","type":"journal_article","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology / methods","data analysis / stars","oscillations"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"language":[{"iso":"eng"}],"volume":620,"abstract":[{"text":"Asteroseismology provides global stellar parameters such as masses, radii, or surface gravities using mean global seismic parameters and effective temperature for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been successfully applied to stars in which acoustic modes excited by turbulent convection are measured. Other methods such as the Flicker technique can also be used to determine stellar surface gravities, but only works for log g above 2.5 dex. In this work, we present a new metric called FliPer (Flicker in spectral power density, in opposition to the standard Flicker measurement which is computed in the time domain); it is able to extend the range for which reliable surface gravities can be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for stars brighter than Kp < 14. FliPer takes into account the average variability of a star measured in the power density spectrum in a given range of frequencies. However, FliPer values calculated on several ranges of frequency are required to better characterize a star. Using a large set of asteroseismic targets it is possible to calibrate the behavior of surface gravity with FliPer through machine learning. This calibration made with a random forest regressor covers a wide range of surface gravities from main-sequence stars to subgiants and red giants, with very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in automatic global seismic pipelines to either give an estimation of the stellar surface gravity or to assess the quality of the seismic results by detecting any outliers in the obtained νmax values. FliPer also constrains the surface gravities of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency is too low to measure the acoustic-mode properties.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.05105"}],"scopus_import":"1","intvolume":" 620","month":"12","citation":{"ista":"Bugnet LA, García RA, Davies GR, Mathur S, Corsaro E, Hall OJ, Rendle BM. 2018. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. 620, A38.","chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, E. Corsaro, O. J. Hall, and B. M. Rendle. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833106.","short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, E. Corsaro, O.J. Hall, B.M. Rendle, Astronomy & Astrophysics 620 (2018).","ieee":"L. A. Bugnet et al., “FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants,” Astronomy & Astrophysics, vol. 620. EDP Sciences, 2018.","ama":"Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. 2018;620. doi:10.1051/0004-6361/201833106","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall, O. J., & Rendle, B. M. (2018). FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833106","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” Astronomy & Astrophysics, vol. 620, A38, EDP Sciences, 2018, doi:10.1051/0004-6361/201833106."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1809.05105"]},"article_processing_charge":"No","author":[{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"R. A.","full_name":"García, R. A.","last_name":"García"},{"first_name":"G. R.","last_name":"Davies","full_name":"Davies, G. R."},{"first_name":"S.","full_name":"Mathur, S.","last_name":"Mathur"},{"first_name":"E.","last_name":"Corsaro","full_name":"Corsaro, E."},{"last_name":"Hall","full_name":"Hall, O. J.","first_name":"O. J."},{"first_name":"B. M.","full_name":"Rendle, B. M.","last_name":"Rendle"}],"title":"FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants","article_number":"A38","year":"2018","publication":"Astronomy & Astrophysics","day":"01","date_created":"2022-07-18T14:37:39Z","date_published":"2018-12-01T00:00:00Z","doi":"10.1051/0004-6361/201833106","acknowledgement":"We thank the anonymous referee for the very useful comments. We would also like to thank M. Benbakoura for his help in analyzing the light curves of several binary systems included in our set of stars. L.B. and R.A.G. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges support from the National Aeronautics and Space Administration under Grant NNX15AF13G, the National Science Foundation grant AST-1411685, and the Ramon y Cajal fellowship no. RYC-2015-17697. E.C. is funded by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 664931. O.J.H and B.M.R. acknowledge the support of the UK Science and Technology Facilities Council (STFC). Funding for the Stellar Astrophysics Centre is provided by the Danish National Research Foundation (Grant DNRF106). This research has made use of NASA’s Astrophysics Data System. Data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.","oa":1,"quality_controlled":"1","publisher":"EDP Sciences"},{"date_updated":"2022-08-22T07:45:38Z","extern":"1","_id":"11620","article_type":"original","type":"journal_article","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","planets and satellites: composition","planets and satellites: formation","planets and satellites: fundamental parameters"],"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":478,"abstract":[{"lang":"eng","text":"We report the discovery and characterization of HD 89345b (K2-234b; EPIC 248777106b), a Saturn-sized planet orbiting a slightly evolved star. HD 89345 is a bright star (V = 9.3 mag) observed by the K2 mission with 1 min time sampling. It exhibits solar-like oscillations. We conducted asteroseismology to determine the parameters of the star, finding the mass and radius to be 1.12+0.04−0.01M⊙ and 1.657+0.020−0.004R⊙, respectively. The star appears to have recently left the main sequence, based on the inferred age, 9.4+0.4−1.3Gyr, and the non-detection of mixed modes. The star hosts a ‘warm Saturn’ (P = 11.8 d, Rp = 6.86 ± 0.14 R⊕). Radial-velocity follow-up observations performed with the FIbre-fed Echelle Spectrograph, HARPS, and HARPS-N spectrographs show that the planet has a mass of 35.7 ± 3.3 M⊕. The data also show that the planet’s orbit is eccentric (e ≈ 0.2). An investigation of the rotational splitting of the oscillation frequencies of the star yields no conclusive evidence on the stellar inclination angle. We further obtained Rossiter–McLaughlin observations, which result in a broad posterior of the stellar obliquity. The planet seems to confirm to the same patterns that have been observed for other sub-Saturns regarding planet mass and multiplicity, orbital eccentricity, and stellar metallicity."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1805.01860","open_access":"1"}],"month":"08","intvolume":" 478","citation":{"chicago":"Van Eylen, V, F Dai, S Mathur, D Gandolfi, S Albrecht, M Fridlund, R A García, et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty1390.","ista":"Van Eylen V, Dai F, Mathur S, Gandolfi D, Albrecht S, Fridlund M, García RA, Guenther E, Hjorth M, Justesen AB, Livingston J, Lund MN, Pérez Hernández F, Prieto-Arranz J, Regulo C, Bugnet LA, Everett ME, Hirano T, Nespral D, Nowak G, Palle E, Silva Aguirre V, Trifonov T, Winn JN, Barragán O, Beck PG, Chaplin WJ, Cochran WD, Csizmadia S, Deeg H, Endl M, Heeren P, Grziwa S, Hatzes AP, Hidalgo D, Korth J, Mathis S, Montañes Rodriguez P, Narita N, Patzold M, Persson CM, Rodler F, Smith AMS. 2018. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 478(4), 4866–4880.","mla":"Van Eylen, V., et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4, Oxford University Press, 2018, pp. 4866–80, doi:10.1093/mnras/sty1390.","apa":"Van Eylen, V., Dai, F., Mathur, S., Gandolfi, D., Albrecht, S., Fridlund, M., … Smith, A. M. S. (2018). HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty1390","ama":"Van Eylen V, Dai F, Mathur S, et al. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 2018;478(4):4866-4880. doi:10.1093/mnras/sty1390","ieee":"V. Van Eylen et al., “HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2,” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4. Oxford University Press, pp. 4866–4880, 2018.","short":"V. Van Eylen, F. Dai, S. Mathur, D. Gandolfi, S. Albrecht, M. Fridlund, R.A. García, E. Guenther, M. Hjorth, A.B. Justesen, J. Livingston, M.N. Lund, F. Pérez Hernández, J. Prieto-Arranz, C. Regulo, L.A. Bugnet, M.E. Everett, T. Hirano, D. Nespral, G. Nowak, E. Palle, V. Silva Aguirre, T. Trifonov, J.N. Winn, O. Barragán, P.G. Beck, W.J. Chaplin, W.D. Cochran, S. Csizmadia, H. Deeg, M. Endl, P. Heeren, S. Grziwa, A.P. Hatzes, D. Hidalgo, J. Korth, S. Mathis, P. Montañes Rodriguez, N. Narita, M. Patzold, C.M. Persson, F. Rodler, A.M.S. Smith, Monthly Notices of the Royal Astronomical Society 478 (2018) 4866–4880."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"V","last_name":"Van Eylen","full_name":"Van Eylen, V"},{"first_name":"F","full_name":"Dai, F","last_name":"Dai"},{"full_name":"Mathur, S","last_name":"Mathur","first_name":"S"},{"first_name":"D","full_name":"Gandolfi, D","last_name":"Gandolfi"},{"first_name":"S","last_name":"Albrecht","full_name":"Albrecht, S"},{"first_name":"M","last_name":"Fridlund","full_name":"Fridlund, M"},{"first_name":"R A","full_name":"García, R A","last_name":"García"},{"last_name":"Guenther","full_name":"Guenther, E","first_name":"E"},{"last_name":"Hjorth","full_name":"Hjorth, M","first_name":"M"},{"first_name":"A B","full_name":"Justesen, A B","last_name":"Justesen"},{"last_name":"Livingston","full_name":"Livingston, J","first_name":"J"},{"last_name":"Lund","full_name":"Lund, M N","first_name":"M N"},{"full_name":"Pérez Hernández, F","last_name":"Pérez Hernández","first_name":"F"},{"first_name":"J","last_name":"Prieto-Arranz","full_name":"Prieto-Arranz, J"},{"first_name":"C","full_name":"Regulo, C","last_name":"Regulo"},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"first_name":"M E","full_name":"Everett, M E","last_name":"Everett"},{"full_name":"Hirano, T","last_name":"Hirano","first_name":"T"},{"first_name":"D","full_name":"Nespral, D","last_name":"Nespral"},{"first_name":"G","last_name":"Nowak","full_name":"Nowak, G"},{"first_name":"E","last_name":"Palle","full_name":"Palle, E"},{"full_name":"Silva Aguirre, V","last_name":"Silva Aguirre","first_name":"V"},{"first_name":"T","last_name":"Trifonov","full_name":"Trifonov, T"},{"first_name":"J N","last_name":"Winn","full_name":"Winn, J N"},{"last_name":"Barragán","full_name":"Barragán, O","first_name":"O"},{"first_name":"P G","last_name":"Beck","full_name":"Beck, P G"},{"first_name":"W J","full_name":"Chaplin, W J","last_name":"Chaplin"},{"first_name":"W D","last_name":"Cochran","full_name":"Cochran, W D"},{"last_name":"Csizmadia","full_name":"Csizmadia, S","first_name":"S"},{"first_name":"H","last_name":"Deeg","full_name":"Deeg, H"},{"last_name":"Endl","full_name":"Endl, M","first_name":"M"},{"full_name":"Heeren, P","last_name":"Heeren","first_name":"P"},{"full_name":"Grziwa, S","last_name":"Grziwa","first_name":"S"},{"last_name":"Hatzes","full_name":"Hatzes, A P","first_name":"A P"},{"full_name":"Hidalgo, D","last_name":"Hidalgo","first_name":"D"},{"last_name":"Korth","full_name":"Korth, J","first_name":"J"},{"last_name":"Mathis","full_name":"Mathis, S","first_name":"S"},{"full_name":"Montañes Rodriguez, P","last_name":"Montañes Rodriguez","first_name":"P"},{"first_name":"N","last_name":"Narita","full_name":"Narita, N"},{"last_name":"Patzold","full_name":"Patzold, M","first_name":"M"},{"full_name":"Persson, C M","last_name":"Persson","first_name":"C M"},{"last_name":"Rodler","full_name":"Rodler, F","first_name":"F"},{"full_name":"Smith, A M S","last_name":"Smith","first_name":"A M S"}],"external_id":{"arxiv":["1805.01860"]},"article_processing_charge":"No","title":"HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2","year":"2018","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","page":"4866-4880","date_published":"2018-08-01T00:00:00Z","doi":"10.1093/mnras/sty1390","date_created":"2022-07-18T14:43:17Z","acknowledgement":"We gratefully acknowledge many helpful suggestions by the anonymous referee. Based on observations made with a) the Nordic Optical Telescope, operated by the Nordic Optical Telescope Scientific Association at the Observatorio del Roque de los Muchachos; b) the ESO-3.6m telescope at La Silla Observatory under programme ID 0100.C-0808; c) the Italian Telescopio Nazionale Galileo operated on the island of La Palma by the Fundación Galileo Galilei of the Istituto Nazionale di Astrofisica. NESSI was funded by the NASA Exoplanet Exploration Program and the NASA Ames Research Center. NESSI was built at the Ames Research Center by Steve B. Howell, Nic Scott, Elliott P. Horch, and Emmett Quigley. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 730890. This material reflects only the authors views and the Commission is not liable for any use that may be made of the information contained therein. DG gratefully acknowledges the financial support of the Programma Giovani Ricercatori – Rita Levi Montalcini – Rientro dei Cervelli (2012) awarded by the Italian Ministry of Education, Universities and Research (MIUR). SaM would like to acknowledge support from the Ramon y Cajal fellowship number RYC-2015-17697. AJ, MH, and SA acknowledge support by the Danish Council for Independent Research, through a DFF Sapere Aude Starting Grant nr. 4181-00487B. SzCs, APH, MP, and HR acknowledge the support of the DFG priority program SPP 1992Exploring the Diversity of Extrasolar Planets (grants HA 3279/12-1, PA 525/18-1, PA5 25/19-1 and PA525/20-1, RA 714/14-1) HD, CR, and FPH acknowledge the financial support from MINECO under grants ESP2015-65712-C5-4-R and AYA2016-76378-P. This paper has made use of the IAC Supercomputing facility HTCondor (http://research.cs.wisc.edu/htcondor/), partly financed by the Ministry of Economy and Competitiveness with FEDER funds, code IACA13-3E-2493. MF and CMP gratefully acknowledge the support of the Swedish National Space Board. RAG and StM thanks the support of the CNES PLATO grant. PGB is a postdoctoral fellow in the MINECO-programme ’Juan de la Cierva Incorporacion’ (IJCI-2015-26034). StM acknowledges support from ERC through SPIRE grant (647383) and from ISSI through the ENCELADE 2.0 team. VSA acknowledges support from VILLUM FONDEN (research grant 10118). MNL acknowledges support from the ESA-PRODEX programme. Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (Grant agreement no.: DNRF106) This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. This research was made with the use of NASA’s Astrophysics Data System and 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.","publisher":"Oxford University Press","quality_controlled":"1","oa":1},{"_id":"11631","article_number":"1811.12140","type":"preprint","status":"public","keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"date_updated":"2022-08-22T08:41:55Z","citation":{"chicago":"Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1811.12140.","ista":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.","apa":"Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., & Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. arXiv. https://doi.org/10.48550/arXiv.1811.12140","ama":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv. doi:10.48550/arXiv.1811.12140","ieee":"L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle, “FliPer: Classifying TESS pulsating stars,” arXiv. .","short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.)."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"first_name":"G. R.","last_name":"Davies","full_name":"Davies, G. R."},{"last_name":"Mathur","full_name":"Mathur, S.","first_name":"S."},{"last_name":"Hall","full_name":"Hall, O. J.","first_name":"O. J."},{"last_name":"Rendle","full_name":"Rendle, B. M.","first_name":"B. M."}],"external_id":{"arxiv":["1811.12140"]},"article_processing_charge":"No","title":"FliPer: Classifying TESS pulsating stars","abstract":[{"text":"The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with\r\nthe effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy.","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1811.12140","open_access":"1"}],"month":"11","publication_status":"submitted","year":"2018","day":"29","language":[{"iso":"eng"}],"publication":"arXiv","doi":"10.48550/arXiv.1811.12140","date_published":"2018-11-29T00:00:00Z","date_created":"2022-07-21T07:05:23Z"},{"oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","page":"1-22","date_created":"2022-07-27T08:28:26Z","doi":"10.1145/3274662","date_published":"2018-10-01T00:00:00Z","year":"2018","publication":"ACM Journal of Experimental Algorithmics","day":"01","article_processing_charge":"No","external_id":{"arxiv":["1708.06127"]},"author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Noe, Alexander","last_name":"Noe","first_name":"Alexander"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"},{"first_name":"Darren","full_name":"Strash, Darren","last_name":"Strash"}],"title":"Practical minimum cut algorithms","citation":{"ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22.","chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics. Association for Computing Machinery, 2018. https://doi.org/10.1145/3274662.","apa":"Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. Association for Computing Machinery. https://doi.org/10.1145/3274662","ama":"Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 2018;23:1-22. doi:10.1145/3274662","ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association for Computing Machinery, pp. 1–22, 2018.","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22.","mla":"Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics, vol. 23, Association for Computing Machinery, 2018, pp. 1–22, doi:10.1145/3274662."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1708.06127","open_access":"1"}],"scopus_import":"1","intvolume":" 23","month":"10","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 weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm runs a factor 7.5× faster on average when using 32 threads. To further speed up computations, we also give a version of our algorithm that performs random edge contractions as preprocessing. This version achieves a lower running time and better parallel scalability at the expense of a higher error rate."}],"oa_version":"Preprint","volume":23,"publication_status":"published","publication_identifier":{"issn":["1084-6654"],"eissn":["1084-6654"]},"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","keyword":["Theoretical Computer Science"],"status":"public","_id":"11657","date_updated":"2022-09-09T11:32:52Z","extern":"1"},{"article_processing_charge":"No","external_id":{"arxiv":["1310.3153"]},"author":[{"last_name":"Dütting","full_name":"Dütting, Paul","first_name":"Paul"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Starnberger","full_name":"Starnberger, Martin","first_name":"Martin"}],"title":"Valuation compressions in VCG-based combinatorial auctions","citation":{"ista":"Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2018. https://doi.org/10.1145/3232860.","ama":"Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 2018;6(2). doi:10.1145/3232860","apa":"Dütting, P., Henzinger, M. H., & Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/3232860","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation, vol. 6, no. 2. Association for Computing Machinery, 2018.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018).","mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation, vol. 6, no. 2, 5, Association for Computing Machinery, 2018, doi:10.1145/3232860."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"5","date_created":"2022-07-27T11:46:46Z","doi":"10.1145/3232860","date_published":"2018-05-01T00:00:00Z","year":"2018","publication":"ACM Transactions on Economics and Computation","day":"01","oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","date_updated":"2022-09-09T12:04:42Z","extern":"1","article_type":"original","type":"journal_article","keyword":["Theory of computation","Algorithmic game theory and mechanism design","Applied computing","Economics","Simplified mechanisms","Combinatorial auctions with item bidding","Price of anarchy"],"status":"public","_id":"11667","issue":"2","volume":6,"publication_status":"published","publication_identifier":{"eissn":["2167-8383"],"issn":["2167-8375"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3153"}],"scopus_import":"1","intvolume":" 6","month":"05","abstract":[{"text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency.","lang":"eng"}],"oa_version":"Preprint"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms, vol. 14, no. 2, 17, Association for Computing Machinery, 2018, doi:10.1145/3174803.","ieee":"G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in polylogarithmic amortized update time,” ACM Transactions on Algorithms, vol. 14, no. 2. Association for Computing Machinery, 2018.","short":"G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).","ama":"Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 2018;14(2). doi:10.1145/3174803","apa":"Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3174803","chicago":"Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174803.","ista":"Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17."},"title":"Incremental exact min-cut in polylogarithmic amortized update time","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Thorup, Mikkel","last_name":"Thorup","first_name":"Mikkel"}],"article_processing_charge":"No","external_id":{"arxiv":["1611.06500"]},"article_number":"17","day":"01","publication":"ACM Transactions on Algorithms","year":"2018","doi":"10.1145/3174803","date_published":"2018-04-01T00:00:00Z","date_created":"2022-07-27T11:29:39Z","acknowledgement":"We thank the two anonymous reviewers for their suggestions and comments, which improved the\r\nquality of the article.","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"extern":"1","date_updated":"2022-09-09T11:38:14Z","_id":"11664","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"publication_status":"published","issue":"2","volume":14,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function."}],"month":"04","intvolume":" 14","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1611.06500","open_access":"1"}]},{"_id":"11757","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-10T07:27:39Z","extern":"1","abstract":[{"lang":"eng","text":"We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ic.2018.02.005"}],"scopus_import":"1","intvolume":" 261","month":"08","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"language":[{"iso":"eng"}],"issue":"08","volume":261,"citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation. Elsevier, 2018. https://doi.org/10.1016/j.ic.2018.02.005.","ista":"Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239.","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:10.1016/j.ic.2018.02.005.","short":"S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.","ama":"Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual method. Information and Computation. 2018;261(08):219-239. doi:10.1016/j.ic.2018.02.005","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Italiano, Giuseppe","last_name":"Italiano","first_name":"Giuseppe"}],"title":"Dynamic algorithms via the primal-dual method","oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2018","publication":"Information and Computation","day":"01","page":"219-239","date_created":"2022-08-08T11:20:03Z","date_published":"2018-08-01T00:00:00Z","doi":"10.1016/j.ic.2018.02.005"},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"publication_status":"published","volume":112,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false."}],"month":"08","intvolume":" 112","alternative_title":["LIPIcs"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.40","open_access":"1"}],"extern":"1","date_updated":"2023-02-16T11:08:08Z","_id":"11828","status":"public","type":"conference","conference":{"end_date":"2018-08-22","location":"Helsinki, Finland","start_date":"2018-08-20","name":"ESA: Annual European Symposium on Algorithms"},"day":"14","publication":"26th Annual European Symposium on Algorithms","year":"2018","date_published":"2018-08-14T00:00:00Z","doi":"10.4230/LIPICS.ESA.2018.40","date_created":"2022-08-12T08:26:42Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.40.","ista":"Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.","mla":"Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.","ama":"Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.40","apa":"Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112."},"title":"Dynamic effective resistances and approximate schur complement on separable graphs","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz","first_name":"Gramoz"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Peng","full_name":"Peng, Pan","first_name":"Pan"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.09111"]},"article_number":"40"},{"volume":112,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783959770811"],"issn":["1868-8969"]},"intvolume":" 112","month":"08","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.39","open_access":"1"}],"alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem."}],"extern":"1","date_updated":"2023-02-16T10:50:51Z","status":"public","conference":{"start_date":"2018-08-20","location":"Helsinki, Finland","end_date":"2018-08-22","name":"ESA: Annual European Symposium on Algorithms"},"type":"conference","_id":"11827","date_created":"2022-08-12T08:20:57Z","doi":"10.4230/LIPICS.ESA.2018.39","date_published":"2018-08-14T00:00:00Z","publication":"26th Annual European Symposium on Algorithms","day":"14","year":"2018","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"A tree structure for dynamic facility location","article_processing_charge":"No","external_id":{"arxiv":["1909.06653"]},"author":[{"full_name":"Goranci, Gramoz ","last_name":"Goranci","first_name":"Gramoz "},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.","short":"G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure for dynamic facility location. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.39","ama":"Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39","mla":"Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.","ista":"Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.","chicago":"Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.39."},"article_number":"39"},{"external_id":{"arxiv":["1512.08148"]},"article_processing_charge":"No","author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 65(6), 1–40.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM. Association for Computing Machinery, 2018. https://doi.org/10.1145/3218657.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 2018;65(6):1-40. doi:10.1145/3218657","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657","mla":"Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1-40","date_created":"2022-08-08T12:33:17Z","doi":"10.1145/3218657","date_published":"2018-12-01T00:00:00Z","year":"2018","publication":"Journal of the ACM","day":"01","oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","date_updated":"2023-02-21T16:30:41Z","extern":"1","article_type":"original","type":"journal_article","status":"public","_id":"11768","issue":"6","volume":65,"related_material":{"record":[{"status":"public","id":"11855","relation":"earlier_version"}]},"publication_status":"published","publication_identifier":{"issn":["0004-5411"],"eissn":["1557-735X"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08148"}],"scopus_import":"1","intvolume":" 65","month":"12","abstract":[{"text":"In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest.","lang":"eng"}],"oa_version":"Preprint"},{"main_file_link":[{"url":"https://arxiv.org/abs/1711.04355","open_access":"1"}],"oa":1,"scopus_import":"1","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","month":"01","abstract":[{"text":"We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with worst-case update time [4].","lang":"eng"}],"oa_version":"Preprint","page":"1 - 20","date_created":"2022-08-16T12:07:14Z","doi":"10.1137/1.9781611975031.1","date_published":"2018-01-01T00:00:00Z","publication_status":"published","year":"2018","publication_identifier":{"eisbn":["978-161197503-1"]},"language":[{"iso":"eng"}],"publication":"29th Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"New Orleans, LA, United States","end_date":"2018-01-10","start_date":"2018-01-07"},"type":"conference","status":"public","_id":"11872","external_id":{"arxiv":["1711.04355"]},"article_processing_charge":"No","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"first_name":"Deeparnab","full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"title":"Dynamic algorithms for graph coloring","citation":{"ista":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 1–20. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975031.1.","ieee":"S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.","apa":"Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2018:1-20. doi:10.1137/1.9781611975031.1","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:10.1137/1.9781611975031.1."},"date_updated":"2023-02-17T11:39:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"publication_identifier":{"eisbn":["978-1-61197-505-5"]},"year":"2018","publication_status":"published","day":"01","language":[{"iso":"eng"}],"publication":"20th Workshop on Algorithm Engineering and Experiments","page":"48-61","doi":"10.1137/1.9781611975055.5","date_published":"2018-01-01T00:00:00Z","date_created":"2022-08-17T07:04:57Z","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 weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability."}],"oa_version":"Preprint","quality_controlled":"1","scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"url":"https://arxiv.org/abs/1708.06127","open_access":"1"}],"oa":1,"month":"01","citation":{"chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” In 20th Workshop on Algorithm Engineering and Experiments, 48–61. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975055.5.","ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61.","mla":"Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61, doi:10.1137/1.9781611975055.5.","apa":"Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975055.5","ama":"Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. In: 20th Workshop on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2018:48-61. doi:10.1137/1.9781611975055.5","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61.","ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in 20th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2018, pp. 48–61."},"date_updated":"2023-02-17T14:03:39Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Noe","full_name":"Noe, Alexander","first_name":"Alexander"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"},{"last_name":"Strash","full_name":"Strash, Darren","first_name":"Darren"}],"article_processing_charge":"No","external_id":{"arxiv":["1708.06127"]},"title":"Practical minimum cut algorithms","_id":"11882","type":"conference","conference":{"name":"ALENEX: Symposium on Algorithm Engineering and Experiments","start_date":"2018-01-07","end_date":"2018-01-08","location":"New Orleans, LA, United States"},"status":"public"},{"issue":"3","related_material":{"record":[{"relation":"earlier_version","id":"11875","status":"public"}]},"volume":47,"publication_status":"published","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.1318"}],"scopus_import":"1","intvolume":" 47","month":"05","abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]."}],"oa_version":"Preprint","date_updated":"2023-02-21T16:31:30Z","extern":"1","article_type":"original","type":"journal_article","status":"public","_id":"11890","page":"859-887","date_created":"2022-08-17T08:21:23Z","doi":"10.1137/140998925","date_published":"2018-05-01T00:00:00Z","year":"2018","publication":"SIAM Journal on Computing","day":"01","oa":1,"publisher":"Society for Industrial & Applied Mathematics","quality_controlled":"1","external_id":{"arxiv":["1412.1318"]},"article_processing_charge":"No","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"title":"Deterministic fully dynamic data structures for vertex cover and matching","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/140998925.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887, 2018.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887. doi:10.1137/140998925"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"01","publication":"17th International Symposium on Experimental Algorithms","year":"2018","doi":"10.4230/LIPICS.SEA.2018.3","date_published":"2018-07-01T00:00:00Z","date_created":"2022-08-18T06:49:40Z","article_number":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In 17th International Symposium on Experimental Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.SEA.2018.3.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3","apa":"Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SEA.2018.3","mla":"Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3."},"title":"Memetic graph clustering","author":[{"full_name":"Biedermann, Sonja","last_name":"Biedermann","first_name":"Sonja"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"first_name":"Bernhard","last_name":"Schuster","full_name":"Schuster, Bernhard"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.07034"]},"oa_version":"Published Version","abstract":[{"text":"It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. 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. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.","lang":"eng"}],"month":"07","intvolume":" 103","scopus_import":"1","alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.SEA.2018.3","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959770705"],"issn":["1868-8969"]},"publication_status":"published","volume":103,"_id":"11911","status":"public","type":"conference","conference":{"end_date":"2018-07-29","location":"L'Aquila, Italy","start_date":"2018-07-27","name":"SEA: Symposium on Experimental Algorithms"},"extern":"1","date_updated":"2023-02-16T11:45:14Z"},{"_id":"11958","status":"public","type":"journal_article","article_type":"letter_note","extern":"1","date_updated":"2023-02-21T10:09:18Z","pmid":1,"oa_version":"None","abstract":[{"text":"Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly employed in batch processes but are ill-suited for continuous-flow chemistry. Heterogeneous catalysts for thermal reactions are typically used in packed-bed reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs) allow for the continuous utilization of solid materials together with liquids and gases in flow. This technology was utilized to develop selective and efficient fluorination reactions using a modified graphitic carbon nitride heterogeneous catalyst instead of costly homogeneous metal polypyridyl complexes. The merger of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable and scalable photocatalysis.","lang":"eng"}],"intvolume":" 57","month":"07","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1433-7851"],"eissn":[" 1521-3773"]},"issue":"31","volume":57,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Pieber, Bartholomäus, Menny Shalom, Markus Antonietti, Peter H. Seeberger, and Kerry Gilmore. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201712568.","ista":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 57(31), 9976–9979.","mla":"Pieber, Bartholomäus, et al. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” Angewandte Chemie International Edition, vol. 57, no. 31, Wiley, 2018, pp. 9976–79, doi:10.1002/anie.201712568.","apa":"Pieber, B., Shalom, M., Antonietti, M., Seeberger, P. H., & Gilmore, K. (2018). Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201712568","ama":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 2018;57(31):9976-9979. doi:10.1002/anie.201712568","short":"B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979.","ieee":"B. Pieber, M. Shalom, M. Antonietti, P. H. Seeberger, and K. Gilmore, “Continuous heterogeneous photocatalysis in serial micro-batch reactors,” Angewandte Chemie International Edition, vol. 57, no. 31. Wiley, pp. 9976–9979, 2018."},"title":"Continuous heterogeneous photocatalysis in serial micro-batch reactors","external_id":{"pmid":["29377383"]},"article_processing_charge":"No","author":[{"last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"full_name":"Shalom, Menny","last_name":"Shalom","first_name":"Menny"},{"last_name":"Antonietti","full_name":"Antonietti, Markus","first_name":"Markus"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."},{"full_name":"Gilmore, Kerry","last_name":"Gilmore","first_name":"Kerry"}],"quality_controlled":"1","publisher":"Wiley","publication":"Angewandte Chemie International Edition","day":"26","year":"2018","date_created":"2022-08-24T10:57:25Z","date_published":"2018-07-26T00:00:00Z","doi":"10.1002/anie.201712568","page":"9976-9979"},{"month":"06","intvolume":" 31","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus."}],"issue":"2","volume":31,"file":[{"file_size":671125,"date_updated":"2020-07-14T12:44:39Z","creator":"system","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_created":"2018-12-12T10:17:13Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5266","checksum":"47686d58ec21c164540f1a980ff2163f"}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","pubrep_id":"712","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"1215","department":[{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:44:39Z","ddc":["519"],"date_updated":"2021-01-12T06:49:09Z","quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","doi":"10.1007/s10959-016-0724-2","date_published":"2018-06-01T00:00:00Z","date_created":"2018-12-11T11:50:45Z","page":"789-826","day":"01","publication":"Journal of Theoretical Probability","has_accepted_license":"1","year":"2018","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"title":"Infinite-dimensional calculus under weak spatial regularity of the processes","publist_id":"6119","author":[{"first_name":"Franco","last_name":"Flandoli","full_name":"Flandoli, Franco"},{"last_name":"Russo","full_name":"Russo, Francesco","first_name":"Francesco"},{"full_name":"Zanco, Giovanni A","last_name":"Zanco","id":"47491882-F248-11E8-B48F-1D18A9856A87","first_name":"Giovanni A"}],"article_processing_charge":"Yes (via OA deal)","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","apa":"Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2"}},{"status":"public","type":"journal_article","_id":"124","title":"The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system","publist_id":"7930","author":[{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Devin","full_name":"Schrader, Devin","last_name":"Schrader"},{"last_name":"Nagashima","full_name":"Nagashima, Kazuhide","first_name":"Kazuhide"},{"first_name":"Jemma","full_name":"Davidson, Jemma","last_name":"Davidson"},{"full_name":"Mccoy, Timothy","last_name":"Mccoy","first_name":"Timothy"},{"full_name":"Conolly Jr, Harold","last_name":"Conolly Jr","first_name":"Harold"},{"last_name":"Lauretta","full_name":"Lauretta, Dante","first_name":"Dante"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:49:19Z","citation":{"ista":"Waitukaitis SR, Schrader D, Nagashima K, Davidson J, Mccoy T, Conolly Jr H, Lauretta D. 2018. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 223, 405–421.","chicago":"Waitukaitis, Scott R, Devin Schrader, Kazuhide Nagashima, Jemma Davidson, Timothy Mccoy, Harold Conolly Jr, and Dante Lauretta. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” Geochimica et Cosmochimica Acta. Elsevier, 2018. https://doi.org/10.1016/j.gca.2017.12.014.","ama":"Waitukaitis SR, Schrader D, Nagashima K, et al. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 2018;223:405-421. doi:10.1016/j.gca.2017.12.014","apa":"Waitukaitis, S. R., Schrader, D., Nagashima, K., Davidson, J., Mccoy, T., Conolly Jr, H., & Lauretta, D. (2018). The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. Elsevier. https://doi.org/10.1016/j.gca.2017.12.014","ieee":"S. R. Waitukaitis et al., “The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system,” Geochimica et Cosmochimica Acta, vol. 223. Elsevier, pp. 405–421, 2018.","short":"S.R. Waitukaitis, D. Schrader, K. Nagashima, J. Davidson, T. Mccoy, H. Conolly Jr, D. Lauretta, Geochimica et Cosmochimica Acta 223 (2018) 405–421.","mla":"Waitukaitis, Scott R., et al. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” Geochimica et Cosmochimica Acta, vol. 223, Elsevier, 2018, pp. 405–21, doi:10.1016/j.gca.2017.12.014."},"month":"02","intvolume":" 223","quality_controlled":"1","publisher":"Elsevier","oa_version":"None","abstract":[{"text":"By investigating the in situ chemical and O-isotope compositions of olivine in lightly sintered dust agglomerates from the early Solar System, we constrain their origins and the retention of dust in the protoplanetary disk. The grain sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR) chondrites ranged from <1 to 80 µm. We infer this grain size range to be equivalent to the size range for dust in the early Solar System. AO chondrules may contain, but are not solely composed of, recycled fragments of earlier formed chondrules. They also contain 16O-rich olivine related to amoeboid olivine aggregates and represent the best record of chondrule-precursor materials. AO chondrules contain one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich (type II) chondrules, while others contain a type II chondrule core. These morphologies are consistent with particle agglomeration by electrostatic charging of grains during collision, a process that may explain solid agglomeration in the protoplanetary disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions of AO chondrules are consistent with chondrule formation by large-scale shocks, bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild 2 indicate that comets contain AO chondrules. We infer that these AO chondrules likely formed in the inner Solar System and migrated to the comet forming region at least 3 Ma after the formation of the first Solar System solids. Observations made in this study imply that the protoplanetary disk retained a dusty disk at least ∼3.7 Ma after the formation of the first Solar System solids, longer than half of the dusty accretion disks observed around other stars.","lang":"eng"}],"doi":"10.1016/j.gca.2017.12.014","volume":223,"date_published":"2018-02-15T00:00:00Z","date_created":"2018-12-11T11:44:45Z","page":"405 - 421","day":"15","language":[{"iso":"eng"}],"publication":"Geochimica et Cosmochimica Acta","year":"2018","publication_status":"published"},{"abstract":[{"text":"Many fields of study, including medical imaging, granular physics, colloidal physics, and active matter, require the precise identification and tracking of particle-like objects in images. While many algorithms exist to track particles in diffuse conditions, these often perform poorly when particles are densely packed together—as in, for example, solid-like systems of granular materials. Incorrect particle identification can have significant effects on the calculation of physical quantities, which makes the development of more precise and faster tracking algorithms a worthwhile endeavor. In this work, we present a new tracking algorithm to identify particles in dense systems that is both highly accurate and fast. We demonstrate the efficacy of our approach by analyzing images of dense, solid-state granular media, where we achieve an identification error of 5% in the worst evaluated cases. Going further, we propose a parallelization strategy for our algorithm using a GPU, which results in a speedup of up to 10× when compared to a sequential CPU implementation in C and up to 40× when compared to the reference MATLAB library widely used for particle tracking. Our results extend the capabilities of state-of-the-art particle tracking methods by allowing fast, high-fidelity detection in dense media at high resolutions.","lang":"eng"}],"oa_version":"None","publisher":"Elsevier","quality_controlled":"1","month":"06","intvolume":" 227","publication_status":"published","year":"2018","day":"01","language":[{"iso":"eng"}],"publication":"Computer Physics Communications","page":"8 - 16","doi":"10.1016/j.cpc.2018.02.010","date_published":"2018-06-01T00:00:00Z","volume":227,"date_created":"2018-12-11T11:44:45Z","_id":"125","type":"journal_article","status":"public","date_updated":"2021-01-12T06:49:23Z","citation":{"chicago":"Cerda, Mauricio, Scott R Waitukaitis, Cristóbal Navarro, Juan Silva, Nicolás Mujica, and Nancy Hitschfeld. “A High-Speed Tracking Algorithm for Dense Granular Media.” Computer Physics Communications. Elsevier, 2018. https://doi.org/10.1016/j.cpc.2018.02.010.","ista":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. 2018. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 227, 8–16.","mla":"Cerda, Mauricio, et al. “A High-Speed Tracking Algorithm for Dense Granular Media.” Computer Physics Communications, vol. 227, Elsevier, 2018, pp. 8–16, doi:10.1016/j.cpc.2018.02.010.","apa":"Cerda, M., Waitukaitis, S. R., Navarro, C., Silva, J., Mujica, N., & Hitschfeld, N. (2018). A high-speed tracking algorithm for dense granular media. Computer Physics Communications. Elsevier. https://doi.org/10.1016/j.cpc.2018.02.010","ama":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 2018;227:8-16. doi:10.1016/j.cpc.2018.02.010","ieee":"M. Cerda, S. R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, and N. Hitschfeld, “A high-speed tracking algorithm for dense granular media,” Computer Physics Communications, vol. 227. Elsevier, pp. 8–16, 2018.","short":"M. Cerda, S.R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, N. Hitschfeld, Computer Physics Communications 227 (2018) 8–16."},"extern":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"7928","author":[{"first_name":"Mauricio","last_name":"Cerda","full_name":"Cerda, Mauricio"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"},{"first_name":"Cristóbal","last_name":"Navarro","full_name":"Navarro, Cristóbal"},{"first_name":"Juan","full_name":"Silva, Juan","last_name":"Silva"},{"last_name":"Mujica","full_name":"Mujica, Nicolás","first_name":"Nicolás"},{"full_name":"Hitschfeld, Nancy","last_name":"Hitschfeld","first_name":"Nancy"}],"title":"A high-speed tracking algorithm for dense granular media"},{"date_published":"2018-07-25T00:00:00Z","doi":"10.1103/PhysRevLett.121.048001","issue":"4","volume":121,"date_created":"2018-12-11T11:44:46Z","day":"25","publication":"Physical Review Letters","language":[{"iso":"eng"}],"year":"2018","publication_status":"published","month":"07","intvolume":" 121","quality_controlled":"1","publisher":"American Physical Society","oa_version":"None","acknowledgement":"We acknowledge funding from the Netherlands Organization for Scientific Research through Grants VICI No. NWO- 680-47-609 (M. v. H. and S. W.) and VENI No. NWO-680- 47-453 (S. W.), and from the German Science Foundation through Grant No. HA8467/1-1 (K. H.).","abstract":[{"text":"The Leidenfrost effect occurs when a liquid or stiff sublimable solid near a hot surface creates enough vapor beneath it to lift itself up and float. In contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel spheres towards a hot surface, we discover that they are also capable of floating. The bounce-to-float transition is controlled by the approach velocity and temperature, analogously to the "dynamic Leidenfrost effect." For the floating regime, we measure power-law scalings for the gap geometry, which we explain with a model that couples the vaporization rate to the spherical shape. Our results reveal that hydrogels are a promising pathway for controlling floating Leidenfrost objects through shape.","lang":"eng"}],"title":"From bouncing to floating: the Leidenfrost effect with hydrogel spheres","publist_id":"7927","author":[{"first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"},{"first_name":"Kirsten","last_name":"Harth","full_name":"Harth, Kirsten"},{"first_name":"Martin","full_name":"Van Hecke, Martin","last_name":"Van Hecke"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:49:27Z","citation":{"mla":"Waitukaitis, Scott R., et al. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” Physical Review Letters, vol. 121, no. 4, 048001, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.048001.","apa":"Waitukaitis, S. R., Harth, K., & Van Hecke, M. (2018). From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.048001","ama":"Waitukaitis SR, Harth K, Van Hecke M. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 2018;121(4). doi:10.1103/PhysRevLett.121.048001","ieee":"S. R. Waitukaitis, K. Harth, and M. Van Hecke, “From bouncing to floating: the Leidenfrost effect with hydrogel spheres,” Physical Review Letters, vol. 121, no. 4. American Physical Society, 2018.","short":"S.R. Waitukaitis, K. Harth, M. Van Hecke, Physical Review Letters 121 (2018).","chicago":"Waitukaitis, Scott R, Kirsten Harth, and Martin Van Hecke. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.048001.","ista":"Waitukaitis SR, Harth K, Van Hecke M. 2018. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 121(4), 048001."},"status":"public","type":"journal_article","article_number":"048001 ","_id":"126"},{"publisher":"Nature Publishing Group","intvolume":" 14","month":"05","abstract":[{"text":"The ideas of topology are breaking ground in origami-based metamaterials. Experiments now show that certain shapes — doughnuts included — exhibit topological bistability, and can be made to click between different topologically stable states.","lang":"eng"}],"oa_version":"None","page":"777 - 778","date_created":"2018-12-11T11:44:46Z","issue":"8","volume":14,"doi":"10.1038/s41567-018-0160-6","date_published":"2018-05-28T00:00:00Z","publication_status":"published","year":"2018","language":[{"iso":"eng"}],"publication":"Nature Physics","day":"28","type":"journal_article","status":"public","_id":"127","author":[{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7926","title":"Clicks for doughnuts","date_updated":"2021-01-12T06:49:31Z","citation":{"chicago":"Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-018-0160-6.","ista":"Waitukaitis SR. 2018. Clicks for doughnuts. Nature Physics. 14(8), 777–778.","mla":"Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics, vol. 14, no. 8, Nature Publishing Group, 2018, pp. 777–78, doi:10.1038/s41567-018-0160-6.","short":"S.R. Waitukaitis, Nature Physics 14 (2018) 777–778.","ieee":"S. R. Waitukaitis, “Clicks for doughnuts,” Nature Physics, vol. 14, no. 8. Nature Publishing Group, pp. 777–778, 2018.","apa":"Waitukaitis, S. R. (2018). Clicks for doughnuts. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-018-0160-6","ama":"Waitukaitis SR. Clicks for doughnuts. Nature Physics. 2018;14(8):777-778. doi:10.1038/s41567-018-0160-6"},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","extern":"1","citation":{"mla":"Browning, Timothy D. How Often Does the Hasse Principle Hold? Vol. 97, no. 2, American Mathematical Society, 2018, pp. 89–102, doi:10.1090/pspum/097.2/01700.","ieee":"T. D. Browning, “How often does the Hasse principle hold?,” presented at the Algebraic Geometry, Salt Lake City, Utah, USA, 2018, vol. 97, no. 2, pp. 89–102.","short":"T.D. Browning, in:, American Mathematical Society, 2018, pp. 89–102.","ama":"Browning TD. How often does the Hasse principle hold? In: Vol 97. American Mathematical Society; 2018:89-102. doi:10.1090/pspum/097.2/01700","apa":"Browning, T. D. (2018). How often does the Hasse principle hold? (Vol. 97, pp. 89–102). Presented at the Algebraic Geometry, Salt Lake City, Utah, USA: American Mathematical Society. https://doi.org/10.1090/pspum/097.2/01700","chicago":"Browning, Timothy D. “How Often Does the Hasse Principle Hold?,” 97:89–102. American Mathematical Society, 2018. https://doi.org/10.1090/pspum/097.2/01700.","ista":"Browning TD. 2018. How often does the Hasse principle hold? Algebraic Geometry, Proceedings of Symposia in Pure Mathematics, vol. 97, 89–102."},"date_updated":"2021-01-12T06:52:54Z","title":"How often does the Hasse principle hold?","article_processing_charge":"No","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"}],"_id":"174","status":"public","conference":{"name":"Algebraic Geometry","start_date":"2015-07-06","location":"Salt Lake City, Utah, USA","end_date":"2015-07-10"},"type":"conference","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2018","date_created":"2018-12-11T11:45:01Z","issue":"2","date_published":"2018-01-01T00:00:00Z","doi":"10.1090/pspum/097.2/01700","volume":97,"page":"89 - 102","oa_version":"None","abstract":[{"text":"We survey recent efforts to quantify failures of the Hasse principle in families of rationally connected varieties.","lang":"eng"}],"intvolume":" 97","month":"01","quality_controlled":"1","alternative_title":["Proceedings of Symposia in Pure Mathematics"],"publisher":"American Mathematical Society"},{"title":"Averages of arithmetic functions over principal ideals","author":[{"last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"full_name":"Sofos, Efthymios","last_name":"Sofos","first_name":"Efthymios"}],"external_id":{"arxiv":["1706.04331"]},"article_processing_charge":"No","extern":"1","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","date_updated":"2021-01-12T06:53:01Z","citation":{"ista":"Browning TD, Sofos E. 2018. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 15(3), 547–567.","chicago":"Browning, Timothy D, and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory. World Scientific Publishing, 2018. https://doi.org/10.1142/S1793042119500283.","short":"T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018) 547–567.","ieee":"T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific Publishing, pp. 547–567, 2018.","apa":"Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. World Scientific Publishing. https://doi.org/10.1142/S1793042119500283","ama":"Browning TD, Sofos E. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 2018;15(3):547-567. doi:10.1142/S1793042119500283","mla":"Browning, Timothy D., and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory, vol. 15, no. 3, World Scientific Publishing, 2018, pp. 547–67, doi:10.1142/S1793042119500283."},"status":"public","type":"journal_article","article_type":"original","_id":"176","date_published":"2018-11-16T00:00:00Z","doi":"10.1142/S1793042119500283","issue":"3","volume":15,"date_created":"2018-12-11T11:45:01Z","page":"547-567","day":"16","publication":"International Journal of Nuber Theory","language":[{"iso":"eng"}],"year":"2018","publication_status":"published","month":"11","intvolume":" 15","publisher":"World Scientific Publishing","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1706.04331","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with integer coefficients."}]},{"_id":"178","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","ddc":["512"],"extern":"1","date_updated":"2022-08-26T09:13:02Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We give an upper bound for the number of rational points of height at most B, lying on a surface defined by a quadratic form Q. The bound shows an explicit dependence on Q. It is optimal with respect to B, and is also optimal for typical forms Q."}],"intvolume":" 15","month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1801.00979"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2397-3129"]},"volume":15,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Browning, Timothy D, and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis. Alliance of Diamond Open Access Journals, 2018. https://doi.org/10.19086/da.4375.","ista":"Browning TD, Heath-Brown R. 2018. Counting rational points on quadric surfaces. Discrete Analysis. 15, 1–29.","mla":"Browning, Timothy D., and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis, vol. 15, Alliance of Diamond Open Access Journals, 2018, pp. 1–29, doi:10.19086/da.4375.","short":"T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29.","ieee":"T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,” Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp. 1–29, 2018.","ama":"Browning TD, Heath-Brown R. Counting rational points on quadric surfaces. Discrete Analysis. 2018;15:1-29. doi:10.19086/da.4375","apa":"Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/da.4375"},"title":"Counting rational points on quadric surfaces","external_id":{"arxiv":["1801.00979"]},"article_processing_charge":"No","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"},{"first_name":"Roger","last_name":"Heath-Brown","full_name":"Heath-Brown, Roger"}],"oa":1,"publisher":"Alliance of Diamond Open Access Journals","quality_controlled":"1","publication":"Discrete Analysis","day":"07","year":"2018","date_created":"2018-12-11T11:45:02Z","date_published":"2018-09-07T00:00:00Z","doi":"10.19086/da.4375","page":"1 - 29"},{"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:45:19Z","date_updated":"2021-01-12T06:53:36Z","ddc":["510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Budapest, Hungary","end_date":"2018-06-14","start_date":"2018-06-11","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","_id":"185","volume":99,"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-066-8"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5701","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","date_updated":"2020-07-14T12:45:19Z","file_size":718857,"creator":"dernst","date_created":"2018-12-17T12:33:52Z","file_name":"2018_LIPIcs_Fulek.pdf"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"scopus_import":1,"intvolume":" 99","month":"01","abstract":[{"text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.","lang":"eng"}],"oa_version":"Published Version","publist_id":"7735","author":[{"last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"first_name":"Jan","full_name":"Kynčl, Jan","last_name":"Kynčl"}],"title":"Hanani-Tutte for approximating maps of graphs","citation":{"mla":"Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"article_number":"39","date_created":"2018-12-11T11:45:04Z","date_published":"2018-01-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.39","year":"2018","has_accepted_license":"1","day":"01","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35","mla":"Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35."},"title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Ziga","full_name":"Virk, Ziga","last_name":"Virk"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","full_name":"Wagner, Hubert","last_name":"Wagner"}],"publist_id":"7733","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"11","has_accepted_license":"1","year":"2018","date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.35","date_created":"2018-12-11T11:45:05Z","page":"35:1 - 35:13","_id":"188","status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"ddc":["000"],"date_updated":"2021-01-12T06:53:48Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:20Z","oa_version":"Published Version","abstract":[{"text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex.","lang":"eng"}],"month":"06","intvolume":" 99","scopus_import":1,"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"file":[{"checksum":"7509403803b3ac1aee94bbc2ad293d21","file_id":"5724","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-17T16:31:31Z","file_name":"2018_LIPIcs_Edelsbrunner.pdf","creator":"dernst","date_updated":"2020-07-14T12:45:20Z","file_size":489080}],"language":[{"iso":"eng"}],"publication_status":"published","volume":99},{"title":"Learning directed acyclic graphs based on sparsest permutations","author":[{"first_name":"Garvesh","last_name":"Raskutti","full_name":"Raskutti, Garvesh"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler"}],"publist_id":"5061","article_processing_charge":"No","external_id":{"arxiv":["1307.0366"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183.","ama":"Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations. STAT. 2018;7(1). doi:10.1002/sta4.183","apa":"Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183","ieee":"G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” STAT, vol. 7, no. 1. Wiley, 2018.","short":"G. Raskutti, C. Uhler, STAT 7 (2018).","chicago":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183.","ista":"Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest permutations. STAT. 7(1), e183."},"article_number":"e183","doi":"10.1002/sta4.183","date_published":"2018-04-17T00:00:00Z","date_created":"2018-12-11T11:55:13Z","day":"17","publication":"STAT","year":"2018","publisher":"Wiley","quality_controlled":"1","oa":1,"extern":"1","date_updated":"2021-01-12T06:54:44Z","status":"public","type":"journal_article","article_type":"original","_id":"2015","volume":7,"issue":"1","language":[{"iso":"eng"}],"publication_status":"published","month":"04","intvolume":" 7","main_file_link":[{"url":"http://arxiv.org/abs/1307.0366","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the problem of learning a Bayesian network or directed acyclic graph model from observational data. A number of constraint‐based, score‐based and hybrid algorithms have been developed for this purpose. Statistical consistency guarantees of these algorithms rely on the faithfulness assumption, which has been shown to be restrictive especially for graphs with cycles in the skeleton. We here propose the sparsest permutation (SP) algorithm, showing that learning Bayesian networks is possible under strictly weaker assumptions than faithfulness. This comes at a computational price, thereby indicating a statistical‐computational trade‐off for causal inference algorithms. In the Gaussian noiseless setting, we prove that the SP algorithm boils down to finding the permutation of the variables with the sparsest Cholesky decomposition of the inverse covariance matrix, which is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation study showing that in line with the proven stronger consistency guarantees, and the SP algorithm compares favourably to standard causal inference algorithms in terms of accuracy for a given sample size."}]},{"_id":"306","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public","date_updated":"2021-01-12T07:40:46Z","ddc":["530"],"department":[{"_id":"GaTk"}],"file_date_updated":"2020-07-14T12:45:59Z","abstract":[{"text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 4","month":"04","publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5929","checksum":"67010cf5e3b3e0637c659371714a715a","file_size":994490,"date_updated":"2020-07-14T12:45:59Z","creator":"dernst","file_name":"2018_Heliyon_DeMartino.pdf","date_created":"2019-02-06T07:36:24Z"}],"ec_funded":1,"issue":"4","volume":4,"article_number":"e00596","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.","ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018.","short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596","apa":"De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596","chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.","ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Andrea","full_name":"De Martino, Andrea","last_name":"De Martino"},{"first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele"}],"title":"An introduction to the maximum entropy approach and its application to inference problems in biology","oa":1,"publisher":"Elsevier","quality_controlled":"1","year":"2018","has_accepted_license":"1","publication":"Heliyon","day":"01","date_created":"2018-12-11T11:45:44Z","doi":"10.1016/j.heliyon.2018.e00596","date_published":"2018-04-01T00:00:00Z"},{"citation":{"mla":"Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer Nature, 2018, doi:10.1007/978-3-319-10575-8.","ama":"Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking. 1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8","apa":"Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8","ieee":"E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model Checking, 1st ed. Cham: Springer Nature, 2018.","short":"E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.","chicago":"Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.","ista":"Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking 1st ed., Cham: Springer Nature, XLVIII, 1212p."},"date_updated":"2021-12-21T10:49:36Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Clarke, Edmund M.","last_name":"Clarke","first_name":"Edmund M."},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"},{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"}],"publist_id":"3340","article_processing_charge":"No","title":"Handbook of Model Checking","department":[{"_id":"ToHe"}],"_id":"3300","type":"book","status":"public","publication_identifier":{"isbn":["978-3-319-10574-1"],"eisbn":["978-3-319-10575-8"]},"year":"2018","publication_status":"published","day":"08","language":[{"iso":"eng"}],"page":"XLVIII, 1212","doi":"10.1007/978-3-319-10575-8","date_published":"2018-06-08T00:00:00Z","date_created":"2018-12-11T12:02:32Z","abstract":[{"text":"This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.","lang":"eng"}],"oa_version":"None","publisher":"Springer Nature","quality_controlled":"1","scopus_import":"1","edition":"1","month":"06","place":"Cham"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods in Molecular Biology, vol. 1863, 47–63.","chicago":"Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” In Morphogen Gradients , 1863:47–63. MIMB. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-8772-6_4.","short":"M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63.","ieee":"M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube,” in Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63.","apa":"Zagórski, M. P., & Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In Morphogen Gradients (Vol. 1863, pp. 47–63). Springer Nature. https://doi.org/10.1007/978-1-4939-8772-6_4","ama":"Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Vol 1863. MIMB. Springer Nature; 2018:47-63. doi:10.1007/978-1-4939-8772-6_4","mla":"Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63, doi:10.1007/978-1-4939-8772-6_4."},"title":"Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube","article_processing_charge":"No","author":[{"orcid":"0000-0001-7896-7762","full_name":"Zagórski, Marcin P","last_name":"Zagórski","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin P"},{"last_name":"Kicheva","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna"}],"publist_id":"8018","project":[{"call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425","name":"Coordination of Patterning And Growth In the Spinal Cord","grant_number":"680037"}],"publication":"Morphogen Gradients ","day":"16","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:44:17Z","doi":"10.1007/978-1-4939-8772-6_4","date_published":"2018-10-16T00:00:00Z","page":"47 - 63","oa":1,"quality_controlled":"1","publisher":"Springer Nature","ddc":["570"],"date_updated":"2021-01-12T07:49:03Z","department":[{"_id":"AnKi"}],"file_date_updated":"2020-10-13T14:20:37Z","_id":"37","series_title":"MIMB","status":"public","type":"book_chapter","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8656","checksum":"2a97d0649fdcfcf1bdca7c8ad1dce71b","creator":"dernst","file_size":4906815,"date_updated":"2020-10-13T14:20:37Z","file_name":"2018_MIMB_Zagorski.pdf","date_created":"2020-10-13T14:20:37Z"}],"publication_status":"published","publication_identifier":{"issn":["1064-3745"],"isbn":["978-1-4939-8771-9"]},"ec_funded":1,"volume":1863,"oa_version":"Submitted Version","abstract":[{"text":"Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube.","lang":"eng"}],"intvolume":" 1863","month":"10","scopus_import":"1","alternative_title":["Methods in Molecular Biology"]},{"oa_version":"None","abstract":[{"text":"The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.","lang":"eng"}],"month":"01","intvolume":" 1771","scopus_import":1,"alternative_title":["MIMB"],"language":[{"iso":"eng"}],"publication_status":"published","volume":1771,"ec_funded":1,"_id":"305","status":"public","type":"journal_article","date_updated":"2021-01-12T07:40:42Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"acknowledgement":"This work was financially supported by FP7 of the EU through the project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS” (contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss National Science Foundation for Olivier Frey. The research leading to these results also received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE, ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members of the Guet and Tkačik groups, IST Austria, for valuable comments and support.","publisher":"Springer","quality_controlled":"1","day":"01","publication":"Methods in Molecular Biology","year":"2018","date_published":"2018-01-01T00:00:00Z","doi":"10.1007/978-1-4939-7792-5_15","date_created":"2018-12-11T11:45:43Z","page":"183 - 202","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.","chicago":"Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15.","short":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular Biology 1771 (2018) 183–202.","ieee":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and operation of microfluidic hanging drop networks,” Methods in Molecular Biology, vol. 1771. Springer, pp. 183–202, 2018.","apa":"Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. Springer. https://doi.org/10.1007/978-1-4939-7792-5_15","ama":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202. doi:10.1007/978-1-4939-7792-5_15","mla":"Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp. 183–202, doi:10.1007/978-1-4939-7792-5_15."},"title":"Fabrication and operation of microfluidic hanging drop networks","author":[{"first_name":"Patrick","last_name":"Misun","full_name":"Misun, Patrick"},{"last_name":"Birchler","full_name":"Birchler, Axel","first_name":"Axel"},{"first_name":"Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz","last_name":"Lang"},{"last_name":"Hierlemann","full_name":"Hierlemann, Andreas","first_name":"Andreas"},{"last_name":"Frey","full_name":"Frey, Olivier","first_name":"Olivier"}],"publist_id":"7574"},{"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"article_number":"34","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","external_id":{"arxiv":["1709.04037"]},"author":[{"first_name":"Sheshansh","last_name":"Agrawal","full_name":"Agrawal, Sheshansh"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"publist_id":"7540","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.","ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.","mla":"Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.","apa":"Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018."},"oa":1,"quality_controlled":"1","publisher":"ACM","date_created":"2018-12-11T11:45:50Z","date_published":"2018-01-01T00:00:00Z","doi":"10.1145/3158122","day":"01","year":"2018","status":"public","conference":{"name":"POPL: Principles of Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, USA","end_date":"2018-01-13"},"type":"conference","_id":"325","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:07Z","intvolume":" 2","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.04037"}],"oa_version":"Preprint","abstract":[{"text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.","lang":"eng"}],"volume":2,"issue":"POPL","language":[{"iso":"eng"}],"publication_status":"published"},{"_id":"394","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:53:20Z","citation":{"mla":"Mahmood, Fahad, et al. “Observation of Exciton-Exciton Interaction Mediated Valley Depolarization in Monolayer MoSe2.” Nano Letters, vol. 18, no. 1, American Chemical Society, 2018, pp. 223–28, doi:10.1021/acs.nanolett.7b03953.","ieee":"F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, and N. Gedik, “Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2,” Nano Letters, vol. 18, no. 1. American Chemical Society, pp. 223–228, 2018.","short":"F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, N. Gedik, Nano Letters 18 (2018) 223–228.","apa":"Mahmood, F., Alpichshev, Z., Lee, Y., Kong, J., & Gedik, N. (2018). Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b03953","ama":"Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. 2018;18(1):223-228. doi:10.1021/acs.nanolett.7b03953","chicago":"Mahmood, Fahad, Zhanybek Alpichshev, Yi Lee, Jing Kong, and Nuh Gedik. “Observation of Exciton-Exciton Interaction Mediated Valley Depolarization in Monolayer MoSe2.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.7b03953.","ista":"Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. 2018. Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. 18(1), 223–228."},"title":"Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2","external_id":{"arxiv":["1712.07925"]},"author":[{"last_name":"Mahmood","full_name":"Mahmood, Fahad","first_name":"Fahad"},{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek"},{"full_name":"Lee, Yi","last_name":"Lee","first_name":"Yi"},{"full_name":"Kong, Jing","last_name":"Kong","first_name":"Jing"},{"first_name":"Nuh","full_name":"Gedik, Nuh","last_name":"Gedik"}],"publist_id":"7435","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The valley pseudospin in monolayer transition metal dichalcogenides (TMDs) has been proposed as a new way to manipulate information in various optoelectronic devices. This relies on a large valley polarization that remains stable over long time scales (hundreds of nanoseconds). However, time-resolved measurements report valley lifetimes of only a few picoseconds. This has been attributed to mechanisms such as phonon-mediated intervalley scattering and a precession of the valley pseudospin through electron-hole exchange. Here we use transient spin grating to directly measure the valley depolarization lifetime in monolayer MoSe2. We find a fast valley decay rate that scales linearly with the excitation density at different temperatures. This establishes the presence of strong exciton-exciton Coulomb exchange interactions enhancing the valley depolarization. Our work highlights the microscopic processes inhibiting the efficient use of the exciton valley pseudospin in monolayer TMDs. "}],"intvolume":" 18","month":"01","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1712.07925","open_access":"1"}],"publisher":"American Chemical Society","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Nano Letters","day":"10","publication_status":"published","year":"2018","date_created":"2018-12-11T11:46:13Z","volume":18,"doi":"10.1021/acs.nanolett.7b03953","date_published":"2018-01-10T00:00:00Z","issue":"1","page":"223 - 228"},{"pmid":1,"oa_version":"None","abstract":[{"text":"Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.","lang":"eng"}],"intvolume":" 1761","month":"03","alternative_title":["MIMB"],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1064-3745"]},"volume":1761,"_id":"408","status":"public","type":"book_chapter","date_updated":"2021-01-12T07:54:21Z","department":[{"_id":"JiFr"}],"publisher":"Springer Nature","quality_controlled":"1","publication":"Root Development ","day":"01","year":"2018","date_created":"2018-12-11T11:46:18Z","doi":"10.1007/978-1-4939-7747-5_7","date_published":"2018-03-01T00:00:00Z","page":"95 - 102","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Trinh H, Verstraeten I, Geelen D. 2018.In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . MIMB, vol. 1761, 95–102.","chicago":"Trinh, Hoang, Inge Verstraeten, and Danny Geelen. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” In Root Development , 1761:95–102. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-7747-5_7.","ama":"Trinh H, Verstraeten I, Geelen D. In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . Vol 1761. Springer Nature; 2018:95-102. doi:10.1007/978-1-4939-7747-5_7","apa":"Trinh, H., Verstraeten, I., & Geelen, D. (2018). In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In Root Development (Vol. 1761, pp. 95–102). Springer Nature. https://doi.org/10.1007/978-1-4939-7747-5_7","short":"H. Trinh, I. Verstraeten, D. Geelen, in:, Root Development , Springer Nature, 2018, pp. 95–102.","ieee":"H. Trinh, I. Verstraeten, and D. Geelen, “In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls,” in Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102.","mla":"Trinh, Hoang, et al. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102, doi:10.1007/978-1-4939-7747-5_7."},"title":"In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls","external_id":{"pmid":["29525951"]},"article_processing_charge":"No","author":[{"full_name":"Trinh, Hoang","last_name":"Trinh","first_name":"Hoang"},{"orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge"},{"full_name":"Geelen, Danny","last_name":"Geelen","first_name":"Danny"}],"publist_id":"7421"},{"_id":"411","series_title":"MIMB","status":"public","type":"book_chapter","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:54:34Z","citation":{"chicago":"Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018. https://doi.org/10.1007/978-1-4939-7747-5_10.","ista":"Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology, vol. 1761, 131–143.","mla":"Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10.","ama":"Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols. Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10","apa":"Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development. Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10","ieee":"M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia,” in Root Development. Methods and Protocols, vol. 1761, D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.","short":"M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez (Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143."},"editor":[{"first_name":"Daniela","last_name":"Ristova","full_name":"Ristova, Daniela"},{"full_name":"Barbez, Elke","last_name":"Barbez","first_name":"Elke"}],"title":"Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia","department":[{"_id":"JiFr"}],"publist_id":"7418","author":[{"first_name":"Michael","full_name":"Karampelias, Michael","last_name":"Karampelias"},{"first_name":"Ricardo","last_name":"Tejos","full_name":"Tejos, Ricardo"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vanneste","full_name":"Vanneste, Steffen","first_name":"Steffen"}],"oa_version":"None","abstract":[{"text":"Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins.","lang":"eng"}],"intvolume":" 1761","month":"03","scopus_import":1,"publisher":"Springer","alternative_title":["Methods in Molecular Biology"],"quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Root Development. Methods and Protocols","day":"11","year":"2018","publication_status":"published","date_created":"2018-12-11T11:46:20Z","date_published":"2018-03-11T00:00:00Z","doi":"10.1007/978-1-4939-7747-5_10","volume":1761,"page":"131 - 143"},{"type":"journal_article","status":"public","_id":"456","article_number":"eaar7514","publist_id":"7365","author":[{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"}],"title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","department":[{"_id":"GaNo"}],"citation":{"ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018.","short":"G. Novarino, Science Translational Medicine 10 (2018).","ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514","apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514."},"date_updated":"2021-01-12T07:59:42Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"publisher":"American Association for the Advancement of Science","quality_controlled":"1","month":"01","intvolume":" 10","abstract":[{"lang":"eng","text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. "}],"oa_version":"None","volume":10,"date_published":"2018-01-10T00:00:00Z","doi":"10.1126/scitranslmed.aar7514","issue":"423","date_created":"2018-12-11T11:46:34Z","year":"2018","publication_status":"published","day":"10","language":[{"iso":"eng"}],"publication":"Science Translational Medicine"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.","mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993."},"title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","author":[{"last_name":"Petritsch","full_name":"Petritsch, Barbara","orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara"},{"last_name":"Porsche","full_name":"Porsche, Jana","first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"8001","publication":"VÖB Mitteilungen","day":"01","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:44:22Z","date_published":"2018-10-01T00:00:00Z","doi":"10.31263/voebm.v71i1.1993","page":"199 - 206","oa":1,"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","ddc":["020"],"date_updated":"2021-01-12T08:01:26Z","department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:46:38Z","_id":"53","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"7ac61bade5f37db011ca435ebcf86797","file_id":"5702","creator":"dernst","file_size":509434,"date_updated":"2020-07-14T12:46:38Z","file_name":"2018_VOEB_Petritsch.pdf","date_created":"2018-12-17T12:40:27Z"}],"publication_status":"published","volume":71,"issue":"1","oa_version":"Published Version","abstract":[{"text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation.","lang":"eng"}],"intvolume":" 71","month":"10","scopus_import":1},{"scopus_import":1,"month":"11","intvolume":" 31","abstract":[{"lang":"eng","text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model."}],"oa_version":"Published Version","volume":31,"issue":"6","publication_identifier":{"issn":["01782770"]},"publication_status":"published","file":[{"checksum":"69b46e537acdcac745237ddb853fcbb5","file_id":"5867","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-01-22T07:25:51Z","file_name":"2017_DistribComp_Alistarh.pdf","date_updated":"2020-07-14T12:46:38Z","file_size":595707,"creator":"dernst"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"536","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:46:38Z","date_updated":"2023-02-23T12:23:25Z","ddc":["000"],"quality_controlled":"1","publisher":"Springer","oa":1,"page":"489-501","doi":"10.1007/s00446-017-0315-1","date_published":"2018-11-01T00:00:00Z","date_created":"2018-12-11T11:47:01Z","has_accepted_license":"1","year":"2018","day":"01","publication":"Distributed Computing","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"last_name":"King","full_name":"King, Valerie","first_name":"Valerie"},{"first_name":"Jared","full_name":"Saia, Jared","last_name":"Saia"}],"publist_id":"7281","article_processing_charge":"Yes (via OA deal)","title":"Communication-efficient randomized consensus","citation":{"ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"type":"journal_article","status":"public","_id":"554","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T08:02:35Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"scopus_import":1,"intvolume":" 360","month":"05","abstract":[{"text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).","lang":"eng"}],"oa_version":"Submitted Version","volume":360,"issue":"1","publication_status":"published","publication_identifier":{"issn":["00103616"]},"language":[{"iso":"eng"}],"project":[{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"external_id":{"arxiv":["1511.05953"]},"author":[{"full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Reuvers, Robin","last_name":"Reuvers","first_name":"Robin"},{"first_name":"Jan","full_name":"Solovej, Jan","last_name":"Solovej"}],"publist_id":"7260","title":"The Bogoliubov free energy functional II: The dilute Limit","citation":{"ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.","ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Springer","quality_controlled":"1","page":"347-403","date_created":"2018-12-11T11:47:09Z","date_published":"2018-05-01T00:00:00Z","doi":"10.1007/s00220-017-3064-x","year":"2018","publication":"Communications in Mathematical Physics","day":"01"},{"publist_id":"7252","author":[{"first_name":"Dimitar","last_name":"Dimitrov","full_name":"Dimitrov, Dimitar"},{"last_name":"Guillaud","full_name":"Guillaud, Laurent","first_name":"Laurent"},{"last_name":"Eguchi","orcid":"0000-0002-6170-2546","full_name":"Eguchi, Kohgaku","first_name":"Kohgaku","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Takahashi, Tomoyuki","last_name":"Takahashi","first_name":"Tomoyuki"}],"article_processing_charge":"No","external_id":{"pmid":["29222783"]},"editor":[{"first_name":"Stephen D.","last_name":"Skaper","full_name":"Skaper, Stephen D."}],"title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","citation":{"ista":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215.","chicago":"Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.","apa":"Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15","ama":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15","short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","ieee":"D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215.","mla":"Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"201 - 215","doi":"10.1007/978-1-4939-7571-6_15","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:47:11Z","has_accepted_license":"1","year":"2018","day":"01","publication":"Neurotrophic Factors","quality_controlled":"1","publisher":"Springer","oa":1,"file_date_updated":"2020-07-14T12:47:09Z","department":[{"_id":"RySh"}],"date_updated":"2021-01-12T08:03:05Z","ddc":["570"],"type":"book_chapter","status":"public","_id":"562","volume":1727,"publication_status":"published","file":[{"file_id":"7046","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","date_created":"2019-11-19T07:47:43Z","file_size":787407,"date_updated":"2020-07-14T12:47:09Z","creator":"dernst"}],"language":[{"iso":"eng"}],"alternative_title":["Methods in Molecular Biology"],"scopus_import":1,"month":"01","intvolume":" 1727","abstract":[{"lang":"eng","text":"Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals."}],"pmid":1,"oa_version":"Submitted Version"},{"oa_version":"None","abstract":[{"text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.","lang":"eng"}],"month":"05","edition":"1","quality_controlled":"1","publisher":"Springer","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","day":"19","publication_status":"published","year":"2018","publication_identifier":{"isbn":["978-3-319-10574-1"]},"date_created":"2018-12-11T11:44:24Z","date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_27","page":"921 - 962","_id":"59","status":"public","type":"book_chapter","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:10Z","citation":{"ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27."},"editor":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Edmund M.","last_name":"Clarke","full_name":"Clarke, Edmund M."},{"last_name":"Veith","full_name":"Veith, Helmut","first_name":"Helmut"},{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"}],"title":"Graph games and reactive synthesis","department":[{"_id":"KrCh"}],"author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"}],"publist_id":"7995"},{"title":"Introduction to model checking","editor":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"ToHe"}],"publist_id":"7994","author":[{"full_name":"Clarke, Edmund","last_name":"Clarke","first_name":"Edmund"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.","apa":"Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer. https://doi.org/10.1007/978-3-319-10575-8_1","ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer; 2018:1-26. doi:10.1007/978-3-319-10575-8_1","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.","ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26."},"date_updated":"2021-01-12T08:05:35Z","status":"public","type":"book_chapter","series_title":"Handbook of Model Checking","_id":"60","doi":"10.1007/978-3-319-10575-8_1","date_published":"2018-05-19T00:00:00Z","date_created":"2018-12-11T11:44:25Z","page":"1 - 26","day":"19","language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","publication_status":"published","year":"2018","month":"05","publisher":"Springer","scopus_import":1,"quality_controlled":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking."}]},{"oa_version":"Preprint","abstract":[{"text":"We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. ","lang":"eng"}],"month":"05","publisher":"Springer","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1509.06286","open_access":"1"}],"day":"23","language":[{"iso":"eng"}],"publication":"Contemporary Computational Mathematics","publication_status":"published","year":"2018","doi":"10.1007/978-3-319-72456-0_7","date_published":"2018-05-23T00:00:00Z","date_created":"2018-12-11T11:44:25Z","page":"131 - 134","_id":"61","status":"public","type":"book_chapter","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:06:06Z","citation":{"chicago":"Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In Contemporary Computational Mathematics, 131–34. Springer, 2018. https://doi.org/10.1007/978-3-319-72456-0_7.","ista":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.","mla":"Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” Contemporary Computational Mathematics, Springer, 2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7.","apa":"Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7","ama":"Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7","ieee":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary Computational Mathematics, Springer, 2018, pp. 131–134.","short":"A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134."},"department":[{"_id":"TaHa"}],"title":"There is no strongly regular graph with parameters (460; 153; 32; 60)","author":[{"first_name":"Andriy","last_name":"Bondarenko","full_name":"Bondarenko, Andriy"},{"id":"388D3134-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Mellit","full_name":"Mellit, Anton"},{"first_name":"Andriy","last_name":"Prymak","full_name":"Prymak, Andriy"},{"full_name":"Radchenko, Danylo","last_name":"Radchenko","first_name":"Danylo"},{"last_name":"Viazovska","full_name":"Viazovska, Maryna","first_name":"Maryna"}],"publist_id":"7993","article_processing_charge":"No","external_id":{"arxiv":["1509.06286"]}},{"citation":{"mla":"McLachlan, Ian G., et al. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” PLOS Genetics, vol. 14, no. 6, e1007435, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007435.","apa":"McLachlan, I. G., Beets, I., de Bono, M., & Heiman, M. G. (2018). A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007435","ama":"McLachlan IG, Beets I, de Bono M, Heiman MG. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 2018;14(6). doi:10.1371/journal.pgen.1007435","short":"I.G. McLachlan, I. Beets, M. de Bono, M.G. Heiman, PLOS Genetics 14 (2018).","ieee":"I. G. McLachlan, I. Beets, M. de Bono, and M. G. Heiman, “A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism,” PLOS Genetics, vol. 14, no. 6. Public Library of Science, 2018.","chicago":"McLachlan, Ian G., Isabel Beets, Mario de Bono, and Maxwell G. Heiman. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007435.","ista":"McLachlan IG, Beets I, de Bono M, Heiman MG. 2018. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 14(6), e1007435."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["29879119"]},"author":[{"first_name":"Ian G.","full_name":"McLachlan, Ian G.","last_name":"McLachlan"},{"first_name":"Isabel","full_name":"Beets, Isabel","last_name":"Beets"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","first_name":"Mario","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario","last_name":"de Bono"},{"first_name":"Maxwell G.","full_name":"Heiman, Maxwell G.","last_name":"Heiman"}],"title":"A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism","article_number":"e1007435","year":"2018","has_accepted_license":"1","publication":"PLOS Genetics","day":"07","date_created":"2019-03-19T13:09:28Z","date_published":"2018-06-07T00:00:00Z","doi":"10.1371/journal.pgen.1007435","oa":1,"quality_controlled":"1","publisher":"Public Library of Science","date_updated":"2021-01-12T08:06:11Z","ddc":["570"],"extern":"1","file_date_updated":"2020-07-14T12:47:19Z","_id":"6111","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public","publication_status":"published","publication_identifier":{"issn":["1553-7404"]},"language":[{"iso":"eng"}],"file":[{"checksum":"622036b945365dbc575bea2768aa9bc8","file_id":"6112","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_PLOS_McLachlan.pdf","date_created":"2019-03-19T13:18:01Z","file_size":13011506,"date_updated":"2020-07-14T12:47:19Z","creator":"kschuh"}],"volume":14,"issue":"6","abstract":[{"lang":"eng","text":"Neurons develop elaborate morphologies that provide a model for understanding cellular architecture. By studying C. elegans sensory dendrites, we previously identified genes that act to promote the extension of ciliated sensory dendrites during embryogenesis. Interestingly, the nonciliated dendrite of the oxygen-sensing neuron URX is not affected by these genes, suggesting it develops through a distinct mechanism. Here, we use a visual forward genetic screen to identify mutants that affect URX dendrite morphogenesis. We find that disruption of the MAP kinase MAPK-15 or the βH-spectrin SMA-1 causes a phenotype opposite to what we had seen before: dendrites extend normally during embryogenesis but begin to overgrow as the animals reach adulthood, ultimately extending up to 150% of their normal length. SMA-1 is broadly expressed and acts non-cell-autonomously, while MAPK-15 is expressed in many sensory neurons including URX and acts cell-autonomously. MAPK-15 acts at the time of overgrowth, localizes at the dendrite ending, and requires its kinase activity, suggesting it acts locally in time and space to constrain dendrite growth. Finally, we find that the oxygen-sensing guanylate cyclase GCY-35, which normally localizes at the dendrite ending, is localized throughout the overgrown region, and that overgrowth can be suppressed by overexpressing GCY-35 or by genetically mimicking elevated cGMP signaling. These results suggest that overgrowth may correspond to expansion of a sensory compartment at the dendrite ending, reminiscent of the remodeling of sensory cilia or dendritic spines. Thus, in contrast to established pathways that promote dendrite growth during early development, our results reveal a distinct mechanism that constrains dendrite growth throughout the life of the animal, possibly by controlling the size of a sensory compartment at the dendrite ending."}],"oa_version":"Published Version","pmid":1,"intvolume":" 14","month":"06"}]