[{"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"        12","publisher":"American Chemical Society","extern":"1","external_id":{"pmid":["29350911"]},"date_published":"2018-01-19T00:00:00Z","scopus_import":"1","date_created":"2021-11-26T15:15:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_type":"original","page":"1508-1518","publication":"ACS Nano","date_updated":"2021-11-26T15:57:02Z","year":"2018","keyword":["general physics and astronomy"],"article_processing_charge":"No","volume":12,"oa_version":"None","day":"19","citation":{"chicago":"Fisher, Patrick D. Ellis, Qi Shen, Bernice Akpinar, Luke K. Davis, Kenny Kwok Hin Chung, David Baddeley, Anđela Šarić, et al. “A Programmable DNA Origami Platform for Organizing Intrinsically Disordered Nucleoporins within Nanopore Confinement.” <i>ACS Nano</i>. American Chemical Society, 2018. <a href=\"https://doi.org/10.1021/acsnano.7b08044\">https://doi.org/10.1021/acsnano.7b08044</a>.","mla":"Fisher, Patrick D. Ellis, et al. “A Programmable DNA Origami Platform for Organizing Intrinsically Disordered Nucleoporins within Nanopore Confinement.” <i>ACS Nano</i>, vol. 12, no. 2, American Chemical Society, 2018, pp. 1508–18, doi:<a href=\"https://doi.org/10.1021/acsnano.7b08044\">10.1021/acsnano.7b08044</a>.","ieee":"P. D. E. Fisher <i>et al.</i>, “A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement,” <i>ACS Nano</i>, vol. 12, no. 2. American Chemical Society, pp. 1508–1518, 2018.","apa":"Fisher, P. D. E., Shen, Q., Akpinar, B., Davis, L. K., Chung, K. K. H., Baddeley, D., … Lusk, C. P. (2018). A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsnano.7b08044\">https://doi.org/10.1021/acsnano.7b08044</a>","ama":"Fisher PDE, Shen Q, Akpinar B, et al. A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement. <i>ACS Nano</i>. 2018;12(2):1508-1518. doi:<a href=\"https://doi.org/10.1021/acsnano.7b08044\">10.1021/acsnano.7b08044</a>","ista":"Fisher PDE, Shen Q, Akpinar B, Davis LK, Chung KKH, Baddeley D, Šarić A, Melia TJ, Hoogenboom BW, Lin C, Lusk CP. 2018. A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement. ACS Nano. 12(2), 1508–1518.","short":"P.D.E. Fisher, Q. Shen, B. Akpinar, L.K. Davis, K.K.H. Chung, D. Baddeley, A. Šarić, T.J. Melia, B.W. Hoogenboom, C. Lin, C.P. Lusk, ACS Nano 12 (2018) 1508–1518."},"pmid":1,"month":"01","publication_status":"published","status":"public","acknowledgement":"We thank J. Edel and members of the Lusk, Lin and Hoogenboom lab for discussion and acknowledge A. Pyne and R. Thorogate for support carrying out the AFM experiments. This work was funded by the NIH (R21GM109466 to CPL, CL and TJM, DP2GM114830 to CL, RO1GM105672 to CPL, and T32GM007223 to PDEF) and the UK Engineering and Physical Sciences Research Council (EP/L015277/1, EP/L504889/1, and EP/M028100/1).","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"issue":"2","abstract":[{"lang":"eng","text":"Nuclear pore complexes (NPCs) form gateways that control molecular exchange between the nucleus and the cytoplasm. They impose a diffusion barrier to macromolecules and enable the selective transport of nuclear transport receptors with bound cargo. The underlying mechanisms that establish these permeability properties remain to be fully elucidated but require unstructured nuclear pore proteins rich in Phe-Gly (FG)-repeat domains of different types, such as FxFG and GLFG. While physical modeling and in vitro approaches have provided a framework for explaining how the FG network contributes to the barrier and transport properties of the NPC, it remains unknown whether the number and/or the spatial positioning of different FG-domains along a cylindrical, ∼40 nm diameter transport channel contributes to their collective properties and function. To begin to answer these questions, we have used DNA origami to build a cylinder that mimics the dimensions of the central transport channel and can house a specified number of FG-domains at specific positions with easily tunable design parameters, such as grafting density and topology. We find the overall morphology of the FG-domain assemblies to be dependent on their chemical composition, determined by the type and density of FG-repeat, and on their architectural confinement provided by the DNA cylinder, largely consistent with here presented molecular dynamics simulations based on a coarse-grained polymer model. In addition, high-speed atomic force microscopy reveals local and reversible FG-domain condensation that transiently occludes the lumen of the DNA central channel mimics, suggestive of how the NPC might establish its permeability properties."}],"doi":"10.1021/acsnano.7b08044","author":[{"first_name":"Patrick D. Ellis","last_name":"Fisher","full_name":"Fisher, Patrick D. Ellis"},{"last_name":"Shen","full_name":"Shen, Qi","first_name":"Qi"},{"first_name":"Bernice","full_name":"Akpinar, Bernice","last_name":"Akpinar"},{"first_name":"Luke K.","full_name":"Davis, Luke K.","last_name":"Davis"},{"last_name":"Chung","full_name":"Chung, Kenny Kwok Hin","first_name":"Kenny Kwok Hin"},{"full_name":"Baddeley, David","last_name":"Baddeley","first_name":"David"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","full_name":"Šarić, Anđela","last_name":"Šarić","orcid":"0000-0002-7854-2139"},{"full_name":"Melia, Thomas J.","last_name":"Melia","first_name":"Thomas J."},{"full_name":"Hoogenboom, Bart W.","last_name":"Hoogenboom","first_name":"Bart W."},{"first_name":"Chenxiang","last_name":"Lin","full_name":"Lin, Chenxiang"},{"last_name":"Lusk","full_name":"Lusk, C. Patrick","first_name":"C. Patrick"}],"title":"A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement","_id":"10362"},{"oa":1,"year":"2018","date_updated":"2023-09-19T10:06:42Z","publication":"Molecular Plant Pathology","page":"2277 - 2287","publist_id":"7950","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GradSch"}],"date_created":"2018-12-11T11:44:39Z","scopus_import":"1","date_published":"2018-10-01T00:00:00Z","external_id":{"isi":["000445624100006"]},"publisher":"Wiley","intvolume":"        19","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"_id":"104","title":"The core effector Cce1 is required for early infection of maize by Ustilago maydis","author":[{"last_name":"Seitner","full_name":"Seitner, Denise","first_name":"Denise"},{"first_name":"Simon","full_name":"Uhse, Simon","last_name":"Uhse"},{"orcid":"0000-0003-1286-7368","id":"35A03822-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle C","full_name":"Gallei, Michelle C","last_name":"Gallei"},{"last_name":"Djamei","full_name":"Djamei, Armin","first_name":"Armin"}],"doi":"10.1111/mpp.12698","abstract":[{"lang":"eng","text":"The biotrophic pathogen Ustilago maydis, the causative agent of corn smut disease, infects one of the most important crops worldwide – Zea mays. To successfully colonize its host, U. maydis secretes proteins, known as effectors, that suppress plant defense responses and facilitate the establishment of biotrophy. In this work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence and is upregulated during infection. Through microscopic analysis and in vitro assays, we show that Cce1 is secreted from hyphae during filamentous growth of the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection and induce callose deposition as a plant defense response. Cce1 is highly conserved among smut fungi and the Ustilago bromivora ortholog complemented the virulence defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core effector with apoplastic localization that is essential for U. maydis to infect its host."}],"issue":"10","acknowledgement":"the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22], and the Austrian Academy of Science (OEAW).","publication_status":"published","status":"public","month":"10","ddc":["580"],"file_date_updated":"2018-12-18T09:46:00Z","citation":{"chicago":"Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>.","mla":"Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>, vol. 19, no. 10, Wiley, 2018, pp. 2277–87, doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>.","short":"D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19 (2018) 2277–2287.","ista":"Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10), 2277–2287.","ama":"Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. 2018;19(10):2277-2287. doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>","ieee":"D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1 is required for early infection of maize by Ustilago maydis,” <i>Molecular Plant Pathology</i>, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018.","apa":"Seitner, D., Uhse, S., Gallei, M. C., &#38; Djamei, A. (2018). The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. Wiley. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>"},"day":"01","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"date_updated":"2018-12-18T09:46:00Z","access_level":"open_access","content_type":"application/pdf","file_name":"2018_MolecPlantPath_Seitner.pdf","creator":"dernst","file_size":682335,"relation":"main_file","file_id":"5740","date_created":"2018-12-18T09:46:00Z"}],"article_processing_charge":"No","volume":19,"has_accepted_license":"1"},{"page":"26 - 31","date_updated":"2023-09-13T08:49:16Z","publication":"Mathematical Intelligencer","year":"2018","oa":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"intvolume":"        40","main_file_link":[{"url":"https://arxiv.org/abs/1702.05172","open_access":"1"}],"publisher":"Springer","scopus_import":"1","date_created":"2018-12-11T11:44:40Z","external_id":{"arxiv":["1702.05172"],"isi":["000444141200005"]},"date_published":"2018-09-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7948","department":[{"_id":"HeEd"}],"publication_status":"published","status":"public","doi":"10.1007/s00283-018-9795-5","issue":"3","abstract":[{"lang":"eng","text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below."}],"_id":"106","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","full_name":"Akopyan, Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X"},{"first_name":"Anton","full_name":"Petrunin, Anton","last_name":"Petrunin"}],"title":"Long geodesics on convex surfaces","volume":40,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","month":"09","day":"01","citation":{"ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. 2018;40(3):26-31. doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","apa":"Akopyan, A., &#38; Petrunin, A. (2018). Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. Springer. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>.","mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>."}},{"arxiv":1,"article_processing_charge":"No","volume":121,"citation":{"chicago":"Polshyn, Hryhoriy, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevlett.121.226801\">https://doi.org/10.1103/physrevlett.121.226801</a>.","mla":"Polshyn, Hryhoriy, et al. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” <i>Physical Review Letters</i>, vol. 121, no. 22, 226801, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevlett.121.226801\">10.1103/physrevlett.121.226801</a>.","ama":"Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. <i>Physical Review Letters</i>. 2018;121(22). doi:<a href=\"https://doi.org/10.1103/physrevlett.121.226801\">10.1103/physrevlett.121.226801</a>","short":"H. Polshyn, H. Zhou, E.M. Spanton, T. Taniguchi, K. Watanabe, A.F. Young, Physical Review Letters 121 (2018).","ista":"Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. 2018. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. Physical Review Letters. 121(22), 226801.","apa":"Polshyn, H., Zhou, H., Spanton, E. M., Taniguchi, T., Watanabe, K., &#38; Young, A. F. (2018). Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.121.226801\">https://doi.org/10.1103/physrevlett.121.226801</a>","ieee":"H. Polshyn, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young, “Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices,” <i>Physical Review Letters</i>, vol. 121, no. 22. American Physical Society, 2018."},"day":"28","month":"11","oa_version":"Preprint","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"publication_status":"published","acknowledgement":"We thank Cory Dean, S. Chen, Y. Zeng, M. Yankowitz, and J. Li for discussing their unpublished data and for sharing the stack inversion technique. The authors acknowledge further discussions of the results with I. Sodemann, M. Zaletel, C. Nayak, and J. Jain. A. F. Y., H. P., H. Z., and E. M. S. were supported by the ARO under awards 69188PHH and MURI W911NF-17-1-0323. A portion of this work was performed at the National High Magnetic Field Laboratory, which is supported by National Science Foundation Cooperative Agreement No. DMR-1644779 and the State of Florida. K. W. and T. T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, and JSPS KAKENHI Grant No. JP15K21722. E. M. S. acknowledges the support of the Elings Prize Fellowship in Science of the California Nanosystems Institute at the University of California, Santa Barbara. A. F. Y. acknowledges the support of the David and Lucile Packard Foundation.","status":"public","title":"Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices","author":[{"orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","last_name":"Polshyn","full_name":"Polshyn, Hryhoriy"},{"first_name":"H.","last_name":"Zhou","full_name":"Zhou, H."},{"last_name":"Spanton","full_name":"Spanton, E. M.","first_name":"E. M."},{"last_name":"Taniguchi","full_name":"Taniguchi, T.","first_name":"T."},{"first_name":"K.","full_name":"Watanabe, K.","last_name":"Watanabe"},{"last_name":"Young","full_name":"Young, A. F.","first_name":"A. F."}],"_id":"10626","abstract":[{"lang":"eng","text":"Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter \r\nΓ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4."}],"issue":"22","doi":"10.1103/physrevlett.121.226801","publisher":"American Physical Society","intvolume":"       121","main_file_link":[{"url":"https://arxiv.org/abs/1805.04199","open_access":"1"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["1805.04199"]},"date_published":"2018-11-28T00:00:00Z","extern":"1","date_created":"2022-01-14T12:15:47Z","scopus_import":"1","publication":"Physical Review Letters","date_updated":"2022-01-14T13:48:35Z","article_number":"226801","article_type":"original","oa":1,"year":"2018","keyword":["general physics and astronomy"]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.08184"}],"intvolume":"        97","publisher":"American Physical Society","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2018-05-08T00:00:00Z","extern":"1","external_id":{"arxiv":["1703.08184"]},"scopus_import":"1","date_created":"2022-01-14T13:48:47Z","publication":"Physical Review B","date_updated":"2022-01-14T13:58:24Z","article_type":"original","article_number":"184501","oa":1,"year":"2018","arxiv":1,"volume":97,"article_processing_charge":"No","day":"08","citation":{"chicago":"Polshyn, Hryhoriy, Tyler R. Naibert, and Raffi Budakian. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevb.97.184501\">https://doi.org/10.1103/physrevb.97.184501</a>.","mla":"Polshyn, Hryhoriy, et al. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” <i>Physical Review B</i>, vol. 97, no. 18, 184501, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.97.184501\">10.1103/physrevb.97.184501</a>.","ama":"Polshyn H, Naibert TR, Budakian R. Imaging phase slip dynamics in micron-size superconducting rings. <i>Physical Review B</i>. 2018;97(18). doi:<a href=\"https://doi.org/10.1103/physrevb.97.184501\">10.1103/physrevb.97.184501</a>","ista":"Polshyn H, Naibert TR, Budakian R. 2018. Imaging phase slip dynamics in micron-size superconducting rings. Physical Review B. 97(18), 184501.","short":"H. Polshyn, T.R. Naibert, R. Budakian, Physical Review B 97 (2018).","apa":"Polshyn, H., Naibert, T. R., &#38; Budakian, R. (2018). Imaging phase slip dynamics in micron-size superconducting rings. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.97.184501\">https://doi.org/10.1103/physrevb.97.184501</a>","ieee":"H. Polshyn, T. R. Naibert, and R. Budakian, “Imaging phase slip dynamics in micron-size superconducting rings,” <i>Physical Review B</i>, vol. 97, no. 18. American Physical Society, 2018."},"month":"05","oa_version":"Preprint","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"publication_status":"published","status":"public","acknowledgement":"We are grateful to Nadya Mason for useful discussions. This work was supported by the DOE Basic Energy Sciences under Contract No. DE-SC0012649, the Department of Physics and the Frederick Seitz Materials Research Laboratory Central Facilities at the University of Illinois.\r\n","author":[{"orcid":"0000-0001-8223-8896","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","first_name":"Hryhoriy","full_name":"Polshyn, Hryhoriy","last_name":"Polshyn"},{"first_name":"Tyler R.","last_name":"Naibert","full_name":"Naibert, Tyler R."},{"first_name":"Raffi","last_name":"Budakian","full_name":"Budakian, Raffi"}],"title":"Imaging phase slip dynamics in micron-size superconducting rings","_id":"10627","issue":"18","abstract":[{"lang":"eng","text":"We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures."}],"doi":"10.1103/physrevb.97.184501"},{"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"ec_funded":1,"status":"public","publication_status":"published","_id":"1064","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","author":[{"orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","full_name":"Akopyan, Arseniy","last_name":"Akopyan"},{"first_name":"Alexey","last_name":"Balitskiy","full_name":"Balitskiy, Alexey"},{"first_name":"Mikhail","full_name":"Grigorev, Mikhail","last_name":"Grigorev"}],"doi":"10.1007/s00454-017-9883-x","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}],"issue":"4","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_size":482518,"relation":"main_file","creator":"dernst","file_name":"2018_DiscreteComp_Akopyan.pdf","date_updated":"2019-01-18T09:27:36Z","success":1,"content_type":"application/pdf","access_level":"open_access","date_created":"2019-01-18T09:27:36Z","file_id":"5844"}],"article_processing_charge":"Yes (via OA deal)","volume":59,"has_accepted_license":"1","ddc":["516","000"],"month":"06","file_date_updated":"2019-01-18T09:27:36Z","citation":{"ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>."},"day":"01","oa_version":"Published Version","date_updated":"2023-09-20T12:08:51Z","publication":"Discrete & Computational Geometry","page":"1001-1009","article_type":"original","oa":1,"year":"2018","publisher":"Springer","intvolume":"        59","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6324","department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:49:57Z","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","external_id":{"isi":["000432205500011"]}},{"article_processing_charge":"No","volume":112,"arxiv":1,"oa_version":"Published Version","conference":{"end_date":"2018-08-22","location":"Helsinki, Finland","start_date":"2018-08-20","name":"ESA: Annual European Symposium on Algorithms"},"citation":{"ama":"Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>","short":"G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ista":"Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.","apa":"Goranci, G., Henzinger, M. H., &#38; Leniowski, D. (2018). A tree structure for dynamic facility location. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>","ieee":"G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112.","chicago":"Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>.","mla":"Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>."},"day":"14","month":"08","publication_status":"published","status":"public","publication_identifier":{"isbn":["9783959770811"],"issn":["1868-8969"]},"abstract":[{"lang":"eng","text":"We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem."}],"doi":"10.4230/LIPICS.ESA.2018.39","title":"A tree structure for dynamic facility location","author":[{"full_name":"Goranci, Gramoz ","last_name":"Goranci","first_name":"Gramoz "},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"}],"_id":"11827","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.39","open_access":"1"}],"intvolume":"       112","external_id":{"arxiv":["1909.06653"]},"date_published":"2018-08-14T00:00:00Z","extern":"1","date_created":"2022-08-12T08:20:57Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"39","publication":"26th Annual European Symposium on Algorithms","date_updated":"2023-02-16T10:50:51Z","alternative_title":["LIPIcs"],"year":"2018","oa":1},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2018.40","open_access":"1"}],"intvolume":"       112","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","external_id":{"arxiv":["1802.09111"]},"date_published":"2018-08-14T00:00:00Z","date_created":"2022-08-12T08:26:42Z","scopus_import":"1","publication":"26th Annual European Symposium on Algorithms","date_updated":"2023-02-16T11:08:08Z","article_number":"40","oa":1,"year":"2018","alternative_title":["LIPIcs"],"arxiv":1,"volume":112,"article_processing_charge":"No","citation":{"mla":"Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>.","ista":"Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">10.4230/LIPICS.ESA.2018.40</a>","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112.","apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.40\">https://doi.org/10.4230/LIPICS.ESA.2018.40</a>"},"day":"14","month":"08","oa_version":"Published Version","conference":{"end_date":"2018-08-22","start_date":"2018-08-20","location":"Helsinki, Finland","name":"ESA: Annual European Symposium on Algorithms"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770811"]},"publication_status":"published","status":"public","title":"Dynamic effective resistances and approximate schur complement on separable graphs","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz","first_name":"Gramoz"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Pan","full_name":"Peng, Pan","last_name":"Peng"}],"_id":"11828","abstract":[{"lang":"eng","text":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false."}],"doi":"10.4230/LIPICS.ESA.2018.40"},{"author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"first_name":"Deeparnab","full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"title":"Dynamic algorithms for graph coloring","_id":"11872","abstract":[{"text":"We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with  worst-case update time [4].","lang":"eng"}],"doi":"10.1137/1.9781611975031.1","publication_identifier":{"eisbn":["978-161197503-1"]},"publication_status":"published","status":"public","day":"01","citation":{"ieee":"S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2018, pp. 1–20.","apa":"Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., &#38; Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>","ista":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2018:1-20. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>","mla":"Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.1\">10.1137/1.9781611975031.1</a>.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In <i>29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1–20. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.1\">https://doi.org/10.1137/1.9781611975031.1</a>."},"month":"01","conference":{"end_date":"2018-01-10","start_date":"2018-01-07","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms"},"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","oa":1,"year":"2018","publication":"29th Annual ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2023-02-17T11:39:01Z","page":"1 - 20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","external_id":{"arxiv":["1711.04355"]},"date_published":"2018-01-01T00:00:00Z","scopus_import":"1","date_created":"2022-08-16T12:07:14Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.04355"}],"publisher":"Society for Industrial and Applied Mathematics","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}]},{"publication":"20th Workshop on Algorithm Engineering and Experiments","date_updated":"2023-02-17T14:03:39Z","page":"48-61","oa":1,"year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.06127"}],"publisher":"Society for Industrial and Applied Mathematics","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_published":"2018-01-01T00:00:00Z","external_id":{"arxiv":["1708.06127"]},"scopus_import":"1","date_created":"2022-08-17T07:04:57Z","publication_identifier":{"eisbn":["978-1-61197-505-5"]},"status":"public","publication_status":"published","author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"last_name":"Strash","full_name":"Strash, Darren","first_name":"Darren"}],"title":"Practical minimum cut algorithms","_id":"11882","abstract":[{"lang":"eng","text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability."}],"doi":"10.1137/1.9781611975055.5","arxiv":1,"article_processing_charge":"No","day":"01","citation":{"chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” In <i>20th Workshop on Algorithm Engineering and Experiments</i>, 48–61. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/1.9781611975055.5\">https://doi.org/10.1137/1.9781611975055.5</a>.","mla":"Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” <i>20th Workshop on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2018, pp. 48–61, doi:<a href=\"https://doi.org/10.1137/1.9781611975055.5\">10.1137/1.9781611975055.5</a>.","ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in <i>20th Workshop on Algorithm Engineering and Experiments</i>, New Orleans, LA, United States, 2018, pp. 48–61.","apa":"Henzinger, M. H., Noe, A., Schulz, C., &#38; Strash, D. (2018). Practical minimum cut algorithms. In <i>20th Workshop on Algorithm Engineering and Experiments</i> (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975055.5\">https://doi.org/10.1137/1.9781611975055.5</a>","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61.","ama":"Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. In: <i>20th Workshop on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2018:48-61. doi:<a href=\"https://doi.org/10.1137/1.9781611975055.5\">10.1137/1.9781611975055.5</a>","ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61."},"month":"01","conference":{"location":"New Orleans, LA, United States","start_date":"2018-01-07","end_date":"2018-01-08","name":"ALENEX: Symposium on Algorithm Engineering and Experiments"},"oa_version":"Preprint"},{"publisher":"Society for Industrial & Applied Mathematics","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"intvolume":"        47","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","external_id":{"arxiv":["1412.1318"]},"date_published":"2018-05-01T00:00:00Z","date_created":"2022-08-17T08:21:23Z","scopus_import":"1","publication":"SIAM Journal on Computing","date_updated":"2023-02-21T16:31:30Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11875"}]},"page":"859-887","article_type":"original","oa":1,"year":"2018","arxiv":1,"volume":47,"article_processing_charge":"No","citation":{"ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” <i>SIAM Journal on Computing</i>, vol. 47, no. 3. Society for Industrial &#38; Applied Mathematics, pp. 859–887, 2018.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. 2018;47(3):859-887. doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>, vol. 47, no. 3, Society for Industrial &#38; Applied Mathematics, 2018, pp. 859–87, doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>."},"day":"01","month":"05","oa_version":"Preprint","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"status":"public","publication_status":"published","title":"Deterministic fully dynamic data structures for vertex cover and matching","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"_id":"11890","abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]."}],"issue":"3","doi":"10.1137/140998925"},{"article_number":"3","date_updated":"2023-02-16T11:45:14Z","publication":"17th International Symposium on Experimental Algorithms","alternative_title":["LIPIcs"],"year":"2018","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.SEA.2018.3"}],"intvolume":"       103","date_created":"2022-08-18T06:49:40Z","scopus_import":"1","extern":"1","external_id":{"arxiv":["1802.07034"]},"date_published":"2018-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770705"]},"doi":"10.4230/LIPICS.SEA.2018.3","abstract":[{"text":"It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.","lang":"eng"}],"_id":"11911","title":"Memetic graph clustering","author":[{"first_name":"Sonja","last_name":"Biedermann","full_name":"Biedermann, Sonja"},{"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":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"full_name":"Schuster, Bernhard","last_name":"Schuster","first_name":"Bernhard"}],"article_processing_charge":"No","volume":103,"arxiv":1,"oa_version":"Published Version","conference":{"start_date":"2018-07-27","location":"L'Aquila, Italy","end_date":"2018-07-29","name":"SEA: Symposium on Experimental Algorithms"},"month":"07","citation":{"chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In <i>17th International Symposium on Experimental Algorithms</i>, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>.","mla":"Biedermann, Sonja, et al. “Memetic Graph Clustering.” <i>17th International Symposium on Experimental Algorithms</i>, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: <i>17th International Symposium on Experimental Algorithms</i>. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>","ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in <i>17th International Symposium on Experimental Algorithms</i>, L’Aquila, Italy, 2018, vol. 103.","apa":"Biedermann, S., Henzinger, M. H., Schulz, C., &#38; Schuster, B. (2018). Memetic graph clustering. In <i>17th International Symposium on Experimental Algorithms</i> (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>"},"day":"01"},{"page":"9976-9979","article_type":"letter_note","date_updated":"2023-02-21T10:09:18Z","publication":"Angewandte Chemie International Edition","year":"2018","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Wiley","intvolume":"        57","date_created":"2022-08-24T10:57:25Z","scopus_import":"1","external_id":{"pmid":["29377383"]},"extern":"1","date_published":"2018-07-26T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","publication_identifier":{"eissn":[" 1521-3773"],"issn":["1433-7851"]},"doi":"10.1002/anie.201712568","abstract":[{"text":"Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly employed in batch processes but are ill-suited for continuous-flow chemistry. Heterogeneous catalysts for thermal reactions are typically used in packed-bed reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs) allow for the continuous utilization of solid materials together with liquids and gases in flow. This technology was utilized to develop selective and efficient fluorination reactions using a modified graphitic carbon nitride heterogeneous catalyst instead of costly homogeneous metal polypyridyl complexes. The merger of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable and scalable photocatalysis.","lang":"eng"}],"issue":"31","_id":"11958","title":"Continuous heterogeneous photocatalysis in serial micro-batch reactors","author":[{"orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus"},{"first_name":"Menny","last_name":"Shalom","full_name":"Shalom, Menny"},{"last_name":"Antonietti","full_name":"Antonietti, Markus","first_name":"Markus"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."},{"first_name":"Kerry","last_name":"Gilmore","full_name":"Gilmore, Kerry"}],"article_processing_charge":"No","volume":57,"oa_version":"None","pmid":1,"month":"07","citation":{"ista":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie International Edition. 57(31), 9976–9979.","ama":"Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. Continuous heterogeneous photocatalysis in serial micro-batch reactors. <i>Angewandte Chemie International Edition</i>. 2018;57(31):9976-9979. doi:<a href=\"https://doi.org/10.1002/anie.201712568\">10.1002/anie.201712568</a>","short":"B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979.","apa":"Pieber, B., Shalom, M., Antonietti, M., Seeberger, P. H., &#38; Gilmore, K. (2018). Continuous heterogeneous photocatalysis in serial micro-batch reactors. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201712568\">https://doi.org/10.1002/anie.201712568</a>","ieee":"B. Pieber, M. Shalom, M. Antonietti, P. H. Seeberger, and K. Gilmore, “Continuous heterogeneous photocatalysis in serial micro-batch reactors,” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 31. Wiley, pp. 9976–9979, 2018.","chicago":"Pieber, Bartholomäus, Menny Shalom, Markus Antonietti, Peter H. Seeberger, and Kerry Gilmore. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” <i>Angewandte Chemie International Edition</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/anie.201712568\">https://doi.org/10.1002/anie.201712568</a>.","mla":"Pieber, Bartholomäus, et al. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch Reactors.” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 31, Wiley, 2018, pp. 9976–79, doi:<a href=\"https://doi.org/10.1002/anie.201712568\">10.1002/anie.201712568</a>."},"day":"26"},{"related_material":{"link":[{"url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/","description":"News on IST Homepage","relation":"press_release"}]},"article_number":"135","publication":"ACM Transaction on Graphics","date_updated":"2023-09-11T12:48:09Z","year":"2018","oa":1,"isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"ACM","intvolume":"        37","external_id":{"isi":["000448185000096"]},"date_published":"2018-08-04T00:00:00Z","date_created":"2018-12-11T11:44:09Z","scopus_import":"1","department":[{"_id":"BeBi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"8044","publication_status":"published","status":"public","ec_funded":1,"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841"}],"abstract":[{"text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects.","lang":"eng"}],"issue":"4","doi":"10.1145/3197517.3201341","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","author":[{"first_name":"Kazutaka","full_name":"Nakashima, Kazutaka","last_name":"Nakashima"},{"full_name":"Auzinger, Thomas","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-1546-3265"},{"first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi","full_name":"Iarussi, Emmanuel"},{"orcid":"0000-0002-3808-281X","last_name":"Zhang","full_name":"Zhang, Ran","first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"}],"_id":"12","has_accepted_license":"1","article_processing_charge":"No","volume":37,"file":[{"date_created":"2018-12-12T10:18:38Z","file_id":"5360","relation":"main_file","creator":"system","file_size":104225664,"file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","date_updated":"2020-07-14T12:44:38Z","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","content_type":"application/pdf","access_level":"open_access"},{"file_id":"5361","date_created":"2018-12-12T10:18:39Z","file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","relation":"main_file","creator":"system","file_size":377743553,"date_updated":"2020-07-14T12:44:38Z","access_level":"open_access","checksum":"3861e693ba47c51f3ec7b7867d573a61","content_type":"application/zip"},{"creator":"system","relation":"main_file","file_size":162634396,"file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","content_type":"video/vnd.objectvideo","checksum":"490040c685ed869536e2a18f5a906b94","access_level":"open_access","date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-12T10:18:41Z","file_id":"5362"},{"date_created":"2018-12-12T10:18:42Z","file_id":"5363","relation":"main_file","file_size":527972,"creator":"system","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","date_updated":"2020-07-14T12:44:38Z","content_type":"image/jpeg","checksum":"be7fc8b229adda727419b6504b3b9352","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"1037","citation":{"mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4, 135, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>.","chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>.","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>","short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135.","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4. ACM, 2018.","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., &#38; Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>"},"day":"04","file_date_updated":"2020-07-14T12:44:38Z","ddc":["004","516","670"],"month":"08"},{"page":"789-826","date_updated":"2021-01-12T06:49:09Z","publication":"Journal of Theoretical Probability","year":"2018","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"publisher":"Springer","intvolume":"        31","date_created":"2018-12-11T11:50:45Z","scopus_import":1,"date_published":"2018-06-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"6119","department":[{"_id":"JaMa"}],"status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","publication_status":"published","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"doi":"10.1007/s10959-016-0724-2","abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"issue":"2","_id":"1215","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","author":[{"full_name":"Flandoli, Franco","last_name":"Flandoli","first_name":"Franco"},{"last_name":"Russo","full_name":"Russo, Francesco","first_name":"Francesco"},{"id":"47491882-F248-11E8-B48F-1D18A9856A87","first_name":"Giovanni A","full_name":"Zanco, Giovanni A","last_name":"Zanco"}],"article_processing_charge":"Yes (via OA deal)","volume":31,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"checksum":"47686d58ec21c164540f1a980ff2163f","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:39Z","file_size":671125,"creator":"system","relation":"main_file","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_created":"2018-12-12T10:17:13Z","file_id":"5266"}],"oa_version":"Published Version","ddc":["519"],"month":"06","file_date_updated":"2020-07-14T12:44:39Z","pubrep_id":"712","citation":{"apa":"Flandoli, F., Russo, F., &#38; Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. Springer. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2. Springer, pp. 789–826, 2018.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. 2018;31(2):789-826. doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.","chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>."},"day":"01"},{"publication":"Geochimica et Cosmochimica Acta","date_updated":"2021-01-12T06:49:19Z","status":"public","publication_status":"published","page":"405 - 421","title":"The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system","author":[{"orcid":"0000-0002-2299-3176","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R"},{"full_name":"Schrader, Devin","last_name":"Schrader","first_name":"Devin"},{"first_name":"Kazuhide","last_name":"Nagashima","full_name":"Nagashima, Kazuhide"},{"first_name":"Jemma","last_name":"Davidson","full_name":"Davidson, Jemma"},{"last_name":"Mccoy","full_name":"Mccoy, Timothy","first_name":"Timothy"},{"last_name":"Conolly Jr","full_name":"Conolly Jr, Harold","first_name":"Harold"},{"first_name":"Dante","last_name":"Lauretta","full_name":"Lauretta, Dante"}],"_id":"124","abstract":[{"lang":"eng","text":"By investigating the in situ chemical and O-isotope compositions of olivine in lightly sintered dust agglomerates from the early Solar System, we constrain their origins and the retention of dust in the protoplanetary disk. The grain sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR) chondrites ranged from &lt;1 to 80 µm. We infer this grain size range to be equivalent to the size range for dust in the early Solar System. AO chondrules may contain, but are not solely composed of, recycled fragments of earlier formed chondrules. They also contain 16O-rich olivine related to amoeboid olivine aggregates and represent the best record of chondrule-precursor materials. AO chondrules contain one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich (type II) chondrules, while others contain a type II chondrule core. These morphologies are consistent with particle agglomeration by electrostatic charging of grains during collision, a process that may explain solid agglomeration in the protoplanetary disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions of AO chondrules are consistent with chondrule formation by large-scale shocks, bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild 2 indicate that comets contain AO chondrules. We infer that these AO chondrules likely formed in the inner Solar System and migrated to the comet forming region at least 3 Ma after the formation of the first Solar System solids. Observations made in this study imply that the protoplanetary disk retained a dusty disk at least ∼3.7 Ma after the formation of the first Solar System solids, longer than half of the dusty accretion disks observed around other stars."}],"year":"2018","doi":"10.1016/j.gca.2017.12.014","publisher":"Elsevier","intvolume":"       223","volume":223,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ieee":"S. R. Waitukaitis <i>et al.</i>, “The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system,” <i>Geochimica et Cosmochimica Acta</i>, vol. 223. Elsevier, pp. 405–421, 2018.","apa":"Waitukaitis, S. R., Schrader, D., Nagashima, K., Davidson, J., Mccoy, T., Conolly Jr, H., &#38; Lauretta, D. (2018). The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. <i>Geochimica et Cosmochimica Acta</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">https://doi.org/10.1016/j.gca.2017.12.014</a>","ama":"Waitukaitis SR, Schrader D, Nagashima K, et al. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. <i>Geochimica et Cosmochimica Acta</i>. 2018;223:405-421. doi:<a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">10.1016/j.gca.2017.12.014</a>","short":"S.R. Waitukaitis, D. Schrader, K. Nagashima, J. Davidson, T. Mccoy, H. Conolly Jr, D. Lauretta, Geochimica et Cosmochimica Acta 223 (2018) 405–421.","ista":"Waitukaitis SR, Schrader D, Nagashima K, Davidson J, Mccoy T, Conolly Jr H, Lauretta D. 2018. The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica Acta. 223, 405–421.","mla":"Waitukaitis, Scott R., et al. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” <i>Geochimica et Cosmochimica Acta</i>, vol. 223, Elsevier, 2018, pp. 405–21, doi:<a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">10.1016/j.gca.2017.12.014</a>.","chicago":"Waitukaitis, Scott R, Devin Schrader, Kazuhide Nagashima, Jemma Davidson, Timothy Mccoy, Harold Conolly Jr, and Dante Lauretta. “The Retention of Dust in Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” <i>Geochimica et Cosmochimica Acta</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.gca.2017.12.014\">https://doi.org/10.1016/j.gca.2017.12.014</a>."},"day":"15","publist_id":"7930","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_published":"2018-02-15T00:00:00Z","date_created":"2018-12-11T11:44:45Z","oa_version":"None"},{"_id":"125","author":[{"last_name":"Cerda","full_name":"Cerda, Mauricio","first_name":"Mauricio"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176"},{"first_name":"Cristóbal","last_name":"Navarro","full_name":"Navarro, Cristóbal"},{"full_name":"Silva, Juan","last_name":"Silva","first_name":"Juan"},{"full_name":"Mujica, Nicolás","last_name":"Mujica","first_name":"Nicolás"},{"last_name":"Hitschfeld","full_name":"Hitschfeld, Nancy","first_name":"Nancy"}],"title":"A high-speed tracking algorithm for dense granular media","doi":"10.1016/j.cpc.2018.02.010","year":"2018","abstract":[{"text":"Many fields of study, including medical imaging, granular physics, colloidal physics, and active matter, require the precise identification and tracking of particle-like objects in images. While many algorithms exist to track particles in diffuse conditions, these often perform poorly when particles are densely packed together—as in, for example, solid-like systems of granular materials. Incorrect particle identification can have significant effects on the calculation of physical quantities, which makes the development of more precise and faster tracking algorithms a worthwhile endeavor. In this work, we present a new tracking algorithm to identify particles in dense systems that is both highly accurate and fast. We demonstrate the efficacy of our approach by analyzing images of dense, solid-state granular media, where we achieve an identification error of 5% in the worst evaluated cases. Going further, we propose a parallelization strategy for our algorithm using a GPU, which results in a speedup of up to 10× when compared to a sequential CPU implementation in C and up to 40× when compared to the reference MATLAB library widely used for particle tracking. Our results extend the capabilities of state-of-the-art particle tracking methods by allowing fast, high-fidelity detection in dense media at high resolutions.","lang":"eng"}],"date_updated":"2021-01-12T06:49:23Z","publication":"Computer Physics Communications","page":"8 - 16","publication_status":"published","status":"public","publist_id":"7928","month":"06","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","citation":{"mla":"Cerda, Mauricio, et al. “A High-Speed Tracking Algorithm for Dense Granular Media.” <i>Computer Physics Communications</i>, vol. 227, Elsevier, 2018, pp. 8–16, doi:<a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">10.1016/j.cpc.2018.02.010</a>.","chicago":"Cerda, Mauricio, Scott R Waitukaitis, Cristóbal Navarro, Juan Silva, Nicolás Mujica, and Nancy Hitschfeld. “A High-Speed Tracking Algorithm for Dense Granular Media.” <i>Computer Physics Communications</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">https://doi.org/10.1016/j.cpc.2018.02.010</a>.","ista":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. 2018. A high-speed tracking algorithm for dense granular media. Computer Physics Communications. 227, 8–16.","short":"M. Cerda, S.R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, N. Hitschfeld, Computer Physics Communications 227 (2018) 8–16.","ama":"Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. A high-speed tracking algorithm for dense granular media. <i>Computer Physics Communications</i>. 2018;227:8-16. doi:<a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">10.1016/j.cpc.2018.02.010</a>","ieee":"M. Cerda, S. R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, and N. Hitschfeld, “A high-speed tracking algorithm for dense granular media,” <i>Computer Physics Communications</i>, vol. 227. Elsevier, pp. 8–16, 2018.","apa":"Cerda, M., Waitukaitis, S. R., Navarro, C., Silva, J., Mujica, N., &#38; Hitschfeld, N. (2018). A high-speed tracking algorithm for dense granular media. <i>Computer Physics Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cpc.2018.02.010\">https://doi.org/10.1016/j.cpc.2018.02.010</a>"},"oa_version":"None","date_created":"2018-12-11T11:44:45Z","date_published":"2018-06-01T00:00:00Z","extern":"1","intvolume":"       227","publisher":"Elsevier","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","volume":227},{"acknowledgement":"We acknowledge funding from the Netherlands Organization for Scientific Research through Grants VICI No. NWO- 680-47-609 (M. v. H. and S. W.) and VENI No. NWO-680- 47-453 (S. W.), and from the German Science Foundation through Grant No. HA8467/1-1 (K. H.).","status":"public","publication_status":"published","article_number":"048001 ","publication":"Physical Review Letters","date_updated":"2021-01-12T06:49:27Z","issue":"4","year":"2018","abstract":[{"text":"The Leidenfrost effect occurs when a liquid or stiff sublimable solid near a hot surface creates enough vapor beneath it to lift itself up and float. In contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel spheres towards a hot surface, we discover that they are also capable of floating. The bounce-to-float transition is controlled by the approach velocity and temperature, analogously to the &quot;dynamic Leidenfrost effect.&quot; For the floating regime, we measure power-law scalings for the gap geometry, which we explain with a model that couples the vaporization rate to the spherical shape. Our results reveal that hydrogels are a promising pathway for controlling floating Leidenfrost objects through shape.","lang":"eng"}],"doi":"10.1103/PhysRevLett.121.048001","author":[{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"},{"last_name":"Harth","full_name":"Harth, Kirsten","first_name":"Kirsten"},{"first_name":"Martin","full_name":"Van Hecke, Martin","last_name":"Van Hecke"}],"title":"From bouncing to floating: the Leidenfrost effect with hydrogel spheres","_id":"126","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"volume":121,"intvolume":"       121","publisher":"American Physical Society","date_published":"2018-07-25T00:00:00Z","extern":"1","date_created":"2018-12-11T11:44:46Z","oa_version":"None","day":"25","citation":{"ista":"Waitukaitis SR, Harth K, Van Hecke M. 2018. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters. 121(4), 048001.","short":"S.R. Waitukaitis, K. Harth, M. Van Hecke, Physical Review Letters 121 (2018).","ama":"Waitukaitis SR, Harth K, Van Hecke M. From bouncing to floating: the Leidenfrost effect with hydrogel spheres. <i>Physical Review Letters</i>. 2018;121(4). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">10.1103/PhysRevLett.121.048001</a>","ieee":"S. R. Waitukaitis, K. Harth, and M. Van Hecke, “From bouncing to floating: the Leidenfrost effect with hydrogel spheres,” <i>Physical Review Letters</i>, vol. 121, no. 4. American Physical Society, 2018.","apa":"Waitukaitis, S. R., Harth, K., &#38; Van Hecke, M. (2018). From bouncing to floating: the Leidenfrost effect with hydrogel spheres. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">https://doi.org/10.1103/PhysRevLett.121.048001</a>","mla":"Waitukaitis, Scott R., et al. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” <i>Physical Review Letters</i>, vol. 121, no. 4, 048001, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">10.1103/PhysRevLett.121.048001</a>.","chicago":"Waitukaitis, Scott R, Kirsten Harth, and Martin Van Hecke. “From Bouncing to Floating: The Leidenfrost Effect with Hydrogel Spheres.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevLett.121.048001\">https://doi.org/10.1103/PhysRevLett.121.048001</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","publist_id":"7927"},{"date_updated":"2023-02-28T11:49:36Z","publication":"Hydrological Processes","page":"214-229","article_type":"original","oa":1,"keyword":["Water Science and Technology"],"year":"2018","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1002/hyp.13354","open_access":"1"}],"intvolume":"        33","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-20T08:13:14Z","scopus_import":"1","extern":"1","date_published":"2018-11-26T00:00:00Z","publication_identifier":{"issn":["0885-6087"],"eissn":["1099-1085"]},"publication_status":"published","status":"public","_id":"12603","title":"Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology","author":[{"first_name":"Flavia","last_name":"Burger","full_name":"Burger, Flavia"},{"first_name":"Alvaro","last_name":"Ayala","full_name":"Ayala, Alvaro"},{"first_name":"David","last_name":"Farias","full_name":"Farias, David"},{"full_name":"Shaw, Thomas E.","last_name":"Shaw","first_name":"Thomas E."},{"full_name":"MacDonell, Shelley","last_name":"MacDonell","first_name":"Shelley"},{"full_name":"Brock, Ben","last_name":"Brock","first_name":"Ben"},{"first_name":"James","full_name":"McPhee, James","last_name":"McPhee"},{"first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca"}],"doi":"10.1002/hyp.13354","abstract":[{"text":"We present a field-data rich modelling analysis to reconstruct the climatic forcing, glacier response, and runoff generation from a high-elevation catchment in central Chile over the period 2000–2015 to provide insights into the differing contributions of debris-covered and debris-free glaciers under current and future changing climatic conditions. Model simulations with the physically based glacio-hydrological model TOPKAPI-ETH reveal a period of neutral or slightly positive mass balance between 2000 and 2010, followed by a transition to increasingly large annual mass losses, associated with a recent mega drought. Mass losses commence earlier, and are more severe, for a heavily debris-covered glacier, most likely due to its strong dependence on snow avalanche accumulation, which has declined in recent years. Catchment runoff shows a marked decreasing trend over the study period, but with high interannual variability directly linked to winter snow accumulation, and high contribution from ice melt in dry periods and drought conditions. The study demonstrates the importance of incorporating local-scale processes such as snow avalanche accumulation and spatially variable debris thickness, in understanding the responses of different glacier types to climate change. We highlight the increased dependency of runoff from high Andean catchments on the diminishing resource of glacier ice during dry years.","lang":"eng"}],"issue":"2","volume":33,"article_processing_charge":"No","month":"11","citation":{"chicago":"Burger, Flavia, Alvaro Ayala, David Farias, Thomas E. Shaw, Shelley MacDonell, Ben Brock, James McPhee, and Francesca Pellicciotti. “Interannual Variability in Glacier Contribution to Runoff from a High‐elevation Andean Catchment: Understanding the Role of Debris Cover in Glacier Hydrology.” <i>Hydrological Processes</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/hyp.13354\">https://doi.org/10.1002/hyp.13354</a>.","mla":"Burger, Flavia, et al. “Interannual Variability in Glacier Contribution to Runoff from a High‐elevation Andean Catchment: Understanding the Role of Debris Cover in Glacier Hydrology.” <i>Hydrological Processes</i>, vol. 33, no. 2, Wiley, 2018, pp. 214–29, doi:<a href=\"https://doi.org/10.1002/hyp.13354\">10.1002/hyp.13354</a>.","apa":"Burger, F., Ayala, A., Farias, D., Shaw, T. E., MacDonell, S., Brock, B., … Pellicciotti, F. (2018). Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. <i>Hydrological Processes</i>. Wiley. <a href=\"https://doi.org/10.1002/hyp.13354\">https://doi.org/10.1002/hyp.13354</a>","ieee":"F. Burger <i>et al.</i>, “Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology,” <i>Hydrological Processes</i>, vol. 33, no. 2. Wiley, pp. 214–229, 2018.","ista":"Burger F, Ayala A, Farias D, Shaw TE, MacDonell S, Brock B, McPhee J, Pellicciotti F. 2018. Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. Hydrological Processes. 33(2), 214–229.","ama":"Burger F, Ayala A, Farias D, et al. Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology. <i>Hydrological Processes</i>. 2018;33(2):214-229. doi:<a href=\"https://doi.org/10.1002/hyp.13354\">10.1002/hyp.13354</a>","short":"F. Burger, A. Ayala, D. Farias, T.E. Shaw, S. MacDonell, B. Brock, J. McPhee, F. Pellicciotti, Hydrological Processes 33 (2018) 214–229."},"day":"26","oa_version":"Published Version"},{"publication_status":"published","status":"public","publication_identifier":{"issn":["0094-8276"],"eissn":["1944-8007"]},"abstract":[{"text":"Glaciers in the high mountains of Asia provide an important water resource for millions of people. Many of these glaciers are partially covered by rocky debris, which protects the ice from solar radiation and warm air. However, studies have found that the surface of these debris-covered glaciers is actually lowering as fast as glaciers without debris. Water ponded on the surface of the glaciers may be partially responsible, as water can absorb atmospheric energy very efficiently. However, the overall effect of these ponds has not been thoroughly assessed yet. We study a valley in Nepal for which we have extensive weather measurements, and we use a numerical model to calculate the energy absorbed by ponds on the surface of the glaciers over 6 months. As we have not observed each individual pond thoroughly, we run the model 5,000 times with different setups. We find that ponds are extremely important for glacier melt and absorb energy 14 times as quickly as the debris-covered ice. Although the ponds account for 1% of the glacier area covered by rocks, and only 0.3% of the total glacier area, they absorb enough energy to account for one eighth of the whole valley's ice loss.","lang":"eng"}],"issue":"19","doi":"10.1029/2018gl079678","title":"Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss","author":[{"first_name":"Evan S.","full_name":"Miles, Evan S.","last_name":"Miles"},{"first_name":"Ian","last_name":"Willis","full_name":"Willis, Ian"},{"last_name":"Buri","full_name":"Buri, Pascal","first_name":"Pascal"},{"first_name":"Jakob F.","last_name":"Steiner","full_name":"Steiner, Jakob F."},{"first_name":"Neil S.","full_name":"Arnold, Neil S.","last_name":"Arnold"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"}],"_id":"12604","article_processing_charge":"No","volume":45,"oa_version":"Published Version","citation":{"ama":"Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. <i>Geophysical Research Letters</i>. 2018;45(19):10464-10473. doi:<a href=\"https://doi.org/10.1029/2018gl079678\">10.1029/2018gl079678</a>","ista":"Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. 2018. Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. Geophysical Research Letters. 45(19), 10464–10473.","short":"E.S. Miles, I. Willis, P. Buri, J.F. Steiner, N.S. Arnold, F. Pellicciotti, Geophysical Research Letters 45 (2018) 10464–10473.","ieee":"E. S. Miles, I. Willis, P. Buri, J. F. Steiner, N. S. Arnold, and F. Pellicciotti, “Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss,” <i>Geophysical Research Letters</i>, vol. 45, no. 19. American Geophysical Union, pp. 10464–10473, 2018.","apa":"Miles, E. S., Willis, I., Buri, P., Steiner, J. F., Arnold, N. S., &#38; Pellicciotti, F. (2018). Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total catchment ice loss. <i>Geophysical Research Letters</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2018gl079678\">https://doi.org/10.1029/2018gl079678</a>","chicago":"Miles, Evan S., Ian Willis, Pascal Buri, Jakob F. Steiner, Neil S. Arnold, and Francesca Pellicciotti. “Surface Pond Energy Absorption across Four Himalayan Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” <i>Geophysical Research Letters</i>. American Geophysical Union, 2018. <a href=\"https://doi.org/10.1029/2018gl079678\">https://doi.org/10.1029/2018gl079678</a>.","mla":"Miles, Evan S., et al. “Surface Pond Energy Absorption across Four Himalayan Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” <i>Geophysical Research Letters</i>, vol. 45, no. 19, American Geophysical Union, 2018, pp. 10464–73, doi:<a href=\"https://doi.org/10.1029/2018gl079678\">10.1029/2018gl079678</a>."},"day":"18","month":"10","page":"10464-10473","article_type":"letter_note","publication":"Geophysical Research Letters","date_updated":"2023-02-28T11:46:48Z","year":"2018","keyword":["General Earth and Planetary Sciences","Geophysics"],"oa":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"American Geophysical Union","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2018GL079678"}],"intvolume":"        45","date_published":"2018-10-18T00:00:00Z","extern":"1","date_created":"2023-02-20T08:13:18Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]