[{"article_number":"A38","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.","year":"2018","article_type":"original","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"oa":1,"day":"01","doi":"10.1051/0004-6361/201833106","date_published":"2018-12-01T00:00:00Z","intvolume":" 620","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Astronomy & Astrophysics","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology / methods","data analysis / stars","oscillations"],"oa_version":"Preprint","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","orcid":"0000-0003-0142-4000"},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"first_name":"G. R.","last_name":"Davies","full_name":"Davies, G. R."},{"full_name":"Mathur, S.","last_name":"Mathur","first_name":"S."},{"last_name":"Corsaro","full_name":"Corsaro, E.","first_name":"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","date_updated":"2024-10-14T11:40:17Z","citation":{"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).","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","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","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.","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.","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.","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."},"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"}],"extern":"1","type":"journal_article","quality_controlled":"1","publisher":"EDP Sciences","main_file_link":[{"url":"https://arxiv.org/abs/1809.05105","open_access":"1"}],"volume":620,"external_id":{"arxiv":["1809.05105"]},"publication_status":"published","date_created":"2022-07-18T14:37:39Z","month":"12","scopus_import":"1","_id":"11618"},{"external_id":{"arxiv":["1809.07573"]},"publication_status":"published","date_created":"2022-07-18T14:41:16Z","month":"11","scopus_import":"1","_id":"11619","extern":"1","type":"journal_article","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"}],"citation":{"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).","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","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","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.","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.","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."},"quality_controlled":"1","publisher":"EDP Sciences","main_file_link":[{"url":"https://arxiv.org/abs/1809.07573","open_access":"1"}],"volume":619,"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"],"oa_version":"Preprint","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"first_name":"D.","full_name":"Gandolfi, D.","last_name":"Gandolfi"},{"first_name":"O.","full_name":"Barragán, O.","last_name":"Barragán"},{"full_name":"Livingston, J. H.","last_name":"Livingston","first_name":"J. H."},{"last_name":"Fridlund","full_name":"Fridlund, M.","first_name":"M."},{"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"},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"last_name":"Grziwa","full_name":"Grziwa, S.","first_name":"S."},{"full_name":"Cabrera, J.","last_name":"Cabrera","first_name":"J."},{"last_name":"García","full_name":"García, R. A.","first_name":"R. A."},{"last_name":"Persson","full_name":"Persson, C. M.","first_name":"C. M."},{"last_name":"Van Eylen","full_name":"Van Eylen, V.","first_name":"V."},{"first_name":"A. P.","last_name":"Hatzes","full_name":"Hatzes, A. P."},{"first_name":"D.","full_name":"Hidalgo, D.","last_name":"Hidalgo"},{"first_name":"S.","last_name":"Albrecht","full_name":"Albrecht, S."},{"orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle"},{"last_name":"Cochran","full_name":"Cochran, W. D.","first_name":"W. D."},{"first_name":"Sz.","full_name":"Csizmadia, Sz.","last_name":"Csizmadia"},{"full_name":"Deeg, H.","last_name":"Deeg","first_name":"H."},{"first_name":"Ph.","last_name":"Eigmüller","full_name":"Eigmüller, Ph."},{"first_name":"M.","last_name":"Endl","full_name":"Endl, M."},{"full_name":"Erikson, A.","last_name":"Erikson","first_name":"A."},{"full_name":"Esposito, M.","last_name":"Esposito","first_name":"M."},{"last_name":"Guenther","full_name":"Guenther, E.","first_name":"E."},{"first_name":"J.","full_name":"Korth, J.","last_name":"Korth"},{"last_name":"Luque","full_name":"Luque, R.","first_name":"R."},{"first_name":"P.","full_name":"Montañes Rodríguez, P.","last_name":"Montañes Rodríguez"},{"first_name":"D.","full_name":"Nespral, D.","last_name":"Nespral"},{"last_name":"Nowak","full_name":"Nowak, G.","first_name":"G."},{"full_name":"Pätzold, M.","last_name":"Pätzold","first_name":"M."},{"full_name":"Prieto-Arranz, J.","last_name":"Prieto-Arranz","first_name":"J."}],"title":"TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae","date_updated":"2022-08-22T07:43:29Z","article_number":"L10","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"article_type":"letter_note","year":"2018","doi":"10.1051/0004-6361/201834289","day":"22","oa":1,"intvolume":" 619","date_published":"2018-11-22T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Astronomy & Astrophysics"},{"publisher":"Oxford University Press","main_file_link":[{"url":"https://arxiv.org/abs/1805.01860","open_access":"1"}],"volume":478,"citation":{"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.","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.","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.","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.","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","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","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."},"type":"journal_article","abstract":[{"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.","lang":"eng"}],"extern":"1","quality_controlled":"1","month":"08","issue":"4","scopus_import":"1","_id":"11620","external_id":{"arxiv":["1805.01860"]},"publication_status":"published","date_created":"2022-07-18T14:43:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Monthly Notices of the Royal Astronomical Society","article_type":"original","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"year":"2018","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.","oa":1,"doi":"10.1093/mnras/sty1390","day":"01","date_published":"2018-08-01T00:00:00Z","intvolume":" 478","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2","author":[{"last_name":"Van Eylen","full_name":"Van Eylen, V","first_name":"V"},{"last_name":"Dai","full_name":"Dai, F","first_name":"F"},{"first_name":"S","last_name":"Mathur","full_name":"Mathur, S"},{"first_name":"D","last_name":"Gandolfi","full_name":"Gandolfi, D"},{"first_name":"S","last_name":"Albrecht","full_name":"Albrecht, S"},{"full_name":"Fridlund, M","last_name":"Fridlund","first_name":"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"},{"first_name":"M","full_name":"Hjorth, M","last_name":"Hjorth"},{"first_name":"A B","last_name":"Justesen","full_name":"Justesen, A B"},{"full_name":"Livingston, J","last_name":"Livingston","first_name":"J"},{"last_name":"Lund","full_name":"Lund, M N","first_name":"M N"},{"last_name":"Pérez Hernández","full_name":"Pérez Hernández, F","first_name":"F"},{"last_name":"Prieto-Arranz","full_name":"Prieto-Arranz, J","first_name":"J"},{"first_name":"C","last_name":"Regulo","full_name":"Regulo, C"},{"last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle"},{"first_name":"M E","last_name":"Everett","full_name":"Everett, M E"},{"first_name":"T","full_name":"Hirano, T","last_name":"Hirano"},{"first_name":"D","last_name":"Nespral","full_name":"Nespral, D"},{"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"},{"last_name":"Winn","full_name":"Winn, J N","first_name":"J N"},{"first_name":"O","full_name":"Barragán, O","last_name":"Barragán"},{"last_name":"Beck","full_name":"Beck, P G","first_name":"P G"},{"first_name":"W J","last_name":"Chaplin","full_name":"Chaplin, W J"},{"first_name":"W D","last_name":"Cochran","full_name":"Cochran, W D"},{"first_name":"S","last_name":"Csizmadia","full_name":"Csizmadia, S"},{"full_name":"Deeg, H","last_name":"Deeg","first_name":"H"},{"first_name":"M","full_name":"Endl, M","last_name":"Endl"},{"first_name":"P","full_name":"Heeren, P","last_name":"Heeren"},{"first_name":"S","full_name":"Grziwa, S","last_name":"Grziwa"},{"first_name":"A P","last_name":"Hatzes","full_name":"Hatzes, A P"},{"full_name":"Hidalgo, D","last_name":"Hidalgo","first_name":"D"},{"last_name":"Korth","full_name":"Korth, J","first_name":"J"},{"first_name":"S","last_name":"Mathis","full_name":"Mathis, S"},{"first_name":"P","full_name":"Montañes Rodriguez, P","last_name":"Montañes Rodriguez"},{"full_name":"Narita, N","last_name":"Narita","first_name":"N"},{"last_name":"Patzold","full_name":"Patzold, M","first_name":"M"},{"first_name":"C M","full_name":"Persson, C M","last_name":"Persson"},{"full_name":"Rodler, F","last_name":"Rodler","first_name":"F"},{"full_name":"Smith, A M S","last_name":"Smith","first_name":"A M S"}],"page":"4866-4880","date_updated":"2022-08-22T07:45:38Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","planets and satellites: composition","planets and satellites: formation","planets and satellites: fundamental parameters"],"oa_version":"Preprint"},{"language":[{"iso":"eng"}],"status":"public","month":"11","article_processing_charge":"No","title":"FliPer: Classifying TESS pulsating stars","author":[{"full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle"},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"first_name":"G. R.","last_name":"Davies","full_name":"Davies, G. R."},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"first_name":"O. J.","last_name":"Hall","full_name":"Hall, O. J."},{"last_name":"Rendle","full_name":"Rendle, B. M.","first_name":"B. M."}],"_id":"11631","date_updated":"2022-08-22T08:41:55Z","keyword":["asteroseismology - methods","data analysis - stars","oscillations"],"external_id":{"arxiv":["1811.12140"]},"publication_status":"submitted","date_created":"2022-07-21T07:05:23Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1811.12140"}],"publication":"arXiv","arxiv":1,"article_number":"1811.12140","year":"2018","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"}],"day":"29","extern":"1","doi":"10.48550/arXiv.1811.12140","type":"preprint","citation":{"short":"L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.).","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. .","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","ista":"Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.","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.","mla":"Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140."},"oa":1,"date_published":"2018-11-29T00:00:00Z"},{"date_published":"2018-10-01T00:00:00Z","intvolume":" 23","oa":1,"day":"01","doi":"10.1145/3274662","article_type":"original","year":"2018","publication_identifier":{"issn":["1084-6654"],"eissn":["1084-6654"]},"publication":"ACM Journal of Experimental Algorithmics","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","keyword":["Theoretical Computer Science"],"date_updated":"2024-11-06T12:05:24Z","page":"1-22","author":[{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","full_name":"Noe, Alexander","last_name":"Noe"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"},{"last_name":"Strash","full_name":"Strash, Darren","first_name":"Darren"}],"title":"Practical minimum cut algorithms","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","citation":{"ista":"Henzinger M, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22.","chicago":"Henzinger, Monika, 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.","mla":"Henzinger, Monika, 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.","apa":"Henzinger, M., 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 M, 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. 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. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22."},"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."}],"extern":"1","type":"journal_article","volume":23,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.06127"}],"publisher":"Association for Computing Machinery","date_created":"2022-07-27T08:28:26Z","publication_status":"published","external_id":{"arxiv":["1708.06127"]},"_id":"11657","scopus_import":"1","month":"10"},{"arxiv":1,"publication":"ACM Transactions on Algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-04-01T00:00:00Z","intvolume":" 14","oa":1,"doi":"10.1145/3174803","day":"01","acknowledgement":"We thank the two anonymous reviewers for their suggestions and comments, which improved the\r\nquality of the article.","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"year":"2018","article_type":"original","article_number":"17","date_updated":"2024-11-06T12:05:51Z","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","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"last_name":"Thorup","full_name":"Thorup, Mikkel","first_name":"Mikkel"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","oa_version":"Preprint","volume":14,"main_file_link":[{"url":"https://arxiv.org/abs/1611.06500","open_access":"1"}],"publisher":"Association for Computing Machinery","quality_controlled":"1","citation":{"ieee":"G. Goranci, M. 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.","ama":"Goranci G, Henzinger M, 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., & 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","ista":"Goranci G, Henzinger M, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17.","chicago":"Goranci, Gramoz, Monika 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.","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.","short":"G. Goranci, M. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018)."},"abstract":[{"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.","lang":"eng"}],"type":"journal_article","extern":"1","_id":"11664","issue":"2","scopus_import":"1","month":"04","date_created":"2022-07-27T11:29:39Z","publication_status":"published","external_id":{"arxiv":["1611.06500"]}},{"external_id":{"arxiv":["1310.3153"]},"date_created":"2022-07-27T11:46:46Z","publication_status":"published","issue":"2","scopus_import":"1","month":"05","_id":"11667","quality_controlled":"1","citation":{"ieee":"P. Dütting, M. 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.","apa":"Dütting, P., Henzinger, M., & 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","ama":"Dütting P, Henzinger M, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 2018;6(2). doi:10.1145/3232860","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.","ista":"Dütting P, Henzinger M, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.","chicago":"Dütting, Paul, Monika 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.","short":"P. Dütting, M. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018)."},"extern":"1","type":"journal_article","abstract":[{"lang":"eng","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."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3153"}],"publisher":"Association for Computing Machinery","volume":6,"keyword":["Theory of computation","Algorithmic game theory and mechanism design","Applied computing","Economics","Simplified mechanisms","Combinatorial auctions with item bidding","Price of anarchy"],"oa_version":"Preprint","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"date_updated":"2024-11-06T12:06:28Z","title":"Valuation compressions in VCG-based combinatorial auctions","author":[{"full_name":"Dütting, Paul","last_name":"Dütting","first_name":"Paul"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Starnberger","full_name":"Starnberger, Martin","first_name":"Martin"}],"article_type":"original","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"year":"2018","article_number":"5","date_published":"2018-05-01T00:00:00Z","intvolume":" 6","oa":1,"doi":"10.1145/3232860","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"ACM Transactions on Economics and Computation"},{"volume":261,"publisher":"Elsevier","main_file_link":[{"url":"https://doi.org/10.1016/j.ic.2018.02.005","open_access":"1"}],"citation":{"short":"S. Bhattacharya, M. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.","ama":"Bhattacharya S, Henzinger M, 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","ieee":"S. Bhattacharya, M. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.","apa":"Bhattacharya, S., Henzinger, M., & Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005","chicago":"Bhattacharya, Sayan, Monika 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 M, 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."},"type":"journal_article","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."}],"extern":"1","quality_controlled":"1","_id":"11757","month":"08","scopus_import":"1","issue":"08","publication_status":"published","date_created":"2022-08-08T11:20:03Z","publication":"Information and Computation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"01","doi":"10.1016/j.ic.2018.02.005","date_published":"2018-08-01T00:00:00Z","intvolume":" 261","year":"2018","publication_identifier":{"issn":["0890-5401"]},"article_type":"original","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Italiano","full_name":"Italiano, Giuseppe","first_name":"Giuseppe"}],"title":"Dynamic algorithms via the primal-dual method","date_updated":"2024-11-06T08:13:33Z","page":"219-239","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","oa_version":"Published Version"},{"main_file_link":[{"url":"https://arxiv.org/abs/1512.08148","open_access":"1"}],"publisher":"Association for Computing Machinery","volume":65,"quality_controlled":"1","type":"journal_article","extern":"1","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"}],"citation":{"short":"M. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.","mla":"Henzinger, Monika, 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.","chicago":"Henzinger, Monika, 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.","ista":"Henzinger M, 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.","apa":"Henzinger, M., 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","ieee":"M. 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 M, 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"},"scopus_import":"1","issue":"6","month":"12","_id":"11768","external_id":{"arxiv":["1512.08148"]},"date_created":"2022-08-08T12:33:17Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Journal of the ACM","year":"2018","publication_identifier":{"issn":["0004-5411"],"eissn":["1557-735X"]},"article_type":"original","intvolume":" 65","date_published":"2018-12-01T00:00:00Z","doi":"10.1145/3218657","day":"01","oa":1,"article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"page":"1-40","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11855"}]},"date_updated":"2024-11-06T12:18:17Z","title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"oa_version":"Preprint"},{"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"year":"2018","article_number":"39","date_published":"2018-08-14T00:00:00Z","intvolume":" 112","oa":1,"day":"14","doi":"10.4230/LIPICS.ESA.2018.39","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"26th Annual European Symposium on Algorithms","arxiv":1,"oa_version":"Published Version","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","date_updated":"2024-11-06T11:57:41Z","title":"A tree structure for dynamic facility location","author":[{"first_name":"Gramoz ","full_name":"Goranci, Gramoz ","last_name":"Goranci"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"}],"quality_controlled":"1","citation":{"short":"G. Goranci, M. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","apa":"Goranci, G., Henzinger, M., & 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 M, 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","ieee":"G. Goranci, M. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.","ista":"Goranci G, Henzinger M, 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 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.","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."},"type":"conference","extern":"1","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."}],"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.39","open_access":"1"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":112,"external_id":{"arxiv":["1909.06653"]},"alternative_title":["LIPIcs"],"conference":{"end_date":"2018-08-22","start_date":"2018-08-20","name":"ESA: Annual European Symposium on Algorithms","location":"Helsinki, Finland"},"date_created":"2022-08-12T08:20:57Z","publication_status":"published","scopus_import":"1","month":"08","_id":"11827"},{"corr_author":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.40","open_access":"1"}],"volume":112,"citation":{"short":"G. Goranci, M. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"G. Goranci, M. 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.","apa":"Goranci, G., Henzinger, M., & 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","ama":"Goranci G, Henzinger M, 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","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.","chicago":"Goranci, Gramoz, Monika 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 M, 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."},"extern":"1","type":"conference","abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","month":"08","scopus_import":"1","_id":"11828","conference":{"end_date":"2018-08-22","start_date":"2018-08-20","location":"Helsinki, Finland","name":"ESA: Annual European Symposium on Algorithms"},"external_id":{"arxiv":["1802.09111"]},"alternative_title":["LIPIcs"],"publication_status":"published","date_created":"2022-08-12T08:26:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"26th Annual European Symposium on Algorithms","article_number":"40","year":"2018","publication_identifier":{"isbn":["9783959770811"],"issn":["1868-8969"]},"oa":1,"day":"14","doi":"10.4230/LIPICS.ESA.2018.40","date_published":"2018-08-14T00:00:00Z","intvolume":" 112","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}],"title":"Dynamic effective resistances and approximate schur complement on separable graphs","date_updated":"2024-11-06T12:16:31Z","oa_version":"Published Version"},{"extern":"1","type":"conference","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"}],"citation":{"chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika 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.","ista":"Bhattacharya S, Chakrabarty D, Henzinger M, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.","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.","ieee":"S. Bhattacharya, D. Chakrabarty, M. 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.","apa":"Bhattacharya, S., Chakrabarty, D., Henzinger, M., & 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 M, 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","short":"S. Bhattacharya, D. Chakrabarty, M. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20."},"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.04355"}],"conference":{"end_date":"2018-01-10","start_date":"2018-01-07","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms"},"external_id":{"arxiv":["1711.04355"]},"publication_status":"published","date_created":"2022-08-16T12:07:14Z","month":"01","scopus_import":"1","_id":"11872","year":"2018","publication_identifier":{"eisbn":["978-161197503-1"]},"doi":"10.1137/1.9781611975031.1","day":"01","oa":1,"date_published":"2018-01-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"29th Annual ACM-SIAM Symposium on Discrete Algorithms","oa_version":"Preprint","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","title":"Dynamic algorithms for graph coloring","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty","first_name":"Deeparnab"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"page":"1 - 20","date_updated":"2024-11-06T12:20:35Z"},{"year":"2018","publication_identifier":{"eisbn":["978-1-61197-505-5"]},"date_published":"2018-01-01T00:00:00Z","oa":1,"day":"01","doi":"10.1137/1.9781611975055.5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"20th Workshop on Algorithm Engineering and Experiments","arxiv":1,"oa_version":"Preprint","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","page":"48-61","date_updated":"2024-11-06T12:22:09Z","title":"Practical minimum cut algorithms","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"first_name":"Christian","full_name":"Schulz, Christian","last_name":"Schulz"},{"last_name":"Strash","full_name":"Strash, Darren","first_name":"Darren"}],"quality_controlled":"1","citation":{"short":"M. 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. 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.","apa":"Henzinger, M., 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 M, 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","chicago":"Henzinger, Monika, 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 M, 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, 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."},"type":"conference","abstract":[{"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.","lang":"eng"}],"extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.06127"}],"publisher":"Society for Industrial and Applied Mathematics","external_id":{"arxiv":["1708.06127"]},"conference":{"end_date":"2018-01-08","start_date":"2018-01-07","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"New Orleans, LA, United States"},"date_created":"2022-08-17T07:04:57Z","publication_status":"published","scopus_import":"1","month":"01","_id":"11882"},{"oa_version":"Preprint","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Deterministic fully dynamic data structures for vertex cover and matching","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Italiano","full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F."}],"date_updated":"2024-11-06T12:22:54Z","related_material":{"record":[{"status":"public","id":"11875","relation":"earlier_version"}]},"page":"859-887","year":"2018","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"article_type":"original","doi":"10.1137/140998925","day":"01","oa":1,"intvolume":" 47","date_published":"2018-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"SIAM Journal on Computing","external_id":{"arxiv":["1412.1318"]},"publication_status":"published","date_created":"2022-08-17T08:21:23Z","month":"05","issue":"3","scopus_import":"1","_id":"11890","extern":"1","type":"journal_article","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]."}],"citation":{"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.","chicago":"Bhattacharya, Sayan, Monika 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 M, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.","ama":"Bhattacharya S, Henzinger M, 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","ieee":"S. Bhattacharya, M. 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., & 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","short":"S. Bhattacharya, M. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887."},"quality_controlled":"1","publisher":"Society for Industrial & Applied Mathematics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.1318"}],"volume":47},{"oa_version":"Published Version","date_updated":"2024-11-06T11:57:15Z","author":[{"first_name":"Sonja","full_name":"Biedermann, Sonja","last_name":"Biedermann"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"first_name":"Bernhard","full_name":"Schuster, Bernhard","last_name":"Schuster"}],"title":"Memetic graph clustering","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"date_published":"2018-07-01T00:00:00Z","intvolume":" 103","oa":1,"day":"01","doi":"10.4230/LIPICS.SEA.2018.3","publication_identifier":{"isbn":["9783959770705"],"issn":["1868-8969"]},"year":"2018","article_number":"3","publication":"17th International Symposium on Experimental Algorithms","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-18T06:49:40Z","publication_status":"published","external_id":{"arxiv":["1802.07034"]},"alternative_title":["LIPIcs"],"conference":{"name":"SEA: Symposium on Experimental Algorithms","location":"L'Aquila, Italy","start_date":"2018-07-27","end_date":"2018-07-29"},"_id":"11911","scopus_import":"1","month":"07","quality_controlled":"1","citation":{"apa":"Biedermann, S., Henzinger, M., 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","ama":"Biedermann S, Henzinger M, 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","ieee":"S. Biedermann, M. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.","ista":"Biedermann S, Henzinger M, 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 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.","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.","short":"S. Biedermann, M. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"type":"conference","abstract":[{"lang":"eng","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."}],"extern":"1","volume":103,"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.SEA.2018.3","open_access":"1"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"citation":{"short":"B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979.","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","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","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.","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.","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."},"abstract":[{"lang":"eng","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."}],"extern":"1","type":"journal_article","pmid":1,"quality_controlled":"1","volume":57,"publisher":"Wiley","publication_status":"published","date_created":"2022-08-24T10:57:25Z","external_id":{"pmid":["29377383"]},"_id":"11958","month":"07","issue":"31","scopus_import":"1","doi":"10.1002/anie.201712568","day":"26","date_published":"2018-07-26T00:00:00Z","intvolume":" 57","article_type":"letter_note","publication_identifier":{"issn":["1433-7851"],"eissn":[" 1521-3773"]},"year":"2018","publication":"Angewandte Chemie International Edition","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","author":[{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"},{"full_name":"Shalom, Menny","last_name":"Shalom","first_name":"Menny"},{"first_name":"Markus","last_name":"Antonietti","full_name":"Antonietti, Markus"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."},{"full_name":"Gilmore, Kerry","last_name":"Gilmore","first_name":"Kerry"}],"title":"Continuous heterogeneous photocatalysis in serial micro-batch reactors","page":"9976-9979","date_updated":"2023-02-21T10:09:18Z","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No"},{"month":"08","issue":"4","scopus_import":"1","pubrep_id":"1037","_id":"12","external_id":{"isi":["000448185000096"]},"publication_status":"published","date_created":"2018-12-11T11:44:09Z","publisher":"ACM","volume":37,"department":[{"_id":"BeBi"}],"citation":{"short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 2018;37(4). doi:10.1145/3197517.3201341","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” ACM Transaction on Graphics, vol. 37, no. 4. ACM, 2018.","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., & Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. ACM. https://doi.org/10.1145/3197517.3201341","mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics, vol. 37, no. 4, 135, ACM, 2018, doi:10.1145/3197517.3201341.","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135.","chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201341."},"type":"journal_article","abstract":[{"lang":"eng","text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects."}],"quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:44:38Z","author":[{"last_name":"Nakashima","full_name":"Nakashima, Kazutaka","first_name":"Kazutaka"},{"first_name":"Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas","last_name":"Auzinger"},{"first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi","full_name":"Iarussi, Emmanuel"},{"full_name":"Zhang, Ran","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","first_name":"Ran"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd"}],"title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","date_updated":"2025-03-31T15:58:16Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/","description":"News on IST Homepage","relation":"press_release"}]},"publist_id":"8044","oa_version":"Submitted Version","project":[{"call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"},{"grant_number":"642841","name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["004","516","670"],"isi":1,"publication":"ACM Transaction on Graphics","article_number":"135","year":"2018","ec_funded":1,"file":[{"access_level":"open_access","creator":"system","file_size":104225664,"file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","date_created":"2018-12-12T10:18:38Z","content_type":"application/pdf","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","relation":"main_file","date_updated":"2020-07-14T12:44:38Z","file_id":"5360"},{"content_type":"application/zip","checksum":"3861e693ba47c51f3ec7b7867d573a61","relation":"main_file","date_updated":"2020-07-14T12:44:38Z","file_id":"5361","access_level":"open_access","creator":"system","file_size":377743553,"file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","date_created":"2018-12-12T10:18:39Z"},{"relation":"main_file","checksum":"490040c685ed869536e2a18f5a906b94","content_type":"video/vnd.objectvideo","file_id":"5362","date_updated":"2020-07-14T12:44:38Z","access_level":"open_access","file_size":162634396,"creator":"system","file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","date_created":"2018-12-12T10:18:41Z"},{"file_id":"5363","date_updated":"2020-07-14T12:44:38Z","relation":"main_file","checksum":"be7fc8b229adda727419b6504b3b9352","content_type":"image/jpeg","file_size":527972,"creator":"system","date_created":"2018-12-12T10:18:42Z","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","access_level":"open_access"}],"oa":1,"doi":"10.1145/3197517.3201341","day":"04","date_published":"2018-08-04T00:00:00Z","intvolume":" 37"},{"month":"06","scopus_import":"1","issue":"2","_id":"1215","pubrep_id":"712","external_id":{"isi":["000432743300007"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2018-12-11T11:50:45Z","publisher":"Springer","corr_author":"1","volume":31,"department":[{"_id":"JaMa"}],"citation":{"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.","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.","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.","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.","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","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826."},"abstract":[{"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.","lang":"eng"}],"type":"journal_article","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2020-07-14T12:44:39Z","author":[{"last_name":"Flandoli","full_name":"Flandoli, Franco","first_name":"Franco"},{"first_name":"Francesco","full_name":"Russo, Francesco","last_name":"Russo"},{"first_name":"Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","last_name":"Zanco","full_name":"Zanco, Giovanni A"}],"title":"Infinite-dimensional calculus under weak spatial regularity of the processes","date_updated":"2025-09-22T09:36:02Z","page":"789-826","publist_id":"6119","oa_version":"Published Version","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["519"],"isi":1,"publication":"Journal of Theoretical Probability","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.","year":"2018","oa":1,"file":[{"file_id":"5266","date_updated":"2020-07-14T12:44:39Z","relation":"main_file","checksum":"47686d58ec21c164540f1a980ff2163f","content_type":"application/pdf","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_created":"2018-12-12T10:17:13Z","file_size":671125,"creator":"system","access_level":"open_access"}],"doi":"10.1007/s10959-016-0724-2","day":"01","date_published":"2018-06-01T00:00:00Z","intvolume":" 31"},{"external_id":{"arxiv":["1604.08269"],"isi":["000457843603087"]},"conference":{"end_date":"2018-06-22","start_date":"2018-06-18","location":"Salt Lake City, UT, USA","name":"CVPR: Conference on Computer Vision and Pattern Recognition"},"date_created":"2018-12-11T11:45:33Z","publication_status":"published","scopus_import":"1","month":"06","_id":"273","quality_controlled":"1","citation":{"mla":"Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.","ista":"Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 3693–3701.","chicago":"Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.","ama":"Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389","ieee":"P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.","apa":"Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M. P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt Lake City, UT, USA: IEEE. https://doi.org/10.1109/cvpr.2018.00389","short":"P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701."},"type":"conference","abstract":[{"text":"The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG). Given a set of positive and negative samples, the parameters of a retrieval system can be estimated by minimizing these loss functions. However, the non-differentiability and non-decomposability of these loss functions does not allow for simple gradient based optimization algorithms. This issue is generally circumvented by either optimizing a structured hinge-loss upper bound to the loss function or by using asymptotic methods like the direct-loss minimization framework. Yet, the high computational complexity of loss-augmented inference, which is necessary for both the frameworks, prohibits its use in large training data sets. To alleviate this deficiency, we present a novel quicksort flavored algorithm for a large class of non-decomposable loss functions. We provide a complete characterization of the loss functions that are amenable to our algorithm, and show that it includes both AP and NDCG based loss functions. Furthermore, we prove that no comparison based algorithm can improve upon the computational complexity of our approach asymptotically. We demonstrate the effectiveness of our approach in the context of optimizing the structured hinge loss upper bound of AP and NDCG loss for learning models for a variety of vision tasks. We show that our approach provides significantly better results than simpler decomposable loss functions, while requiring a comparable training time.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.08269","open_access":"1"}],"publisher":"IEEE","department":[{"_id":"VlKo"}],"oa_version":"Preprint","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"page":"3693-3701","date_updated":"2024-11-04T13:52:32Z","title":"Efficient optimization for rank-based loss functions","author":[{"full_name":"Mohapatra, Pritish","last_name":"Mohapatra","first_name":"Pritish"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","full_name":"Rolinek, Michal","first_name":"Michal"},{"last_name":"Jawahar","full_name":"Jawahar, C V","first_name":"C V"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"M Pawan","last_name":"Kumar","full_name":"Kumar, M Pawan"}],"publication_identifier":{"isbn":["9781538664209"]},"year":"2018","ec_funded":1,"date_published":"2018-06-28T00:00:00Z","oa":1,"doi":"10.1109/cvpr.2018.00389","day":"28","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"isi":1,"arxiv":1,"publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition"},{"citation":{"ama":"Brown M, Johnson L, Leone D, et al. Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. 2018;217(6):2205-2221. doi:10.1083/jcb.201612051","ieee":"M. Brown et al., “Lymphatic exosomes promote dendritic cell migration along guidance cues,” Journal of Cell Biology, vol. 217, no. 6. Rockefeller University Press, pp. 2205–2221, 2018.","apa":"Brown, M., Johnson, L., Leone, D., Májek, P., Vaahtomeri, K., Senfter, D., … Kerjaschki, D. (2018). Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201612051","chicago":"Brown, Markus, Louise Johnson, Dario Leone, Peter Májek, Kari Vaahtomeri, Daniel Senfter, Nora Bukosza, et al. “Lymphatic Exosomes Promote Dendritic Cell Migration along Guidance Cues.” Journal of Cell Biology. Rockefeller University Press, 2018. https://doi.org/10.1083/jcb.201612051.","ista":"Brown M, Johnson L, Leone D, Májek P, Vaahtomeri K, Senfter D, Bukosza N, Schachner H, Asfour G, Langer B, Hauschild R, Parapatics K, Hong Y, Bennett K, Kain R, Detmar M, Sixt MK, Jackson D, Kerjaschki D. 2018. Lymphatic exosomes promote dendritic cell migration along guidance cues. Journal of Cell Biology. 217(6), 2205–2221.","mla":"Brown, Markus, et al. “Lymphatic Exosomes Promote Dendritic Cell Migration along Guidance Cues.” Journal of Cell Biology, vol. 217, no. 6, Rockefeller University Press, 2018, pp. 2205–21, doi:10.1083/jcb.201612051.","short":"M. Brown, L. Johnson, D. Leone, P. Májek, K. Vaahtomeri, D. Senfter, N. Bukosza, H. Schachner, G. Asfour, B. Langer, R. Hauschild, K. Parapatics, Y. Hong, K. Bennett, R. Kain, M. Detmar, M.K. Sixt, D. Jackson, D. Kerjaschki, Journal of Cell Biology 217 (2018) 2205–2221."},"pmid":1,"abstract":[{"text":"Lymphatic endothelial cells (LECs) release extracellular chemokines to guide the migration of dendritic cells. In this study, we report that LECs also release basolateral exosome-rich endothelial vesicles (EEVs) that are secreted in greater numbers in the presence of inflammatory cytokines and accumulate in the perivascular stroma of small lymphatic vessels in human chronic inflammatory diseases. Proteomic analyses of EEV fractions identified > 1,700 cargo proteins and revealed a dominant motility-promoting protein signature. In vitro and ex vivo EEV fractions augmented cellular protrusion formation in a CX3CL1/fractalkine-dependent fashion and enhanced the directional migratory response of human dendritic cells along guidance cues. We conclude that perilymphatic LEC exosomes enhance exploratory behavior and thus promote directional migration of CX3CR1-expressing cells in complex tissue environments.","lang":"eng"}],"type":"journal_article","quality_controlled":"1","volume":217,"department":[{"_id":"MiSi"},{"_id":"Bio"}],"publisher":"Rockefeller University Press","corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2018-12-11T11:45:33Z","external_id":{"pmid":["29650776"],"isi":["000438077800026"]},"_id":"275","month":"04","scopus_import":"1","issue":"6","file":[{"creator":"dernst","file_size":2252043,"file_name":"2018_JournalCellBiology_Brown.pdf","date_created":"2018-12-17T12:50:07Z","access_level":"open_access","date_updated":"2020-07-14T12:45:45Z","file_id":"5704","checksum":"9c7eba51a35c62da8c13f98120b64df4","content_type":"application/pdf","relation":"main_file"}],"oa":1,"day":"12","doi":"10.1083/jcb.201612051","date_published":"2018-04-12T00:00:00Z","intvolume":" 217","year":"2018","acknowledgement":"M. Brown was supported by the Cell Communication in Health and Disease Graduate Study Program of the Austrian Science Fund and Medizinische Universität Wien, M. Sixt by the European Research Council (ERC GA 281556) and an Austrian Science Fund START award, K.L. Bennett by the Austrian Academy of Sciences, D.G. Jackson and L.A. Johnson by Unit Funding (MC_UU_12010/2) and project grants from the Medical Research Council (G1100134 and MR/L008610/1), and M. Detmar by the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung and Advanced European Research Council grant LYVICAM. K. Vaahtomeri was supported by an Academy of Finland postdoctoral research grant (287853). This project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No. 668036 (RELENT).","ec_funded":1,"isi":1,"publication":"Journal of Cell Biology","project":[{"call_identifier":"FWF","grant_number":"Y 564-B12","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes"},{"grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["570"],"publist_id":"7627","oa_version":"Published Version","title":"Lymphatic exosomes promote dendritic cell migration along guidance cues","author":[{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","full_name":"Brown, Markus","first_name":"Markus"},{"full_name":"Johnson, Louise","last_name":"Johnson","first_name":"Louise"},{"first_name":"Dario","full_name":"Leone, Dario","last_name":"Leone"},{"first_name":"Peter","full_name":"Májek, Peter","last_name":"Májek"},{"id":"368EE576-F248-11E8-B48F-1D18A9856A87","last_name":"Vaahtomeri","full_name":"Vaahtomeri, Kari","orcid":"0000-0001-7829-3518","first_name":"Kari"},{"last_name":"Senfter","full_name":"Senfter, Daniel","first_name":"Daniel"},{"full_name":"Bukosza, Nora","last_name":"Bukosza","first_name":"Nora"},{"last_name":"Schachner","full_name":"Schachner, Helga","first_name":"Helga"},{"first_name":"Gabriele","full_name":"Asfour, Gabriele","last_name":"Asfour"},{"first_name":"Brigitte","full_name":"Langer, Brigitte","last_name":"Langer"},{"first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","full_name":"Hauschild, Robert"},{"first_name":"Katja","full_name":"Parapatics, Katja","last_name":"Parapatics"},{"first_name":"Young","last_name":"Hong","full_name":"Hong, Young"},{"first_name":"Keiryn","full_name":"Bennett, Keiryn","last_name":"Bennett"},{"last_name":"Kain","full_name":"Kain, Renate","first_name":"Renate"},{"full_name":"Detmar, Michael","last_name":"Detmar","first_name":"Michael"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"first_name":"David","last_name":"Jackson","full_name":"Jackson, David"},{"first_name":"Dontscho","last_name":"Kerjaschki","full_name":"Kerjaschki, Dontscho"}],"date_updated":"2025-04-14T13:10:20Z","page":"2205 - 2221","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:45Z"}]