[{"title":"Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang","author":[{"first_name":"Nickels","last_name":"Jensen","full_name":"Jensen, Nickels"},{"last_name":"Danzl","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G"},{"full_name":"Willig, Katrin","last_name":"Willig","first_name":"Katrin"},{"last_name":"Lavoie Cardinal","full_name":"Lavoie Cardinal, Flavie","first_name":"Flavie"},{"last_name":"Brakemann","full_name":"Brakemann, Tanja","first_name":"Tanja"},{"full_name":"Hell, Stefan","last_name":"Hell","first_name":"Stefan"},{"first_name":"Stefan","last_name":"Jakobs","full_name":"Jakobs, Stefan"}],"publist_id":"6332","article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:47:58Z","citation":{"chicago":"Jensen, Nickels, Johann G Danzl, Katrin Willig, Flavie Lavoie Cardinal, Tanja Brakemann, Stefan Hell, and Stefan Jakobs. “Coordinate-Targeted and Coordinate-Stochastic Super-Resolution Microscopy with the Reversibly Switchable Fluorescent Protein Dreiklang.” ChemPhysChem. Wiley-Blackwell, 2014. https://doi.org/10.1002/cphc.201301034.","ista":"Jensen N, Danzl JG, Willig K, Lavoie Cardinal F, Brakemann T, Hell S, Jakobs S. 2014. Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. 15(4), 756–762.","mla":"Jensen, Nickels, et al. “Coordinate-Targeted and Coordinate-Stochastic Super-Resolution Microscopy with the Reversibly Switchable Fluorescent Protein Dreiklang.” ChemPhysChem, vol. 15, no. 4, Wiley-Blackwell, 2014, pp. 756–62, doi:10.1002/cphc.201301034.","apa":"Jensen, N., Danzl, J. G., Willig, K., Lavoie Cardinal, F., Brakemann, T., Hell, S., & Jakobs, S. (2014). Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. Wiley-Blackwell. https://doi.org/10.1002/cphc.201301034","ama":"Jensen N, Danzl JG, Willig K, et al. Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. 2014;15(4):756-762. doi:10.1002/cphc.201301034","short":"N. Jensen, J.G. Danzl, K. Willig, F. Lavoie Cardinal, T. Brakemann, S. Hell, S. Jakobs, ChemPhysChem 15 (2014) 756–762.","ieee":"N. Jensen et al., “Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang,” ChemPhysChem, vol. 15, no. 4. Wiley-Blackwell, pp. 756–762, 2014."},"status":"public","type":"journal_article","_id":"1058","date_published":"2014-03-17T00:00:00Z","issue":"4","doi":"10.1002/cphc.201301034","volume":15,"date_created":"2018-12-11T11:49:55Z","page":"756 - 762","day":"17","language":[{"iso":"eng"}],"publication":"ChemPhysChem","year":"2014","publication_status":"published","month":"03","intvolume":" 15","publisher":"Wiley-Blackwell","oa_version":"None","abstract":[{"text":"Diffraction-unlimited far-field super-resolution fluorescence (nanoscopy) methods typically rely on transiently transferring fluorophores between two states, whereby this transfer is usually laid out as a switch. However, depending on whether this is induced in a spatially controlled manner using a pattern of light (coordinate-targeted) or stochastically on a single-molecule basis, specific requirements on the fluorophores are imposed. Therefore, the fluorophores are usually utilized just for one class of methods only. In this study we demonstrate that the reversibly switchable fluorescent protein Dreiklang enables live-cell recordings in both spatially controlled and stochastic modes. We show that the Dreiklang chromophore entails three different light-induced switching mechanisms, namely a reversible photochemical one, off-switching by stimulated emission, and a reversible transfer to a long-lived dark state from the S1 state, all of which can be utilized to overcome the diffraction barrier. We also find that for the single-molecule- based stochastic GSDIM approach (ground-state depletion followed by individual molecule return), Dreiklang provides a larger number of on-off localization events as compared to its progenitor Citrine. Altogether, Dreiklang is a versatile probe for essentially all popular forms of live-cell fluorescence nanoscopy.","lang":"eng"}]},{"acknowledgement":"The authors thank all the members of the Division of Morphogenesis, National Institute for Basic Biology, for their contributions to the research, their encouragement, and helpful discussions, particularly Dr M. Suzuki for his critical reading of the manuscript. We also thank the Model Animal Research and Spectrography and Bioimaging Facilities, NIBB Core Research Facilities, for technical support. M.H. was supported by a research fellowship from the Japan Society for the Promotion of Science (JSPS). Our work introduced in this review was supported by a Grant-in-Aid for Scientific Research on Innovative Areas from the Ministry of Education, Culture, Sports, Science, and Technology (MEXT), Japan, to N.U.","publisher":"Wiley","quality_controlled":"1","oa":1,"day":"01","publication":"Congenital Anomalies","year":"2014","date_published":"2014-02-01T00:00:00Z","doi":"10.1111/cga.12039","date_created":"2022-03-04T08:17:25Z","page":"1-7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hashimoto M, Morita H, Ueno N. 2014. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 54(1), 1–7.","chicago":"Hashimoto, Masakazu, Hitoshi Morita, and Naoto Ueno. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” Congenital Anomalies. Wiley, 2014. https://doi.org/10.1111/cga.12039.","ieee":"M. Hashimoto, H. Morita, and N. Ueno, “Molecular and cellular mechanisms of development underlying congenital diseases,” Congenital Anomalies, vol. 54, no. 1. Wiley, pp. 1–7, 2014.","short":"M. Hashimoto, H. Morita, N. Ueno, Congenital Anomalies 54 (2014) 1–7.","ama":"Hashimoto M, Morita H, Ueno N. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 2014;54(1):1-7. doi:10.1111/cga.12039","apa":"Hashimoto, M., Morita, H., & Ueno, N. (2014). Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. Wiley. https://doi.org/10.1111/cga.12039","mla":"Hashimoto, Masakazu, et al. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” Congenital Anomalies, vol. 54, no. 1, Wiley, 2014, pp. 1–7, doi:10.1111/cga.12039."},"title":"Molecular and cellular mechanisms of development underlying congenital diseases","author":[{"last_name":"Hashimoto","full_name":"Hashimoto, Masakazu","first_name":"Masakazu"},{"id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87","first_name":"Hitoshi","last_name":"Morita","full_name":"Morita, Hitoshi"},{"first_name":"Naoto","last_name":"Ueno","full_name":"Ueno, Naoto"}],"article_processing_charge":"No","external_id":{"pmid":["24666178"]},"oa_version":"None","pmid":1,"abstract":[{"lang":"eng","text":"In the last several decades, developmental biology has clarified the molecular mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated that the “tool-kit genes” essential for regulating developmental processes are not only highly conserved among species, but are also used as systems at various times and places in an organism to control distinct developmental events. Therefore, mutations in many of these tool-kit genes may cause congenital diseases involving morphological abnormalities. This link between genes and abnormal morphological phenotypes underscores the importance of understanding how cells behave and contribute to morphogenesis as a result of gene function. Recent improvements in live imaging and in quantitative analyses of cellular dynamics will advance our understanding of the cellular pathogenesis of congenital diseases associated with aberrant morphologies. In these studies, it is critical to select an appropriate model organism for the particular phenomenon of interest."}],"month":"02","intvolume":" 54","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1111/cga.12039","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0914-3505"]},"publication_status":"published","volume":54,"issue":"1","_id":"10815","status":"public","keyword":["Developmental Biology","Embryology","General Medicine","Pediatrics","Perinatology","and Child Health"],"article_type":"original","type":"journal_article","date_updated":"2022-03-04T08:26:05Z","department":[{"_id":"CaHe"}]},{"date_updated":"2022-03-04T07:38:15Z","citation":{"short":"E. Zažímalová, J. Petrášek, E. Benková, eds., Auxin and Its Role in Plant Development, 1st ed., Springer Nature, Vienna, 2014.","ieee":"E. Zažímalová, J. Petrášek, and E. Benková, Eds., Auxin and Its Role in Plant Development, 1st ed. Vienna: Springer Nature, 2014.","ama":"Zažímalová E, Petrášek J, Benková E, eds. Auxin and Its Role in Plant Development. 1st ed. Vienna: Springer Nature; 2014. doi:10.1007/978-3-7091-1526-8","apa":"Zažímalová, E., Petrášek, J., & Benková, E. (Eds.). (2014). Auxin and Its Role in Plant Development (1st ed.). Vienna: Springer Nature. https://doi.org/10.1007/978-3-7091-1526-8","mla":"Zažímalová, Eva, et al., editors. Auxin and Its Role in Plant Development. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-7091-1526-8.","ista":"Zažímalová E, Petrášek J, Benková E eds. 2014. Auxin and Its Role in Plant Development 1st ed., Vienna: Springer Nature, 444p.","chicago":"Zažímalová, Eva, Jan Petrášek, and Eva Benková, eds. Auxin and Its Role in Plant Development. 1st ed. Vienna: Springer Nature, 2014. https://doi.org/10.1007/978-3-7091-1526-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"Auxin and Its Role in Plant Development","department":[{"_id":"EvBe"}],"editor":[{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"},{"last_name":"Petrášek","full_name":"Petrášek, Jan","first_name":"Jan"},{"orcid":"0000-0002-8510-9739","full_name":"Benková, Eva","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"_id":"10811","type":"book_editor","status":"public","year":"2014","publication_status":"published","publication_identifier":{"isbn":["9783709115251"],"eisbn":["9783709115268"]},"language":[{"iso":"eng"}],"day":"01","page":"444","date_created":"2022-03-03T11:52:44Z","date_published":"2014-04-01T00:00:00Z","doi":"10.1007/978-3-7091-1526-8","abstract":[{"text":"Auxin is an important signaling compound in plants and vital for plant development and growth. The present book, Auxin and its Role in Plant Development, provides the reader with detailed and comprehensive insight into the functioning of the molecule on the whole and specifically in plant development. In the first part, the functioning, metabolism and signaling pathways of auxin in plants are explained, the second part depicts the specific role of auxin in plant development and the third part describes the interaction and functioning of the signaling compound upon stimuli of the environment. Each chapter is written by international experts in the respective field and designed for scientists and researchers in plant biology, plant development and cell biology to summarize the recent progress in understanding the role of auxin and suggest future perspectives for auxin research.","lang":"eng"}],"oa_version":"None","edition":"1","scopus_import":"1","quality_controlled":"1","publisher":"Springer Nature","month":"04","place":"Vienna"},{"oa_version":"Preprint","abstract":[{"text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.","lang":"eng"}],"intvolume":" 8318","month":"01","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1311.4425","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783642540127"],"eissn":["1611-3349"],"eisbn":["9783642540134"]},"ec_funded":1,"volume":8318,"_id":"10884","status":"public","conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19"},"type":"conference","date_updated":"2022-05-17T08:36:01Z","department":[{"_id":"KrCh"}],"acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"Verification, Model Checking, and Abstract Interpretation","day":"30","year":"2014","date_created":"2022-03-18T13:01:22Z","date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_15","page":"262-281","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15","apa":"Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281."},"title":"Parameterized model checking of token-passing systems","article_processing_charge":"No","external_id":{"arxiv":["1311.4425"]},"author":[{"last_name":"Aminof","full_name":"Aminof, Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"last_name":"Khalimov","full_name":"Khalimov, Ayrat","first_name":"Ayrat"},{"full_name":"Rubin, Sasha","last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}]},{"publication_status":"published","publication_identifier":{"eisbn":["9783319040998"],"isbn":["9783319040981"],"eissn":["2197-666X"],"issn":["1612-3786"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":1,"abstract":[{"text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.","lang":"eng"}],"oa_version":"None","scopus_import":"1","intvolume":" 1","place":"Cham","month":"03","date_updated":"2022-06-21T12:01:47Z","department":[{"_id":"HeEd"}],"_id":"10893","series_title":"Mathematics and Visualization","type":"book_chapter","status":"public","year":"2014","publication":"Topological Methods in Data Analysis and Visualization III ","day":"19","page":"55-69","date_created":"2022-03-21T07:11:23Z","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_4","acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","publisher":"Springer","quality_controlled":"1","citation":{"ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_4.","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4","apa":"Kasten, J., Reininghaus, J., Reich, W., & Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (Vol. 1, pp. 55–69). Cham: Springer. https://doi.org/10.1007/978-3-319-04099-8_4","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Jens","last_name":"Kasten","full_name":"Kasten, Jens"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Reininghaus, Jan","last_name":"Reininghaus"},{"full_name":"Reich, Wieland","last_name":"Reich","first_name":"Wieland"},{"last_name":"Scheuermann","full_name":"Scheuermann, Gerik","first_name":"Gerik"}],"title":"Toward the extraction of saddle periodic orbits","editor":[{"last_name":"Bremer","full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"},{"last_name":"Peikert","full_name":"Peikert, Ronald","first_name":"Ronald"}],"project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"The spindle assembly checkpoint prevents separation of sister chromatids until each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report that the nuclear pore complex scaffolds spindle assembly checkpoint signaling in interphase, providing a store of inhibitory signals that limits the speed of the subsequent mitosis."}],"month":"02","intvolume":" 156","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2014.02.004"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0092-8674"]},"publication_status":"published","volume":156,"issue":"5","_id":"11080","status":"public","keyword":["General Biochemistry","Genetics and Molecular Biology"],"article_type":"original","type":"journal_article","extern":"1","date_updated":"2022-07-18T08:44:33Z","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"27","publication":"Cell","year":"2014","date_published":"2014-02-27T00:00:00Z","doi":"10.1016/j.cell.2014.02.004","date_created":"2022-04-07T07:50:04Z","page":"868-869","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"mla":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” Cell, vol. 156, no. 5, Elsevier, 2014, pp. 868–69, doi:10.1016/j.cell.2014.02.004.","short":"A. Buchwalter, M. Hetzer, Cell 156 (2014) 868–869.","ieee":"A. Buchwalter and M. Hetzer, “Nuclear pores set the speed limit for mitosis,” Cell, vol. 156, no. 5. Elsevier, pp. 868–869, 2014.","ama":"Buchwalter A, Hetzer M. Nuclear pores set the speed limit for mitosis. Cell. 2014;156(5):868-869. doi:10.1016/j.cell.2014.02.004","apa":"Buchwalter, A., & Hetzer, M. (2014). Nuclear pores set the speed limit for mitosis. Cell. Elsevier. https://doi.org/10.1016/j.cell.2014.02.004","chicago":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” Cell. Elsevier, 2014. https://doi.org/10.1016/j.cell.2014.02.004.","ista":"Buchwalter A, Hetzer M. 2014. Nuclear pores set the speed limit for mitosis. Cell. 156(5), 868–869."},"title":"Nuclear pores set the speed limit for mitosis","author":[{"first_name":"Abigail","full_name":"Buchwalter, Abigail","last_name":"Buchwalter"},{"last_name":"HETZER","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"article_processing_charge":"No","external_id":{"pmid":["24581486"]}},{"oa":1,"quality_controlled":"1","publisher":"American Society for Cell Biology","year":"2014","publication":"Molecular Biology of the Cell","day":"15","page":"2472-2484","date_created":"2022-04-07T07:50:24Z","date_published":"2014-08-15T00:00:00Z","doi":"10.1091/mbc.e14-04-0865","citation":{"chicago":"Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” Molecular Biology of the Cell. American Society for Cell Biology, 2014. https://doi.org/10.1091/mbc.e14-04-0865.","ista":"Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. Molecular Biology of the Cell. 25(16), 2472–2484.","mla":"Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” Molecular Biology of the Cell, vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:10.1091/mbc.e14-04-0865.","ama":"Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. Molecular Biology of the Cell. 2014;25(16):2472-2484. doi:10.1091/mbc.e14-04-0865","apa":"Buchwalter, A. L., Liang, Y., & Hetzer, M. (2014). Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. Molecular Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.e14-04-0865","ieee":"A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics,” Molecular Biology of the Cell, vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014.","short":"A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014) 2472–2484."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","article_processing_charge":"No","author":[{"first_name":"Abigail L.","full_name":"Buchwalter, Abigail L.","last_name":"Buchwalter"},{"last_name":"Liang","full_name":"Liang, Yun","first_name":"Yun"},{"last_name":"HETZER","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W"}],"title":"Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics","abstract":[{"text":"The nuclear pore complex (NPC) plays a critical role in gene expression by mediating import of transcription regulators into the nucleus and export of RNA transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating transport, a subset of nucleoporins (Nups) engage in transcriptional activation and elongation at genomic loci that are not associated with NPCs. The underlying mechanism and regulation of Nup mobility on and off nuclear pores remain unclear. Here we show that Nup50 is a mobile Nup with a pronounced presence both at the NPC and in the nucleoplasm that can move between these different localizations. Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active transcription by RNA polymerase II and requires the N-terminal half of the protein, which contains importin α– and Nup153-binding domains. However, Nup50 dynamics are independent of importin α, Nup153, and Nup98, even though the latter two proteins also exhibit transcription-dependent mobility. Of interest, depletion of Nup50 from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation into myotubes. Taken together, our results suggest a transport-independent role for Nup50 in chromatin biology that occurs away from the NPC.","lang":"eng"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1091/mbc.e14-04-0865"}],"scopus_import":"1","intvolume":" 25","month":"08","publication_status":"published","publication_identifier":{"issn":["1059-1524","1939-4586"]},"language":[{"iso":"eng"}],"issue":"16","volume":25,"_id":"11082","type":"journal_article","article_type":"original","keyword":["Cell Biology","Molecular Biology"],"status":"public","date_updated":"2022-07-18T08:45:20Z","extern":"1"},{"citation":{"apa":"Hatch, E., & Hetzer, M. (2014). Breaching the nuclear envelope in development and disease. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201402003","ama":"Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease. Journal of Cell Biology. 2014;205(2):133-141. doi:10.1083/jcb.201402003","ieee":"E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and disease,” Journal of Cell Biology, vol. 205, no. 2. Rockefeller University Press, pp. 133–141, 2014.","short":"E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141.","mla":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” Journal of Cell Biology, vol. 205, no. 2, Rockefeller University Press, 2014, pp. 133–41, doi:10.1083/jcb.201402003.","ista":"Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and disease. Journal of Cell Biology. 205(2), 133–141.","chicago":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” Journal of Cell Biology. Rockefeller University Press, 2014. https://doi.org/10.1083/jcb.201402003."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","author":[{"first_name":"Emily","last_name":"Hatch","full_name":"Hatch, Emily"},{"last_name":"HETZER","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W"}],"article_processing_charge":"No","external_id":{"pmid":["24751535"]},"title":"Breaching the nuclear envelope in development and disease","quality_controlled":"1","publisher":"Rockefeller University Press","oa":1,"year":"2014","day":"21","publication":"Journal of Cell Biology","page":"133-141","date_published":"2014-04-21T00:00:00Z","doi":"10.1083/jcb.201402003","date_created":"2022-04-07T07:50:13Z","_id":"11081","article_type":"review","type":"journal_article","status":"public","keyword":["Cell Biology"],"date_updated":"2022-07-18T08:45:09Z","extern":"1","abstract":[{"text":"In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope (NE). In metazoans, the NE breaks down in mitosis and it has been assumed that the physical barrier separating nucleoplasm and cytoplasm remains intact during the rest of the cell cycle and cell differentiation. However, recent studies suggest that nonmitotic NE remodeling plays a critical role in development, virus infection, laminopathies, and cancer. Although the mechanisms underlying these NE restructuring events are currently being defined, one common theme is activation of protein kinase C family members in the interphase nucleus to disrupt the nuclear lamina, demonstrating the importance of the lamina in maintaining nuclear integrity.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1083/jcb.201402003"}],"month":"04","intvolume":" 205","publication_identifier":{"issn":["1540-8140","0021-9525"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":205,"issue":"2"},{"citation":{"ista":"Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.","chicago":"Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best, Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2014. https://doi.org/10.1093/mnras/stu392.","ieee":"J. J. Matthee et al., “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys,” Monthly Notices of the Royal Astronomical Society, vol. 440, no. 3. Oxford University Press, pp. 2375–2387, 2014.","short":"J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M. Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical Society 440 (2014) 2375–2387.","apa":"Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim, J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stu392","ama":"Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. 2014;440(3):2375-2387. doi:10.1093/mnras/stu392","mla":"Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” Monthly Notices of the Royal Astronomical Society, vol. 440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:10.1093/mnras/stu392."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1402.6697"]},"article_processing_charge":"No","author":[{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"first_name":"A. M.","full_name":"Swinbank, A. M.","last_name":"Swinbank"},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"first_name":"P. N.","last_name":"Best","full_name":"Best, P. N."},{"full_name":"Kim, Jae-Woo","last_name":"Kim","first_name":"Jae-Woo"},{"first_name":"Marijn","last_name":"Franx","full_name":"Franx, Marijn"},{"full_name":"Milvang-Jensen, Bo","last_name":"Milvang-Jensen","first_name":"Bo"},{"last_name":"Fynbo","full_name":"Fynbo, Johan","first_name":"Johan"}],"title":"A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys","year":"2014","publication":"Monthly Notices of the Royal Astronomical Society","day":"21","page":"2375-2387","date_created":"2022-07-14T12:33:24Z","date_published":"2014-05-21T00:00:00Z","doi":"10.1093/mnras/stu392","acknowledgement":"We thank the anonymous referee for the comments and suggestions which improved both the quality and clarity of this work. DS acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship. IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges the support from the Creative Research Initiative Program, no. 2008- 0060544, of the National Research Foundation of Korea (NRF) funded by the Korean government (MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The Dark Cosmology Centre is funded by the Danish National Research Foundation. This work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey. Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France and the University of Hawaii. This work is based in part on data products produced at Terapix available at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope. The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent legacy and complementary value – without such high-quality data sets, this research would not have been possible.","oa":1,"quality_controlled":"1","publisher":"Oxford University Press","date_updated":"2022-08-19T08:30:30Z","extern":"1","_id":"11583","article_type":"original","type":"journal_article","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations","dark ages","reionization","first stars"],"status":"public","publication_status":"published","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"language":[{"iso":"eng"}],"volume":440,"issue":"3","abstract":[{"lang":"eng","text":"Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.6697"}],"scopus_import":"1","intvolume":" 440","month":"05"},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1407.1047"}],"month":"09","intvolume":" 443","abstract":[{"text":"We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.","lang":"eng"}],"oa_version":"Preprint","volume":443,"issue":"3","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: kinematics and dynamics"],"_id":"11582","date_updated":"2022-08-19T08:27:25Z","extern":"1","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"acknowledgement":"First, we acknowledge the referee for their comments, which have improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1). IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting grant. PNB acknowledges STFC for financial support.","page":"2695-2704","doi":"10.1093/mnras/stu1343","date_published":"2014-09-21T00:00:00Z","date_created":"2022-07-14T12:16:10Z","year":"2014","day":"21","publication":"Monthly Notices of the Royal Astronomical Society","author":[{"full_name":"Stott, John P.","last_name":"Stott","first_name":"John P."},{"last_name":"Sobral","full_name":"Sobral, David","first_name":"David"},{"full_name":"Swinbank, A. M.","last_name":"Swinbank","first_name":"A. M."},{"last_name":"Smail","full_name":"Smail, Ian","first_name":"Ian"},{"first_name":"Richard","last_name":"Bower","full_name":"Bower, Richard"},{"full_name":"Best, Philip N.","last_name":"Best","first_name":"Philip N."},{"last_name":"Sharples","full_name":"Sharples, Ray M.","first_name":"Ray M."},{"last_name":"Geach","full_name":"Geach, James E.","first_name":"James E."},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","last_name":"Matthee"}],"article_processing_charge":"No","external_id":{"arxiv":["1407.1047"]},"title":"A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS","citation":{"mla":"Stott, John P., et al. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” Monthly Notices of the Royal Astronomical Society, vol. 443, no. 3, Oxford University Press, 2014, pp. 2695–704, doi:10.1093/mnras/stu1343.","ieee":"J. P. Stott et al., “A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” Monthly Notices of the Royal Astronomical Society, vol. 443, no. 3. Oxford University Press, pp. 2695–2704, 2014.","short":"J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M. Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 443 (2014) 2695–2704.","apa":"Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N., … Matthee, J. J. (2014). A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stu1343","ama":"Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. 2014;443(3):2695-2704. doi:10.1093/mnras/stu1343","chicago":"Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower, Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2014. https://doi.org/10.1093/mnras/stu1343.","ista":"Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach JE, Matthee JJ. 2014. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. 443(3), 2695–2704."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"05","intvolume":" 50","scopus_import":"1","oa_version":"None","abstract":[{"text":"We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find a significant increase in the magnetic susceptibility in our sample when compared with the values previously reported for the polycrystalline sample. The pronounced Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole. In the intrinsic conductivity region, the susceptibility due to free carriers shows thermally activated behavior and is consistent with the data reported for single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic susceptibility in our sample comes mainly from a small amount of unreacted Fe, the contribution from the enhanced carrier density due to lattice and strain defects arising from the ball milling process is also significant. Existence of an unreacted Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300 K.","lang":"eng"}],"volume":50,"issue":"5","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0018-9464"],"eissn":["1941-0069"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","_id":"11750","extern":"1","date_updated":"2022-08-11T09:51:22Z","quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","doi":"10.1109/TMAG.2013.2292607","date_published":"2014-05-01T00:00:00Z","date_created":"2022-08-08T08:26:02Z","day":"01","publication":"IEEE Transactions on Magnetics","year":"2014","article_number":"6675864","title":"Magnetic properties of hot-pressed FeSb2","author":[{"last_name":"Pokharel","full_name":"Pokharel, Mani","first_name":"Mani"},{"last_name":"Zhao","full_name":"Zhao, Huaizhou","first_name":"Huaizhou"},{"orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A"},{"last_name":"Ren","full_name":"Ren, Zhifeng","first_name":"Zhifeng"},{"first_name":"Cyril","full_name":"Opeil, Cyril","last_name":"Opeil"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics, vol. 50, no. 5, 6675864, Institute of Electrical and Electronics Engineers, 2014, doi:10.1109/TMAG.2013.2292607.","ama":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 2014;50(5). doi:10.1109/TMAG.2013.2292607","apa":"Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., & Opeil, C. (2014). Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TMAG.2013.2292607","ieee":"M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties of hot-pressed FeSb2,” IEEE Transactions on Magnetics, vol. 50, no. 5. Institute of Electrical and Electronics Engineers, 2014.","short":"M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on Magnetics 50 (2014).","chicago":"Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics. Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/TMAG.2013.2292607.","ista":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864."}},{"date_updated":"2023-02-13T11:16:24Z","extern":"1","_id":"11789","type":"conference","conference":{"name":"ESA: Annual European Symposium on Algorithms","start_date":"2014-09-08","end_date":"2014-09-10","location":"Wroclaw, Poland"},"status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["978-366244776-5"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":8737,"abstract":[{"lang":"eng","text":"We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.\r\n\r\nWe identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal."}],"oa_version":"Preprint","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1409.2139","open_access":"1"}],"month":"09","intvolume":" 8737","citation":{"apa":"Charikar, M., Henzinger, M. H., & Nguyễn, H. L. (2014). Online bipartite matching with decomposable weights. In 22nd Annual European Symposium on Algorithms (Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-44777-2_22","ama":"Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22","short":"M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium on Algorithms, Springer Nature, 2014, pp. 260–271.","ieee":"M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in 22nd Annual European Symposium on Algorithms, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.","mla":"Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.” 22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.","ista":"Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.","chicago":"Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite Matching with Decomposable Weights.” In 22nd Annual European Symposium on Algorithms, 8737:260–71. Springer Nature, 2014. https://doi.org/10.1007/978-3-662-44777-2_22."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Moses","last_name":"Charikar","full_name":"Charikar, Moses"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Huy L.","last_name":"Nguyễn","full_name":"Nguyễn, Huy L."}],"article_processing_charge":"No","external_id":{"arxiv":["1409.2139"]},"title":"Online bipartite matching with decomposable weights","year":"2014","day":"01","publication":"22nd Annual European Symposium on Algorithms","page":"260 - 271","date_published":"2014-09-01T00:00:00Z","doi":"10.1007/978-3-662-44777-2_22","date_created":"2022-08-11T10:41:47Z","quality_controlled":"1","publisher":"Springer Nature","oa":1},{"conference":{"name":"WINE: International Conference on Web and Internet Economics","start_date":"2014-12-14","end_date":"2014-12-17","location":"Beijing, China"},"type":"conference","status":"public","_id":"11790","article_processing_charge":"No","author":[{"first_name":"Luděk","full_name":"Cigler, Luděk","last_name":"Cigler"},{"first_name":"Wolfgang","full_name":"Dvořák, Wolfgang","last_name":"Dvořák"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"title":"Limiting price discrimination when selling products with positive network externalities","date_updated":"2023-02-13T11:18:30Z","citation":{"ama":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. Limiting price discrimination when selling products with positive network externalities. In: 10th International Conference of Web and Internet Economics. Vol 8877. Springer Nature; 2014:44-57. doi:10.1007/978-3-319-13129-0_4","apa":"Cigler, L., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2014). Limiting price discrimination when selling products with positive network externalities. In 10th International Conference of Web and Internet Economics (Vol. 8877, pp. 44–57). Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-319-13129-0_4","short":"L. Cigler, W. Dvořák, M.H. Henzinger, M. Starnberger, in:, 10th International Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57.","ieee":"L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57.","mla":"Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” 10th International Conference of Web and Internet Economics, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:10.1007/978-3-319-13129-0_4.","ista":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. 2014. Limiting price discrimination when selling products with positive network externalities. 10th International Conference of Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8877, 44–57.","chicago":"Cigler, Luděk, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” In 10th International Conference of Web and Internet Economics, 8877:44–57. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13129-0_4."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","scopus_import":"1","alternative_title":["LNCS"],"publisher":"Springer Nature","quality_controlled":"1","intvolume":" 8877","month":"12","abstract":[{"text":"Assume a seller wants to sell a digital product in a social network where a buyer’s valuation of the item has positive network externalities from her neighbors that already have the item. The goal of the seller is to maximize his revenue. Previous work on this problem [7] studies the case where clients are offered the item in sequence and have to pay personalized prices. This is highly infeasible in large scale networks such as the Facebook graph: (1) Offering items to the clients one after the other consumes a large amount of time, and (2) price-discrimination of clients could appear unfair to them and result in negative client reaction or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with these issues. Specifically, the item is offered in parallel to multiple clients at the same time and at the same price. This is called a round. We show that with O(logn) rounds, where n is the number of clients, a constant factor of the revenue with price discrimination can be achieved and that this is not possible with o(logn) rounds. Moreover we show that it is APX-hard to maximize the revenue and we give constant factor approximation algorithms for various further settings of limited price discrimination.","lang":"eng"}],"oa_version":"None","page":"44 - 57","date_created":"2022-08-11T10:58:44Z","doi":"10.1007/978-3-319-13129-0_4","volume":8877,"date_published":"2014-12-01T00:00:00Z","publication_status":"published","year":"2014","publication_identifier":{"issn":["0302-9743"]},"language":[{"iso":"eng"}],"publication":"10th International Conference of Web and Internet Economics","day":"01"},{"date_updated":"2021-01-12T06:48:53Z","citation":{"chicago":"Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular Media in Different Gravities.” Geophysical Research Letters. Wiley-Blackwell, 2014. https://doi.org/10.1002/2014GL059229.","ista":"Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis SR, Hidalgo R. 2014. Settling into dry granular media in different gravities. Geophysical Research Letters. 41(9), 3032–3037.","mla":"Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.” Geophysical Research Letters, vol. 41, no. 9, Wiley-Blackwell, 2014, pp. 3032–37, doi:10.1002/2014GL059229.","ama":"Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media in different gravities. Geophysical Research Letters. 2014;41(9):3032-3037. doi:10.1002/2014GL059229","apa":"Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet, C., Waitukaitis, S. R., & Hidalgo, R. (2014). Settling into dry granular media in different gravities. Geophysical Research Letters. Wiley-Blackwell. https://doi.org/10.1002/2014GL059229","ieee":"E. Altshuler et al., “Settling into dry granular media in different gravities,” Geophysical Research Letters, vol. 41, no. 9. Wiley-Blackwell, pp. 3032–3037, 2014.","short":"E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet, S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","publist_id":"7936","author":[{"first_name":"Ernesto","last_name":"Altshuler","full_name":"Altshuler, Ernesto"},{"first_name":"H","full_name":"Torres, H","last_name":"Torres"},{"last_name":"González_Pita","full_name":"González_Pita, A","first_name":"A"},{"first_name":"Colina G","full_name":"Sánchez, Colina G","last_name":"Sánchez"},{"full_name":"Pérez Penichet, Carlos","last_name":"Pérez Penichet","first_name":"Carlos"},{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"},{"last_name":"Hidalgo","full_name":"Hidalgo, Rauól","first_name":"Rauól"}],"title":"Settling into dry granular media in different gravities","_id":"118","type":"journal_article","status":"public","year":"2014","publication_status":"published","language":[{"iso":"eng"}],"publication":"Geophysical Research Letters","day":"16","page":"3032 - 3037","date_created":"2018-12-11T11:44:43Z","date_published":"2014-05-16T00:00:00Z","issue":"9","volume":41,"doi":"10.1002/2014GL059229","abstract":[{"lang":"eng","text":"While the penetration of objects into granular media is well-studied, there is little understanding of how objects settle in gravities, geff, different from that of Earth - a scenario potentially relevant to the geomorphology of planets and asteroids and also to their exploration using man-made devices. By conducting experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2 g. Surprisingly, we find that the rest depth is independent of geff and also that the time required for the object to come to rest scales like geff-1/2. With discrete element modeling simulations, we reproduce the experimental results and extend the range of geff to objects as small as asteroids and as large as Jupiter. Our results shed light on the initial stage of sedimentation into dry granular media across a range of celestial bodies and also have implications for the design of man-made, extraterrestrial vehicles and structures. Key Points The settling depth in granular media is independent of gravity The settling time scales like g-1/2 Layering driven by granular sedimentation should be similar."}],"acknowledgement":"The Spanish MINECO project FIS2011-26675, the PIUNA program (U. Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba) have partially supported this research. ","oa_version":"None","publisher":"Wiley-Blackwell","quality_controlled":"1","intvolume":" 41","month":"05"},{"external_id":{"arxiv":["1402.0054"]},"article_processing_charge":"No","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In 55th Annual Symposium on Foundations of Computer Science, 146–55. Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/focs.2014.24.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United States, 2014, pp. 146–155.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In 55th Annual Symposium on Foundations of Computer Science (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2014.24","ama":"Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: 55th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:10.1109/focs.2014.24","mla":"Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–55, doi:10.1109/focs.2014.24."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","page":"146-155","date_created":"2022-08-16T08:14:33Z","doi":"10.1109/focs.2014.24","date_published":"2014-10-01T00:00:00Z","year":"2014","publication":"55th Annual Symposium on Foundations of Computer Science","day":"01","conference":{"name":"FOCS: Annual Symposium on Foundations of Computer Science","start_date":"2014-10-18","location":"Philadelphia, PA, United States","end_date":"2014-10-21"},"type":"conference","status":"public","_id":"11855","date_updated":"2023-02-21T16:27:34Z","extern":"1","main_file_link":[{"url":"https://arxiv.org/abs/1402.0054","open_access":"1"}],"scopus_import":"1","month":"10","abstract":[{"text":"The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest.","lang":"eng"}],"oa_version":"Preprint","related_material":{"record":[{"id":"11768","status":"public","relation":"later_version"}]},"publication_status":"published","publication_identifier":{"eisbn":["978-1-4799-6517-5"],"issn":["0272-5428"]},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"publication":"46th Annual ACM Symposium on Theory of Computing","day":"01","publication_status":"published","year":"2014","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145032710-7"]},"date_created":"2022-08-16T09:41:57Z","date_published":"2014-05-01T00:00:00Z","doi":"10.1145/2591796.2591869","oa_version":"Preprint","abstract":[{"text":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case.","lang":"eng"}],"month":"05","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.07959","open_access":"1"}],"publisher":"Association for Computing Machinery","scopus_import":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2014. https://doi.org/10.1145/2591796.2591869.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2014. doi:10.1145/2591796.2591869","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In 46th Annual ACM Symposium on Theory of Computing. New York, NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.","mla":"Henzinger, Monika H., et al. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” 46th Annual ACM Symposium on Theory of Computing, 674–683, Association for Computing Machinery, 2014, doi:10.1145/2591796.2591869."},"date_updated":"2023-02-17T11:18:52Z","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","external_id":{"arxiv":["1504.07959"]},"article_processing_charge":"No","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","full_name":"Krinninger, Sebastian","last_name":"Krinninger"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"article_number":"674 - 683","_id":"11870","status":"public","conference":{"start_date":"2014-05-31","end_date":"2014-06-03","location":"New York, NY, United States","name":"STOC: Symposium on Theory of Computing"},"type":"conference"},{"year":"2014","publication_status":"published","publication_identifier":{"isbn":["978-1-61197-338-9"],"eisbn":["978-1-61197-340-2"]},"language":[{"iso":"eng"}],"publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","page":"1053-1072","date_created":"2022-08-16T12:58:31Z","doi":"10.1137/1.9781611973402.79","date_published":"2014-01-01T00:00:00Z","abstract":[{"text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.","lang":"eng"}],"oa_version":"Published Version","oa":1,"main_file_link":[{"url":"https://doi.org/10.1137/1.9781611973402.79","open_access":"1"}],"scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","month":"01","citation":{"mla":"Henzinger, Monika H., et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:10.1137/1.9781611973402.79.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.","ama":"Henzinger MH, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:10.1137/1.9781611973402.79","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973402.79","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In 25th Annual ACM-SIAM Symposium on Discrete Algorithms, 1053–72. Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973402.79.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072."},"date_updated":"2023-02-17T11:58:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"title":"A subquadratic-time algorithm for decremental single-source shortest paths","_id":"11876","conference":{"location":"Portland, OR, United States","end_date":"2014-01-07","start_date":"2014-01-05","name":"SODA: Symposium on Discrete Algorithms"},"type":"conference","status":"public"},{"title":"Deterministic fully dynamic data structures for vertex cover and matching","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"full_name":"Italiano, Giuseppe F.","last_name":"Italiano","first_name":"Giuseppe F."}],"article_processing_charge":"No","external_id":{"arxiv":["1412.1318"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:10.1137/1.9781611973730.54.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In 26th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.54","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:785-804. doi:10.1137/1.9781611973730.54","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In 26th Annual ACM-SIAM Symposium on Discrete Algorithms, 785–804. Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973730.54.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804."},"date_published":"2014-01-01T00:00:00Z","doi":"10.1137/1.9781611973730.54","date_created":"2022-08-16T12:36:42Z","page":"785-804","day":"01","publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","year":"2014","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","oa":1,"extern":"1","date_updated":"2023-02-21T16:32:06Z","status":"public","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"San Diego, CA, United States","end_date":"2015-01-06","start_date":"2015-01-04"},"_id":"11875","related_material":{"record":[{"relation":"later_version","status":"public","id":"11890"}]},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"publication_status":"published","month":"01","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13]."}]},{"intvolume":" 112","month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2578"}],"oa_version":"Submitted Version","abstract":[{"text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging.","lang":"eng"}],"volume":112,"issue":"21","language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"119","extern":"1","date_updated":"2021-01-12T06:48:58Z","oa":1,"quality_controlled":"1","publisher":"American Physical Society","acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation.","date_created":"2018-12-11T11:44:44Z","date_published":"2014-05-30T00:00:00Z","doi":"10.1103/PhysRevLett.112.218001","publication":"APS Physics, Physical Review Letters","day":"30","year":"2014","article_number":"218001","title":"Size-dependent same-material tribocharging in insulating grains","external_id":{"arxiv":["1309.2578"]},"author":[{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"},{"first_name":"Victor","last_name":"Lee","full_name":"Lee, Victor"},{"first_name":"James","last_name":"Pierson","full_name":"Pierson, James"},{"last_name":"Forman","full_name":"Forman, Steven","first_name":"Steven"},{"first_name":"Heinrich","last_name":"Jaeger","full_name":"Jaeger, Heinrich"}],"publist_id":"7935","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS Physics, Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.112.218001.","ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS Physics, Physical Review Letters, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:10.1103/PhysRevLett.112.218001.","ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 2014;112(21). doi:10.1103/PhysRevLett.112.218001","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., & Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.112.218001","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” APS Physics, Physical Review Letters, vol. 112, no. 21. American Physical Society, 2014.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014)."}},{"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription.","lang":"eng"}],"month":"06","intvolume":" 29","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2014.04.025","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"publication_status":"published","volume":29,"issue":"6","_id":"11968","status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2023-02-21T10:09:45Z","quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"23","publication":"Developmental Cell","year":"2014","date_published":"2014-06-23T00:00:00Z","doi":"10.1016/j.devcel.2014.04.025","date_created":"2022-08-25T08:42:42Z","page":"P729-739","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental Cell, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:10.1016/j.devcel.2014.04.025.","short":"H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber, G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler, A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell 29 (2014) P729-739.","ieee":"H. F. Hofbauer et al., “Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids,” Developmental Cell, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.","ama":"Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 2014;29(6):P729-739. doi:10.1016/j.devcel.2014.04.025","apa":"Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber, B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2014.04.025","chicago":"Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder, Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental Cell. Elsevier, 2014. https://doi.org/10.1016/j.devcel.2014.04.025.","ista":"Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), P729-739."},"title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","author":[{"full_name":"Hofbauer, Harald F.","last_name":"Hofbauer","first_name":"Harald F."},{"last_name":"Schopf","full_name":"Schopf, Florian H.","first_name":"Florian H."},{"first_name":"Hannes","last_name":"Schleifer","full_name":"Schleifer, Hannes"},{"full_name":"Knittelfelder, Oskar L.","last_name":"Knittelfelder","first_name":"Oskar L."},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"last_name":"Rechberger","full_name":"Rechberger, Gerald N.","first_name":"Gerald N."},{"first_name":"Heimo","full_name":"Wolinski, Heimo","last_name":"Wolinski"},{"full_name":"Gaspar, Maria L.","last_name":"Gaspar","first_name":"Maria L."},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"},{"first_name":"Johannes","full_name":"Stadlmann, Johannes","last_name":"Stadlmann"},{"last_name":"Mechtler","full_name":"Mechtler, Karl","first_name":"Karl"},{"first_name":"Alexandra","last_name":"Zenz","full_name":"Zenz, Alexandra"},{"full_name":"Lohner, Karl","last_name":"Lohner","first_name":"Karl"},{"first_name":"Oksana","full_name":"Tehlivets, Oksana","last_name":"Tehlivets"},{"last_name":"Henry","full_name":"Henry, Susan A.","first_name":"Susan A."},{"first_name":"Sepp D.","last_name":"Kohlwein","full_name":"Kohlwein, Sepp D."}],"article_processing_charge":"No","external_id":{"pmid":["24960695"]}}]