[{"date_updated":"2026-06-18T17:50:38Z","department":[{"_id":"KrPi"}],"title":"Anonymous transferable e-cash","ec_funded":1,"_id":"1651","publication_identifier":{"isbn":["978-3-662-46446-5"]},"isi":1,"oa_version":"Published Version","type":"conference","publisher":"Springer","publication_status":"published","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"month":"03","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-662-46447-2_5"}],"article_processing_charge":"No","conference":{"start_date":"2015-03-30","location":"Gaithersburg, MD, United States","name":"PKC: Public Key Crypography","end_date":"2015-04-01"},"oa":1,"ddc":["000"],"abstract":[{"text":"Cryptographic e-cash allows off-line electronic transactions between a bank, users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions has been proposed in the literature; however, these traditional e-cash schemes only allow coins to be transferred once between users and merchants. Ideally, we would like users to be able to transfer coins between each other multiple times before deposit, as happens with physical cash. “Transferable” e-cash schemes are the solution to this problem. Unfortunately, the currently proposed schemes are either completely impractical or do not achieve the desirable anonymity properties without compromises, such as assuming the existence of a trusted “judge” who can trace all coins and users in the system. This paper presents the first efficient and fully anonymous transferable e-cash scheme without any trusted third parties. We start by revising the security and anonymity properties of transferable e-cash to capture issues that were previously overlooked. For our construction we use the recently proposed malleable signatures by Chase et al. to allow the secure and anonymous transfer of coins, combined with a new efficient double-spending detection mechanism. Finally, we discuss an instantiation of our construction.","lang":"eng"}],"doi":"10.1007/978-3-662-46447-2_5","intvolume":"      9020","alternative_title":["LNCS"],"day":"17","scopus_import":"1","quality_controlled":"1","date_created":"2018-12-11T11:53:15Z","citation":{"apa":"Baldimtsi, F., Chase, M., Fuchsbauer, G., &#38; Kohlweiss, M. (2015). Anonymous transferable e-cash. In <i>Public-Key Cryptography - PKC 2015</i> (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>","chicago":"Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.” In <i>Public-Key Cryptography - PKC 2015</i>, 9020:101–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>.","mla":"Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” <i>Public-Key Cryptography - PKC 2015</i>, vol. 9020, Springer, 2015, pp. 101–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>.","ista":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS, vol. 9020, 101–124.","ieee":"F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable e-cash,” in <i>Public-Key Cryptography - PKC 2015</i>, Gaithersburg, MD, United States, 2015, vol. 9020, pp. 101–124.","short":"F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography - PKC 2015, Springer, 2015, pp. 101–124.","ama":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash. In: <i>Public-Key Cryptography - PKC 2015</i>. Vol 9020. Springer; 2015:101-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>"},"year":"2015","page":"101 - 124","language":[{"iso":"eng"}],"publication":"Public-Key Cryptography - PKC 2015","author":[{"full_name":"Baldimtsi, Foteini","last_name":"Baldimtsi","first_name":"Foteini"},{"first_name":"Melissa","full_name":"Chase, Melissa","last_name":"Chase"},{"last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","first_name":"Georg"},{"full_name":"Kohlweiss, Markulf","last_name":"Kohlweiss","first_name":"Markulf"}],"external_id":{"isi":["000406205700005"]},"publist_id":"5499","volume":9020,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-03-17T00:00:00Z","status":"public","acknowledgement":"Work done as an intern in Microsoft Research Redmond and as a student at Brown University, where supported by NSF grant 0964379. Supported by the European Research Council, ERC Starting Grant (259668-PSPC)."},{"oa_version":"Published Version","publication_status":"published","publisher":"National Academy of Sciences","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4343110/"}],"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"month":"02","title":"An early secretory pathway mediated by gnom-like 1 and gnom is essential for basal polarity establishment in Arabidopsis thaliana","department":[{"_id":"JiFr"}],"date_updated":"2026-06-18T17:48:36Z","isi":1,"_id":"1569","ec_funded":1,"issue":"7","publication":"PNAS","language":[{"iso":"eng"}],"page":"E806 - E815","year":"2015","status":"public","acknowledgement":"This work was supported by Vetenskapsrådet and Vinnova (Verket för Innovationssystemet) (S.M.D., T.V., M.Ł., and S.R.), Knut och Alice Wallenbergs Stiftelse (S.M.D., A.R., and C.V.), Kempestiftelserna (A.H. and Q.M.), Carl Tryggers Stiftelse för Vetenskaplig Forskning (Q.M.), European Research Council Grant ERC-2011-StG-20101109-PSDP (to J.F.), US Department of Energy Grant DE-FG02-02ER15295 (to N.V.R.), and National Science Foundation Grant MCB-0817916 (to N.V.R. and G.R.H.). ","publist_id":"5602","volume":112,"author":[{"full_name":"Doyle, Siamsa","last_name":"Doyle","first_name":"Siamsa"},{"last_name":"Haegera","full_name":"Haegera, Ash","first_name":"Ash"},{"last_name":"Vain","full_name":"Vain, Thomas","first_name":"Thomas"},{"full_name":"Rigala, Adeline","last_name":"Rigala","first_name":"Adeline"},{"first_name":"Corrado","last_name":"Viotti","full_name":"Viotti, Corrado"},{"full_name":"Łangowskaa, Małgorzata","last_name":"Łangowskaa","first_name":"Małgorzata"},{"first_name":"Qian","full_name":"Maa, Qian","last_name":"Maa"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"},{"first_name":"Natasha","full_name":"Raikhel, Natasha","last_name":"Raikhel"},{"first_name":"Glenn","full_name":"Hickse, Glenn","last_name":"Hickse"},{"first_name":"Stéphanie","full_name":"Robert, Stéphanie","last_name":"Robert"}],"external_id":{"isi":["000349446000025"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-02-17T00:00:00Z","oa":1,"abstract":[{"lang":"eng","text":"Spatial regulation of the plant hormone indole-3-acetic acid (IAA, or auxin) is essential for plant development. Auxin gradient establishment is mediated by polarly localized auxin transporters, including PIN-FORMED (PIN) proteins. Their localization and abundance at the plasma membrane are tightly regulated by endomembrane machinery, especially the endocytic and recycling pathways mediated by the ADP ribosylation factor guanine nucleotide exchange factor (ARF-GEF) GNOM. We assessed the role of the early secretory pathway in establishing PIN1 polarity in Arabidopsis thaliana by pharmacological and genetic approaches. We identified the compound endosidin 8 (ES8), which selectively interferes with PIN1 basal polarity without altering the polarity of apical proteins. ES8 alters the auxin distribution pattern in the root and induces a strong developmental phenotype, including reduced root length. The ARF-GEF- defective mutants gnom-like 1 ( gnl1-1) and gnom ( van7) are significantly resistant to ES8. The compound does not affect recycling or vacuolar trafficking of PIN1 but leads to its intracellular accumulation, resulting in loss of PIN1 basal polarity at the plasma membrane. Our data confirm a role for GNOM in endoplasmic reticulum (ER) - Golgi trafficking and reveal that a GNL1/GNOM-mediated early secretory pathway selectively regulates PIN1 basal polarity establishment in a manner essential for normal plant development."}],"ddc":["580"],"article_processing_charge":"No","day":"17","quality_controlled":"1","date_created":"2018-12-11T11:52:46Z","citation":{"short":"S. Doyle, A. Haegera, T. Vain, A. Rigala, C. Viotti, M. Łangowskaa, Q. Maa, J. Friml, N. Raikhel, G. Hickse, S. Robert, PNAS 112 (2015) E806–E815.","ieee":"S. Doyle <i>et al.</i>, “An early secretory pathway mediated by gnom-like 1 and gnom is essential for basal polarity establishment in Arabidopsis thaliana,” <i>PNAS</i>, vol. 112, no. 7. National Academy of Sciences, pp. E806–E815, 2015.","ama":"Doyle S, Haegera A, Vain T, et al. An early secretory pathway mediated by gnom-like 1 and gnom is essential for basal polarity establishment in Arabidopsis thaliana. <i>PNAS</i>. 2015;112(7):E806-E815. doi:<a href=\"https://doi.org/10.1073/pnas.1424856112\">10.1073/pnas.1424856112</a>","chicago":"Doyle, Siamsa, Ash Haegera, Thomas Vain, Adeline Rigala, Corrado Viotti, Małgorzata Łangowskaa, Qian Maa, et al. “An Early Secretory Pathway Mediated by Gnom-like 1 and Gnom Is Essential for Basal Polarity Establishment in Arabidopsis Thaliana.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1424856112\">https://doi.org/10.1073/pnas.1424856112</a>.","mla":"Doyle, Siamsa, et al. “An Early Secretory Pathway Mediated by Gnom-like 1 and Gnom Is Essential for Basal Polarity Establishment in Arabidopsis Thaliana.” <i>PNAS</i>, vol. 112, no. 7, National Academy of Sciences, 2015, pp. E806–15, doi:<a href=\"https://doi.org/10.1073/pnas.1424856112\">10.1073/pnas.1424856112</a>.","apa":"Doyle, S., Haegera, A., Vain, T., Rigala, A., Viotti, C., Łangowskaa, M., … Robert, S. (2015). An early secretory pathway mediated by gnom-like 1 and gnom is essential for basal polarity establishment in Arabidopsis thaliana. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1424856112\">https://doi.org/10.1073/pnas.1424856112</a>","ista":"Doyle S, Haegera A, Vain T, Rigala A, Viotti C, Łangowskaa M, Maa Q, Friml J, Raikhel N, Hickse G, Robert S. 2015. An early secretory pathway mediated by gnom-like 1 and gnom is essential for basal polarity establishment in Arabidopsis thaliana. PNAS. 112(7), E806–E815."},"scopus_import":"1","doi":"10.1073/pnas.1424856112","intvolume":"       112"},{"month":"10","article_type":"original","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4603513/","open_access":"1"}],"publication_status":"published","publisher":"National Academy of Sciences","type":"journal_article","oa_version":"Published Version","_id":"1577","pmid":1,"isi":1,"date_updated":"2026-06-18T17:49:06Z","department":[{"_id":"BeVi"}],"title":"Birth of a new gene on the Y chromosome of Drosophila melanogaster","date_published":"2015-10-06T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Antonio","last_name":"Carvalho","full_name":"Carvalho, Antonio"},{"first_name":"Beatriz","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Claudia","full_name":"Russo, Claudia","last_name":"Russo"},{"last_name":"Swenor","full_name":"Swenor, Bonnielin","first_name":"Bonnielin"},{"first_name":"Andrew","last_name":"Clark","full_name":"Clark, Andrew"}],"external_id":{"isi":["000363125400061"],"pmid":["26385968"]},"publist_id":"5594","volume":112,"acknowledgement":"This work was supported by grants from Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), FAPERJ, and CAPES (to A.B.C.), and National Institutes of Health Grant R01 GM64590 (to A.G.C. and A.B.C.).\r\nWe thank M. Vibranovski, C. Bergman, and the Berkeley Drosophila Genome Project for access to unpublished data; M. Vibranovski, R. Hoskins, S. Celniker, C. Kennedy, J. Carlson, S. Galasinski, B. Wakimoto, J. Yasuhara, G. Sutton, M. Kuhner, J. Felsenstein, and C. Santos for help in various steps of the work; and B. Bitner-Mathe, R. Ventura, the members of the A.B.C. and A.G.C. laboratories, and two reviewers for many valuable comments on the manuscript.","status":"public","year":"2015","page":"12450 - 12455","language":[{"iso":"eng"}],"publication":"PNAS","issue":"40","intvolume":"       112","doi":"10.1073/pnas.1516543112","scopus_import":"1","citation":{"short":"A. Carvalho, B. Vicoso, C. Russo, B. Swenor, A. Clark, PNAS 112 (2015) 12450–12455.","ieee":"A. Carvalho, B. Vicoso, C. Russo, B. Swenor, and A. Clark, “Birth of a new gene on the Y chromosome of Drosophila melanogaster,” <i>PNAS</i>, vol. 112, no. 40. National Academy of Sciences, pp. 12450–12455, 2015.","ama":"Carvalho A, Vicoso B, Russo C, Swenor B, Clark A. Birth of a new gene on the Y chromosome of Drosophila melanogaster. <i>PNAS</i>. 2015;112(40):12450-12455. doi:<a href=\"https://doi.org/10.1073/pnas.1516543112\">10.1073/pnas.1516543112</a>","apa":"Carvalho, A., Vicoso, B., Russo, C., Swenor, B., &#38; Clark, A. (2015). Birth of a new gene on the Y chromosome of Drosophila melanogaster. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1516543112\">https://doi.org/10.1073/pnas.1516543112</a>","mla":"Carvalho, Antonio, et al. “Birth of a New Gene on the Y Chromosome of Drosophila Melanogaster.” <i>PNAS</i>, vol. 112, no. 40, National Academy of Sciences, 2015, pp. 12450–55, doi:<a href=\"https://doi.org/10.1073/pnas.1516543112\">10.1073/pnas.1516543112</a>.","chicago":"Carvalho, Antonio, Beatriz Vicoso, Claudia Russo, Bonnielin Swenor, and Andrew Clark. “Birth of a New Gene on the Y Chromosome of Drosophila Melanogaster.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1516543112\">https://doi.org/10.1073/pnas.1516543112</a>.","ista":"Carvalho A, Vicoso B, Russo C, Swenor B, Clark A. 2015. Birth of a new gene on the Y chromosome of Drosophila melanogaster. PNAS. 112(40), 12450–12455."},"date_created":"2018-12-11T11:52:49Z","quality_controlled":"1","day":"06","article_processing_charge":"No","ddc":["570"],"abstract":[{"lang":"eng","text":"Contrary to the pattern seen in mammalian sex chromosomes, where most Y-linked genes have X-linked homologs, the Drosophila X and Y chromosomes appear to be unrelated. Most of the Y-linked genes have autosomal paralogs, so autosome-to-Y transposition must be the main source of Drosophila Y-linked genes. Here we show how these genes were acquired. We found a previously unidentified gene (flagrante delicto Y, FDY) that originated from a recent duplication of the autosomal gene vig2 to the Y chromosome of Drosophila melanogaster. Four contiguous genes were duplicated along with vig2, but they became pseudogenes through the accumulation of deletions and transposable element insertions, whereas FDY remained functional, acquired testis-specific expression, and now accounts for ∼20% of the vig2-like mRNA in testis. FDY is absent in the closest relatives of D. melanogaster, and DNA sequence divergence indicates that the duplication to the Y chromosome occurred ∼2 million years ago. Thus, FDY provides a snapshot of the early stages of the establishment of a Y-linked gene and demonstrates how the Drosophila Y has been accumulating autosomal genes."}],"oa":1},{"article_processing_charge":"No","conference":{"end_date":"2015-08-13","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, USA","start_date":"2015-08-09"},"article_number":"136","oa":1,"ddc":["000"],"abstract":[{"text":"We propose a method for fabricating deformable objects with spatially varying elasticity using 3D printing. Using a single, relatively stiff printer material, our method designs an assembly of smallscale microstructures that have the effect of a softer material at the object scale, with properties depending on the microstructure used in each part of the object. We build on work in the area of metamaterials, using numerical optimization to design tiled microstructures with desired properties, but with the key difference that our method designs families of related structures that can be interpolated to smoothly vary the material properties over a wide range. To create an object with spatially varying elastic properties, we tile the object's interior with microstructures drawn from these families, generating a different microstructure for each cell using an efficient algorithm to select compatible structures for neighboring cells. We show results computed for both 2D and 3D objects, validating several 2D and 3D printed structures using standard material tests as well as demonstrating various example applications.","lang":"eng"}],"doi":"10.1145/2766926","intvolume":"        34","day":"01","scopus_import":"1","citation":{"ama":"Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. Microstructures to control elasticity in 3D printing. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766926\">10.1145/2766926</a>","ieee":"C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, and M. Gross, “Microstructures to control elasticity in 3D printing,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 2015, vol. 34, no. 4.","short":"C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, M. Gross, in:, ACM, 2015.","chicago":"Schumacher, Christian, Bernd Bickel, Jan Rys, Steve Marschner, Chiara Daraio, and Markus Gross. “Microstructures to Control Elasticity in 3D Printing,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766926\">https://doi.org/10.1145/2766926</a>.","apa":"Schumacher, C., Bickel, B., Rys, J., Marschner, S., Daraio, C., &#38; Gross, M. (2015). Microstructures to control elasticity in 3D printing (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA: ACM. <a href=\"https://doi.org/10.1145/2766926\">https://doi.org/10.1145/2766926</a>","mla":"Schumacher, Christian, et al. <i>Microstructures to Control Elasticity in 3D Printing</i>. Vol. 34, no. 4, 136, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766926\">10.1145/2766926</a>.","ista":"Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. 2015. Microstructures to control elasticity in 3D printing. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 136."},"date_created":"2018-12-11T11:53:07Z","quality_controlled":"1","year":"2015","issue":"4","language":[{"iso":"eng"}],"author":[{"first_name":"Christian","full_name":"Schumacher, Christian","last_name":"Schumacher"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"first_name":"Jan","full_name":"Rys, Jan","last_name":"Rys"},{"first_name":"Steve","last_name":"Marschner","full_name":"Marschner, Steve"},{"last_name":"Daraio","full_name":"Daraio, Chiara","first_name":"Chiara"},{"first_name":"Markus","last_name":"Gross","full_name":"Gross, Markus"}],"external_id":{"isi":["000358786600102"]},"volume":34,"publist_id":"5529","date_published":"2015-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-06-18T17:49:31Z","title":"Microstructures to control elasticity in 3D printing","department":[{"_id":"BeBi"}],"_id":"1628","isi":1,"oa_version":"Published Version","publisher":"ACM","publication_status":"published","type":"conference","month":"08","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/2766926"}]},{"ddc":["500"],"abstract":[{"lang":"eng","text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard."}],"oa":1,"article_processing_charge":"No","scopus_import":"1","date_created":"2018-12-11T11:54:06Z","citation":{"chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.comgeo.2014.08.010\">https://doi.org/10.1016/j.comgeo.2014.08.010</a>.","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., &#38; Lieutier, A. (2015). Homological reconstruction and simplification in R3. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2014.08.010\">https://doi.org/10.1016/j.comgeo.2014.08.010</a>","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2014.08.010\">10.1016/j.comgeo.2014.08.010</a>.","ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621.","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. <i>Computational Geometry: Theory and Applications</i>. 2015;48(8):606-621. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2014.08.010\">10.1016/j.comgeo.2014.08.010</a>"},"quality_controlled":"1","corr_author":"1","day":"03","intvolume":"        48","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2812"}]},"doi":"10.1016/j.comgeo.2014.08.010","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","page":"606 - 621","issue":"8","year":"2015","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-06-03T00:00:00Z","external_id":{"isi":["000357353200006"]},"author":[{"full_name":"Attali, Dominique","last_name":"Attali","first_name":"Dominique"},{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich"},{"first_name":"Olivier","full_name":"Devillers, Olivier","last_name":"Devillers"},{"last_name":"Glisse","full_name":"Glisse, Marc","first_name":"Marc"},{"last_name":"Lieutier","full_name":"Lieutier, André","first_name":"André"}],"publist_id":"5305","volume":48,"department":[{"_id":"HeEd"}],"title":"Homological reconstruction and simplification in R3","date_updated":"2026-06-18T17:57:28Z","isi":1,"OA_place":"publisher","ec_funded":1,"_id":"1805","publication_status":"published","publisher":"Elsevier","type":"journal_article","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.comgeo.2014.08.010"}],"OA_type":"free access","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems"}],"month":"06","article_type":"original"},{"_id":"1512","department":[{"_id":"UlWa"}],"tmp":{"image":"/images/cc_by.png","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)"},"title":"Bounding Helly numbers via Betti numbers","date_updated":"2026-06-18T18:48:48Z","month":"01","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","oa_version":"Submitted Version","scopus_import":"1","date_created":"2018-12-11T11:52:27Z","citation":{"ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">10.4230/LIPIcs.SOCG.2015.507</a>","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.","mla":"Goaoc, Xavier, et al. <i>Bounding Helly Numbers via Betti Numbers</i>. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">10.4230/LIPIcs.SOCG.2015.507</a>.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">https://doi.org/10.4230/LIPIcs.SOCG.2015.507</a>.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.507\">https://doi.org/10.4230/LIPIcs.SOCG.2015.507</a>"},"quality_controlled":"1","alternative_title":["LIPIcs"],"day":"01","intvolume":"        34","related_material":{"record":[{"id":"424","status":"public","relation":"later_version"}]},"doi":"10.4230/LIPIcs.SOCG.2015.507","ddc":["510"],"abstract":[{"text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:00Z","oa":1,"article_processing_charge":"No","conference":{"location":"Eindhoven, Netherlands","name":"SoCG: Symposium on Computational Geometry","end_date":"2015-06-25","start_date":"2015-06-22"},"has_accepted_license":"1","acknowledgement":"PP, ZP and MT were partially supported by the Charles University Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen för matematik, Kungliga Tekniska Högskolan, then IST Austria.","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"501","file":[{"date_updated":"2020-07-14T12:45:00Z","relation":"main_file","creator":"system","file_id":"4794","file_size":633712,"file_name":"IST-2016-501-v1+1_46.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:10:09Z","checksum":"e6881df44d87fe0c2529c9f7b2724614"}],"date_published":"2015-01-01T00:00:00Z","author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"first_name":"Zuzana","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","last_name":"Patakova"},{"first_name":"Martin","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5665","volume":34,"page":"507 - 521","language":[{"iso":"eng"}],"year":"2015"},{"year":"2015","language":[{"iso":"eng"}],"publication":"PLoS Biology","issue":"11","file":[{"date_updated":"2020-07-14T12:45:07Z","creator":"system","file_id":"4723","relation":"main_file","file_name":"IST-2016-468-v1+1_journal.pbio.1002299.pdf","file_size":1387760,"checksum":"0e82e3279f50b15c6c170c042627802b","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:09:00Z"}],"date_published":"2015-11-18T00:00:00Z","pubrep_id":"468","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Guillaume","full_name":"Chevereau, Guillaume","last_name":"Chevereau","id":"424D78A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marta","full_name":"Dravecka, Marta","orcid":"0000-0002-2519-8004","last_name":"Dravecka","id":"4342E402-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tugce","last_name":"Batur","full_name":"Batur, Tugce"},{"first_name":"Aysegul","full_name":"Guvenek, Aysegul","last_name":"Guvenek"},{"last_name":"Ayhan","full_name":"Ayhan, Dilay","first_name":"Dilay"},{"full_name":"Toprak, Erdal","last_name":"Toprak","first_name":"Erdal"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias"}],"external_id":{"isi":["000365898900011"]},"publist_id":"5547","volume":13,"status":"public","article_processing_charge":"No","article_number":"e1002299","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The emergence of drug resistant pathogens is a serious public health problem. It is a long-standing goal to predict rates of resistance evolution and design optimal treatment strategies accordingly. To this end, it is crucial to reveal the underlying causes of drug-specific differences in the evolutionary dynamics leading to resistance. However, it remains largely unknown why the rates of resistance evolution via spontaneous mutations and the diversity of mutational paths vary substantially between drugs. Here we comprehensively quantify the distribution of fitness effects (DFE) of mutations, a key determinant of evolutionary dynamics, in the presence of eight antibiotics representing the main modes of action. Using precise high-throughput fitness measurements for genome-wide Escherichia coli gene deletion strains, we find that the width of the DFE varies dramatically between antibiotics and, contrary to conventional wisdom, for some drugs the DFE width is lower than in the absence of stress. We show that this previously underappreciated divergence in DFE width among antibiotics is largely caused by their distinct drug-specific dose-response characteristics. Unlike the DFE, the magnitude of the changes in tolerated drug concentration resulting from genome-wide mutations is similar for most drugs but exceptionally small for the antibiotic nitrofurantoin, i.e., mutations generally have considerably smaller resistance effects for nitrofurantoin than for other drugs. A population genetics model predicts that resistance evolution for drugs with this property is severely limited and confined to reproducible mutational paths. We tested this prediction in laboratory evolution experiments using the “morbidostat”, a device for evolving bacteria in well-controlled drug environments. Nitrofurantoin resistance indeed evolved extremely slowly via reproducible mutations—an almost paradoxical behavior since this drug causes DNA damage and increases the mutation rate. Overall, we identified novel quantitative characteristics of the evolutionary landscape that provide the conceptual foundation for predicting the dynamics of drug resistance evolution."}],"ddc":["570"],"file_date_updated":"2020-07-14T12:45:07Z","oa":1,"intvolume":"        13","related_material":{"record":[{"id":"9711","relation":"research_data","status":"public"},{"status":"public","relation":"research_data","id":"9765"},{"id":"6263","status":"public","relation":"dissertation_contains"}]},"doi":"10.1371/journal.pbio.1002299","scopus_import":"1","date_created":"2018-12-11T11:53:04Z","citation":{"ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan D, Toprak E, Bollenbach MT. 2015. Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. 13(11), e1002299.","mla":"Chevereau, Guillaume, et al. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” <i>PLoS Biology</i>, vol. 13, no. 11, e1002299, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299\">10.1371/journal.pbio.1002299</a>.","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” <i>PLoS Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002299\">https://doi.org/10.1371/journal.pbio.1002299</a>.","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D., Toprak, E., &#38; Bollenbach, M. T. (2015). Quantifying the determinants of evolutionary dynamics leading to drug resistance. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002299\">https://doi.org/10.1371/journal.pbio.1002299</a>","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Quantifying the determinants of evolutionary dynamics leading to drug resistance. <i>PLoS Biology</i>. 2015;13(11). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299\">10.1371/journal.pbio.1002299</a>","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D. Ayhan, E. Toprak, M.T. Bollenbach, PLoS Biology 13 (2015).","ieee":"G. Chevereau <i>et al.</i>, “Quantifying the determinants of evolutionary dynamics leading to drug resistance,” <i>PLoS Biology</i>, vol. 13, no. 11. Public Library of Science, 2015."},"quality_controlled":"1","corr_author":"1","day":"18","publication_status":"published","type":"journal_article","publisher":"Public Library of Science","oa_version":"Published Version","month":"11","project":[{"grant_number":"RGP0042/2013","name":"Revealing the fundamental limits of cell growth","_id":"25EB3A80-B435-11E9-9278-68D0E5697425"},{"name":"Revealing the mechanisms underlying drug interactions","call_identifier":"FWF","grant_number":"P27201-B22","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"303507","name":"Optimality principles in responses to antibiotics","_id":"25E83C2C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-06-19T22:30:53Z","title":"Quantifying the determinants of evolutionary dynamics leading to drug resistance","tmp":{"image":"/images/cc_by.png","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)"},"department":[{"_id":"ToBo"}],"ec_funded":1,"_id":"1619","isi":1},{"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys."}],"oa":1,"intvolume":"       443","doi":"10.1093/mnras/stu1343","quality_controlled":"1","date_created":"2022-07-14T12:16:10Z","citation":{"ieee":"J. P. Stott <i>et al.</i>, “A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3. Oxford University Press, pp. 2695–2704, 2014.","short":"J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M. Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 443 (2014) 2695–2704.","ama":"Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;443(3):2695-2704. doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>","ista":"Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach JE, Matthee JJ. 2014. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. 443(3), 2695–2704.","chicago":"Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower, Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>.","apa":"Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N., … Matthee, J. J. (2014). A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>","mla":"Stott, John P., et al. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3, Oxford University Press, 2014, pp. 2695–704, doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>."},"scopus_import":"1","day":"21","year":"2014","publication":"Monthly Notices of the Royal Astronomical Society","language":[{"iso":"eng"}],"page":"2695-2704","issue":"3","date_published":"2014-09-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","volume":443,"external_id":{"arxiv":["1407.1047"]},"author":[{"first_name":"John P.","full_name":"Stott, John P.","last_name":"Stott"},{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"first_name":"A. M.","full_name":"Swinbank, A. M.","last_name":"Swinbank"},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"first_name":"Richard","last_name":"Bower","full_name":"Bower, Richard"},{"first_name":"Philip N.","last_name":"Best","full_name":"Best, Philip N."},{"last_name":"Sharples","full_name":"Sharples, Ray M.","first_name":"Ray M."},{"last_name":"Geach","full_name":"Geach, James E.","first_name":"James E."},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","first_name":"Jorryt J"}],"acknowledgement":"First, we acknowledge the referee for their comments, which have improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1). IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting grant. PNB acknowledges STFC for financial support.","status":"public","date_updated":"2022-08-19T08:27:25Z","title":"A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS","_id":"11582","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"publication_status":"published","publisher":"Oxford University Press","type":"journal_article","oa_version":"Preprint","arxiv":1,"month":"09","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: kinematics and dynamics"],"main_file_link":[{"url":"https://arxiv.org/abs/1407.1047","open_access":"1"}]},{"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"_id":"11583","title":"A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys","date_updated":"2024-10-14T11:37:28Z","main_file_link":[{"url":"https://arxiv.org/abs/1402.6697","open_access":"1"}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations","dark ages","reionization","first stars"],"article_type":"original","month":"05","arxiv":1,"oa_version":"Preprint","type":"journal_article","publisher":"Oxford University Press","publication_status":"published","day":"21","scopus_import":"1","citation":{"ama":"Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;440(3):2375-2387. doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>","ieee":"J. J. Matthee <i>et al.</i>, “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3. Oxford University Press, pp. 2375–2387, 2014.","short":"J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M. Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical Society 440 (2014) 2375–2387.","ista":"Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.","apa":"Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim, J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>","chicago":"Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best, Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>.","mla":"Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>."},"date_created":"2022-07-14T12:33:24Z","quality_controlled":"1","doi":"10.1093/mnras/stu392","intvolume":"       440","oa":1,"abstract":[{"lang":"eng","text":"Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary."}],"article_processing_charge":"No","status":"public","acknowledgement":"We thank the anonymous referee for the comments and suggestions which improved both the quality and clarity of this work. DS acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship. IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges the support from the Creative Research Initiative Program, no. 2008- 0060544, of the National Research Foundation of Korea (NRF) funded by the Korean government (MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The Dark Cosmology Centre is funded by the Danish National Research Foundation. This work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey. 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 Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope. The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent legacy and complementary value – without such high-quality data sets, this research would not have been possible.","author":[{"first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"last_name":"Sobral","full_name":"Sobral, David","first_name":"David"},{"first_name":"A. M.","last_name":"Swinbank","full_name":"Swinbank, A. M."},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"first_name":"P. N.","full_name":"Best, P. N.","last_name":"Best"},{"full_name":"Kim, Jae-Woo","last_name":"Kim","first_name":"Jae-Woo"},{"first_name":"Marijn","last_name":"Franx","full_name":"Franx, Marijn"},{"full_name":"Milvang-Jensen, Bo","last_name":"Milvang-Jensen","first_name":"Bo"},{"full_name":"Fynbo, Johan","last_name":"Fynbo","first_name":"Johan"}],"external_id":{"arxiv":["1402.6697"]},"volume":440,"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-05-21T00:00:00Z","issue":"3","page":"2375-2387","publication":"Monthly Notices of the Royal Astronomical Society","language":[{"iso":"eng"}],"year":"2014"},{"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","type":"journal_article","oa_version":"None","month":"05","article_type":"original","title":"Magnetic properties of hot-pressed FeSb2","date_updated":"2022-08-11T09:51:22Z","publication_identifier":{"eissn":["1941-0069"],"issn":["0018-9464"]},"_id":"11750","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Magnetics","issue":"5","year":"2014","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-05-01T00:00:00Z","volume":50,"extern":"1","author":[{"last_name":"Pokharel","full_name":"Pokharel, Mani","first_name":"Mani"},{"first_name":"Huaizhou","last_name":"Zhao","full_name":"Zhao, Huaizhou"},{"first_name":"Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A"},{"full_name":"Ren, Zhifeng","last_name":"Ren","first_name":"Zhifeng"},{"first_name":"Cyril","last_name":"Opeil","full_name":"Opeil, Cyril"}],"abstract":[{"lang":"eng","text":"We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find a significant increase in the magnetic susceptibility in our sample when compared with the values previously reported for the polycrystalline sample. The pronounced Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole. In the intrinsic conductivity region, the susceptibility due to free carriers shows thermally activated behavior and is consistent with the data reported for single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic susceptibility in our sample comes mainly from a small amount of unreacted Fe, the contribution from the enhanced carrier density due to lattice and strain defects arising from the ball milling process is also significant. Existence of an unreacted Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300 K."}],"article_number":"6675864","article_processing_charge":"No","date_created":"2022-08-08T08:26:02Z","quality_controlled":"1","citation":{"apa":"Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., &#38; Opeil, C. (2014). Magnetic properties of hot-pressed FeSb2. <i>IEEE Transactions on Magnetics</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">https://doi.org/10.1109/TMAG.2013.2292607</a>","chicago":"Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” <i>IEEE Transactions on Magnetics</i>. Institute of Electrical and Electronics Engineers, 2014. <a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">https://doi.org/10.1109/TMAG.2013.2292607</a>.","mla":"Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” <i>IEEE Transactions on Magnetics</i>, vol. 50, no. 5, 6675864, Institute of Electrical and Electronics Engineers, 2014, doi:<a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">10.1109/TMAG.2013.2292607</a>.","ista":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864.","ama":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed FeSb2. <i>IEEE Transactions on Magnetics</i>. 2014;50(5). doi:<a href=\"https://doi.org/10.1109/TMAG.2013.2292607\">10.1109/TMAG.2013.2292607</a>","short":"M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on Magnetics 50 (2014).","ieee":"M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties of hot-pressed FeSb2,” <i>IEEE Transactions on Magnetics</i>, vol. 50, no. 5. Institute of Electrical and Electronics Engineers, 2014."},"scopus_import":"1","day":"01","intvolume":"        50","doi":"10.1109/TMAG.2013.2292607"},{"date_updated":"2024-11-06T12:11:36Z","title":"Online bipartite matching with decomposable weights","_id":"11789","publication_identifier":{"isbn":["978-366244776-5"],"issn":["0302-9743"]},"oa_version":"Preprint","type":"conference","publisher":"Springer Nature","publication_status":"published","arxiv":1,"month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.2139"}],"article_processing_charge":"No","conference":{"end_date":"2014-09-10","name":"ESA: Annual European Symposium on Algorithms","location":"Wroclaw, Poland","start_date":"2014-09-08"},"oa":1,"abstract":[{"lang":"eng","text":"We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.\r\n\r\nWe identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal."}],"doi":"10.1007/978-3-662-44777-2_22","intvolume":"      8737","alternative_title":["LNCS"],"day":"01","scopus_import":"1","quality_controlled":"1","date_created":"2022-08-11T10:41:47Z","citation":{"apa":"Charikar, M., Henzinger, M., &#38; Nguyễn, H. L. (2014). Online bipartite matching with decomposable weights. In <i>22nd Annual European Symposium on Algorithms</i> (Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>","mla":"Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.” <i>22nd Annual European Symposium on Algorithms</i>, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>.","chicago":"Charikar, Moses, Monika Henzinger, and Huy L. Nguyễn. “Online Bipartite Matching with Decomposable Weights.” In <i>22nd Annual European Symposium on Algorithms</i>, 8737:260–71. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>.","ista":"Charikar M, Henzinger M, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.","ama":"Charikar M, Henzinger M, Nguyễn HL. Online bipartite matching with decomposable weights. In: <i>22nd Annual European Symposium on Algorithms</i>. Vol 8737. Springer Nature; 2014:260-271. doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>","short":"M. Charikar, M. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium on Algorithms, Springer Nature, 2014, pp. 260–271.","ieee":"M. Charikar, M. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in <i>22nd Annual European Symposium on Algorithms</i>, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271."},"year":"2014","page":"260 - 271","publication":"22nd Annual European Symposium on Algorithms","language":[{"iso":"eng"}],"external_id":{"arxiv":["1409.2139"]},"author":[{"first_name":"Moses","full_name":"Charikar, Moses","last_name":"Charikar"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Nguyễn, Huy L.","last_name":"Nguyễn","first_name":"Huy L."}],"volume":8737,"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-09-01T00:00:00Z","status":"public"},{"year":"2014","oa_version":"None","publisher":"Springer Nature","publication_status":"published","type":"conference","publication":"10th International Conference of Web and Internet Economics","language":[{"iso":"eng"}],"page":"44 - 57","author":[{"full_name":"Cigler, Luděk","last_name":"Cigler","first_name":"Luděk"},{"first_name":"Wolfgang","full_name":"Dvořák, Wolfgang","last_name":"Dvořák"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"volume":8877,"extern":"1","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-12-01T00:00:00Z","status":"public","article_processing_charge":"No","date_updated":"2024-11-06T12:11:48Z","conference":{"start_date":"2014-12-14","location":"Beijing, China","name":"WINE: International Conference on Web and Internet Economics","end_date":"2014-12-17"},"abstract":[{"text":"Assume a seller wants to sell a digital product in a social network where a buyer’s valuation of the item has positive network externalities from her neighbors that already have the item. The goal of the seller is to maximize his revenue. Previous work on this problem [7] studies the case where clients are offered the item in sequence and have to pay personalized prices. This is highly infeasible in large scale networks such as the Facebook graph: (1) Offering items to the clients one after the other consumes a large amount of time, and (2) price-discrimination of clients could appear unfair to them and result in negative client reaction or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with these issues. Specifically, the item is offered in parallel to multiple clients at the same time and at the same price. This is called a round. We show that with O(logn) rounds, where n is the number of clients, a constant factor of the revenue with price discrimination can be achieved and that this is not possible with o(logn) rounds. Moreover we show that it is APX-hard to maximize the revenue and we give constant factor approximation algorithms for various further settings of limited price discrimination.","lang":"eng"}],"title":"Limiting price discrimination when selling products with positive network externalities","doi":"10.1007/978-3-319-13129-0_4","intvolume":"      8877","_id":"11790","publication_identifier":{"issn":["0302-9743"]},"alternative_title":["LNCS"],"day":"01","scopus_import":"1","citation":{"apa":"Cigler, L., Dvořák, W., Henzinger, M., &#38; Starnberger, M. (2014). Limiting price discrimination when selling products with positive network externalities. In <i>10th International Conference of Web and Internet Economics</i> (Vol. 8877, pp. 44–57). Beijing, China: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">https://doi.org/10.1007/978-3-319-13129-0_4</a>","chicago":"Cigler, Luděk, Wolfgang Dvořák, Monika Henzinger, and Martin Starnberger. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” In <i>10th International Conference of Web and Internet Economics</i>, 8877:44–57. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">https://doi.org/10.1007/978-3-319-13129-0_4</a>.","mla":"Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” <i>10th International Conference of Web and Internet Economics</i>, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">10.1007/978-3-319-13129-0_4</a>.","ista":"Cigler L, Dvořák W, Henzinger M, Starnberger M. 2014. Limiting price discrimination when selling products with positive network externalities. 10th International Conference of Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8877, 44–57.","ama":"Cigler L, Dvořák W, Henzinger M, Starnberger M. Limiting price discrimination when selling products with positive network externalities. In: <i>10th International Conference of Web and Internet Economics</i>. Vol 8877. Springer Nature; 2014:44-57. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_4\">10.1007/978-3-319-13129-0_4</a>","short":"L. Cigler, W. Dvořák, M. Henzinger, M. Starnberger, in:, 10th International Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57.","ieee":"L. Cigler, W. Dvořák, M. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in <i>10th International Conference of Web and Internet Economics</i>, Beijing, China, 2014, vol. 8877, pp. 44–57."},"date_created":"2022-08-11T10:58:44Z","quality_controlled":"1"},{"month":"05","date_published":"2014-05-16T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Altshuler, Ernesto","last_name":"Altshuler","first_name":"Ernesto"},{"first_name":"H","last_name":"Torres","full_name":"Torres, H"},{"last_name":"González_Pita","full_name":"González_Pita, A","first_name":"A"},{"first_name":"Colina G","full_name":"Sánchez, Colina G","last_name":"Sánchez"},{"full_name":"Pérez Penichet, Carlos","last_name":"Pérez Penichet","first_name":"Carlos"},{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R"},{"first_name":"Rauól","last_name":"Hidalgo","full_name":"Hidalgo, Rauól"}],"publist_id":"7936","extern":"1","volume":41,"status":"public","acknowledgement":"The Spanish MINECO project FIS2011-26675, the PIUNA program (U. Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba) have partially supported this research. ","publication_status":"published","publisher":"Wiley-Blackwell","type":"journal_article","oa_version":"None","year":"2014","language":[{"iso":"eng"}],"publication":"Geophysical Research Letters","page":"3032 - 3037","issue":"9","intvolume":"        41","_id":"118","doi":"10.1002/2014GL059229","date_created":"2018-12-11T11:44:43Z","citation":{"short":"E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet, S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037.","ieee":"E. Altshuler <i>et al.</i>, “Settling into dry granular media in different gravities,” <i>Geophysical Research Letters</i>, vol. 41, no. 9. Wiley-Blackwell, pp. 3032–3037, 2014.","ama":"Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media in different gravities. <i>Geophysical Research Letters</i>. 2014;41(9):3032-3037. doi:<a href=\"https://doi.org/10.1002/2014GL059229\">10.1002/2014GL059229</a>","ista":"Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis SR, Hidalgo R. 2014. Settling into dry granular media in different gravities. Geophysical Research Letters. 41(9), 3032–3037.","chicago":"Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular Media in Different Gravities.” <i>Geophysical Research Letters</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/2014GL059229\">https://doi.org/10.1002/2014GL059229</a>.","mla":"Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.” <i>Geophysical Research Letters</i>, vol. 41, no. 9, Wiley-Blackwell, 2014, pp. 3032–37, doi:<a href=\"https://doi.org/10.1002/2014GL059229\">10.1002/2014GL059229</a>.","apa":"Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet, C., Waitukaitis, S. R., &#38; Hidalgo, R. (2014). Settling into dry granular media in different gravities. <i>Geophysical Research Letters</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/2014GL059229\">https://doi.org/10.1002/2014GL059229</a>"},"quality_controlled":"1","day":"16","date_updated":"2021-01-12T06:48:53Z","title":"Settling into dry granular media in different gravities","abstract":[{"lang":"eng","text":"While the penetration of objects into granular media is well-studied, there is little understanding of how objects settle in gravities, geff, different from that of Earth - a scenario potentially relevant to the geomorphology of planets and asteroids and also to their exploration using man-made devices. By conducting experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2 g. Surprisingly, we find that the rest depth is independent of geff and also that the time required for the object to come to rest scales like geff-1/2. With discrete element modeling simulations, we reproduce the experimental results and extend the range of geff to objects as small as asteroids and as large as Jupiter. Our results shed light on the initial stage of sedimentation into dry granular media across a range of celestial bodies and also have implications for the design of man-made, extraterrestrial vehicles and structures. Key Points The settling depth in granular media is independent of gravity The settling time scales like g-1/2 Layering driven by granular sedimentation should be similar."}]},{"year":"2014","publication":"55th Annual Symposium on Foundations of Computer Science","language":[{"iso":"eng"}],"page":"146-155","date_published":"2014-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","author":[{"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":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"external_id":{"arxiv":["1402.0054"]},"status":"public","conference":{"end_date":"2014-10-21","location":"Philadelphia, PA, United States","name":"FOCS: Annual Symposium on Foundations of Computer Science","start_date":"2014-10-18"},"article_processing_charge":"No","abstract":[{"text":"The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest.","lang":"eng"}],"oa":1,"related_material":{"record":[{"id":"11768","status":"public","relation":"later_version"}]},"doi":"10.1109/focs.2014.24","quality_controlled":"1","citation":{"ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.","mla":"Henzinger, Monika, et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” <i>55th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2014, pp. 146–55, doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In <i>55th Annual Symposium on Foundations of Computer Science</i>, 146–55. Institute of Electrical and Electronics Engineers, 2014. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In <i>55th Annual Symposium on Foundations of Computer Science</i> (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2014.24\">https://doi.org/10.1109/focs.2014.24</a>","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in <i>55th Annual Symposium on Foundations of Computer Science</i>, Philadelphia, PA, United States, 2014, pp. 146–155.","ama":"Henzinger M, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: <i>55th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:<a href=\"https://doi.org/10.1109/focs.2014.24\">10.1109/focs.2014.24</a>"},"date_created":"2022-08-16T08:14:33Z","scopus_import":"1","day":"01","publication_status":"published","type":"conference","publisher":"Institute of Electrical and Electronics Engineers","oa_version":"Preprint","arxiv":1,"month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.0054"}],"date_updated":"2024-11-06T12:18:18Z","title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","_id":"11855","publication_identifier":{"eisbn":["978-1-4799-6517-5"],"issn":["0272-5428"]}},{"date_updated":"2024-11-06T12:20:12Z","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","_id":"11870","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145032710-7"]},"oa_version":"Preprint","publication_status":"published","type":"conference","publisher":"Association for Computing Machinery","arxiv":1,"month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07959"}],"article_processing_charge":"No","conference":{"start_date":"2014-05-31","end_date":"2014-06-03","location":"New York, NY, United States","name":"STOC: Symposium on Theory of Computing"},"article_number":"674 - 683","oa":1,"abstract":[{"lang":"eng","text":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case."}],"doi":"10.1145/2591796.2591869","day":"01","scopus_import":"1","quality_controlled":"1","date_created":"2022-08-16T09:41:57Z","citation":{"ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery, 2014. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In <i>46th Annual ACM Symposium on Theory of Computing</i>. New York, NY, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2591796.2591869\">https://doi.org/10.1145/2591796.2591869</a>","mla":"Henzinger, Monika, et al. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” <i>46th Annual ACM Symposium on Theory of Computing</i>, 674–683, Association for Computing Machinery, 2014, doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>.","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in <i>46th Annual ACM Symposium on Theory of Computing</i>, New York, NY, United States, 2014.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.","ama":"Henzinger M, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: <i>46th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery; 2014. doi:<a href=\"https://doi.org/10.1145/2591796.2591869\">10.1145/2591796.2591869</a>"},"year":"2014","language":[{"iso":"eng"}],"publication":"46th Annual ACM Symposium on Theory of Computing","external_id":{"arxiv":["1504.07959"]},"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Krinninger","full_name":"Krinninger, Sebastian","first_name":"Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"extern":"1","date_published":"2014-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"},{"title":"Deterministic fully dynamic data structures for vertex cover and matching","date_updated":"2024-11-06T12:22:53Z","publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"_id":"11875","arxiv":1,"oa_version":"Preprint","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"month":"01","oa":1,"abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in  time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13]."}],"conference":{"end_date":"2015-01-06","location":"San Diego, CA, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2015-01-04"},"article_processing_charge":"No","day":"01","quality_controlled":"1","citation":{"ista":"Bhattacharya S, Henzinger M, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>.","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 785–804. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>.","apa":"Bhattacharya, S., Henzinger, M., &#38; Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973730.54\">https://doi.org/10.1137/1.9781611973730.54</a>","ama":"Bhattacharya S, Henzinger M, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:785-804. doi:<a href=\"https://doi.org/10.1137/1.9781611973730.54\">10.1137/1.9781611973730.54</a>","ieee":"S. Bhattacharya, M. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in <i>26th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2014, pp. 785–804.","short":"S. Bhattacharya, M. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804."},"date_created":"2022-08-16T12:36:42Z","scopus_import":"1","doi":"10.1137/1.9781611973730.54","related_material":{"record":[{"status":"public","relation":"later_version","id":"11890"}]},"page":"785-804","publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"year":"2014","status":"public","extern":"1","external_id":{"arxiv":["1412.1318"]},"author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Italiano","full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-01-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee."}],"title":"A subquadratic-time algorithm for decremental single-source shortest paths","oa":1,"article_processing_charge":"No","conference":{"location":"Portland, OR, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2014-01-07","start_date":"2014-01-05"},"date_updated":"2024-11-06T12:21:22Z","scopus_import":"1","date_created":"2022-08-16T12:58:31Z","quality_controlled":"1","citation":{"ama":"Henzinger M, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>","ieee":"M. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, OR, United States, 2014, pp. 1053–1072.","short":"M. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","ista":"Henzinger M, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.","apa":"Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>","chicago":"Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1053–72. Society for Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.79\">https://doi.org/10.1137/1.9781611973402.79</a>.","mla":"Henzinger, Monika, et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” <i>25th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.79\">10.1137/1.9781611973402.79</a>."},"publication_identifier":{"isbn":["978-1-61197-338-9"],"eisbn":["978-1-61197-340-2"]},"day":"01","_id":"11876","doi":"10.1137/1.9781611973402.79","publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"page":"1053-1072","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","type":"conference","oa_version":"Published Version","year":"2014","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611973402.79","open_access":"1"}],"status":"public","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-01-01T00:00:00Z","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"extern":"1"},{"acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation.","status":"public","author":[{"first_name":"Scott R","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis"},{"first_name":"Victor","last_name":"Lee","full_name":"Lee, Victor"},{"full_name":"Pierson, James","last_name":"Pierson","first_name":"James"},{"last_name":"Forman","full_name":"Forman, Steven","first_name":"Steven"},{"last_name":"Jaeger","full_name":"Jaeger, Heinrich","first_name":"Heinrich"}],"external_id":{"arxiv":["1309.2578"]},"volume":112,"publist_id":"7935","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2014-05-30T00:00:00Z","issue":"21","language":[{"iso":"eng"}],"publication":"APS Physics, Physical Review Letters","year":"2014","day":"30","quality_controlled":"1","date_created":"2018-12-11T11:44:44Z","citation":{"ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>.","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., &#38; Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>","chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” <i>APS Physics, Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">https://doi.org/10.1103/PhysRevLett.112.218001</a>.","ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. <i>APS Physics, Physical Review Letters</i>. 2014;112(21). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.112.218001\">10.1103/PhysRevLett.112.218001</a>","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” <i>APS Physics, Physical Review Letters</i>, vol. 112, no. 21. American Physical Society, 2014.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014)."},"doi":"10.1103/PhysRevLett.112.218001","intvolume":"       112","oa":1,"abstract":[{"lang":"eng","text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging."}],"article_number":"218001","main_file_link":[{"url":"https://arxiv.org/abs/1309.2578","open_access":"1"}],"month":"05","arxiv":1,"oa_version":"Submitted Version","publication_status":"published","publisher":"American Physical Society","type":"journal_article","_id":"119","title":"Size-dependent same-material tribocharging in insulating grains","date_updated":"2021-01-12T06:48:58Z"},{"year":"2014","language":[{"iso":"eng"}],"publication":"ChemSusChem","page":"3122-3131","issue":"11","date_published":"2014-11-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":7,"extern":"1","author":[{"full_name":"Moghaddam, Mojtaba Mirhosseini","last_name":"Moghaddam","first_name":"Mojtaba Mirhosseini"},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"},{"full_name":"Glasnov, Toma","last_name":"Glasnov","first_name":"Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"external_id":{"pmid":["25209099"]},"status":"public","article_processing_charge":"No","abstract":[{"lang":"eng","text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring."}],"intvolume":"         7","doi":"10.1002/cssc.201402455","citation":{"short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.","ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” <i>ChemSusChem</i>, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014.","ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. 2014;7(11):3122-3131. doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>","ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131.","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>. Wiley, 2014. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” <i>ChemSusChem</i>, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:<a href=\"https://doi.org/10.1002/cssc.201402455\">10.1002/cssc.201402455</a>.","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., &#38; Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. <i>ChemSusChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cssc.201402455\">https://doi.org/10.1002/cssc.201402455</a>"},"quality_controlled":"1","date_created":"2022-08-25T08:36:54Z","scopus_import":"1","day":"01","publication_status":"published","type":"journal_article","publisher":"Wiley","oa_version":"None","month":"11","article_type":"original","date_updated":"2023-02-21T10:09:42Z","title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","_id":"11967","pmid":1,"publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]}},{"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription."}],"oa":1,"intvolume":"        29","doi":"10.1016/j.devcel.2014.04.025","scopus_import":"1","date_created":"2022-08-25T08:42:42Z","citation":{"ista":"Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), P729-739.","chicago":"Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder, Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>.","apa":"Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber, B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">https://doi.org/10.1016/j.devcel.2014.04.025</a>","mla":"Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” <i>Developmental Cell</i>, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>.","short":"H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber, G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler, A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell 29 (2014) P729-739.","ieee":"H. F. Hofbauer <i>et al.</i>, “Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids,” <i>Developmental Cell</i>, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.","ama":"Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. <i>Developmental Cell</i>. 2014;29(6):P729-739. doi:<a href=\"https://doi.org/10.1016/j.devcel.2014.04.025\">10.1016/j.devcel.2014.04.025</a>"},"quality_controlled":"1","day":"23","year":"2014","publication":"Developmental Cell","page":"P729-739","language":[{"iso":"eng"}],"issue":"6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2014-06-23T00:00:00Z","external_id":{"pmid":["24960695"]},"author":[{"full_name":"Hofbauer, Harald F.","last_name":"Hofbauer","first_name":"Harald F."},{"last_name":"Schopf","full_name":"Schopf, Florian H.","first_name":"Florian H."},{"full_name":"Schleifer, Hannes","last_name":"Schleifer","first_name":"Hannes"},{"last_name":"Knittelfelder","full_name":"Knittelfelder, Oskar L.","first_name":"Oskar L."},{"orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus"},{"full_name":"Rechberger, Gerald N.","last_name":"Rechberger","first_name":"Gerald N."},{"first_name":"Heimo","last_name":"Wolinski","full_name":"Wolinski, Heimo"},{"last_name":"Gaspar","full_name":"Gaspar, Maria L.","first_name":"Maria L."},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"},{"first_name":"Johannes","full_name":"Stadlmann, Johannes","last_name":"Stadlmann"},{"first_name":"Karl","full_name":"Mechtler, Karl","last_name":"Mechtler"},{"first_name":"Alexandra","full_name":"Zenz, Alexandra","last_name":"Zenz"},{"full_name":"Lohner, Karl","last_name":"Lohner","first_name":"Karl"},{"first_name":"Oksana","last_name":"Tehlivets","full_name":"Tehlivets, Oksana"},{"first_name":"Susan A.","full_name":"Henry, Susan A.","last_name":"Henry"},{"first_name":"Sepp D.","full_name":"Kohlwein, Sepp D.","last_name":"Kohlwein"}],"extern":"1","volume":29,"status":"public","date_updated":"2023-02-21T10:09:45Z","title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","_id":"11968","pmid":1,"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"type":"journal_article","publication_status":"published","publisher":"Elsevier","oa_version":"Published Version","month":"06","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.devcel.2014.04.025"}]}]