---
_id: '11613'
abstract:
- lang: eng
text: Over 2,000 stars were observed for 1 month with a high enough cadence in order
to look for acoustic modes during the survey phase of the Kepler mission. Solar-like
oscillations have been detected in about 540 stars. The question of why no oscillations
were detected in the remaining stars is still open. Previous works explained the
non-detection of modes with the high level of magnetic activity of the stars.
However, the sample of stars studied contained some classical pulsators and red
giants that could have biased the results. In this work, we revisit this analysis
on a cleaner sample of main-sequence solar-like stars that consists of 1,014 stars.
First we compute the predicted amplitude of the modes of that sample and for the
stars with detected oscillation and compare it to the noise at high frequency
in the power spectrum. We find that the stars with detected modes have an amplitude
to noise ratio larger than 0.94. We measure reliable rotation periods and the
associated photometric magnetic index for 684 stars out of the full sample and
in particular for 323 stars where the amplitude of the modes is predicted to be
high enough to be detected. We find that among these 323 stars 32% of them have
a level of magnetic activity larger than the Sun during its maximum activity,
explaining the non-detection of acoustic modes. Interestingly, magnetic activity
cannot be the primary reason responsible for the absence of detectable modes in
the remaining 68% of the stars without acoustic modes detected and with reliable
rotation periods. Thus, we investigate metallicity, inclination angle of the rotation
axis, and binarity as possible causes of low mode amplitudes. Using spectroscopic
observations for a subsample, we find that a low metallicity could be the reason
for suppressed modes. No clear correlation with binarity nor inclination is found.
We also derive the lower limit for our photometric activity index (of 20–30 ppm)
below which rotation and magnetic activity are not detected. Finally, with our
analysis we conclude that stars with a photometric activity index larger than
2,000 ppm have 98.3% probability of not having oscillations detected.
acknowledgement: This paper includes data collected by the Kepler mission. Funding
for the Kepler mission is provided by the NASA Science Mission directorate. Some
of the 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. Partly Based on observations
obtained with the HERMES spectrograph on the Mercator Telescope, which was supported
by the Research Foundation—Flanders (FWO), Belgium, the Research Council of KU Leuven,
Belgium, the Fonds National de la Recherche Scientifique (F.R.S.-FNRS), Belgium,
the Royal Observatory of Belgium, the Observatoire de Genève, Switzerland, and the
Thüringer Landessternwarte Tautenburg, Germany. SM acknowledges support by the National
Aeronautics and Space Administration under Grant NNX15AF13G, by the National Science
Foundation grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697.
RG acknowledges the support from PLATO and GOLF CNES grants. ÂS acknowledges the
support from National Aeronautics and Space Administration under Grant NNX17AF27G.
PB acknowledges the support of the MINECO under the fellowship program Juan de la
Cierva Incorporacion (IJCI-2015-26034).
article_number: '46'
article_processing_charge: No
article_type: original
author:
- first_name: Savita
full_name: Mathur, Savita
last_name: Mathur
- first_name: Rafael A.
full_name: García, Rafael A.
last_name: García
- 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: Ângela R.G.
full_name: Santos, Ângela R.G.
last_name: Santos
- first_name: Netsha
full_name: Santiago, Netsha
last_name: Santiago
- first_name: Paul G.
full_name: Beck, Paul G.
last_name: Beck
citation:
ama: Mathur S, García RA, Bugnet LA, Santos ÂRG, Santiago N, Beck PG. Revisiting
the impact of stellar magnetic activity on the detectability of solar-like oscillations
by Kepler. Frontiers in Astronomy and Space Sciences. 2019;6. doi:10.3389/fspas.2019.00046
apa: Mathur, S., García, R. A., Bugnet, L. A., Santos, Â. R. G., Santiago, N., &
Beck, P. G. (2019). Revisiting the impact of stellar magnetic activity on the
detectability of solar-like oscillations by Kepler. Frontiers in Astronomy
and Space Sciences. Frontiers Media. https://doi.org/10.3389/fspas.2019.00046
chicago: Mathur, Savita, Rafael A. García, Lisa Annabelle Bugnet, Ângela R.G. Santos,
Netsha Santiago, and Paul G. Beck. “Revisiting the Impact of Stellar Magnetic
Activity on the Detectability of Solar-like Oscillations by Kepler.” Frontiers
in Astronomy and Space Sciences. Frontiers Media, 2019. https://doi.org/10.3389/fspas.2019.00046.
ieee: S. Mathur, R. A. García, L. A. Bugnet, Â. R. G. Santos, N. Santiago, and P.
G. Beck, “Revisiting the impact of stellar magnetic activity on the detectability
of solar-like oscillations by Kepler,” Frontiers in Astronomy and Space Sciences,
vol. 6. Frontiers Media, 2019.
ista: Mathur S, García RA, Bugnet LA, Santos ÂRG, Santiago N, Beck PG. 2019. Revisiting
the impact of stellar magnetic activity on the detectability of solar-like oscillations
by Kepler. Frontiers in Astronomy and Space Sciences. 6, 46.
mla: Mathur, Savita, et al. “Revisiting the Impact of Stellar Magnetic Activity
on the Detectability of Solar-like Oscillations by Kepler.” Frontiers in Astronomy
and Space Sciences, vol. 6, 46, Frontiers Media, 2019, doi:10.3389/fspas.2019.00046.
short: S. Mathur, R.A. García, L.A. Bugnet, Â.R.G. Santos, N. Santiago, P.G. Beck,
Frontiers in Astronomy and Space Sciences 6 (2019).
date_created: 2022-07-18T14:00:36Z
date_published: 2019-07-10T00:00:00Z
date_updated: 2022-08-22T07:29:55Z
day: '10'
doi: 10.3389/fspas.2019.00046
extern: '1'
external_id:
arxiv:
- '1907.01415'
intvolume: ' 6'
keyword:
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.01415
month: '07'
oa: 1
oa_version: Preprint
publication: Frontiers in Astronomy and Space Sciences
publication_identifier:
eissn:
- 2296-987X
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: Revisiting the impact of stellar magnetic activity on the detectability of
solar-like oscillations by Kepler
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2019'
...
---
_id: '11615'
abstract:
- lang: eng
text: The recently published Kepler mission Data Release 25 (DR25) reported on ∼197 000
targets observed during the mission. Despite this, no wide search for red giants
showing solar-like oscillations have been made across all stars observed in Kepler’s
long-cadence mode. In this work, we perform this task using custom apertures on
the Kepler pixel files and detect oscillations in 21 914 stars, representing the
largest sample of solar-like oscillating stars to date. We measure their frequency
at maximum power, νmax, down to νmax≃4μHz and obtain log (g) estimates with a
typical uncertainty below 0.05 dex, which is superior to typical measurements
from spectroscopy. Additionally, the νmax distribution of our detections show
good agreement with results from a simulated model of the Milky Way, with a ratio
of observed to predicted stars of 0.992 for stars with 10<νmax<270μHz. Among our
red giant detections, we find 909 to be dwarf/subgiant stars whose flux signal
is polluted by a neighbouring giant as a result of using larger photometric apertures
than those used by the NASA Kepler science processing pipeline. We further find
that only 293 of the polluting giants are known Kepler targets. The remainder
comprises over 600 newly identified oscillating red giants, with many expected
to belong to the Galactic halo, serendipitously falling within the Kepler pixel
files of targeted stars.
acknowledgement: Funding for this Discovery mission is provided by NASA’s Science
mission Directorate. We thank the entire Kepler team without whom this investigation
would not be possible. DS is the recipient of an Australian Research Council Future
Fellowship (project number FT1400147). RAG acknowledges the support from CNES. SM
acknowledges support from NASA grant NNX15AF13G, NSF grant AST-1411685, and the
Ramon y Cajal fellowship number RYC-2015-17697. ILC acknowledges scholarship support
from the University of Sydney. We would like to thank Nicholas Barbara and Timothy
Bedding for providing us with a list of variable stars that helped to validate a
number of detections in this study. We also thank the group at the University of
Sydney for fruitful discussions. Finally, we gratefully acknowledge the support
of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research.
article_processing_charge: No
article_type: original
author:
- first_name: Marc
full_name: Hon, Marc
last_name: Hon
- first_name: Dennis
full_name: Stello, Dennis
last_name: Stello
- first_name: Rafael A
full_name: García, Rafael A
last_name: García
- first_name: Savita
full_name: Mathur, Savita
last_name: Mathur
- first_name: Sanjib
full_name: Sharma, Sanjib
last_name: Sharma
- first_name: Isabel L
full_name: Colman, Isabel L
last_name: Colman
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
citation:
ama: Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations
in all Kepler data. Monthly Notices of the Royal Astronomical Society.
2019;485(4):5616-5630. doi:10.1093/mnras/stz622
apa: Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L.,
& Bugnet, L. A. (2019). A search for red giant solar-like oscillations in
all Kepler data. Monthly Notices of the Royal Astronomical Society. Oxford
University Press. https://doi.org/10.1093/mnras/stz622
chicago: Hon, Marc, Dennis Stello, Rafael A García, Savita Mathur, Sanjib Sharma,
Isabel L Colman, and Lisa Annabelle Bugnet. “A Search for Red Giant Solar-like
Oscillations in All Kepler Data.” Monthly Notices of the Royal Astronomical
Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz622.
ieee: M. Hon et al., “A search for red giant solar-like oscillations in all
Kepler data,” Monthly Notices of the Royal Astronomical Society, vol. 485,
no. 4. Oxford University Press, pp. 5616–5630, 2019.
ista: Hon M, Stello D, García RA, Mathur S, Sharma S, Colman IL, Bugnet LA. 2019.
A search for red giant solar-like oscillations in all Kepler data. Monthly Notices
of the Royal Astronomical Society. 485(4), 5616–5630.
mla: Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler
Data.” Monthly Notices of the Royal Astronomical Society, vol. 485, no.
4, Oxford University Press, 2019, pp. 5616–30, doi:10.1093/mnras/stz622.
short: M. Hon, D. Stello, R.A. García, S. Mathur, S. Sharma, I.L. Colman, L.A. Bugnet,
Monthly Notices of the Royal Astronomical Society 485 (2019) 5616–5630.
date_created: 2022-07-18T14:26:03Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2022-08-22T07:35:19Z
day: '01'
doi: 10.1093/mnras/stz622
extern: '1'
external_id:
arxiv:
- '1903.00115'
intvolume: ' 485'
issue: '4'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- asteroseismology
- 'methods: data analysis'
- 'techniques: image processing'
- 'stars: oscillations'
- 'stars: statistics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.00115
month: '06'
oa: 1
oa_version: Preprint
page: 5616-5630
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: A search for red giant solar-like oscillations in all Kepler data
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 485
year: '2019'
...
---
_id: '11614'
abstract:
- lang: eng
text: The NASA Transiting Exoplanet Survey Satellite (TESS) is about to provide
full-frame images of almost the entire sky. The amount of stellar data to be analysed
represents hundreds of millions stars, which is several orders of magnitude more
than the number of stars observed by the Convection, Rotation and planetary Transits
satellite (CoRoT), and NASA Kepler and K2 missions. We aim at automatically classifying
the newly observed stars with near real-time algorithms to better guide the subsequent
detailed studies. In this paper, we present a classification algorithm built to
recognise solar-like pulsators among classical pulsators. This algorithm relies
on the global amount of power contained in the power spectral density (PSD), also
known as the flicker in spectral power density (FliPer). Because each type of
pulsating star has a characteristic background or pulsation pattern, the shape
of the PSD at different frequencies can be used to characterise the type of pulsating
star. The FliPer classifier (FliPerClass) uses different FliPer parameters along
with the effective temperature as input parameters to feed a ML algorithm in order
to automatically classify the pulsating stars observed by TESS. Using noisy TESS-simulated
data from the TESS Asteroseismic Science Consortium (TASC), we classify pulsators
with a 98% accuracy. Among them, solar-like pulsating stars are recognised with
a 99% accuracy, which is of great interest for a further seismic analysis of these
stars, which are like our Sun. Similar results are obtained when we trained our
classifier and applied it to 27-day subsets of real Kepler data. FliPerClass is
part of the large TASC classification pipeline developed by the TESS Data for
Asteroseismology (T’DA) classification working group.
acknowledgement: We thank the enitre T’DA team for useful comments and discussions,
in particular Andrew Tkachenko. We also acknowledge Marc Hon, Keaton Bell, and James
Kuszlewicz for useful comments on the manuscript. L.B. and R.A.G. acknowledge the
support from PLATO and GOLF CNES grants. S.M. acknowledges support by the Ramon
y Cajal fellowship number RYC-2015-17697. O.J.H. and B.M.R. acknowledge the support
of the UK Science and Technology Facilities Council (STFC). M.N.L. acknowledges
the support of the ESA PRODEX programme (PEA 4000119301). Funding for the Stellar
Astrophysics Centre is provided by the Danish National Research Foundation (Grant
DNRF106).
article_number: A79
article_processing_charge: No
article_type: original
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: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: G. R.
full_name: Davies, G. R.
last_name: Davies
- first_name: O. J.
full_name: Hall, O. J.
last_name: Hall
- first_name: M. N.
full_name: Lund, M. N.
last_name: Lund
- first_name: B. M.
full_name: Rendle, B. M.
last_name: Rendle
citation:
ama: 'Bugnet LA, García RA, Mathur S, et al. FliPerClass: In search of solar-like
pulsators among TESS targets. Astronomy & Astrophysics. 2019;624. doi:10.1051/0004-6361/201834780'
apa: 'Bugnet, L. A., García, R. A., Mathur, S., Davies, G. R., Hall, O. J., Lund,
M. N., & Rendle, B. M. (2019). FliPerClass: In search of solar-like pulsators
among TESS targets. Astronomy & Astrophysics. EDP Science. https://doi.org/10.1051/0004-6361/201834780'
chicago: 'Bugnet, Lisa Annabelle, R. A. García, S. Mathur, G. R. Davies, O. J. Hall,
M. N. Lund, and B. M. Rendle. “FliPerClass: In Search of Solar-like Pulsators
among TESS Targets.” Astronomy & Astrophysics. EDP Science, 2019. https://doi.org/10.1051/0004-6361/201834780.'
ieee: 'L. A. Bugnet et al., “FliPerClass: In search of solar-like pulsators
among TESS targets,” Astronomy & Astrophysics, vol. 624. EDP Science,
2019.'
ista: 'Bugnet LA, García RA, Mathur S, Davies GR, Hall OJ, Lund MN, Rendle BM. 2019.
FliPerClass: In search of solar-like pulsators among TESS targets. Astronomy &
Astrophysics. 624, A79.'
mla: 'Bugnet, Lisa Annabelle, et al. “FliPerClass: In Search of Solar-like Pulsators
among TESS Targets.” Astronomy & Astrophysics, vol. 624, A79, EDP Science,
2019, doi:10.1051/0004-6361/201834780.'
short: L.A. Bugnet, R.A. García, S. Mathur, G.R. Davies, O.J. Hall, M.N. Lund, B.M.
Rendle, Astronomy & Astrophysics 624 (2019).
date_created: 2022-07-18T14:13:34Z
date_published: 2019-04-19T00:00:00Z
date_updated: 2022-08-22T07:32:51Z
day: '19'
doi: 10.1051/0004-6361/201834780
extern: '1'
external_id:
arxiv:
- '1902.09854'
intvolume: ' 624'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.09854
month: '04'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FliPerClass: In search of solar-like pulsators among TESS targets'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 624
year: '2019'
...
---
_id: '11623'
abstract:
- lang: eng
text: Brightness variations due to dark spots on the stellar surface encode information
about stellar surface rotation and magnetic activity. In this work, we analyze
the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M
and K in order to measure their surface rotation and photometric activity level.
Rotation-period estimates are obtained by the combination of a wavelet analysis
and autocorrelation function of the light curves. Reliable rotation estimates
are determined by comparing the results from the different rotation diagnostics
and four data sets. We also measure the photometric activity proxy Sph using the
amplitude of the flux variations on an appropriate timescale. We report rotation
periods and photometric activity proxies for about 60% of the sample, including
4431 targets for which McQuillan et al. did not report a rotation period. For
the common targets with rotation estimates in this study and in McQuillan et al.,
our rotation periods agree within 99%. In this work, we also identify potential
polluters, such as misclassified red giants and classical pulsator candidates.
Within the parameter range we study, there is a mild tendency for hotter stars
to have shorter rotation periods. The photometric activity proxy spans a wider
range of values with increasing effective temperature. The rotation period and
photometric activity proxy are also related, with Sph being larger for fast rotators.
Similar to McQuillan et al., we find a bimodal distribution of rotation periods.
acknowledgement: "The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg,
and Isabel L. Colman for helping on the classification of stars. This paper includes
data collected by the Kepler mission and obtained from the MAST data archive at
the Space Telescope Science Institute (STScI). Funding for the Kepler mission is
provided by the National Aeronautics and Space Administration (NASA) Science Mission
Directorate. STScI is operated by the Association of Universities for Research in
Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support
from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO
and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship
number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at
the Max Planck Institute for Solar System Research. This research has made use of
the NASA Exoplanet Archive, which is operated by the California Institute of Technology,
under contract with the National Aeronautics and Space Administration under the
Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy
(van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities:
MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -"
article_number: '21'
article_processing_charge: No
article_type: original
author:
- first_name: A. R. G.
full_name: Santos, A. R. G.
last_name: Santos
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- 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: J. L.
full_name: van Saders, J. L.
last_name: van Saders
- first_name: T. S.
full_name: Metcalfe, T. S.
last_name: Metcalfe
- first_name: G. V. A.
full_name: Simonian, G. V. A.
last_name: Simonian
- first_name: M. H.
full_name: Pinsonneault, M. H.
last_name: Pinsonneault
citation:
ama: Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity
for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal
Supplement Series. 2019;244(1). doi:10.3847/1538-4365/ab3b56
apa: Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J.
L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric
activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical
Journal Supplement Series. IOP Publishing. https://doi.org/10.3847/1538-4365/ab3b56
chicago: Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L.
van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface
Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence
Stars.” The Astrophysical Journal Supplement Series. IOP Publishing, 2019.
https://doi.org/10.3847/1538-4365/ab3b56.
ieee: A. R. G. Santos et al., “Surface rotation and photometric activity
for Kepler targets. I. M and K main-sequence stars,” The Astrophysical Journal
Supplement Series, vol. 244, no. 1. IOP Publishing, 2019.
ista: Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian
GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler
targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement
Series. 244(1), 21.
mla: Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler
Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement
Series, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:10.3847/1538-4365/ab3b56.
short: A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S.
Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement
Series 244 (2019).
date_created: 2022-07-19T09:21:58Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2022-08-22T08:10:38Z
day: '19'
doi: 10.3847/1538-4365/ab3b56
extern: '1'
external_id:
arxiv:
- '1908.05222'
intvolume: ' 244'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'methods: data analysis'
- 'stars: activity'
- 'stars: low-mass'
- 'stars: rotation'
- starspots
- 'techniques: photometric'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.05222
month: '09'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal Supplement Series
publication_identifier:
issn:
- 0067-0049
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence
stars
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 244
year: '2019'
...
---
_id: '11627'
abstract:
- lang: eng
text: 'For a solar-like star, the surface rotation evolves with time, allowing in
principle to estimate the age of a star from its surface rotation period. Here
we are interested in measuring surface rotation periods of solar-like stars observed
by the NASA mission Kepler. Different methods have been developed to track rotation
signals in Kepler photometric light curves: time-frequency analysis based on wavelet
techniques, autocorrelation and composite spectrum. We use the learning abilities
of random forest classifiers to take decisions during two crucial steps of the
analysis. First, given some input parameters, we discriminate the considered Kepler
targets between rotating MS stars, non-rotating MS stars, red giants, binaries
and pulsators. We then use a second classifier only on the MS rotating targets
to decide the best data analysis treatment.'
article_number: '1906.09609'
article_processing_charge: No
author:
- first_name: S. N.
full_name: Breton, S. N.
last_name: Breton
- 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: A. R. G.
full_name: Santos, A. R. G.
last_name: Santos
- first_name: A. Le
full_name: Saux, A. Le
last_name: Saux
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: P. L.
full_name: Palle, P. L.
last_name: Palle
- first_name: R. A.
full_name: Garcia, R. A.
last_name: Garcia
citation:
ama: Breton SN, Bugnet LA, Santos ARG, et al. Determining surface rotation periods
of solar-like stars observed by the Kepler mission using machine learning techniques.
arXiv. doi:10.48550/arXiv.1906.09609
apa: Breton, S. N., Bugnet, L. A., Santos, A. R. G., Saux, A. L., Mathur, S., Palle,
P. L., & Garcia, R. A. (n.d.). Determining surface rotation periods of solar-like
stars observed by the Kepler mission using machine learning techniques. arXiv.
https://doi.org/10.48550/arXiv.1906.09609
chicago: Breton, S. N., Lisa Annabelle Bugnet, A. R. G. Santos, A. Le Saux, S. Mathur,
P. L. Palle, and R. A. Garcia. “Determining Surface Rotation Periods of Solar-like
Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.1906.09609.
ieee: S. N. Breton et al., “Determining surface rotation periods of solar-like
stars observed by the Kepler mission using machine learning techniques,” arXiv.
.
ista: Breton SN, Bugnet LA, Santos ARG, Saux AL, Mathur S, Palle PL, Garcia RA.
Determining surface rotation periods of solar-like stars observed by the Kepler
mission using machine learning techniques. arXiv, 1906.09609.
mla: Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars
Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv,
1906.09609, doi:10.48550/arXiv.1906.09609.
short: S.N. Breton, L.A. Bugnet, A.R.G. Santos, A.L. Saux, S. Mathur, P.L. Palle,
R.A. Garcia, ArXiv (n.d.).
date_created: 2022-07-20T11:18:53Z
date_published: 2019-06-23T00:00:00Z
date_updated: 2022-08-22T08:16:53Z
day: '23'
doi: 10.48550/arXiv.1906.09609
extern: '1'
external_id:
arxiv:
- '1906.09609'
keyword:
- asteroseismology
- rotation
- solar-like stars
- kepler
- machine learning
- random forest
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1906.09609
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Determining surface rotation periods of solar-like stars observed by the Kepler
mission using machine learning techniques
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11630'
abstract:
- lang: eng
text: 'The second mission of NASA’s Kepler satellite, K2, has collected hundreds
of thousands of lightcurves for stars close to the ecliptic plane. This new sample
could increase the number of known pulsating stars and then improve our understanding
of those stars. For the moment only a few stars have been properly classified
and published. In this work, we present a method to automaticly classify K2 pulsating
stars using a Machine Learning technique called Random Forest. The objective is
to sort out the stars in four classes: red giant (RG), main-sequence Solar-like
stars (SL), classical pulsators (PULS) and Other. To do this we use the effective
temperatures and the luminosities of the stars as well as the FliPer features,
that measures the amount of power contained in the power spectral density. The
classifier now retrieves the right classification for more than 80% of the stars.'
article_number: '1906.09611'
article_processing_charge: No
author:
- first_name: A. Le
full_name: Saux, A. Le
last_name: Saux
- 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: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: S. N.
full_name: Breton, S. N.
last_name: Breton
- first_name: R. A.
full_name: Garcia, R. A.
last_name: Garcia
citation:
ama: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification
of K2 pulsating stars using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09611
apa: Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., & Garcia, R. A.
(n.d.). Automatic classification of K2 pulsating stars using machine learning
techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09611
chicago: Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A.
Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning
Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09611.
ieee: A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic
classification of K2 pulsating stars using machine learning techniques,” arXiv.
.
ista: Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification
of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611.
mla: Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine
Learning Techniques.” ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611.
short: A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).
date_created: 2022-07-21T06:57:10Z
date_published: 2019-06-23T00:00:00Z
date_updated: 2022-08-22T08:20:29Z
day: '23'
doi: 10.48550/arXiv.1906.09611
extern: '1'
external_id:
arxiv:
- '1906.09611'
keyword:
- asteroseismology - methods
- data analysis - thecniques
- machine learning - stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1906.09611
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Automatic classification of K2 pulsating stars using machine learning techniques
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11826'
abstract:
- lang: eng
text: "The diameter, radius and eccentricities are natural graph parameters. While
these problems have been studied extensively, there are no known dynamic algorithms
for them beyond the ones that follow from trivial recomputation after each update
or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally
intensive. This is the situation for dynamic approximation algorithms as well,
and even if only edge insertions or edge deletions need to be supported.\r\nThis
paper provides a comprehensive study of the dynamic approximation of Diameter,
Radius and Eccentricities, providing both conditional lower bounds, and new algorithms
whose bounds are optimal under popular hypotheses in fine-grained complexity.
Some of the highlights include:\r\n- Under popular hardness hypotheses, there
can be no significantly better fully dynamic approximation algorithms than recomputing
the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially
dynamic (incremental/decremental) algorithms can be achieved via efficient reductions
to (incremental/decremental) maintenance of Single-Source Shortest Paths. For
instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected
n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2.
This nearly matches the static 3/2-approximation algorithm for the problem that
is known to be conditionally optimal."
alternative_title:
- LIPIcs
article_number: '13'
article_processing_charge: No
author:
- first_name: Bertie
full_name: Ancona, Bertie
last_name: Ancona
- 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: Liam
full_name: Roditty, Liam
last_name: Roditty
- first_name: Virginia Vassilevska
full_name: Williams, Virginia Vassilevska
last_name: Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness
for diameter in dynamic graphs. In: 46th International Colloquium on Automata,
Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13'
apa: 'Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N.
(2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International
Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13'
chicago: Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska
Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
In 46th International Colloquium on Automata, Languages, and Programming,
Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.
ieee: B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms
and hardness for diameter in dynamic graphs,” in 46th International Colloquium
on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
ista: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms
and hardness for diameter in dynamic graphs. 46th International Colloquium on
Automata, Languages, and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LIPIcs, vol. 132, 13.'
mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
46th International Colloquium on Automata, Languages, and Programming,
vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.
short: B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th
International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2019-07-09
date_created: 2022-08-12T08:14:51Z
date_published: 2019-07-04T00:00:00Z
date_updated: 2023-02-16T10:48:24Z
day: '04'
doi: 10.4230/LIPICS.ICALP.2019.13
extern: '1'
external_id:
arxiv:
- '811.12527'
intvolume: ' 132'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13
month: '07'
oa: 1
oa_version: Published Version
publication: 46th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithms and hardness for diameter in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '11850'
abstract:
- lang: eng
text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware
infrastructures whose resources can be adjusted according to the workload they
currently serve. Such dynamic adjustments can be exploited to improve network
utilization and hence performance, by moving frequently interacting communication
partners closer, e.g., collocating them in the same server or datacenter. However,
dynamically changing the embedding of workloads is algorithmically challenging:
communication patterns are often not known ahead of time, but must be learned.
During the learning process, overheads related to unnecessary moves (i.e., re-embeddings)
should be minimized. This paper studies a fundamental model which captures the
tradeoff between the benefits and costs of dynamically collocating communication
partners on l servers, in an online manner. Our main contribution is a distributed
online algorithm which is asymptotically almost optimal, i.e., almost matches
the lower bound (also derived in this paper) on the competitive ratio of any (distributed
or centralized) online algorithm.'
article_processing_charge: No
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: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding.
In: SIGMETRICS’19: International Conference on Measurement and Modeling of
Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503'
apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed
workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States:
Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503'
chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed
Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, 43–44. Association for Computing Machinery,
2019. https://doi.org/10.1145/3309697.3331503.'
ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload
(re-)embedding,” in SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.'
ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding.
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems, 43–44.'
mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.”
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.'
short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International
Conference on Measurement and Modeling of Computer Systems, Association for Computing
Machinery, 2019, pp. 43–44.'
conference:
end_date: 2019-06-28
location: Phoenix, AZ, United States
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2019-06-24
date_created: 2022-08-16T07:14:57Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2023-02-17T09:41:45Z
day: '20'
doi: 10.1145/3309697.3331503
extern: '1'
external_id:
arxiv:
- '1904.05474'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.05474
month: '06'
oa: 1
oa_version: Preprint
page: 43–44
publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling
of Computer Systems'
publication_identifier:
isbn:
- 978-1-4503-6678-6
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient distributed workload (re-)embedding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11847'
abstract:
- lang: eng
text: This paper serves as a user guide to the Vienna graph clustering framework.
We review our general memetic algorithm, VieClus, to tackle the graph clustering
problem. A key component of our contribution are natural recombine operators that
employ ensemble clusterings as well as multi-level techniques. Lastly, we combine
these techniques with a scalable communication protocol, producing a system that
is able to compute high-quality solutions in a short amount of time. After giving
a description of the algorithms employed, we establish the connection of the graph
clustering problem to protein–protein interaction networks and moreover give a
description on how the software can be used, what file formats are expected, and
how this can be used to find functional groups in protein–protein interaction
networks.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
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 MH, Schulz C, Schuster B. Vienna Graph Clustering.
In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks.
Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16'
apa: Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna
Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein
Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16
chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster.
“Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited
by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature,
2019. https://doi.org/10.1007/978-1-4939-9873-9_16.
ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph
Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar
and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.
ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering.
In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074,
215–231.'
mla: Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction
Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074,
Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16.
short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F.
Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature,
2019, pp. 215–231.
date_created: 2022-08-16T06:54:48Z
date_published: 2019-10-04T00:00:00Z
date_updated: 2023-02-17T09:34:26Z
day: '04'
doi: 10.1007/978-1-4939-9873-9_16
editor:
- first_name: Stefan
full_name: Canzar, Stefan
last_name: Canzar
- first_name: Francisca
full_name: Rojas Ringeling, Francisca
last_name: Rojas Ringeling
extern: '1'
external_id:
pmid:
- '31583641'
intvolume: ' 2074'
language:
- iso: eng
month: '10'
oa_version: None
page: 215–231
pmid: 1
publication: Protein-Protein Interaction Networks
publication_identifier:
eisbn:
- '9781493998739'
eissn:
- 1940-6029
isbn:
- '9781493998722'
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Vienna Graph Clustering
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2074
year: '2019'
...
---
_id: '11853'
abstract:
- lang: eng
text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate
minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input
set system is undergoing element insertions and deletions. Here, n denotes the
number of elements, each element appears in at most f sets, and the cost of each
set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17],
implies that there is a deterministic algorithm for this problem with O(f log(Cn))
amortized update time and O(min(log n, f)) -approximation ratio, which nearly
matches the polynomial-time hardness of approximation for minimum set cover in
the static setting. Our update time is only O(log (Cn)) away from a trivial lower
bound. Prior to our work, the previous best approximation ratio guaranteed by
deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15].
In contrast, the only result that guaranteed O(f) -approximation was obtained
very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with
(1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the
extra O(f) factor in the update time compared to our and Gupta~et~al.'s results,
the Abboud~et~al.~algorithm is randomized, and works only when the adversary is
oblivious and the sets are unweighted (each set has the same cost). We achieve
our result via the primal-dual approach, by maintaining a fractional packing solution
as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and
Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual
algorithms that try to satisfy some local constraints for individual sets at all
time, our algorithm basically waits until the dual solution changes significantly
globally, and fixes the solution only where the fix is needed.
article_processing_charge: No
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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for
dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science.
Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033'
apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic
algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of
Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of
Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New
Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on
Foundations of Computer Science, 406–23. Institute of Electrical and Electronics
Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.
ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm
for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer
Science, Baltimore, MD, United States, 2019, pp. 406–423.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm
for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science.
FOCS: Annual Symposium on Foundations of Computer Science, 406–423.'
mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set
Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute
of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium
on Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2019, pp. 406–423.
conference:
end_date: 2019-11-12
location: Baltimore, MD, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2019-11-09
date_created: 2022-08-16T08:00:00Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-02-17T09:50:37Z
day: '01'
doi: 10.1109/focs.2019.00033
extern: '1'
external_id:
arxiv:
- '1909.11600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.11600
month: '11'
oa: 1
oa_version: Preprint
page: 406-423
publication: 60th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-4952-3
isbn:
- 978-1-7281-4953-0
issn:
- 2575-8454
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new deterministic algorithm for dynamic set cover
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...