[{"publication_status":"published","publisher":"Elsevier","year":"2015","pmid":1,"date_created":"2022-04-07T07:49:00Z","date_updated":"2022-07-18T08:34:34Z","volume":25,"author":[{"last_name":"Hatch","first_name":"Emily M.","full_name":"Hatch, Emily M."},{"full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X"}],"extern":"1","quality_controlled":"1","external_id":{"pmid":["25989073"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2015.02.033"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2015.02.033","month":"05","publication_identifier":{"issn":["0960-9822"]},"title":"Chromothripsis","status":"public","intvolume":" 25","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","_id":"11074","oa_version":"Published Version","type":"journal_article","issue":"10","article_type":"original","page":"PR397-R399","publication":"Current Biology","citation":{"short":"E.M. Hatch, M. Hetzer, Current Biology 25 (2015) PR397-R399.","mla":"Hatch, Emily M., and Martin Hetzer. “Chromothripsis.” Current Biology, vol. 25, no. 10, Elsevier, 2015, pp. PR397-R399, doi:10.1016/j.cub.2015.02.033.","chicago":"Hatch, Emily M., and Martin Hetzer. “Chromothripsis.” Current Biology. Elsevier, 2015. https://doi.org/10.1016/j.cub.2015.02.033.","ama":"Hatch EM, Hetzer M. Chromothripsis. Current Biology. 2015;25(10):PR397-R399. doi:10.1016/j.cub.2015.02.033","apa":"Hatch, E. M., & Hetzer, M. (2015). Chromothripsis. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2015.02.033","ieee":"E. M. Hatch and M. Hetzer, “Chromothripsis,” Current Biology, vol. 25, no. 10. Elsevier, pp. PR397-R399, 2015.","ista":"Hatch EM, Hetzer M. 2015. Chromothripsis. Current Biology. 25(10), PR397-R399."},"date_published":"2015-05-18T00:00:00Z","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"scopus_import":"1","day":"18","article_processing_charge":"No"},{"extern":"1","volume":808,"date_created":"2022-07-07T09:00:58Z","date_updated":"2022-08-18T10:30:13Z","author":[{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J"},{"first_name":"Behnam","last_name":"Darvish","full_name":"Darvish, Behnam"},{"full_name":"Schaerer, Daniel","last_name":"Schaerer","first_name":"Daniel"},{"full_name":"Mobasher, Bahram","first_name":"Bahram","last_name":"Mobasher"},{"full_name":"Röttgering, Huub","last_name":"Röttgering","first_name":"Huub"},{"first_name":"Sérgio","last_name":"Santos","full_name":"Santos, Sérgio"},{"first_name":"Shoubaneh","last_name":"Hemmati","full_name":"Hemmati, Shoubaneh"}],"publisher":"IOP Publishing","publication_status":"published","acknowledgement":"We thank the anonymous reviewer for useful and constructive comments and suggestions which greatly improved the quality and clarity of our work. D.S. acknowledges financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship, from FCT through a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant UID/FIS/04434/2013, and from LSF and LKBF. J.M. acknowledges the award of a Huygens PhD fellowship. H.R. acknowledges support from the ERC Advanced Investigator program NewClusters 321271. The authors thank Mark Dijkstra, Bhaskar Agarwal, Jarrett Johnson, Andrea Ferrara, Jarle Brinchmann, Rebecca Bowler, George Becker, Emma Curtis-Lake, Milos Milosavljevic, Raffaella Schneider, Paul Shapiro, and Erik Zackrisson for interesting, stimulating and helpful discussions. The authors are extremely grateful to ESO for the award of ESO DDT time (294.A-5018 and 294.A-5039) which allowed the spectroscopic confirmation of both sources and the detailed investigation of their nature. Observations are also based on data from W.M. Keck Observatory. The W.M. Keck Observatory is operated as a scientific partnership of Caltech, the University of California and the National Aeronautics and Space Administration. Based on observations obtained with MegaPrime/Megacam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de lUnivers of the Centre National de la Recherche Scientifique (CNRS) of France, and the University of Hawaii. This work is based in part on data products produced at Terapix available at the Canadian Astronomy Data Centre as part of the Canada–France–Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 294.A-5039, and 179.A-2005, and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. The authors acknowledge the award of service time (SW2014b20) on the William Herschel Telescope (WHT). WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias.","year":"2015","publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1088/0004-637X/808/2/139","quality_controlled":"1","external_id":{"arxiv":["1504.01734"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.01734","open_access":"1"}],"issue":"2","abstract":[{"lang":"eng","text":"Faint Lyα emitters become increasingly rarer toward the reionization epoch (z ∼ 6–7). However, observations from a very large (∼5 deg2) Lyα narrow-band survey at z = 6.6 show that this is not the case for the most luminous emitters, capable of ionizing their own local bubbles. Here we present follow-up observations of the two most luminous Lyα candidates in the COSMOS field: “MASOSA” and “CR7.” We used X-SHOOTER, SINFONI, and FORS2 on the Very Large Telescope, and DEIMOS on Keck, to confirm both candidates beyond any doubt. We find redshifts of z = 6.541 and z = 6.604 for “MASOSA” and “CR7,” respectively. MASOSA has a strong detection in Lyα with a line width of 386 ± 30 km s−1 (FWHM) and with very high EW0 (>200 Å), but undetected in the continuum, implying very low stellar mass and a likely young, metal-poor stellar population. “CR7,” with an observed Lyα luminosity of 1043.92±0.05 erg s−1 is the most luminous Lyα emitter ever found at z > 6 and is spatially extended (∼16 kpc). “CR7” reveals a narrow Lyα line with 266 ± 15 km s−1 FWHM, being detected in the near-infrared (NIR) (rest-frame UV; β = −2.3 ± 0.1) and in IRAC/Spitzer. We detect a narrow He II 1640 Å emission line (6σ, FWHM = 130 ± 30 km s−1 ) in CR7 which can explain the clear excess seen in the J-band photometry (EW0 ∼ 80 Å). We find no other emission lines from the UV to the NIR in our X-SHOOTER spectra (He II/O III] 1663 Å > 3 and He II/C III] 1908 Å > 2.5). We conclude that CR7 is best explained by a combination of a PopIII-like population, which dominates the rest-frame UV and the nebular emission, and a more normal stellar population, which presumably dominates the mass. Hubble Space Telescope/WFC3 observations show that the light is indeed spatially separated between a very blue component, coincident with Lyα and He II emission, and two red components (∼5 kpc away), which dominate the mass. Our findings are consistent with theoretical predictions of a PopIII wave, with PopIII star formation migrating away from the original sites of star formation."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 808","title":"Evidence for PopIII-like stellar populations in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11519","article_processing_charge":"No","day":"28","keyword":["Space and Planetary Science","Astronomy and Astrophysics","dark ages","reionization","first stars – early universe – galaxies: evolution"],"scopus_import":"1","date_published":"2015-07-28T00:00:00Z","page":"139","article_type":"original","citation":{"ista":"Sobral D, Matthee JJ, Darvish B, Schaerer D, Mobasher B, Röttgering H, Santos S, Hemmati S. 2015. Evidence for PopIII-like stellar populations in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation. The Astrophysical Journal. 808(2), 139.","apa":"Sobral, D., Matthee, J. J., Darvish, B., Schaerer, D., Mobasher, B., Röttgering, H., … Hemmati, S. (2015). Evidence for PopIII-like stellar populations in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation. The Astrophysical Journal. IOP Publishing. https://doi.org/10.1088/0004-637X/808/2/139","ieee":"D. Sobral et al., “Evidence for PopIII-like stellar populations in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation,” The Astrophysical Journal, vol. 808, no. 2. IOP Publishing, p. 139, 2015.","ama":"Sobral D, Matthee JJ, Darvish B, et al. Evidence for PopIII-like stellar populations in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation. The Astrophysical Journal. 2015;808(2):139. doi:10.1088/0004-637X/808/2/139","chicago":"Sobral, David, Jorryt J Matthee, Behnam Darvish, Daniel Schaerer, Bahram Mobasher, Huub Röttgering, Sérgio Santos, and Shoubaneh Hemmati. “Evidence for PopIII-like Stellar Populations in the Most Luminous Lyα Emitters at the Epoch of Reionisation: Spectroscopic Confirmation.” The Astrophysical Journal. IOP Publishing, 2015. https://doi.org/10.1088/0004-637X/808/2/139.","mla":"Sobral, David, et al. “Evidence for PopIII-like Stellar Populations in the Most Luminous Lyα Emitters at the Epoch of Reionisation: Spectroscopic Confirmation.” The Astrophysical Journal, vol. 808, no. 2, IOP Publishing, 2015, p. 139, doi:10.1088/0004-637X/808/2/139.","short":"D. Sobral, J.J. Matthee, B. Darvish, D. Schaerer, B. Mobasher, H. Röttgering, S. Santos, S. Hemmati, The Astrophysical Journal 808 (2015) 139."},"publication":"The Astrophysical Journal"},{"volume":451,"date_updated":"2022-08-19T08:23:18Z","date_created":"2022-07-14T09:02:22Z","author":[{"full_name":"Sobral, D.","first_name":"D.","last_name":"Sobral"},{"full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee"},{"full_name":"Best, P. N.","first_name":"P. N.","last_name":"Best"},{"last_name":"Smail","first_name":"I.","full_name":"Smail, I."},{"last_name":"Khostovan","first_name":"A. A.","full_name":"Khostovan, A. A."},{"first_name":"B.","last_name":"Milvang-Jensen","full_name":"Milvang-Jensen, B."},{"last_name":"Kim","first_name":"J.-W.","full_name":"Kim, J.-W."},{"first_name":"J.","last_name":"Stott","full_name":"Stott, J."},{"first_name":"J.","last_name":"Calhau","full_name":"Calhau, J."},{"full_name":"Nayyeri, H.","first_name":"H.","last_name":"Nayyeri"},{"last_name":"Mobasher","first_name":"B.","full_name":"Mobasher, B."}],"publisher":"Oxford University Press","publication_status":"published","year":"2015","acknowledgement":"The authors wish to thank the anonymous reviewer for many helpful comments and suggestions which greatly improved the clarity and quality of this work. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship, from FCT through an FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant PEst-OE/FIS/UI2751/2014, and from LSF and LKBF. JM acknowledges the award of a Huygens PhD fellowship. PNB is grateful for support from STFC. IRS acknowledges support from STFC, a Leverhulme Fellowship, the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson Merit Award. BMJ acknowledges support from the ERC-StG grant EGGS-278202. The Dark Cosmology Centre is funded by the DNRF. The Dark Cosmology Centre is funded by the DNRF. JWK acknowledges support from the National Research Foundation of Korea (NRF) grant, no. 2008-0060544, funded by the Korea government (MSIP). JPS acknowledges support from STFC (ST/I001573/1). JC acknowledges support from the FCT-IF grant IF/01154/2012/CP0189/CT0010. The work was only possible due to OPTICON/FP7 and the invaluable access that it granted to the CFHT telescope. We would also like to acknowledge the excellent work done by CFHT staff in conducting the observations in service mode, and on delivering truly excellent data. We are also tremendously thankful to Kentaro Aoki for the incredible support while observing at Subaru with FMOS, and also to the Keck staff for the help with the observations with MOSFIRE. This work is based on observations obtained with WIRCam on the CFHT, OPTICON programme 2011B/029, 2012A019 and 2012B/016. Based on observations made with ESO telescopes at the La Silla Paranal Observatory under programmes IDs 60.A-9460 (data can be accessed through the ESO data archive), 087.A 0337 and 089.A-0965. Based on observations done with FMOS on Subaru under programme S14A-084, and on MOSFIRE/Keck observations under programme U066M. Part of the data on which this analysis is based are available from Sobral et al. (2013a). Dedicated to the memory of C. M. Sobral (1953-2014).","extern":"1","language":[{"iso":"eng"}],"doi":"10.1093/mnras/stv1076","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.06602"}],"external_id":{"arxiv":["1502.06602"]},"oa":1,"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"month":"08","oa_version":"Preprint","intvolume":" 451","title":"CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 ","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11580","issue":"3","abstract":[{"lang":"eng","text":"We present results from the largest contiguous narrow-band survey in the near-infrared. We have used the wide-field infrared camera/Canada–France–Hawaii Telescope and the lowOH2 filter (1.187 ± 0.005 μm) to survey ≈10 deg2 of contiguous extragalactic sky in the SA22 field. A total of ∼6000 candidate emission-line galaxies are found. We use deep ugrizJK data to obtain robust photometric redshifts. We combine our data with the High-redshift(Z) Emission Line Survey (HiZELS), explore spectroscopic surveys (VVDS, VIPERS) and obtain our own spectroscopic follow-up with KMOS, FMOS and MOSFIRE to derive large samples of high-redshift emission-line selected galaxies: 3471 Hα emitters at z = 0.8, 1343 [O III] + Hβ emitters at z = 1.4 and 572 [O II] emitters at z = 2.2. We probe comoving volumes of >106 Mpc3 and find significant overdensities, including an 8.5σ (spectroscopically confirmed) overdensity of Hα emitters at z = 0.81. We derive Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4, 2.2, respectively, and present implications for future surveys such as Euclid. Our uniquely large volumes/areas allow us to subdivide the samples in thousands of randomized combinations of areas and provide a robust empirical measurement of sample/cosmic variance. We show that surveys for star-forming/emission-line galaxies at a depth similar to ours can only overcome cosmic-variance (errors <10 per cent) if they are based on volumes >5 × 105 Mpc3; errors on L* and ϕ* due to sample (cosmic) variance on surveys probing ∼104 and ∼105 Mpc3 are typically very high: ∼300 and ∼40–60 per cent, respectively."}],"type":"journal_article","date_published":"2015-08-11T00:00:00Z","page":"2303-2323","article_type":"original","citation":{"ista":"Sobral D, Matthee JJ, Best PN, Smail I, Khostovan AA, Milvang-Jensen B, Kim J-W, Stott J, Calhau J, Nayyeri H, Mobasher B. 2015. CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society. 451(3), 2303–2323.","ieee":"D. Sobral et al., “CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 ,” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 3. Oxford University Press, pp. 2303–2323, 2015.","apa":"Sobral, D., Matthee, J. J., Best, P. N., Smail, I., Khostovan, A. A., Milvang-Jensen, B., … Mobasher, B. (2015). CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stv1076","ama":"Sobral D, Matthee JJ, Best PN, et al. CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society. 2015;451(3):2303-2323. doi:10.1093/mnras/stv1076","chicago":"Sobral, D., Jorryt J Matthee, P. N. Best, I. Smail, A. A. Khostovan, B. Milvang-Jensen, J.-W. Kim, et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey with Spectroscopic Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions at z = 0.8, 1.4 and 2.2 .” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1076.","mla":"Sobral, D., et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey with Spectroscopic Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions at z = 0.8, 1.4 and 2.2 .” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 3, Oxford University Press, 2015, pp. 2303–23, doi:10.1093/mnras/stv1076.","short":"D. Sobral, J.J. Matthee, P.N. Best, I. Smail, A.A. Khostovan, B. Milvang-Jensen, J.-W. Kim, J. Stott, J. Calhau, H. Nayyeri, B. Mobasher, Monthly Notices of the Royal Astronomical Society 451 (2015) 2303–2323."},"publication":"Monthly Notices of the Royal Astronomical Society","article_processing_charge":"No","day":"11","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: formation","galaxies: luminosity function","mass function","cosmology: observations","early Universe","large-scale structure of Universe"],"scopus_import":"1"},{"date_created":"2022-07-14T11:57:03Z","date_updated":"2022-08-19T08:25:25Z","volume":451,"author":[{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"},{"full_name":"Santos, Sérgio","last_name":"Santos","first_name":"Sérgio"},{"full_name":"Röttgering, Huub","last_name":"Röttgering","first_name":"Huub"},{"full_name":"Darvish, Behnam","first_name":"Behnam","last_name":"Darvish"},{"first_name":"Bahram","last_name":"Mobasher","full_name":"Mobasher, Bahram"}],"publication_status":"published","publisher":"Oxford University Press","year":"2015","acknowledgement":"We thank the anonymous referee for the comments and suggestions which have improved the quality of this work. We thank Masami Ouchi for his useful comments on an earlier version of this paper. JM acknowledges the support of a Huygens PhD fellowship from Leiden University and is thankful for the hospitality of the Center for Astronomy and Astrophysics of the University of Lisbon where part of this research has been done. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship, from FCT through a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEstOE/FIS/UI2751/2014. HR acknowledges support from the ERC Advanced Investigator programme NewClusters 321271. We acknowledge the award of ESO DDT time (294.A-5018) for providing the possibility of a timely publication of this work.\r\nBased on observations with the Subaru Telescope (Programme IDs: our observations: S14A-086; archival: S05B-027, S06A-025, S06B-010, S07A-013, S07B-008, S08B-008 and S09A-017) and the W.M. Keck Observatory. The Subaru telescope is operated by the National Astronomical Observatory of Japan. The W.M. Keck Observatory is operated as a scientific partnership among the California Institute of Technology, the University of California and the National Aeronautics and Space Administration. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme ID 294.A-5018. Based on observations obtained with MegaPrime/Megacam, a joint project of CFHT and CEA/IRFU, at the Canada–France-Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France, and the University of Hawaii. This work is based in part on data products produced at Terapix available at the Canadian Astronomy Data Centre as part of the CFHT Legacy Survey, a collaborative project of NRC and CNRS. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme ID 179.A-2005 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium.\r\nIn addition to the CFHT-LS and COSMOS-UltraVISTA surveys, we are grateful for the excellent data sets from the UKIRT-DXS, SXDF and S-COSMOS survey teams, without these legacy surveys, this research would have been impossible. We have benefited greatly from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB, PYFITS, SCIPY and ASTROPY packages, the astronomical imaging tools SEXTRACTOR, SWARP and SCAMP and the indispensable TOPCAT analysis tool (Taylor 2013)","extern":"1","language":[{"iso":"eng"}],"doi":"10.1093/mnras/stv947","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1502.07355","open_access":"1"}],"external_id":{"arxiv":["1502.07355"]},"oa":1,"month":"07","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"oa_version":"Preprint","title":"Identification of the brightest Lyα emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era","status":"public","intvolume":" 451","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11581","abstract":[{"text":"Using wide-field narrow-band surveys, we provide a new measurement of the z = 6.6 Lymanα emitter (LAE) luminosity function (LF), which constraints the bright end for the first time. We use a combination of archival narrow-band NB921 data in UDS and new NB921 measurements in SA22 and COSMOS/UltraVISTA, all observed with the Subaru telescope, with a total area of ∼5 deg2. We exclude lower redshift interlopers by using broad-band optical and near-infrared photometry and also exclude three supernovae with data split over multiple epochs. Combining the UDS and COSMOS samples, we find no evolution of the bright end of the Lyα LF between z = 5.7 and 6.6, which is supported by spectroscopic follow-up, and conclude that sources with Himiko-like luminosity are not as rare as previously thought, with number densities of ∼1.5 × 10−5 Mpc−3. Combined with our wide-field SA22 measurements, our results indicate a non-Schechter-like bright end of the LF at z = 6.6 and a different evolution of observed faint and bright LAEs, overcoming cosmic variance. This differential evolution is also seen in the spectroscopic follow-up of UV-selected galaxies and is now also confirmed for LAEs, and we argue that it may be an effect of reionization. Using a toy model, we show that such differential evolution of the LF is expected, since brighter sources are able to ionize their surroundings earlier, such that Lyα photons are able to escape. Our targets are excellent candidates for detailed follow-up studies and provide the possibility to give a unique view on the earliest stages in the formation of galaxies and reionization process.","lang":"eng"}],"issue":"1","type":"journal_article","date_published":"2015-07-21T00:00:00Z","article_type":"original","page":"400-417","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"short":"J.J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, B. Mobasher, Monthly Notices of the Royal Astronomical Society 451 (2015) 400–417.","mla":"Matthee, Jorryt J., et al. “Identification of the Brightest Lyα Emitters at z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization Era.” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 1, Oxford University Press, 2015, pp. 400–17, doi:10.1093/mnras/stv947.","chicago":"Matthee, Jorryt J, David Sobral, Sérgio Santos, Huub Röttgering, Behnam Darvish, and Bahram Mobasher. “Identification of the Brightest Lyα Emitters at z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization Era.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv947.","ama":"Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. Identification of the brightest Lyα emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era. Monthly Notices of the Royal Astronomical Society. 2015;451(1):400-417. doi:10.1093/mnras/stv947","apa":"Matthee, J. J., Sobral, D., Santos, S., Röttgering, H., Darvish, B., & Mobasher, B. (2015). Identification of the brightest Lyα emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stv947","ieee":"J. J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, and B. Mobasher, “Identification of the brightest Lyα emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era,” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 1. Oxford University Press, pp. 400–417, 2015.","ista":"Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. 2015. Identification of the brightest Lyα emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era. Monthly Notices of the Royal Astronomical Society. 451(1), 400–417."},"day":"21","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"scopus_import":"1"},{"status":"public","title":"The brightest Lyα emitter: Pop III or black hole?","intvolume":" 453","_id":"11579","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"CR7 is the brightest z = 6.6 Ly α emitter (LAE) known to date, and spectroscopic follow-up by Sobral et al. suggests that CR7 might host Population (Pop) III stars. We examine this interpretation using cosmological hydrodynamical simulations. Several simulated galaxies show the same ‘Pop III wave’ pattern observed in CR7. However, to reproduce the extreme CR7 Ly α/He II1640 line luminosities (Lα/HeII) a top-heavy initial mass function and a massive ( ≳ 107 M⊙) Pop III burst with age ≲ 2 Myr are required. Assuming that the observed properties of Ly α and He II emission are typical for Pop III, we predict that in the COSMOS/UDS/SA22 fields, 14 out of the 30 LAEs at z = 6.6 with Lα > 1043.3 erg s−1 should also host Pop III stars producing an observable LHeII≳1042.7ergs−1. As an alternate explanation, we explore the possibility that CR7 is instead powered by accretion on to a direct collapse black hole. Our model predicts Lα, LHeII, and X-ray luminosities that are in agreement with the observations. In any case, the observed properties of CR7 indicate that this galaxy is most likely powered by sources formed from pristine gas. We propose that further X-ray observations can distinguish between the two above scenarios."}],"issue":"3","article_type":"original","page":"2465-2470","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"apa":"Pallottini, A., Ferrara, A., Pacucci, F., Gallerani, S., Salvadori, S., Schneider, R., … Matthee, J. J. (2015). The brightest Lyα emitter: Pop III or black hole? Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stv1795","ieee":"A. Pallottini et al., “The brightest Lyα emitter: Pop III or black hole?,” Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3. Oxford University Press, pp. 2465–2470, 2015.","ista":"Pallottini A, Ferrara A, Pacucci F, Gallerani S, Salvadori S, Schneider R, Schaerer D, Sobral D, Matthee JJ. 2015. The brightest Lyα emitter: Pop III or black hole? Monthly Notices of the Royal Astronomical Society. 453(3), 2465–2470.","ama":"Pallottini A, Ferrara A, Pacucci F, et al. The brightest Lyα emitter: Pop III or black hole? Monthly Notices of the Royal Astronomical Society. 2015;453(3):2465-2470. doi:10.1093/mnras/stv1795","chicago":"Pallottini, A., A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R. Schneider, D. Schaerer, D. Sobral, and Jorryt J Matthee. “The Brightest Lyα Emitter: Pop III or Black Hole?” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1795.","short":"A. Pallottini, A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R. Schneider, D. Schaerer, D. Sobral, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 453 (2015) 2465–2470.","mla":"Pallottini, A., et al. “The Brightest Lyα Emitter: Pop III or Black Hole?” Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3, Oxford University Press, 2015, pp. 2465–70, doi:10.1093/mnras/stv1795."},"date_published":"2015-11-01T00:00:00Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","black hole physics","stars: Population III","galaxies: high-redshift"],"scopus_import":"1","day":"01","article_processing_charge":"No","publication_status":"published","publisher":"Oxford University Press","acknowledgement":"SS acknowledges support from the Netherlands Organization for Scientific research (NWO), VENI grant 639.041.233. RS acknowledges support from the European Research Council under the European Union (FP/2007-2013)/ERC grant agreement no. 306476. DS acknowledges (i) financial support from the NWO through a Veni fellowship and (ii) funding from FCT through a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEstOE/FIS/UI2751/2014.","year":"2015","date_created":"2022-07-14T08:58:36Z","date_updated":"2022-08-19T08:19:23Z","volume":453,"author":[{"first_name":"A.","last_name":"Pallottini","full_name":"Pallottini, A."},{"full_name":"Ferrara, A.","first_name":"A.","last_name":"Ferrara"},{"full_name":"Pacucci, F.","first_name":"F.","last_name":"Pacucci"},{"full_name":"Gallerani, S.","last_name":"Gallerani","first_name":"S."},{"full_name":"Salvadori, S.","first_name":"S.","last_name":"Salvadori"},{"full_name":"Schneider, R.","first_name":"R.","last_name":"Schneider"},{"full_name":"Schaerer, D.","last_name":"Schaerer","first_name":"D."},{"full_name":"Sobral, D.","first_name":"D.","last_name":"Sobral"},{"full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"}],"extern":"1","quality_controlled":"1","oa":1,"external_id":{"arxiv":["1506.07173"]},"main_file_link":[{"url":"https://arxiv.org/abs/1506.07173","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1093/mnras/stv1795","month":"11","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]}},{"scopus_import":"1","keyword":["Algorithms","Economics","Clinching ascending auction","auctions with budgets","Sponsored search auctions"],"day":"05","article_processing_charge":"No","publication":"ACM Transactions on Economics and Computation","citation":{"ieee":"R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.","apa":"Colini-Baldeschi, R., Leonardi, S., Henzinger, M. H., & Starnberger, M. (2015). On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818357","ista":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. 2015. On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. 4(1), 2.","ama":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2818357","chicago":"Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika H Henzinger, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2818357.","short":"R. Colini-Baldeschi, S. Leonardi, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).","mla":"Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357."},"article_type":"original","date_published":"2015-12-05T00:00:00Z","type":"journal_article","abstract":[{"text":"We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto-optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto-optimal, and deterministic mechanisms for bidders with diminishing marginal valuations.","lang":"eng"}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11668","status":"public","title":"On multiple keyword sponsored search auctions with budgets","intvolume":" 4","oa_version":"Submitted Version","month":"12","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://eprints.cs.univie.ac.at/3510/"}],"quality_controlled":"1","doi":"10.1145/2818357","language":[{"iso":"eng"}],"article_number":"2","extern":"1","year":"2015","publication_status":"published","publisher":"Association for Computing Machinery","author":[{"last_name":"Colini-Baldeschi","first_name":"Riccardo","full_name":"Colini-Baldeschi, Riccardo"},{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Martin","last_name":"Starnberger","full_name":"Starnberger, Martin"}],"date_created":"2022-07-27T11:54:56Z","date_updated":"2023-02-09T10:03:35Z","volume":4},{"date_published":"2015-12-05T00:00:00Z","publication":"ACM Transactions on Economics and Computation","citation":{"chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Auctions for Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2818351.","mla":"Dütting, Paul, et al. “Auctions for Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 4, Association for Computing Machinery, 2015, doi:10.1145/2818351.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).","ista":"Dütting P, Henzinger MH, Starnberger M. 2015. Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. 4(1), 4.","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous items and budget limits,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.","apa":"Dütting, P., Henzinger, M. H., & Starnberger, M. (2015). Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818351","ama":"Dütting P, Henzinger MH, Starnberger M. Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2818351"},"article_type":"original","day":"05","article_processing_charge":"No","scopus_import":"1","keyword":["Algorithmic game theory","auction theory","Clinching auction","Pareto optimality","Budget limits"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11669","title":"Auctions for heterogeneous items and budget limits","status":"public","intvolume":" 4","abstract":[{"lang":"eng","text":"We study individual rational, Pareto-optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. We consider settings with multiunit demand and additive valuations. For single-dimensional valuations we prove a positive result for randomized mechanisms, and a negative result for deterministic mechanisms. While the positive result allows for private budgets, the negative result is for public budgets. For multidimensional valuations and public budgets we prove an impossibility result that applies to deterministic and randomized mechanisms. Taken together this shows the power of randomization in certain settings with heterogeneous items, but it also shows its limitations."}],"issue":"1","type":"journal_article","doi":"10.1145/2818351","language":[{"iso":"eng"}],"external_id":{"arxiv":["1209.6448"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1209.6448"}],"quality_controlled":"1","month":"12","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"author":[{"full_name":"Dütting, Paul","last_name":"Dütting","first_name":"Paul"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Starnberger, Martin","first_name":"Martin","last_name":"Starnberger"}],"date_updated":"2022-09-09T12:08:37Z","date_created":"2022-07-27T12:09:15Z","volume":4,"year":"2015","publication_status":"published","publisher":"Association for Computing Machinery","extern":"1","article_number":"4"},{"quality_controlled":"1","doi":"10.1145/2716312","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"eissn":["2167-8383"],"issn":["2167-8375"]},"acknowledgement":"We would like to thank Veronika Loitzenbauer and the anonymous referees for their valuable feedback.","year":"2015","publication_status":"published","publisher":"Association for Computing Machinery","author":[{"last_name":"Dütting","first_name":"Paul","full_name":"Dütting, Paul"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"}],"date_created":"2022-07-27T12:43:18Z","date_updated":"2023-02-09T10:08:41Z","volume":4,"article_number":"1","extern":"1","publication":"ACM Transactions on Economics and Computation","citation":{"ama":"Dütting P, Henzinger MH, Weber I. An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. 2015;4(1). doi:10.1145/2716312","apa":"Dütting, P., Henzinger, M. H., & Weber, I. (2015). An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2716312","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.","ista":"Dütting P, Henzinger MH, Weber I. 2015. An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. 4(1), 1.","short":"P. Dütting, M.H. Henzinger, I. Weber, ACM Transactions on Economics and Computation 4 (2015).","mla":"Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” ACM Transactions on Economics and Computation, vol. 4, no. 1, 1, Association for Computing Machinery, 2015, doi:10.1145/2716312.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “An Expressive Mechanism for Auctions on the Web.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2716312."},"article_type":"original","date_published":"2015-12-02T00:00:00Z","scopus_import":"1","keyword":["Computational Mathematics","Marketing","Economics and Econometrics","Statistics and Probability","Computer Science (miscellaneous)"],"day":"02","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11670","status":"public","title":"An expressive mechanism for auctions on the web","intvolume":" 4","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. [2009] takes a first step toward addressing the problem of limited expressiveness by computing a bidder optimal, envy-free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piecewise linear utility functions with nonidentical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are nondegenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy-free outcomes for a general class of continuous utility functions via piecewise linear approximation. Finally, we prove hardness results for even more expressive settings."}],"issue":"1"},{"intvolume":" 9470","title":"Combinatorial auctions with conflict-based externalities","status":"public","_id":"11774","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder’s valuation often does not depend solely on the goods assigned to him. For instance, in adwords auctions an advertiser might not want his ads to be displayed next to his competitors’ ads. In this paper, we propose and analyze several natural graph-theoretic models that incorporate such negative externalities, in which bidders form a directed conflict graph with maximum out-degree Δ. We design algorithms and truthful mechanisms for social welfare maximization that attain approximation ratios depending on Δ.\r\n\r\nFor CA, our results are twofold: (1) A lottery that eliminates conflicts by discarding bidders/items independent of the bids. It allows to apply any truthful 𝛼-approximation mechanism for conflict-free valuations and yields an 𝒪(𝛼Δ)-approximation mechanism. (2) For fractionally sub-additive valuations, we design a rounding algorithm via a novel combination of a semi-definite program and a linear program, resulting in a cone program; the approximation ratio is 𝒪((ΔloglogΔ)/logΔ). The ratios are almost optimal given existing hardness results.\r\n\r\nFor adwords auctions, we present several algorithms for the most relevant scenario when the number of items is small. In particular, we design a truthful mechanism with approximation ratio 𝑜(Δ) when the number of items is only logarithmic in the number of bidders."}],"page":"230–243","citation":{"mla":"Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.” 11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.","short":"Y.K. Cheung, M.H. Henzinger, M. Hoefer, M. Starnberger, in:, 11th International Conference on Web and Internet Economics, Springer Nature, 2015, pp. 230–243.","chicago":"Cheung, Yun Kuen, Monika H Henzinger, Martin Hoefer, and Martin Starnberger. “Combinatorial Auctions with Conflict-Based Externalities.” In 11th International Conference on Web and Internet Economics, 9470:230–243. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_17.","ama":"Cheung YK, Henzinger MH, Hoefer M, Starnberger M. Combinatorial auctions with conflict-based externalities. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:230–243. doi:10.1007/978-3-662-48995-6_17","ista":"Cheung YK, Henzinger MH, Hoefer M, Starnberger M. 2015. Combinatorial auctions with conflict-based externalities. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 230–243.","apa":"Cheung, Y. K., Henzinger, M. H., Hoefer, M., & Starnberger, M. (2015). Combinatorial auctions with conflict-based externalities. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 230–243). Amsterdam, Netherlands: Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_17","ieee":"Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243."},"publication":"11th International Conference on Web and Internet Economics","date_published":"2015-12-09T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"09","publisher":"Springer Nature","publication_status":"published","year":"2015","volume":9470,"date_created":"2022-08-08T13:54:32Z","date_updated":"2023-02-10T09:08:30Z","author":[{"last_name":"Cheung","first_name":"Yun Kuen","full_name":"Cheung, Yun Kuen"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"},{"full_name":"Starnberger, Martin","first_name":"Martin","last_name":"Starnberger"}],"extern":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1509.09147"}],"external_id":{"arxiv":["1509.09147"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48995-6_17","conference":{"start_date":"2015-12-09","location":"Amsterdam, Netherlands","end_date":"2015-12-12","name":"WINE: International Conference on Web and Internet Economics"},"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783662489956"],"isbn":["9783662489949"]},"month":"12"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48995-6_8","conference":{"location":"Amsterdam, Netherlands","start_date":"2015-09-09","end_date":"2015-09-12","name":"WINE: International Conference on Web and Internet Economics"},"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1604.05562","open_access":"1"}],"external_id":{"arxiv":["1604.05562"]},"oa":1,"publication_identifier":{"isbn":["9783662489949"],"eisbn":["9783662489956"],"issn":["0302-9743"]},"month":"12","volume":9470,"date_created":"2022-08-08T13:33:56Z","date_updated":"2023-02-10T09:06:23Z","author":[{"full_name":"Ben-Zwi, Oren","last_name":"Ben-Zwi","first_name":"Oren"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publisher":"Springer Nature","publication_status":"published","year":"2015","extern":"1","date_published":"2015-12-09T00:00:00Z","page":"104–117","citation":{"ama":"Ben-Zwi O, Henzinger MH, Loitzenbauer V. Ad exchange: Envy-free auctions with mediators. In: 11th International Conference on Web and Internet Economics. Vol 9470. Springer Nature; 2015:104–117. doi:10.1007/978-3-662-48995-6_8","ista":"Ben-Zwi O, Henzinger MH, Loitzenbauer V. 2015. Ad exchange: Envy-free auctions with mediators. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 104–117.","ieee":"O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.","apa":"Ben-Zwi, O., Henzinger, M. H., & Loitzenbauer, V. (2015). Ad exchange: Envy-free auctions with mediators. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 104–117). Amsterdam, Netherlands: Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_8","mla":"Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.” 11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8.","short":"O. Ben-Zwi, M.H. Henzinger, V. Loitzenbauer, in:, 11th International Conference on Web and Internet Economics, Springer Nature, 2015, pp. 104–117.","chicago":"Ben-Zwi, Oren, Monika H Henzinger, and Veronika Loitzenbauer. “Ad Exchange: Envy-Free Auctions with Mediators.” In 11th International Conference on Web and Internet Economics, 9470:104–117. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_8."},"publication":"11th International Conference on Web and Internet Economics","article_processing_charge":"No","day":"09","scopus_import":"1","oa_version":"Preprint","intvolume":" 9470","status":"public","title":"Ad exchange: Envy-free auctions with mediators","_id":"11773","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Ad exchanges are an emerging platform for trading advertisement slots on the web with billions of dollars revenue per year. Every time a user visits a web page, the publisher of that web page can ask an ad exchange to auction off the ad slots on this page to determine which advertisements are shown at which price. Due to the high volume of traffic, ad networks typically act as mediators for individual advertisers at ad exchanges. If multiple advertisers in an ad network are interested in the ad slots of the same auction, the ad network might use a “local” auction to resell the obtained ad slots among its advertisers.\r\n\r\nIn this work we want to deepen the theoretical understanding of these new markets by analyzing them from the viewpoint of combinatorial auctions. Prior work studied mostly single-item auctions, while we allow the advertisers to express richer preferences over multiple items. We develop a game-theoretic model for the entanglement of the central auction at the ad exchange with the local auctions at the ad networks. We consider the incentives of all three involved parties and suggest a three-party competitive equilibrium, an extension of the Walrasian equilibrium that ensures envy-freeness for all participants. We show the existence of a three-party competitive equilibrium and a polynomial-time algorithm to find one for gross-substitute bidder valuations."}],"alternative_title":["LNCS"],"type":"conference"},{"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11785","intvolume":" 9134","status":"public","title":"Improved algorithms for decremental single-source reachability on directed graphs","abstract":[{"lang":"eng","text":"Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with 𝑜(𝑚𝑛) total update time, where 𝑚 is the number of edges and 𝑛 is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different 𝑚 vs. 𝑛 trade-off. For the case of 𝑚=Θ(𝑛1.5) the running time is 𝑂(𝑛2.47), just barely below 𝑚𝑛=Θ(𝑛2.5). In this paper we simplify the previous algorithm using new algorithmic ideas and achieve an improved running time of 𝑂̃ (min(𝑚7/6𝑛2/3,𝑚3/4𝑛5/4+𝑜(1),𝑚2/3𝑛4/3+𝑜(1)+𝑚3/7𝑛12/7+𝑜(1))). This gives, e.g., 𝑂(𝑛2.36) for the notorious case 𝑚=Θ(𝑛1.5). We obtain the same upper bounds for the problem of maintaining the strongly connected components of a directed graph undergoing edge deletions. Our algorithms are correct with high probabililty against an oblivious adversary."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2015-01-01T00:00:00Z","citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental single-source reachability on directed graphs. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 725–736.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms for decremental single-source reachability on directed graphs. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental single-source reachability on directed graphs. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736. doi:10.1007/978-3-662-47672-7_59","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In 42nd International Colloquium on Automata, Languages and Programming, 9134:725–36. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59.","mla":"Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.” 42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736."},"publication":"42nd International Colloquium on Automata, Languages and Programming","page":"725 - 736","article_processing_charge":"No","day":"01","scopus_import":"1","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"volume":9134,"date_created":"2022-08-11T08:51:32Z","date_updated":"2023-02-10T09:10:26Z","year":"2015","publisher":"Springer Nature","publication_status":"published","extern":"1","doi":"10.1007/978-3-662-47672-7_59","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1612.03856"]},"main_file_link":[{"url":"https://arxiv.org/abs/1612.03856","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"isbn":["9783662476710"],"issn":["0302-9743"]},"month":"01"},{"extern":"1","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"date_updated":"2023-02-10T09:21:47Z","date_created":"2022-08-11T09:38:34Z","volume":9134,"year":"2015","publication_status":"published","publisher":"Springer Nature","month":"07","publication_identifier":{"isbn":["9783662476710"],"issn":["0302-9743"]},"conference":{"end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-07-06","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"doi":"10.1007/978-3-662-47672-7_58","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.6466"}],"oa":1,"external_id":{"arxiv":["1412.6466"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs with m edges and n vertices only rather simple O(m n)-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time 𝑂(𝑛2). For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an 𝑂(𝑚2/log𝑛)-time algorithm for 2-edge strongly connected components, and thus improve over the O(m n) running time also when 𝑚=𝑂(𝑛). Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of 𝑂(𝑛2log𝑛) for k-edge-connectivity and 𝑂(𝑛3) for k-vertex-connectivity."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11787","status":"public","title":"Finding 2-edge and 2-vertex strongly connected components in quadratic time","intvolume":" 9134","day":"06","article_processing_charge":"No","scopus_import":"1","date_published":"2015-07-06T00:00:00Z","publication":"2nd International Colloquium on Automata, Languages and Programming","citation":{"mla":"Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” 2nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.","short":"M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd International Colloquium on Automata, Languages and Programming, 9134:713–24. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.","ama":"Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly connected components in quadratic time. In: 2nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724. doi:10.1007/978-3-662-47672-7_58","ista":"Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex strongly connected components in quadratic time. 2nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 713–724.","apa":"Henzinger, M. H., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge and 2-vertex strongly connected components in quadratic time. In 2nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58","ieee":"M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724."},"page":"713 - 724"},{"quality_controlled":"1","external_id":{"arxiv":["1604.05603"]},"main_file_link":[{"url":"https://arxiv.org/abs/1604.05603","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-18263-6_14","conference":{"name":"WAOA: International Workshop on Approximation and Online Algorithms","end_date":"2014-09-12","location":"Wroclaw, Poland","start_date":"2014-09-11"},"publication_identifier":{"issn":["0302-9743"]},"month":"01","publisher":"Springer Nature","publication_status":"published","year":"2015","volume":8952,"date_created":"2022-08-11T09:43:32Z","date_updated":"2023-02-10T09:26:06Z","author":[{"last_name":"Dvořák","first_name":"Wolfgang","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"extern":"1","page":"156–167","citation":{"ista":"Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th International Workshop of Approximation and Online Algorithms. WAOA: International Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.","apa":"Dvořák, W., & Henzinger, M. H. (2015). Online ad assignment with an ad exchange. In 12th International Workshop of Approximation and Online Algorithms (Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14","ieee":"W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.","ama":"Dvořák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th International Workshop of Approximation and Online Algorithms. Vol 8952. Springer Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14","chicago":"Dvořák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an Ad Exchange.” In 12th International Workshop of Approximation and Online Algorithms, 8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14.","mla":"Dvořák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad Exchange.” 12th International Workshop of Approximation and Online Algorithms, vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.","short":"W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation and Online Algorithms, Springer Nature, 2015, pp. 156–167."},"publication":"12th International Workshop of Approximation and Online Algorithms","date_published":"2015-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 8952","status":"public","title":"Online ad assignment with an ad exchange","_id":"11788","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whether (a) to assign it to a contracted advertiser and if so to which one or (b) to sell it at the ad exchange and if so at which reserve price. We make no assumptions about the distribution of the advertiser valuations that participate in the ad exchange and show that there exists a simple primal-dual based online algorithm, whose lower bound for the revenue converges to 𝑅𝐴𝐷𝑋+𝑅𝐴(1−1/𝑒), where 𝑅𝐴𝐷𝑋 is the revenue that the optimum algorithm achieves from the ad exchange and 𝑅𝐴 is the revenue that the optimum algorithm achieves from the contracted advertisers."}]},{"abstract":[{"lang":"eng","text":"In this paper, 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 𝑂(𝑓2)-approximately optimal solution in 𝑂(𝑓⋅log(𝑚+𝑛)) amortized update time, where 𝑓 is the maximum “frequency” of an element, 𝑛 is the number of sets, and 𝑚 is the maximum number of elements in the universe at any point in time. (2) For the dynamic 𝑏-matching problem, we maintain an 𝑂(1)-approximately optimal solution in 𝑂(log3𝑛) amortized update time, where 𝑛 is the number of nodes in the graph."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11786","intvolume":" 9134","title":"Design of dynamic algorithms via primal-dual method","status":"public","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2015-01-01T00:00:00Z","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_17.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 42nd International Colloquium on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.","mla":"Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.” 42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2015). Design of dynamic algorithms via primal-dual method. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_17","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms via primal-dual method. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 206–218.","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via primal-dual method. In: 42nd International Colloquium on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17"},"publication":"42nd International Colloquium on Automata, Languages and Programming","page":"206 - 218","extern":"1","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F.","last_name":"Italiano"}],"volume":9134,"date_updated":"2023-02-10T09:13:31Z","date_created":"2022-08-11T09:28:49Z","year":"2015","publisher":"Springer Nature","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783662476710"]},"month":"01","doi":"10.1007/978-3-662-47672-7_17","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05337"}],"oa":1,"external_id":{"arxiv":["1604.05337"]},"quality_controlled":"1"},{"date_created":"2022-08-16T06:43:49Z","date_updated":"2023-02-17T09:30:08Z","volume":6,"author":[{"full_name":"Chernomor, Olga","last_name":"Chernomor","first_name":"Olga"},{"full_name":"Minh, Bui Quang","first_name":"Bui Quang","last_name":"Minh"},{"full_name":"Forest, Félix","last_name":"Forest","first_name":"Félix"},{"first_name":"Steffen","last_name":"Klaere","full_name":"Klaere, Steffen"},{"first_name":"Travis","last_name":"Ingram","full_name":"Ingram, Travis"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"von Haeseler, Arndt","first_name":"Arndt","last_name":"von Haeseler"}],"publication_status":"published","publisher":"Wiley","year":"2015","pmid":1,"extern":"1","file_date_updated":"2022-08-16T06:52:53Z","language":[{"iso":"eng"}],"doi":"10.1111/2041-210x.12299","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["25893087"]},"month":"01","publication_identifier":{"eissn":["2041-210X"]},"file":[{"file_name":"2015_MethodsInEcologyAndEvolutionChernomor.pdf","access_level":"open_access","file_size":411415,"content_type":"application/pdf","creator":"asandaue","relation":"main_file","file_id":"11846","date_created":"2022-08-16T06:52:53Z","date_updated":"2022-08-16T06:52:53Z","checksum":"880e78f09f0ac99cb351c48dc97623b6","success":1}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Split diversity in constrained conservation prioritization using integer linear programming","intvolume":" 6","_id":"11845","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.\r\nDepending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator–prey interactions between the species in a community to define viability constraints.\r\nDespite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.\r\nWe exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.","lang":"eng"}],"issue":"1","type":"journal_article","date_published":"2015-01-01T00:00:00Z","article_type":"original","page":"83-91","publication":"Methods in Ecology and Evolution","citation":{"ista":"Chernomor O, Minh BQ, Forest F, Klaere S, Ingram T, Henzinger MH, von Haeseler A. 2015. Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. 6(1), 83–91.","apa":"Chernomor, O., Minh, B. Q., Forest, F., Klaere, S., Ingram, T., Henzinger, M. H., & von Haeseler, A. (2015). Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. Wiley. https://doi.org/10.1111/2041-210x.12299","ieee":"O. Chernomor et al., “Split diversity in constrained conservation prioritization using integer linear programming,” Methods in Ecology and Evolution, vol. 6, no. 1. Wiley, pp. 83–91, 2015.","ama":"Chernomor O, Minh BQ, Forest F, et al. Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. 2015;6(1):83-91. doi:10.1111/2041-210x.12299","chicago":"Chernomor, Olga, Bui Quang Minh, Félix Forest, Steffen Klaere, Travis Ingram, Monika H Henzinger, and Arndt von Haeseler. “Split Diversity in Constrained Conservation Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution. Wiley, 2015. https://doi.org/10.1111/2041-210x.12299.","mla":"Chernomor, Olga, et al. “Split Diversity in Constrained Conservation Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution, vol. 6, no. 1, Wiley, 2015, pp. 83–91, doi:10.1111/2041-210x.12299.","short":"O. Chernomor, B.Q. Minh, F. Forest, S. Klaere, T. Ingram, M.H. Henzinger, A. von Haeseler, Methods in Ecology and Evolution 6 (2015) 83–91."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"title":"Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture","publication_status":"published","status":"public","publisher":"Association for Computing Machinery","_id":"11868","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-16T09:31:21Z","date_updated":"2023-02-17T11:09:54Z","oa_version":"Preprint","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"},{"full_name":"Saranurak, Thatchaphol","first_name":"Thatchaphol","last_name":"Saranurak"}],"article_number":"21-30","type":"conference","extern":"1","abstract":[{"lang":"eng","text":"Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an n x n matrix M and will receive n column-vectors of size n, denoted by v1, ..., vn, one by one. After seeing each vector vi, we have to output the product Mvi before we can see the next vector. A naive algorithm can solve this problem using O(n3) time in total, and its running time can be slightly improved to O(n3/log2 n) [Williams SODA'07]. We show that a conjecture that there is no truly subcubic (O(n3-ε)) time algorithm for this problem can be used to exhibit the underlying polynomial time hardness shared by many dynamic problems. For a number of problems, such as subgraph connectivity, Pagh's problem, d-failure connectivity, decremental single-source shortest paths, and decremental transitive closure, this conjecture implies tight hardness results. Thus, proving or disproving this conjecture will be very interesting as it will either imply several tight unconditional lower bounds or break through a common barrier that blocks progress with these problems. This conjecture might also be considered as strong evidence against any further improvement for these problems since refuting it will imply a major breakthrough for combinatorial Boolean matrix multiplication and other long-standing problems if the term \"combinatorial algorithms\" is interpreted as \"Strassen-like algorithms\" [Ballard et al. SPAA'11].\r\n\r\nThe conjecture also leads to hardness results for problems that were previously based on diverse problems and conjectures -- such as 3SUM, combinatorial Boolean matrix multiplication, triangle detection, and multiphase -- thus providing a uniform way to prove polynomial hardness results for dynamic algorithms; some of the new proofs are also simpler or even become trivial. The conjecture also leads to stronger and new, non-trivial, hardness results, e.g., for the fully-dynamic densest subgraph and diameter problems."}],"quality_controlled":"1","publication":"47th Annual ACM Symposium on Theory of Computing","main_file_link":[{"url":"https://arxiv.org/abs/1511.06773","open_access":"1"}],"external_id":{"arxiv":["1511.06773"]},"citation":{"ama":"Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2015. doi:10.1145/2746539.2746609","ista":"Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 21–30.","ieee":"M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015.","apa":"Henzinger, M. H., Krinninger, S., Nanongkai, D., & Saranurak, T. (2015). Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In 47th Annual ACM Symposium on Theory of Computing. Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746609","mla":"Henzinger, Monika H., et al. “Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.” 47th Annual ACM Symposium on Theory of Computing, 21–30, Association for Computing Machinery, 2015, doi:10.1145/2746539.2746609.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, T. Saranurak, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015.","chicago":"Henzinger, Monika H, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. “Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.” In 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746609."},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"STOC: Symposium on Theory of Computing","location":"Portland, OR, United States","start_date":"2015-06-14","end_date":"2015-06-17"},"doi":"10.1145/2746539.2746609","date_published":"2015-06-14T00:00:00Z","scopus_import":"1","month":"06","day":"14","publication_identifier":{"isbn":["978-145033536-2"],"issn":["0737.8017"]},"article_processing_charge":"No"},{"oa_version":"Preprint","date_updated":"2023-02-17T11:17:03Z","date_created":"2022-08-16T09:36:48Z","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"},{"last_name":"Tsourakakis","first_name":"Charalampos","full_name":"Tsourakakis, Charalampos"}],"publisher":"Association for Computing Machinery","status":"public","publication_status":"published","title":"Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams","_id":"11869","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"lang":"eng","text":"While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of both time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called densest subgraph problem. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge.\r\n\r\nGiven an input graph, the densest subgraph is the subgraph that maximizes the ratio between the number of edges and the number of nodes. For any ε>0, our algorithm can, with high probability, maintain a (4+ε)-approximate solution under edge insertions and deletions using ~O(n) space and ~O(1) amortized time per update; here, $n$ is the number of nodes in the graph and ~O hides the O(polylog_{1+ε} n) term. The approximation ratio can be improved to (2+ε) with more time. It can be extended to a (2+ε)-approximation sublinear-time algorithm and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm that can maintain the densest subgraph in one pass. Prior to this, no algorithm could do so even in the special case of an incremental stream and even when there is no time restriction. The previously best algorithm in this setting required O(log n) passes [BahmaniKV12]. The space required by our algorithm is tight up to a polylogarithmic factor."}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1145/2746539.2746592","date_published":"2015-06-01T00:00:00Z","conference":{"location":"Portland, OR, United States","start_date":"2015-06-14","end_date":"2015-06-17","name":"STOC: Symposium on Theory of Computing"},"page":"173 - 182","quality_controlled":"1","citation":{"short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–182.","mla":"Bhattacharya, Sayan, et al. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.” 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–82, doi:10.1145/2746539.2746592.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.” In 47th Annual ACM Symposium on Theory of Computing, 173–82. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746592.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2015:173-182. doi:10.1145/2746539.2746592","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Tsourakakis, C. (2015). Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp. 173–182). Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746592","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015, pp. 173–182.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 173–182."},"external_id":{"arxiv":["1504.02268"]},"main_file_link":[{"url":"https://arxiv.org/abs/1504.02268","open_access":"1"}],"oa":1,"publication":"47th Annual ACM Symposium on Theory of Computing","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145033536-2"]},"article_processing_charge":"No","day":"01","month":"06","scopus_import":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11837","status":"public","title":"Welfare maximization with friends-of-friends network externalities","intvolume":" 30","oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1-1/e). (2) On the positive side we present (i) an O(sqrt n)-approximation algorithm for general concave externality functions,\r\n(ii) an O(\\log m)-approximation algorithm for linear externality functions, and (iii) an (1-1/e)\\frac{1}{6}-approximation algorithm for 2-hop step function externalities. We also improve the result from [6] for 1-hop step function externalities by giving a (1-1/e)/2-approximation algorithm.","lang":"eng"}],"publication":"32nd International Symposium on Theoretical Aspects of Computer Science","citation":{"mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” 32nd International Symposium on Theoretical Aspects of Computer Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.","short":"S. Bhattacharya, W. Dvorák, M.H. Henzinger, Martin Starnberger, in:, 32nd International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102.","chicago":"Bhattacharya, Sayan, Wolfgang Dvorák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” In 32nd International Symposium on Theoretical Aspects of Computer Science, 30:90–102. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPICS.STACS.2015.90.","ama":"Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. Welfare maximization with friends-of-friends network externalities. In: 32nd International Symposium on Theoretical Aspects of Computer Science. Vol 30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:90-102. doi:10.4230/LIPICS.STACS.2015.90","ista":"Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. 2015. Welfare maximization with friends-of-friends network externalities. 32nd International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 30, 90–102.","apa":"Bhattacharya, S., Dvorák, W., Henzinger, M. H., & Starnberger, Martin. (2015). Welfare maximization with friends-of-friends network externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.STACS.2015.90","ieee":"S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102."},"page":"90-102","date_published":"2015-02-26T00:00:00Z","scopus_import":"1","day":"26","article_processing_charge":"No","year":"2015","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Starnberger, Martin","first_name":" Martin","last_name":"Starnberger"}],"related_material":{"record":[{"id":"11903","relation":"later_version","status":"public"}]},"date_updated":"2023-02-21T16:32:37Z","date_created":"2022-08-12T11:39:40Z","volume":30,"extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.STACS.2015.90"}],"oa":1,"quality_controlled":"1","conference":{"location":"Garching, Germany","start_date":"2015-03-04","end_date":"2015-03-07","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"doi":"10.4230/LIPICS.STACS.2015.90","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"isbn":["978-3-939897-78-1"],"issn":["1868-8969"]}},{"volume":573,"date_created":"2022-08-17T09:06:53Z","date_updated":"2023-02-17T14:50:04Z","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"publisher":"Elsevier","publication_status":"published","year":"2015","extern":"1","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2015.01.033","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.tcs.2015.01.033"}],"oa":1,"publication_identifier":{"issn":["0304-3975"]},"month":"03","oa_version":"None","intvolume":" 573","status":"public","title":"Truthful unit-demand auctions with budgets revisited","_id":"11901","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider auctions of indivisible items to unit-demand bidders with budgets. This setting was suggested as an expressive model for single sponsored search auctions. Prior work presented mechanisms that compute bidder-optimal outcomes and are truthful for a restricted set of inputs, i.e., inputs in so-called general position. This condition is easily violated. We provide the first mechanism that is truthful in expectation for all inputs and achieves for each bidder no worse utility than the bidder-optimal outcome. Additionally we give a complete characterization for which inputs mechanisms that compute bidder-optimal outcomes are truthful.","lang":"eng"}],"type":"journal_article","date_published":"2015-03-30T00:00:00Z","page":"1-15","article_type":"original","citation":{"ama":"Henzinger MH, Loitzenbauer V. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 2015;573:1-15. doi:10.1016/j.tcs.2015.01.033","ieee":"M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.","apa":"Henzinger, M. H., & Loitzenbauer, V. (2015). Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.033","ista":"Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. 573, 1–15.","short":"M.H. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015) 1–15.","mla":"Henzinger, Monika H., and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.” Theoretical Computer Science, vol. 573, Elsevier, 2015, pp. 1–15, doi:10.1016/j.tcs.2015.01.033.","chicago":"Henzinger, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.033."},"publication":"Theoretical Computer Science","article_processing_charge":"No","day":"30","scopus_import":"1"},{"scopus_import":"1","day":"09","article_processing_charge":"No","article_type":"original","page":"4368-4376","publication":"Chemistry - A European Journal","citation":{"ama":"Pieber B, Glasnov T, Kappe CO. Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. 2015;21(11):4368-4376. doi:10.1002/chem.201406439","ista":"Pieber B, Glasnov T, Kappe CO. 2015. Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. 21(11), 4368–4376.","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs,” Chemistry - A European Journal, vol. 21, no. 11. Wiley, pp. 4368–4376, 2015.","apa":"Pieber, B., Glasnov, T., & Kappe, C. O. (2015). Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. Wiley. https://doi.org/10.1002/chem.201406439","mla":"Pieber, Bartholomäus, et al. “Continuous Flow Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry - A European Journal, vol. 21, no. 11, Wiley, 2015, pp. 4368–76, doi:10.1002/chem.201406439.","short":"B. Pieber, T. Glasnov, C.O. Kappe, Chemistry - A European Journal 21 (2015) 4368–4376.","chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. Oliver Kappe. “Continuous Flow Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry - A European Journal. Wiley, 2015. https://doi.org/10.1002/chem.201406439."},"date_published":"2015-03-09T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"One of the rare alternative reagents for the reduction of carbon–carbon double bonds is diimide (HNNH), which can be generated in situ from hydrazine hydrate (N2H4⋅H2O) and O2. Although this selective method is extremely clean and powerful, it is rarely used, as the rate-determining oxidation of hydrazine in the absence of a catalyst is relatively slow using conventional batch protocols. A continuous high-temperature/high-pressure methodology dramatically enhances the initial oxidation step, at the same time allowing for a safe and scalable processing of the hazardous reaction mixture. Simple alkenes can be selectively reduced within 10–20 min at 100–120 °C and 20 bar O2 pressure. The development of a multi-injection reactor platform for the periodic addition of N2H4⋅H2O enables the reduction of less reactive olefins even at lower reaction temperatures. This concept was utilized for the highly selective reduction of artemisinic acid to dihydroartemisinic acid, the precursor molecule for the semisynthesis of the antimalarial drug artemisinin. The industrially relevant reduction was achieved by using four consecutive liquid feeds (of N2H4⋅H2O) and residence time units resulting in a highly selective reduction within approximately 40 min at 60 °C and 20 bar O2 pressure, providing dihydroartemisinic acid in ≥93 % yield and ≥95 % selectivity."}],"issue":"11","status":"public","title":"Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs","intvolume":" 21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11962","oa_version":"None","month":"03","publication_identifier":{"eissn":["1521-3765"],"issn":["0947-6539"]},"quality_controlled":"1","external_id":{"pmid":["25655090"]},"language":[{"iso":"eng"}],"doi":"10.1002/chem.201406439","extern":"1","publication_status":"published","publisher":"Wiley","year":"2015","pmid":1,"date_created":"2022-08-24T11:11:10Z","date_updated":"2023-02-21T10:09:30Z","volume":21,"author":[{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"full_name":"Glasnov, Toma","last_name":"Glasnov","first_name":"Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}]}]