--- _id: '11584' abstract: - lang: eng text: Observations show that star-forming galaxies reside on a tight 3D plane between mass, gas-phase metallicity, and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5 M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass, SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted towards late times, are more α-enhanced, and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements. acknowledgement: We thank the anonymous referee for their constructive comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge the use of the TOPCAT software (Taylor 2013) for assisting in rapid exploration of multidimensional data sets and the use of PYTHON and its NUMPY, MATPLOTLIB, and PANDAS packages. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Joop full_name: Schaye, Joop last_name: Schaye citation: ama: 'Matthee JJ, Schaye J. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 2018;479(1):L34-L39. doi:10.1093/mnrasl/sly093' apa: 'Matthee, J. J., & Schaye, J. (2018). Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press. https://doi.org/10.1093/mnrasl/sly093' chicago: 'Matthee, Jorryt J, and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press, 2018. https://doi.org/10.1093/mnrasl/sly093.' ieee: 'J. J. Matthee and J. Schaye, “Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement,” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1. Oxford University Press, pp. L34–L39, 2018.' ista: 'Matthee JJ, Schaye J. 2018. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 479(1), L34–L39.' mla: 'Matthee, Jorryt J., and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1, Oxford University Press, 2018, pp. L34–39, doi:10.1093/mnrasl/sly093.' short: 'J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society: Letters 479 (2018) L34–L39.' date_created: 2022-07-14T12:49:47Z date_published: 2018-09-01T00:00:00Z date_updated: 2024-10-14T11:37:53Z day: '01' doi: 10.1093/mnrasl/sly093 extern: '1' external_id: arxiv: - '1802.06786' intvolume: ' 479' issue: '1' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: abundances' - 'galaxies: evolution' - 'galaxies: formation' - 'galaxies: star formation' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.06786 month: '09' oa: 1 oa_version: Preprint page: L34 - L39 publication: 'Monthly Notices of the Royal Astronomical Society: Letters' publication_identifier: eissn: - 1745-3933 issn: - 1745-3925 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 479 year: '2018' ... --- _id: '11618' abstract: - lang: eng 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. 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. article_number: A38 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: R. A. full_name: García, R. A. last_name: García - first_name: G. R. full_name: Davies, G. R. last_name: Davies - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: E. full_name: Corsaro, E. last_name: Corsaro - first_name: O. J. full_name: Hall, O. J. last_name: Hall - first_name: B. M. full_name: Rendle, B. M. last_name: Rendle citation: ama: 'Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. 2018;620. doi:10.1051/0004-6361/201833106' apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall, O. J., & Rendle, B. M. (2018). FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833106' 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.' 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.' 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.' 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.' 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). date_created: 2022-07-18T14:37:39Z date_published: 2018-12-01T00:00:00Z date_updated: 2024-10-14T11:40:17Z day: '01' doi: 10.1051/0004-6361/201833106 extern: '1' external_id: arxiv: - '1809.05105' intvolume: ' 620' keyword: - Space and Planetary Science - Astronomy and Astrophysics - asteroseismology / methods - data analysis / stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.05105 month: '12' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 620 year: '2018' ... --- _id: '11619' abstract: - lang: eng 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. article_number: L10 article_processing_charge: No article_type: letter_note arxiv: 1 author: - first_name: D. full_name: Gandolfi, D. last_name: Gandolfi - first_name: O. full_name: Barragán, O. last_name: Barragán - first_name: J. H. full_name: Livingston, J. H. last_name: Livingston - first_name: M. full_name: Fridlund, M. last_name: Fridlund - first_name: A. B. full_name: Justesen, A. B. last_name: Justesen - first_name: S. full_name: Redfield, S. last_name: Redfield - first_name: L. full_name: Fossati, L. last_name: Fossati - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: S. full_name: Grziwa, S. last_name: Grziwa - first_name: J. full_name: Cabrera, J. last_name: Cabrera - first_name: R. A. full_name: García, R. A. last_name: García - first_name: C. M. full_name: Persson, C. M. last_name: Persson - first_name: V. full_name: Van Eylen, V. last_name: Van Eylen - first_name: A. P. full_name: Hatzes, A. P. last_name: Hatzes - first_name: D. full_name: Hidalgo, D. last_name: Hidalgo - first_name: S. full_name: Albrecht, S. last_name: Albrecht - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: W. D. full_name: Cochran, W. D. last_name: Cochran - first_name: Sz. full_name: Csizmadia, Sz. last_name: Csizmadia - first_name: H. full_name: Deeg, H. last_name: Deeg - first_name: Ph. full_name: Eigmüller, Ph. last_name: Eigmüller - first_name: M. full_name: Endl, M. last_name: Endl - first_name: A. full_name: Erikson, A. last_name: Erikson - first_name: M. full_name: Esposito, M. last_name: Esposito - first_name: E. full_name: Guenther, E. last_name: Guenther - first_name: J. full_name: Korth, J. last_name: Korth - first_name: R. full_name: Luque, R. last_name: Luque - 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 - first_name: G. full_name: Nowak, G. last_name: Nowak - first_name: M. full_name: Pätzold, M. last_name: Pätzold - first_name: J. full_name: Prieto-Arranz, J. last_name: Prieto-Arranz citation: 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' 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.' 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.' 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.' 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). date_created: 2022-07-18T14:41:16Z date_published: 2018-11-22T00:00:00Z date_updated: 2022-08-22T07:43:29Z day: '22' doi: 10.1051/0004-6361/201834289 extern: '1' external_id: arxiv: - '1809.07573' intvolume: ' 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 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.07573 month: '11' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 619 year: '2018' ... --- _id: '11620' abstract: - lang: eng text: We report the discovery and characterization of HD 89345b (K2-234b; EPIC 248777106b), a Saturn-sized planet orbiting a slightly evolved star. HD 89345 is a bright star (V = 9.3 mag) observed by the K2 mission with 1 min time sampling. It exhibits solar-like oscillations. We conducted asteroseismology to determine the parameters of the star, finding the mass and radius to be 1.12+0.04−0.01M⊙ and 1.657+0.020−0.004R⊙⁠, respectively. The star appears to have recently left the main sequence, based on the inferred age, 9.4+0.4−1.3Gyr⁠, and the non-detection of mixed modes. The star hosts a ‘warm Saturn’ (P = 11.8 d, Rp = 6.86 ± 0.14 R⊕). Radial-velocity follow-up observations performed with the FIbre-fed Echelle Spectrograph, HARPS, and HARPS-N spectrographs show that the planet has a mass of 35.7 ± 3.3 M⊕. The data also show that the planet’s orbit is eccentric (e ≈ 0.2). An investigation of the rotational splitting of the oscillation frequencies of the star yields no conclusive evidence on the stellar inclination angle. We further obtained Rossiter–McLaughlin observations, which result in a broad posterior of the stellar obliquity. The planet seems to confirm to the same patterns that have been observed for other sub-Saturns regarding planet mass and multiplicity, orbital eccentricity, and stellar metallicity. 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.' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: V full_name: Van Eylen, V last_name: Van Eylen - first_name: F full_name: Dai, F last_name: Dai - first_name: S full_name: Mathur, S last_name: Mathur - first_name: D full_name: Gandolfi, D last_name: Gandolfi - first_name: S full_name: Albrecht, S last_name: Albrecht - first_name: M full_name: Fridlund, M last_name: Fridlund - first_name: R A full_name: García, R A last_name: García - first_name: E full_name: Guenther, E last_name: Guenther - first_name: M full_name: Hjorth, M last_name: Hjorth - first_name: A B full_name: Justesen, A B last_name: Justesen - first_name: J full_name: Livingston, J last_name: Livingston - first_name: M N full_name: Lund, M N last_name: Lund - first_name: F full_name: Pérez Hernández, F last_name: Pérez Hernández - first_name: J full_name: Prieto-Arranz, J last_name: Prieto-Arranz - first_name: C full_name: Regulo, C last_name: Regulo - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: M E full_name: Everett, M E last_name: Everett - first_name: T full_name: Hirano, T last_name: Hirano - first_name: D full_name: Nespral, D last_name: Nespral - first_name: G full_name: Nowak, G last_name: Nowak - first_name: E full_name: Palle, E last_name: Palle - first_name: V full_name: Silva Aguirre, V last_name: Silva Aguirre - first_name: T full_name: Trifonov, T last_name: Trifonov - first_name: J N full_name: Winn, J N last_name: Winn - first_name: O full_name: Barragán, O last_name: Barragán - first_name: P G full_name: Beck, P G last_name: Beck - first_name: W J full_name: Chaplin, W J last_name: Chaplin - first_name: W D full_name: Cochran, W D last_name: Cochran - first_name: S full_name: Csizmadia, S last_name: Csizmadia - first_name: H full_name: Deeg, H last_name: Deeg - 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 full_name: Hatzes, A P last_name: Hatzes - first_name: D full_name: Hidalgo, D last_name: Hidalgo - first_name: J full_name: Korth, J last_name: Korth - first_name: S full_name: Mathis, S last_name: Mathis - first_name: P full_name: Montañes Rodriguez, P last_name: Montañes Rodriguez - first_name: N full_name: Narita, N last_name: Narita - first_name: M full_name: Patzold, M last_name: Patzold - first_name: C M full_name: Persson, C M last_name: Persson - first_name: F full_name: Rodler, F last_name: Rodler - first_name: A M S full_name: Smith, A M S last_name: Smith citation: 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' 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.' ista: 'Van Eylen V, Dai F, Mathur S, Gandolfi D, Albrecht S, Fridlund M, García RA, Guenther E, Hjorth M, Justesen AB, Livingston J, Lund MN, Pérez Hernández F, Prieto-Arranz J, Regulo C, Bugnet LA, Everett ME, Hirano T, Nespral D, Nowak G, Palle E, Silva Aguirre V, Trifonov T, Winn JN, Barragán O, Beck PG, Chaplin WJ, Cochran WD, Csizmadia S, Deeg H, Endl M, Heeren P, Grziwa S, Hatzes AP, Hidalgo D, Korth J, Mathis S, Montañes Rodriguez P, Narita N, Patzold M, Persson CM, Rodler F, Smith AMS. 2018. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 478(4), 4866–4880.' mla: 'Van Eylen, V., et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4, Oxford University Press, 2018, pp. 4866–80, doi:10.1093/mnras/sty1390.' 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. date_created: 2022-07-18T14:43:17Z date_published: 2018-08-01T00:00:00Z date_updated: 2022-08-22T07:45:38Z day: '01' doi: 10.1093/mnras/sty1390 extern: '1' external_id: arxiv: - '1805.01860' intvolume: ' 478' issue: '4' keyword: - Space and Planetary Science - Astronomy and Astrophysics - asteroseismology - 'planets and satellites: composition' - 'planets and satellites: formation' - 'planets and satellites: fundamental parameters' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1805.01860 month: '08' oa: 1 oa_version: Preprint page: 4866-4880 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: 'HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 478 year: '2018' ... --- _id: '11631' abstract: - lang: eng 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." article_number: '1811.12140' article_processing_charge: No arxiv: 1 author: - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: R. A. full_name: García, R. A. last_name: García - first_name: G. R. full_name: Davies, G. R. last_name: Davies - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: O. J. full_name: Hall, O. J. last_name: Hall - first_name: B. M. full_name: Rendle, B. M. last_name: Rendle citation: 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' 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' 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.' 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. .' ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.' mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.' short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.). date_created: 2022-07-21T07:05:23Z date_published: 2018-11-29T00:00:00Z date_updated: 2022-08-22T08:41:55Z day: '29' doi: 10.48550/arXiv.1811.12140 extern: '1' external_id: arxiv: - '1811.12140' keyword: - asteroseismology - methods - data analysis - stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.1811.12140' month: '11' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: 'FliPer: Classifying TESS pulsating stars' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11657' 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. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: 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 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 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. 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. ista: Henzinger M, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22. 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. short: M. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22. date_created: 2022-07-27T08:28:26Z date_published: 2018-10-01T00:00:00Z date_updated: 2024-11-06T12:05:24Z day: '01' doi: 10.1145/3274662 extern: '1' external_id: arxiv: - '1708.06127' intvolume: ' 23' keyword: - Theoretical Computer Science language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.06127 month: '10' oa: 1 oa_version: Preprint page: 1-22 publication: ACM Journal of Experimental Algorithmics publication_identifier: eissn: - 1084-6654 issn: - 1084-6654 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Practical minimum cut algorithms type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2018' ... --- _id: '11664' abstract: - lang: eng text: "We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function." acknowledgement: "We thank the two anonymous reviewers for their suggestions and comments, which improved the\r\nquality of the article." article_number: '17' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Mikkel full_name: Thorup, Mikkel last_name: Thorup citation: 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 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. 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. ista: Goranci G, Henzinger M, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17. 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). date_created: 2022-07-27T11:29:39Z date_published: 2018-04-01T00:00:00Z date_updated: 2024-11-06T12:05:51Z day: '01' doi: 10.1145/3174803 extern: '1' external_id: arxiv: - '1611.06500' intvolume: ' 14' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1611.06500 month: '04' oa: 1 oa_version: Preprint publication: ACM Transactions on Algorithms publication_identifier: eissn: - 1549-6333 issn: - 1549-6325 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Incremental exact min-cut in polylogarithmic amortized update time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2018' ... --- _id: '11667' 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. article_number: '5' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Paul full_name: Dütting, Paul last_name: Dütting - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Martin full_name: Starnberger, Martin last_name: Starnberger citation: 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 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 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. 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. 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. 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. short: P. Dütting, M. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018). date_created: 2022-07-27T11:46:46Z date_published: 2018-05-01T00:00:00Z date_updated: 2024-11-06T12:06:28Z day: '01' doi: 10.1145/3232860 extern: '1' external_id: arxiv: - '1310.3153' intvolume: ' 6' issue: '2' keyword: - Theory of computation - Algorithmic game theory and mechanism design - Applied computing - Economics - Simplified mechanisms - Combinatorial auctions with item bidding - Price of anarchy language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1310.3153 month: '05' oa: 1 oa_version: Preprint publication: ACM Transactions on Economics and Computation publication_identifier: eissn: - 2167-8383 issn: - 2167-8375 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Valuation compressions in VCG-based combinatorial auctions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2018' ... --- _id: '11757' 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. article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Giuseppe full_name: Italiano, Giuseppe last_name: Italiano citation: 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 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. 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. 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. short: S. Bhattacharya, M. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239. date_created: 2022-08-08T11:20:03Z date_published: 2018-08-01T00:00:00Z date_updated: 2024-11-06T08:13:33Z day: '01' doi: 10.1016/j.ic.2018.02.005 extern: '1' intvolume: ' 261' issue: '08' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.ic.2018.02.005 month: '08' oa: 1 oa_version: Published Version page: 219-239 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms via the primal-dual method type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 261 year: '2018' ... --- _id: '11768' abstract: - lang: eng 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." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: 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 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 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. 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. 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. 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. short: M. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40. date_created: 2022-08-08T12:33:17Z date_published: 2018-12-01T00:00:00Z date_updated: 2024-11-06T12:18:17Z day: '01' doi: 10.1145/3218657 extern: '1' external_id: arxiv: - '1512.08148' intvolume: ' 65' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1512.08148 month: '12' oa: 1 oa_version: Preprint page: 1-40 publication: Journal of the ACM publication_identifier: eissn: - 1557-735X issn: - 0004-5411 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '11855' relation: earlier_version status: public scopus_import: '1' status: public title: Decremental single-source shortest paths on undirected graphs in near-linear total update time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 65 year: '2018' ... --- _id: '11827' 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. alternative_title: - LIPIcs article_number: '39' article_processing_charge: No arxiv: 1 author: - first_name: 'Gramoz ' full_name: 'Goranci, Gramoz ' last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Dariusz full_name: Leniowski, Dariusz last_name: Leniowski citation: 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' 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' 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. 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.' 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. short: G. Goranci, M. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 date_created: 2022-08-12T08:20:57Z date_published: 2018-08-14T00:00:00Z date_updated: 2024-11-06T11:57:41Z day: '14' doi: 10.4230/LIPICS.ESA.2018.39 extern: '1' external_id: arxiv: - '1909.06653' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.39 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: A tree structure for dynamic facility location type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11828' abstract: - lang: eng text: "We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false." alternative_title: - LIPIcs article_number: '40' article_processing_charge: No arxiv: 1 author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Pan full_name: Peng, Pan last_name: Peng citation: 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' 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' 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. 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. 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.' 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. short: G. Goranci, M. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 corr_author: '1' date_created: 2022-08-12T08:26:42Z date_published: 2018-08-14T00:00:00Z date_updated: 2024-11-06T12:16:31Z day: '14' doi: 10.4230/LIPICS.ESA.2018.40 extern: '1' external_id: arxiv: - '1802.09111' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.40 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Dynamic effective resistances and approximate schur complement on separable graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11872' abstract: - lang: eng 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]. article_processing_charge: No arxiv: 1 author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Deeparnab full_name: Chakrabarty, Deeparnab last_name: Chakrabarty - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: 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' 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' 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. 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. 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. 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. conference: end_date: 2018-01-10 location: New Orleans, LA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2018-01-07 date_created: 2022-08-16T12:07:14Z date_published: 2018-01-01T00:00:00Z date_updated: 2024-11-06T12:20:35Z day: '01' doi: 10.1137/1.9781611975031.1 extern: '1' external_id: arxiv: - '1711.04355' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.04355 month: '01' oa: 1 oa_version: Preprint page: 1 - 20 publication: 29th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-161197503-1 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms for graph coloring type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11882' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability. article_processing_charge: No arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: 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' 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' 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. 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. 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. 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. conference: end_date: 2018-01-08 location: New Orleans, LA, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2018-01-07 date_created: 2022-08-17T07:04:57Z date_published: 2018-01-01T00:00:00Z date_updated: 2024-11-06T12:22:09Z day: '01' doi: 10.1137/1.9781611975055.5 extern: '1' external_id: arxiv: - '1708.06127' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.06127 month: '01' oa: 1 oa_version: Preprint page: 48-61 publication: 20th Workshop on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-505-5 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Practical minimum cut algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11890' 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 \U0001D43A=(\U0001D449,\U0001D438), with |\U0001D449|=\U0001D45B and |\U0001D438|=\U0001D45A, in \U0001D45C(\U0001D45A‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+\U0001D716) approximation in \U0001D442(log\U0001D45B/\U0001D7162) amortized time per update. For maximum matching, we show how to maintain a (3+\U0001D716) approximation in \U0001D442(min(\U0001D45B√/\U0001D716,\U0001D45A1/3/\U0001D7162) amortized time per update and a (4+\U0001D716) approximation in \U0001D442(\U0001D45A1/3/\U0001D7162) 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]." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Giuseppe F. full_name: Italiano, Giuseppe F. last_name: Italiano citation: 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 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 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. 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. 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. mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925. short: S. Bhattacharya, M. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887. date_created: 2022-08-17T08:21:23Z date_published: 2018-05-01T00:00:00Z date_updated: 2024-11-06T12:22:54Z day: '01' doi: 10.1137/140998925 extern: '1' external_id: arxiv: - '1412.1318' intvolume: ' 47' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1412.1318 month: '05' oa: 1 oa_version: Preprint page: 859-887 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' related_material: record: - id: '11875' relation: earlier_version status: public scopus_import: '1' status: public title: Deterministic fully dynamic data structures for vertex cover and matching type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2018' ... --- _id: '11911' 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. alternative_title: - LIPIcs article_number: '3' article_processing_charge: No arxiv: 1 author: - first_name: Sonja full_name: Biedermann, Sonja last_name: Biedermann - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Bernhard full_name: Schuster, Bernhard last_name: Schuster citation: 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' 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' 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. 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.' 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. conference: end_date: 2018-07-29 location: L'Aquila, Italy name: 'SEA: Symposium on Experimental Algorithms' start_date: 2018-07-27 date_created: 2022-08-18T06:49:40Z date_published: 2018-07-01T00:00:00Z date_updated: 2024-11-06T11:57:15Z day: '01' doi: 10.4230/LIPICS.SEA.2018.3 extern: '1' external_id: arxiv: - '1802.07034' intvolume: ' 103' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPICS.SEA.2018.3 month: '07' oa: 1 oa_version: Published Version publication: 17th International Symposium on Experimental Algorithms publication_identifier: isbn: - '9783959770705' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Memetic graph clustering type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 103 year: '2018' ... --- _id: '12' 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. article_number: '135' article_processing_charge: No author: - first_name: Kazutaka full_name: Nakashima, Kazutaka last_name: Nakashima - first_name: Thomas full_name: Auzinger, Thomas id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Emmanuel full_name: Iarussi, Emmanuel id: 33F19F16-F248-11E8-B48F-1D18A9856A87 last_name: Iarussi - first_name: Ran full_name: Zhang, Ran id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0002-3808-281X - first_name: Takeo full_name: Igarashi, Takeo last_name: Igarashi - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: 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' 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' 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.' 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.' 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.' 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.' short: K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018). date_created: 2018-12-11T11:44:09Z date_published: 2018-08-04T00:00:00Z date_updated: 2025-03-31T15:58:16Z day: '04' ddc: - '004' - '516' - '670' department: - _id: BeBi doi: 10.1145/3197517.3201341 ec_funded: 1 external_id: isi: - '000448185000096' file: - access_level: open_access checksum: 6a5368bc86c4e1a9fcfe588fd1f14ee8 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:38Z date_updated: 2020-07-14T12:44:38Z file_id: '5360' file_name: IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf file_size: 104225664 relation: main_file - access_level: open_access checksum: 3861e693ba47c51f3ec7b7867d573a61 content_type: application/zip creator: system date_created: 2018-12-12T10:18:39Z date_updated: 2020-07-14T12:44:38Z file_id: '5361' file_name: IST-2018-1037-v1+2_CoreCavity-Supplemental.zip file_size: 377743553 relation: main_file - access_level: open_access checksum: 490040c685ed869536e2a18f5a906b94 content_type: video/vnd.objectvideo creator: system date_created: 2018-12-12T10:18:41Z date_updated: 2020-07-14T12:44:38Z file_id: '5362' file_name: IST-2018-1037-v1+3_CoreCavity-Video.mp4 file_size: 162634396 relation: main_file - access_level: open_access checksum: be7fc8b229adda727419b6504b3b9352 content_type: image/jpeg creator: system date_created: 2018-12-12T10:18:42Z date_updated: 2020-07-14T12:44:38Z file_id: '5363' file_name: IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg file_size: 527972 relation: main_file file_date_updated: 2020-07-14T12:44:38Z has_accepted_license: '1' intvolume: ' 37' isi: 1 issue: '4' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' - _id: 2508E324-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '642841' name: Distributed 3D Object Design publication: ACM Transaction on Graphics publication_status: published publisher: ACM publist_id: '8044' pubrep_id: '1037' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/ scopus_import: '1' status: public title: 'CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds' type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 37 year: '2018' ... --- _id: '22' abstract: - lang: eng text: Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems. article_processing_charge: No article_type: original author: - first_name: Gabriel full_name: Botello, Gabriel last_name: Botello - first_name: Florian full_name: Sedlmeir, Florian last_name: Sedlmeir - first_name: Alfredo R full_name: Rueda Sanchez, Alfredo R id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87 last_name: Rueda Sanchez orcid: 0000-0001-6249-5860 - first_name: Kerlos full_name: Abdalmalak, Kerlos last_name: Abdalmalak - first_name: Elliott full_name: Brown, Elliott last_name: Brown - first_name: Gerd full_name: Leuchs, Gerd last_name: Leuchs - first_name: Sascha full_name: Preu, Sascha last_name: Preu - first_name: Daniel full_name: Segovia Vargas, Daniel last_name: Segovia Vargas - first_name: Dmitry full_name: Strekalov, Dmitry last_name: Strekalov - first_name: Luis full_name: Munoz, Luis last_name: Munoz - first_name: Harald full_name: Schwefel, Harald last_name: Schwefel citation: ama: Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210 apa: Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. https://doi.org/10.1364/OPTICA.5.001210 chicago: Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, 2018. https://doi.org/10.1364/OPTICA.5.001210. ieee: G. Botello et al., “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” Optica, vol. 5, no. 10. pp. 1210–1219, 2018. ista: Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219. mla: Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10, 2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210. short: G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219. date_created: 2018-12-11T11:44:12Z date_published: 2018-10-20T00:00:00Z date_updated: 2026-06-18T18:32:20Z day: '20' ddc: - '530' department: - _id: JoFi doi: 10.1364/OPTICA.5.001210 external_id: isi: - '000447853100007' intvolume: ' 5' isi: 1 issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: 'www.doi.org/10.1364/OPTICA.5.001210 ' month: '10' oa: 1 oa_version: Published Version page: 1210-1219 publication: Optica publication_identifier: issn: - 2334-2536 publication_status: published publist_id: '8033' quality_controlled: '1' scopus_import: '1' status: public title: Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2018' ... --- _id: '23' abstract: - lang: eng text: The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices. acknowledged_ssus: - _id: M-Shop - _id: NanoFab article_processing_charge: No author: - first_name: Lada full_name: Vukušić, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukušić orcid: 0000-0003-2424-8636 - first_name: Josip full_name: Kukucka, Josip id: 3F5D8856-F248-11E8-B48F-1D18A9856A87 last_name: Kukucka - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger - first_name: Joshua M full_name: Milem, Joshua M id: 4CDE0A96-F248-11E8-B48F-1D18A9856A87 last_name: Milem - first_name: Friedrich full_name: Schäffler, Friedrich last_name: Schäffler - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217 apa: Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., & Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217 chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217. ieee: L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018. ista: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018. Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145. mla: Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217. short: L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145. date_created: 2018-12-11T11:44:13Z date_published: 2018-10-25T00:00:00Z date_updated: 2026-04-08T14:09:47Z day: '25' ddc: - '530' department: - _id: GeKa doi: 10.1021/acs.nanolett.8b03217 ec_funded: 1 external_id: isi: - '000451102100064' pmid: - '30359041' file: - access_level: open_access checksum: 3e6034a94c6b5335e939145d88bdb371 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:08Z date_updated: 2020-07-14T12:45:37Z file_id: '5194' file_name: IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf file_size: 1361441 relation: main_file file_date_updated: 2020-07-14T12:45:37Z has_accepted_license: '1' intvolume: ' 18' isi: 1 issue: '11' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 7141 - 7145 pmid: 1 project: - _id: 25517E86-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '335497' name: Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires publication: Nano Letters publication_identifier: issn: - 1530-6984 publication_status: published publisher: American Chemical Society publist_id: '8032' pubrep_id: '1065' quality_controlled: '1' related_material: record: - id: '7977' relation: popular_science - id: '7996' relation: dissertation_contains status: public - id: '69' relation: dissertation_contains status: public scopus_import: '1' status: public title: Single-shot readout of hole spins in Ge tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2018' ... --- _id: '24' abstract: - lang: eng text: Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it. acknowledgement: "This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n" article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Adrian full_name: Elgyütt, Adrian id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87 last_name: Elgyütt - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny - first_name: Owen full_name: Rouillé, Owen last_name: Rouillé citation: ama: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652' apa: 'Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652' chicago: Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652. ieee: 'K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.' ista: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.' mla: Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652. short: K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699. conference: end_date: 2018-07-19 location: Stockholm, Sweden name: 'IJCAI: International Joint Conference on Artificial Intelligence' start_date: 2018-07-13 date_created: 2018-12-11T11:44:13Z date_published: 2018-07-01T00:00:00Z date_updated: 2025-04-14T13:51:04Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.24963/ijcai.2018/652 ec_funded: 1 external_id: arxiv: - '1804.10601' isi: - '000764175404117' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.10601 month: '07' oa: 1 oa_version: Preprint page: 4692 - 4699 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication_status: published publisher: IJCAI publist_id: '8031' quality_controlled: '1' scopus_import: '1' status: public title: Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018 year: '2018' ...