[{"scopus_import":"1","publication_identifier":{"isbn":["9783642370632"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642370649"]},"alternative_title":["LNCS"],"page":"214-225","date_published":"2013-04-15T00:00:00Z","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-37064-9_20","ec_funded":1,"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting the problem of identifying a deterministic transducer to compute the optimal cost, and to Martin Chmelik for his comments on the introduction.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"15","oa_version":"None","type":"conference","date_updated":"2023-09-05T15:10:38Z","series_title":"LNCS","place":"Berlin, Heidelberg","intvolume":"      7810","status":"public","month":"04","conference":{"name":"LATA: Conference on Language and Automata Theory and Applications","end_date":"2013-04-05","start_date":"2013-04-02","location":"Bilbao, Spain"},"date_created":"2022-03-21T07:56:21Z","volume":7810,"publisher":"Springer Nature","_id":"10902","title":"How to travel between languages","publication":"7th International Conference on Language and Automata Theory and Applications","abstract":[{"text":"We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language.","lang":"eng"}],"publication_status":"published","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Siddhesh","last_name":"Chaubal","full_name":"Chaubal, Siddhesh"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha","first_name":"Sasha","last_name":"Rubin"}],"citation":{"ista":"Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.","short":"K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In <i>7th International Conference on Language and Automata Theory and Applications</i>, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>.","ieee":"K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,” in <i>7th International Conference on Language and Automata Theory and Applications</i>, Bilbao, Spain, 2013, vol. 7810, pp. 214–225.","ama":"Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: <i>7th International Conference on Language and Automata Theory and Applications</i>. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>","mla":"Chatterjee, Krishnendu, et al. “How to Travel between Languages.” <i>7th International Conference on Language and Automata Theory and Applications</i>, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>.","apa":"Chatterjee, K., Chaubal, S., &#38; Rubin, S. (2013). How to travel between languages. In <i>7th International Conference on Language and Automata Theory and Applications</i> (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>"},"year":"2013"},{"month":"03","date_created":"2022-04-07T07:50:33Z","status":"public","intvolume":"        23","publisher":"Elsevier","article_type":"letter_note","volume":23,"issue":"3","abstract":[{"lang":"eng","text":"Nuclear pore complex (NPC) proteins are known for their critical roles in regulating nucleocytoplasmic traffic of macromolecules across the nuclear envelope. However, recent findings suggest that some nucleoporins (Nups), including Nup98, have additional functions in developmental gene regulation. Nup98, which exhibits transcription-dependent mobility at the NPC but can also bind chromatin away from the nuclear envelope, is frequently involved in chromosomal translocations in a subset of patients suffering from acute myeloid leukemia (AML). A common paradigm suggests that Nup98 translocations cause aberrant transcription when they are recuited to aberrant genomic loci. Importantly, this model fails to account for the potential loss of wild type (WT) Nup98 function in the presence of Nup98 translocation mutants. Here we examine how the cell might regulate Nup98 nucleoplasmic protein levels to control transcription in healthy cells. In addition, we discuss the possibility that dominant negative Nup98 fusion proteins disrupt the transcriptional activity of WT Nup98 in the nucleoplasm to drive AML."}],"publication_status":"published","pmid":1,"publication":"Trends in Cell Biology","title":"The role of Nup98 in transcription regulation in healthy and diseased cells","_id":"11083","year":"2013","citation":{"mla":"Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription Regulation in Healthy and Diseased Cells.” <i>Trends in Cell Biology</i>, vol. 23, no. 3, Elsevier, 2013, pp. 112–17, doi:<a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">10.1016/j.tcb.2012.10.013</a>.","apa":"Franks, T. M., &#38; Hetzer, M. (2013). The role of Nup98 in transcription regulation in healthy and diseased cells. <i>Trends in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">https://doi.org/10.1016/j.tcb.2012.10.013</a>","ieee":"T. M. Franks and M. Hetzer, “The role of Nup98 in transcription regulation in healthy and diseased cells,” <i>Trends in Cell Biology</i>, vol. 23, no. 3. Elsevier, pp. 112–117, 2013.","ama":"Franks TM, Hetzer M. The role of Nup98 in transcription regulation in healthy and diseased cells. <i>Trends in Cell Biology</i>. 2013;23(3):112-117. doi:<a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">10.1016/j.tcb.2012.10.013</a>","short":"T.M. Franks, M. Hetzer, Trends in Cell Biology 23 (2013) 112–117.","chicago":"Franks, Tobias M., and Martin Hetzer. “The Role of Nup98 in Transcription Regulation in Healthy and Diseased Cells.” <i>Trends in Cell Biology</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tcb.2012.10.013\">https://doi.org/10.1016/j.tcb.2012.10.013</a>.","ista":"Franks TM, Hetzer M. 2013. The role of Nup98 in transcription regulation in healthy and diseased cells. Trends in Cell Biology. 23(3), 112–117."},"quality_controlled":"1","author":[{"full_name":"Franks, Tobias M.","last_name":"Franks","first_name":"Tobias M."},{"full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER","first_name":"Martin W"}],"extern":"1","scopus_import":"1","publication_identifier":{"issn":["0962-8924"]},"keyword":["Cell Biology"],"external_id":{"pmid":["23246429"]},"date_published":"2013-03-01T00:00:00Z","page":"112-117","doi":"10.1016/j.tcb.2012.10.013","language":[{"iso":"eng"}],"oa_version":"None","date_updated":"2022-07-18T08:45:34Z","type":"journal_article","day":"01","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","article_processing_charge":"No"},{"scopus_import":"1","publication_identifier":{"issn":["1471-0072","1471-0080"]},"keyword":["Cell Biology","Molecular Biology"],"external_id":{"pmid":["23258296"]},"date_published":"2013-01-01T00:00:00Z","page":"55-61","language":[{"iso":"eng"}],"doi":"10.1038/nrm3496","oa_version":"None","type":"journal_article","date_updated":"2022-07-18T08:37:53Z","day":"01","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","article_processing_charge":"No","month":"01","date_created":"2022-04-07T07:50:43Z","status":"public","intvolume":"        14","article_type":"original","publisher":"Springer Nature","volume":14,"abstract":[{"text":"Protein turnover is an effective way of maintaining a functional proteome, as old and potentially damaged polypeptides are destroyed and replaced by newly synthesized copies. An increasing number of intracellular proteins, however, have been identified that evade this turnover process and instead are maintained over a cell's lifetime. This diverse group of long-lived proteins might be particularly prone to accumulation of damage and thus have a crucial role in the functional deterioration of key regulatory processes during ageing.","lang":"eng"}],"publication_status":"published","pmid":1,"title":"Protein homeostasis: Live long, won't prosper","publication":"Nature Reviews Molecular Cell Biology","_id":"11084","year":"2013","citation":{"ieee":"B. H. Toyama and M. Hetzer, “Protein homeostasis: Live long, won’t prosper,” <i>Nature Reviews Molecular Cell Biology</i>, vol. 14. Springer Nature, pp. 55–61, 2013.","ama":"Toyama BH, Hetzer M. Protein homeostasis: Live long, won’t prosper. <i>Nature Reviews Molecular Cell Biology</i>. 2013;14:55-61. doi:<a href=\"https://doi.org/10.1038/nrm3496\">10.1038/nrm3496</a>","ista":"Toyama BH, Hetzer M. 2013. Protein homeostasis: Live long, won’t prosper. Nature Reviews Molecular Cell Biology. 14, 55–61.","short":"B.H. Toyama, M. Hetzer, Nature Reviews Molecular Cell Biology 14 (2013) 55–61.","chicago":"Toyama, Brandon H., and Martin Hetzer. “Protein Homeostasis: Live Long, Won’t Prosper.” <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature, 2013. <a href=\"https://doi.org/10.1038/nrm3496\">https://doi.org/10.1038/nrm3496</a>.","mla":"Toyama, Brandon H., and Martin Hetzer. “Protein Homeostasis: Live Long, Won’t Prosper.” <i>Nature Reviews Molecular Cell Biology</i>, vol. 14, Springer Nature, 2013, pp. 55–61, doi:<a href=\"https://doi.org/10.1038/nrm3496\">10.1038/nrm3496</a>.","apa":"Toyama, B. H., &#38; Hetzer, M. (2013). Protein homeostasis: Live long, won’t prosper. <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nrm3496\">https://doi.org/10.1038/nrm3496</a>"},"author":[{"full_name":"Toyama, Brandon H.","first_name":"Brandon H.","last_name":"Toyama"},{"first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X"}],"extern":"1","quality_controlled":"1"},{"page":"47-60","external_id":{"pmid":["23827674"]},"keyword":["General Biochemistry","Genetics and Molecular Biology"],"date_published":"2013-07-03T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["0092-8674"]},"article_processing_charge":"No","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","day":"03","oa_version":"Published Version","type":"journal_article","date_updated":"2022-07-18T08:45:47Z","doi":"10.1016/j.cell.2013.06.007","language":[{"iso":"eng"}],"volume":154,"issue":"1","article_type":"original","publisher":"Elsevier","intvolume":"       154","status":"public","month":"07","date_created":"2022-04-07T07:50:51Z","quality_controlled":"1","author":[{"full_name":"Hatch, Emily M.","first_name":"Emily M.","last_name":"Hatch"},{"first_name":"Andrew H.","last_name":"Fischer","full_name":"Fischer, Andrew H."},{"last_name":"Deerinck","first_name":"Thomas J.","full_name":"Deerinck, Thomas J."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","last_name":"HETZER","first_name":"Martin W"}],"extern":"1","citation":{"ama":"Hatch EM, Fischer AH, Deerinck TJ, Hetzer M. Catastrophic nuclear envelope collapse in cancer cell micronuclei. <i>Cell</i>. 2013;154(1):47-60. doi:<a href=\"https://doi.org/10.1016/j.cell.2013.06.007\">10.1016/j.cell.2013.06.007</a>","ieee":"E. M. Hatch, A. H. Fischer, T. J. Deerinck, and M. Hetzer, “Catastrophic nuclear envelope collapse in cancer cell micronuclei,” <i>Cell</i>, vol. 154, no. 1. Elsevier, pp. 47–60, 2013.","ista":"Hatch EM, Fischer AH, Deerinck TJ, Hetzer M. 2013. Catastrophic nuclear envelope collapse in cancer cell micronuclei. Cell. 154(1), 47–60.","short":"E.M. Hatch, A.H. Fischer, T.J. Deerinck, M. Hetzer, Cell 154 (2013) 47–60.","chicago":"Hatch, Emily M., Andrew H. Fischer, Thomas J. Deerinck, and Martin Hetzer. “Catastrophic Nuclear Envelope Collapse in Cancer Cell Micronuclei.” <i>Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cell.2013.06.007\">https://doi.org/10.1016/j.cell.2013.06.007</a>.","apa":"Hatch, E. M., Fischer, A. H., Deerinck, T. J., &#38; Hetzer, M. (2013). Catastrophic nuclear envelope collapse in cancer cell micronuclei. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2013.06.007\">https://doi.org/10.1016/j.cell.2013.06.007</a>","mla":"Hatch, Emily M., et al. “Catastrophic Nuclear Envelope Collapse in Cancer Cell Micronuclei.” <i>Cell</i>, vol. 154, no. 1, Elsevier, 2013, pp. 47–60, doi:<a href=\"https://doi.org/10.1016/j.cell.2013.06.007\">10.1016/j.cell.2013.06.007</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2013.06.007"}],"year":"2013","_id":"11085","oa":1,"pmid":1,"publication":"Cell","title":"Catastrophic nuclear envelope collapse in cancer cell micronuclei","abstract":[{"lang":"eng","text":"During mitotic exit, missegregated chromosomes can recruit their own nuclear envelope (NE) to form micronuclei (MN). MN have reduced functioning compared to primary nuclei in the same cell, although the two compartments appear to be structurally comparable. Here we show that over 60% of MN undergo an irreversible loss of compartmentalization during interphase due to NE collapse. This disruption of the MN, which is induced by defects in nuclear lamina assembly, drastically reduces nuclear functions and can trigger massive DNA damage. MN disruption is associated with chromatin compaction and invasion of endoplasmic reticulum (ER) tubules into the chromatin. We identified disrupted MN in both major subtypes of human non-small-cell lung cancer, suggesting that disrupted MN could be a useful objective biomarker for genomic instability in solid tumors. Our study shows that NE collapse is a key event underlying MN dysfunction and establishes a link between aberrant NE organization and aneuploidy."}],"publication_status":"published"},{"status":"public","article_number":"e1003308","month":"02","date_created":"2022-04-07T07:50:59Z","intvolume":"         9","publisher":"Public Library of Science","article_type":"original","issue":"2","volume":9,"abstract":[{"lang":"eng","text":"Faithful execution of developmental gene expression programs occurs at multiple levels and involves many different components such as transcription factors, histone-modification enzymes, and mRNA processing proteins. Recent evidence suggests that nucleoporins, well known components that control nucleo-cytoplasmic trafficking, have wide-ranging functions in developmental gene regulation that potentially extend beyond their role in nuclear transport. Whether the unexpected role of nuclear pore proteins in transcription regulation, which initially has been described in fungi and flies, also applies to human cells is unknown. Here we show at a genome-wide level that the nuclear pore protein NUP98 associates with developmentally regulated genes active during human embryonic stem cell differentiation. Overexpression of a dominant negative fragment of NUP98 levels decreases expression levels of NUP98-bound genes. In addition, we identify two modes of developmental gene regulation by NUP98 that are differentiated by the spatial localization of NUP98 target genes. Genes in the initial stage of developmental induction can associate with NUP98 that is embedded in the nuclear pores at the nuclear periphery. Alternatively, genes that are highly induced can interact with NUP98 in the nuclear interior, away from the nuclear pores. This work demonstrates for the first time that NUP98 dynamically associates with the human genome during differentiation, revealing a role of a nuclear pore protein in regulating developmental gene expression programs."}],"publication_status":"published","_id":"11086","oa":1,"pmid":1,"title":"Dynamic association of NUP98 with the human genome","publication":"PLoS Genetics","year":"2013","quality_controlled":"1","extern":"1","author":[{"first_name":"Yun","last_name":"Liang","full_name":"Liang, Yun"},{"first_name":"Tobias M.","last_name":"Franks","full_name":"Franks, Tobias M."},{"full_name":"Marchetto, Maria C.","last_name":"Marchetto","first_name":"Maria C."},{"last_name":"Gage","first_name":"Fred H.","full_name":"Gage, Fred H."},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER"}],"citation":{"apa":"Liang, Y., Franks, T. M., Marchetto, M. C., Gage, F. H., &#38; Hetzer, M. (2013). Dynamic association of NUP98 with the human genome. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1003308\">https://doi.org/10.1371/journal.pgen.1003308</a>","mla":"Liang, Yun, et al. “Dynamic Association of NUP98 with the Human Genome.” <i>PLoS Genetics</i>, vol. 9, no. 2, e1003308, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1003308\">10.1371/journal.pgen.1003308</a>.","chicago":"Liang, Yun, Tobias M. Franks, Maria C. Marchetto, Fred H. Gage, and Martin Hetzer. “Dynamic Association of NUP98 with the Human Genome.” <i>PLoS Genetics</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pgen.1003308\">https://doi.org/10.1371/journal.pgen.1003308</a>.","short":"Y. Liang, T.M. Franks, M.C. Marchetto, F.H. Gage, M. Hetzer, PLoS Genetics 9 (2013).","ista":"Liang Y, Franks TM, Marchetto MC, Gage FH, Hetzer M. 2013. Dynamic association of NUP98 with the human genome. PLoS Genetics. 9(2), e1003308.","ieee":"Y. Liang, T. M. Franks, M. C. Marchetto, F. H. Gage, and M. Hetzer, “Dynamic association of NUP98 with the human genome,” <i>PLoS Genetics</i>, vol. 9, no. 2. Public Library of Science, 2013.","ama":"Liang Y, Franks TM, Marchetto MC, Gage FH, Hetzer M. Dynamic association of NUP98 with the human genome. <i>PLoS Genetics</i>. 2013;9(2). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1003308\">10.1371/journal.pgen.1003308</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pgen.1003308"}],"scopus_import":"1","publication_identifier":{"issn":["1553-7404"]},"keyword":["Cancer Research","Genetics (clinical)","Genetics","Molecular Biology","Ecology","Evolution","Behavior and Systematics"],"external_id":{"pmid":["23468646"]},"date_published":"2013-02-28T00:00:00Z","doi":"10.1371/journal.pgen.1003308","language":[{"iso":"eng"}],"day":"28","oa_version":"Published Version","type":"journal_article","date_updated":"2022-07-18T08:45:58Z","article_processing_charge":"No","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd"},{"intvolume":"       154","status":"public","month":"08","date_created":"2022-04-07T07:51:08Z","volume":154,"issue":"5","article_type":"original","publisher":"Elsevier","_id":"11087","oa":1,"pmid":1,"title":"Identification of long-lived proteins reveals exceptional stability of essential cellular structures","publication":"Cell","abstract":[{"lang":"eng","text":"Intracellular proteins with long lifespans have recently been linked to age-dependent defects, ranging from decreased fertility to the functional decline of neurons. Why long-lived proteins exist in metabolically active cellular environments and how they are maintained over time remains poorly understood. Here, we provide a system-wide identification of proteins with exceptional lifespans in the rat brain. These proteins are inefficiently replenished despite being translated robustly throughout adulthood. Using nucleoporins as a paradigm for long-term protein persistence, we found that nuclear pore complexes (NPCs) are maintained over a cell’s life through slow but finite exchange of even its most stable subcomplexes. This maintenance is limited, however, as some nucleoporin levels decrease during aging, providing a rationale for the previously observed age-dependent deterioration of NPC function. Our identification of a long-lived proteome reveals cellular components that are at increased risk for damage accumulation, linking long-term protein persistence to the cellular aging process."}],"publication_status":"published","quality_controlled":"1","extern":"1","author":[{"full_name":"Toyama, Brandon H.","last_name":"Toyama","first_name":"Brandon H."},{"full_name":"Savas, Jeffrey N.","last_name":"Savas","first_name":"Jeffrey N."},{"first_name":"Sung Kyu","last_name":"Park","full_name":"Park, Sung Kyu"},{"full_name":"Harris, Michael S.","first_name":"Michael S.","last_name":"Harris"},{"first_name":"Nicholas T.","last_name":"Ingolia","full_name":"Ingolia, Nicholas T."},{"full_name":"Yates, John R.","first_name":"John R.","last_name":"Yates"},{"last_name":"HETZER","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.cell.2013.07.037","open_access":"1"}],"citation":{"mla":"Toyama, Brandon H., et al. “Identification of Long-Lived Proteins Reveals Exceptional Stability of Essential Cellular Structures.” <i>Cell</i>, vol. 154, no. 5, Elsevier, 2013, pp. 971–82, doi:<a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">10.1016/j.cell.2013.07.037</a>.","apa":"Toyama, B. H., Savas, J. N., Park, S. K., Harris, M. S., Ingolia, N. T., Yates, J. R., &#38; Hetzer, M. (2013). Identification of long-lived proteins reveals exceptional stability of essential cellular structures. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">https://doi.org/10.1016/j.cell.2013.07.037</a>","ieee":"B. H. Toyama <i>et al.</i>, “Identification of long-lived proteins reveals exceptional stability of essential cellular structures,” <i>Cell</i>, vol. 154, no. 5. Elsevier, pp. 971–982, 2013.","ama":"Toyama BH, Savas JN, Park SK, et al. Identification of long-lived proteins reveals exceptional stability of essential cellular structures. <i>Cell</i>. 2013;154(5):971-982. doi:<a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">10.1016/j.cell.2013.07.037</a>","ista":"Toyama BH, Savas JN, Park SK, Harris MS, Ingolia NT, Yates JR, Hetzer M. 2013. Identification of long-lived proteins reveals exceptional stability of essential cellular structures. Cell. 154(5), 971–982.","short":"B.H. Toyama, J.N. Savas, S.K. Park, M.S. Harris, N.T. Ingolia, J.R. Yates, M. Hetzer, Cell 154 (2013) 971–982.","chicago":"Toyama, Brandon H., Jeffrey N. Savas, Sung Kyu Park, Michael S. Harris, Nicholas T. Ingolia, John R. Yates, and Martin Hetzer. “Identification of Long-Lived Proteins Reveals Exceptional Stability of Essential Cellular Structures.” <i>Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">https://doi.org/10.1016/j.cell.2013.07.037</a>."},"year":"2013","scopus_import":"1","publication_identifier":{"issn":["0092-8674"]},"page":"971-982","keyword":["General Biochemistry","Genetics and Molecular Biology"],"external_id":{"pmid":["23993091"]},"date_published":"2013-08-29T00:00:00Z","doi":"10.1016/j.cell.2013.07.037","language":[{"iso":"eng"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","article_processing_charge":"No","day":"29","oa_version":"Published Version","date_updated":"2022-07-18T08:50:47Z","type":"journal_article"},{"doi":"10.1016/j.bpj.2013.01.049","language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2022-07-18T08:51:01Z","type":"journal_article","day":"16","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","article_processing_charge":"No","scopus_import":"1","publication_identifier":{"issn":["0006-3495"]},"external_id":{"pmid":["23601312"]},"keyword":["Biophysics"],"date_published":"2013-04-16T00:00:00Z","page":"1652-1660","abstract":[{"lang":"eng","text":"The crowded intracellular environment poses a formidable challenge to experimental and theoretical analyses of intracellular transport mechanisms. Our measurements of single-particle trajectories in cytoplasm and their random-walk interpretations elucidate two of these mechanisms: molecular diffusion in crowded environments and cytoskeletal transport along microtubules. We employed acousto-optic deflector microscopy to map out the three-dimensional trajectories of microspheres migrating in the cytosolic fraction of a cellular extract. Classical Brownian motion (BM), continuous time random walk, and fractional BM were alternatively used to represent these trajectories. The comparison of the experimental and numerical data demonstrates that cytoskeletal transport along microtubules and diffusion in the cytosolic fraction exhibit anomalous (nonFickian) behavior and posses statistically distinct signatures. Among the three random-walk models used, continuous time random walk provides the best representation of diffusion, whereas microtubular transport is accurately modeled with fractional BM."}],"publication_status":"published","pmid":1,"publication":"Biophysical Journal","title":"Anomalous diffusion of single particles in cytoplasm","_id":"11088","oa":1,"year":"2013","main_file_link":[{"url":"https://doi.org/10.1016/j.bpj.2013.01.049","open_access":"1"}],"citation":{"short":"B.M. Regner, D. Vučinić, C. Domnisoru, T.M. Bartol, M. Hetzer, D.M. Tartakovsky, T.J. Sejnowski, Biophysical Journal 104 (2013) 1652–1660.","chicago":"Regner, Benjamin M., Dejan Vučinić, Cristina Domnisoru, Thomas M. Bartol, Martin Hetzer, Daniel M. Tartakovsky, and Terrence J. Sejnowski. “Anomalous Diffusion of Single Particles in Cytoplasm.” <i>Biophysical Journal</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.bpj.2013.01.049\">https://doi.org/10.1016/j.bpj.2013.01.049</a>.","ista":"Regner BM, Vučinić D, Domnisoru C, Bartol TM, Hetzer M, Tartakovsky DM, Sejnowski TJ. 2013. Anomalous diffusion of single particles in cytoplasm. Biophysical Journal. 104(8), 1652–1660.","ieee":"B. M. Regner <i>et al.</i>, “Anomalous diffusion of single particles in cytoplasm,” <i>Biophysical Journal</i>, vol. 104, no. 8. Elsevier, pp. 1652–1660, 2013.","ama":"Regner BM, Vučinić D, Domnisoru C, et al. Anomalous diffusion of single particles in cytoplasm. <i>Biophysical Journal</i>. 2013;104(8):1652-1660. doi:<a href=\"https://doi.org/10.1016/j.bpj.2013.01.049\">10.1016/j.bpj.2013.01.049</a>","apa":"Regner, B. M., Vučinić, D., Domnisoru, C., Bartol, T. M., Hetzer, M., Tartakovsky, D. M., &#38; Sejnowski, T. J. (2013). Anomalous diffusion of single particles in cytoplasm. <i>Biophysical Journal</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bpj.2013.01.049\">https://doi.org/10.1016/j.bpj.2013.01.049</a>","mla":"Regner, Benjamin M., et al. “Anomalous Diffusion of Single Particles in Cytoplasm.” <i>Biophysical Journal</i>, vol. 104, no. 8, Elsevier, 2013, pp. 1652–60, doi:<a href=\"https://doi.org/10.1016/j.bpj.2013.01.049\">10.1016/j.bpj.2013.01.049</a>."},"quality_controlled":"1","author":[{"full_name":"Regner, Benjamin M.","last_name":"Regner","first_name":"Benjamin M."},{"first_name":"Dejan","last_name":"Vučinić","full_name":"Vučinić, Dejan"},{"full_name":"Domnisoru, Cristina","first_name":"Cristina","last_name":"Domnisoru"},{"last_name":"Bartol","first_name":"Thomas M.","full_name":"Bartol, Thomas M."},{"first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"},{"full_name":"Tartakovsky, Daniel M.","first_name":"Daniel M.","last_name":"Tartakovsky"},{"full_name":"Sejnowski, Terrence J.","last_name":"Sejnowski","first_name":"Terrence J."}],"extern":"1","month":"04","date_created":"2022-04-07T07:51:26Z","status":"public","intvolume":"       104","article_type":"original","publisher":"Elsevier","volume":104,"issue":"8"},{"_id":"115","language":[{"iso":"eng"}],"doi":"10.1063/1.4789496","publication":"Review of Scientific Instruments","title":"In situ granular charge measurement by free-fall videography","abstract":[{"lang":"eng","text":"We present the design and performance characterization of a new experimental technique for measuring individual particle charges in large ensembles of macroscopic grains. The measurement principle is qualitatively similar to that used in determining the elementary charge by Millikan in that it follows individual particle trajectories. However, by taking advantage of new technology we are able to work with macroscopic grains and achieve several orders of magnitude better resolution in charge to mass ratios. By observing freely falling grains accelerated in a horizontal electric field with a co-falling, high-speed video camera, we dramatically increase particle tracking time and measurement precision. Keeping the granular medium under vacuum, we eliminate air drag, leaving the electrostatic force as the primary source of particle accelerations in the co-moving frame. Because the technique is based on direct imaging, we can distinguish between different particle types during the experiment, opening up the possibility of studying charge transfer processes between different particle species. For the ∼300 μm diameter grains reported here, we achieve an average acceleration resolution of ∼0.008 m/s2, a force resolution of ∼500 pN, and a median charge resolution ∼6× 104 elementary charges per grain (corresponding to surface charge densities ∼1 elementary charges per μm2). The primary source of error is indeterminacy in the grain mass, but with higher resolution cameras and better optics this can be further improved. The high degree of resolution and the ability to visually identify particles of different species or sizes with direct imaging make this a powerful new tool to characterize charging processes in granular media."}],"publication_status":"published","acknowledgement":"This work was supported financially by the National Science Foundation (NSF) through its Materials Research Science and Engineering Center (MRSEC) program (DMR-0820054) and by the US Army Research Office through Grant No. W911NF-12-1-0182. S.R.W. acknowledges support from a University of Chicago Millikan Fellowship.","author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","first_name":"Scott R"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Waitukaitis, Scott R., and Heinrich Jaeger. “In Situ Granular Charge Measurement by Free-Fall Videography.” <i>Review of Scientific Instruments</i>, vol. 84, no. 2, 025104, AIP, 2013, doi:<a href=\"https://doi.org/10.1063/1.4789496\">10.1063/1.4789496</a>.","apa":"Waitukaitis, S. R., &#38; Jaeger, H. (2013). In situ granular charge measurement by free-fall videography. <i>Review of Scientific Instruments</i>. AIP. <a href=\"https://doi.org/10.1063/1.4789496\">https://doi.org/10.1063/1.4789496</a>","ieee":"S. R. Waitukaitis and H. Jaeger, “In situ granular charge measurement by free-fall videography,” <i>Review of Scientific Instruments</i>, vol. 84, no. 2. AIP, 2013.","ama":"Waitukaitis SR, Jaeger H. In situ granular charge measurement by free-fall videography. <i>Review of Scientific Instruments</i>. 2013;84(2). doi:<a href=\"https://doi.org/10.1063/1.4789496\">10.1063/1.4789496</a>","ista":"Waitukaitis SR, Jaeger H. 2013. In situ granular charge measurement by free-fall videography. Review of Scientific Instruments. 84(2), 025104.","chicago":"Waitukaitis, Scott R, and Heinrich Jaeger. “In Situ Granular Charge Measurement by Free-Fall Videography.” <i>Review of Scientific Instruments</i>. AIP, 2013. <a href=\"https://doi.org/10.1063/1.4789496\">https://doi.org/10.1063/1.4789496</a>.","short":"S.R. Waitukaitis, H. Jaeger, Review of Scientific Instruments 84 (2013)."},"year":"2013","day":"07","oa_version":"None","date_updated":"2021-01-12T06:48:39Z","type":"journal_article","publist_id":"7939","intvolume":"        84","status":"public","article_number":"025104","month":"02","date_created":"2018-12-11T11:44:42Z","volume":84,"issue":"2","date_published":"2013-02-07T00:00:00Z","publisher":"AIP"},{"arxiv":1,"scopus_import":"1","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution – galaxies","high-redshift – galaxies","starburst"],"external_id":{"arxiv":["1310.3822"]},"date_published":"2013-12-03T00:00:00Z","acknowledgement":"We thank the referee for many helpful comments and suggestions which greatly improved the clarity and quality of this work. D.S. acknowledges financial support from the Netherlands Organisation for Scientific research (NWO) through a Veni fellowship and also funding from the European Community Seventh Framework Programme (FP7/2007-2013) under grant agreement number RG226604 (OPTICON) which allowed access to CFHT time (proposals: 11BO29 & 12AO19). A.M.S. gratefully acknowledges an STFC Advanced Fellowship through grant number ST/H005234/1. I.R.S., J.P.S., and R.G.B. acknowledge support from the UK Science and Technology Facilities Council (STFC) under ST/I001573/1. I.R.S. acknowledges STFC (ST/J001422/1), the ERC Advanced Investigator program DUSTYGAL and a Royal Society/Wolfson Merit Award. P.N.B. acknowledges support from STFC. R.M.S. acknowledges support from the grant ST/1001573/1. The data presented here are based on observations with the KMOS spectrograph on the ESO/VLT under program 60.A-9460 and can be accessed through the ESO data archive. The authors also wish to acknowledge the help from Michael Hilker in preparing the KMOS observations.","doi":"10.1088/0004-637x/779/2/139","language":[{"iso":"eng"}],"oa_version":"Preprint","date_updated":"2022-08-18T10:43:07Z","type":"journal_article","day":"03","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","date_created":"2022-07-07T09:14:48Z","status":"public","article_number":"139","intvolume":"       779","publisher":"IOP Publishing","article_type":"original","issue":"2","volume":779,"abstract":[{"lang":"eng","text":"We present the spatially resolved Hα dynamics of 16 star-forming galaxies at z ∼ 0.81 using the new KMOS multi-object integral field spectrograph on the ESO Very Large Telescope. These galaxies, selected using 1.18 μm narrowband imaging from the 10 deg2 CFHT-HiZELS survey of the SA 22 hr field, are found in a ∼4 Mpc overdensity of Hα emitters and likely reside in a group/intermediate environment, but not a cluster. We confirm and identify a rich group of star-forming galaxies at z = 0.813 ± 0.003, with 13 galaxies within 1000 km s−1 of each other, and seven within a diameter of 3 Mpc. All of our galaxies are “typical” star-forming galaxies at their redshift, 0.8 ± 0.4 SFR$^*_{z = 0.8}$, spanning a range of specific star formation rates (sSFRs) of 0.2–1.1 Gyr−1 and have a median metallicity very close to solar of 12 + log(O/H) = 8.62 ± 0.06. We measure the spatially resolved Hα dynamics of the galaxies in our sample and show that 13 out of 16 galaxies can be described by rotating disks and use the data to derive inclination corrected rotation speeds of 50–275 km s−1. The fraction of disks within our sample is 75% ± 8%, consistent with previous results based on Hubble Space Telescope morphologies of Hα-selected galaxies at z ∼ 1 and confirming that disks dominate the SFR density at z ∼ 1. Our Hα galaxies are well fitted by the z ∼ 1–2 Tully–Fisher (TF) relation, confirming the evolution seen in the zero point. Apart from having, on average, higher stellar masses and lower sSFRs, our group galaxies at z = 0.81 present the same mass–metallicity and TF relation as z ∼ 1 field galaxies and are all disk galaxies."}],"publication_status":"published","title":"The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS","publication":"The Astrophysical Journal","_id":"11520","oa":1,"year":"2013","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3822"}],"citation":{"short":"D. Sobral, A.M. Swinbank, J.P. Stott, J.J. Matthee, R.G. Bower, I. Smail, P. Best, J.E. Geach, R.M. Sharples, The Astrophysical Journal 779 (2013).","chicago":"Sobral, D., A. M. Swinbank, J. P. Stott, Jorryt J Matthee, R. G. Bower, Ian Smail, P. Best, J. E. Geach, and R. M. Sharples. “The Dynamics of Z=0.8 H-Alpha-Selected Star-Forming Galaxies from KMOS/CF-HiZELS.” <i>The Astrophysical Journal</i>. IOP Publishing, 2013. <a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">https://doi.org/10.1088/0004-637x/779/2/139</a>.","ista":"Sobral D, Swinbank AM, Stott JP, Matthee JJ, Bower RG, Smail I, Best P, Geach JE, Sharples RM. 2013. The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. The Astrophysical Journal. 779(2), 139.","ieee":"D. Sobral <i>et al.</i>, “The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS,” <i>The Astrophysical Journal</i>, vol. 779, no. 2. IOP Publishing, 2013.","ama":"Sobral D, Swinbank AM, Stott JP, et al. The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. <i>The Astrophysical Journal</i>. 2013;779(2). doi:<a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">10.1088/0004-637x/779/2/139</a>","mla":"Sobral, D., et al. “The Dynamics of Z=0.8 H-Alpha-Selected Star-Forming Galaxies from KMOS/CF-HiZELS.” <i>The Astrophysical Journal</i>, vol. 779, no. 2, 139, IOP Publishing, 2013, doi:<a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">10.1088/0004-637x/779/2/139</a>.","apa":"Sobral, D., Swinbank, A. M., Stott, J. P., Matthee, J. J., Bower, R. G., Smail, I., … Sharples, R. M. (2013). The dynamics of z=0.8 H-alpha-selected star-forming galaxies from KMOS/CF-HiZELS. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/0004-637x/779/2/139\">https://doi.org/10.1088/0004-637x/779/2/139</a>"},"quality_controlled":"1","author":[{"full_name":"Sobral, D.","first_name":"D.","last_name":"Sobral"},{"full_name":"Swinbank, A. M.","last_name":"Swinbank","first_name":"A. M."},{"first_name":"J. P.","last_name":"Stott","full_name":"Stott, J. P."},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J"},{"first_name":"R. G.","last_name":"Bower","full_name":"Bower, R. G."},{"last_name":"Smail","first_name":"Ian","full_name":"Smail, Ian"},{"last_name":"Best","first_name":"P.","full_name":"Best, P."},{"full_name":"Geach, J. E.","last_name":"Geach","first_name":"J. E."},{"first_name":"R. M.","last_name":"Sharples","full_name":"Sharples, R. M."}],"extern":"1"},{"citation":{"apa":"Waitukaitis, S. R., Roth, L., Vitelli, V., &#38; Jaeger, H. (2013). Dynamic jamming fronts. <i>EPL</i>. Elsevier. <a href=\"https://doi.org/10.1209/0295-5075/102/44001\">https://doi.org/10.1209/0295-5075/102/44001</a>","mla":"Waitukaitis, Scott R., et al. “Dynamic Jamming Fronts.” <i>EPL</i>, vol. 102, no. 4, 44001, Elsevier, 2013, doi:<a href=\"https://doi.org/10.1209/0295-5075/102/44001\">10.1209/0295-5075/102/44001</a>.","chicago":"Waitukaitis, Scott R, Leah Roth, Vincenzo Vitelli, and Heinrich Jaeger. “Dynamic Jamming Fronts.” <i>EPL</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1209/0295-5075/102/44001\">https://doi.org/10.1209/0295-5075/102/44001</a>.","short":"S.R. Waitukaitis, L. Roth, V. Vitelli, H. Jaeger, EPL 102 (2013).","ista":"Waitukaitis SR, Roth L, Vitelli V, Jaeger H. 2013. Dynamic jamming fronts. EPL. 102(4), 44001.","ama":"Waitukaitis SR, Roth L, Vitelli V, Jaeger H. Dynamic jamming fronts. <i>EPL</i>. 2013;102(4). doi:<a href=\"https://doi.org/10.1209/0295-5075/102/44001\">10.1209/0295-5075/102/44001</a>","ieee":"S. R. Waitukaitis, L. Roth, V. Vitelli, and H. Jaeger, “Dynamic jamming fronts,” <i>EPL</i>, vol. 102, no. 4. Elsevier, 2013."},"quality_controlled":"1","author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis"},{"full_name":"Roth, Leah","last_name":"Roth","first_name":"Leah"},{"first_name":"Vincenzo","last_name":"Vitelli","full_name":"Vitelli, Vincenzo"},{"full_name":"Jaeger, Heinrich","first_name":"Heinrich","last_name":"Jaeger"}],"extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","type":"journal_article","date_updated":"2021-01-12T06:48:44Z","year":"2013","day":"24","title":"Dynamic jamming fronts","publication":"EPL","_id":"116","language":[{"iso":"eng"}],"doi":"10.1209/0295-5075/102/44001","acknowledgement":"This work was supported by the National Science Foundation (NSF) through its Materials Research Science and Engineering program (DMR-0820054). SRW was supported by the U.S. Department of Energy, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering under Award DE-FG02-03ER46088. LKR acknowledges support through the NSF Research Experience for Undergraduates program.","abstract":[{"lang":"eng","text":"We describe a model experiment for dynamic jamming: a two-dimensional collection of initially unjammed disks that are forced into the jammed state by uniaxial compression via a rake. This leads to a stable densification front that travels ahead of the rake, leaving regions behind it jammed. Using disk conservation in conjunction with an upper limit to the packing fraction at jamming onset, we predict the front speed as a function of packing fraction and rake speed. However, we find that the jamming front has a finite width, a feature that cannot be explained by disk conservation alone. This width appears to diverge on approach to jamming, which suggests that it may be related to growing lengthscales encountered in other jamming studies."}],"publication_status":"published","date_published":"2013-05-24T00:00:00Z","issue":"4","volume":102,"publisher":"Elsevier","intvolume":"       102","publist_id":"7938","month":"05","date_created":"2018-12-11T11:44:43Z","article_number":"44001","status":"public"},{"oa_version":"None","type":"journal_article","date_updated":"2022-09-12T08:51:57Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1145/2435215.2435218","keyword":["Computer Networks and Communications"],"date_published":"2013-03-01T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["1559-114X"],"issn":["1559-1131"]},"year":"2013","citation":{"apa":"Baykan, E., Weber, I., &#38; Henzinger, M. H. (2013). A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>","mla":"Baykan, Eda, et al. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>, vol. 7, no. 1, 3, Association for Computing Machinery, 2013, doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>.","ieee":"E. Baykan, I. Weber, and M. H. Henzinger, “A comprehensive study of techniques for URL-based web page language classification,” <i>ACM Transactions on the Web</i>, vol. 7, no. 1. Association for Computing Machinery, 2013.","ama":"Baykan E, Weber I, Henzinger MH. A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. 2013;7(1). doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>","short":"E. Baykan, I. Weber, M.H. Henzinger, ACM Transactions on the Web 7 (2013).","chicago":"Baykan, Eda, Ingmar Weber, and Monika H Henzinger. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2013. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>.","ista":"Baykan E, Weber I, Henzinger MH. 2013. A comprehensive study of techniques for URL-based web page language classification. ACM Transactions on the Web. 7(1), 3."},"quality_controlled":"1","extern":"1","author":[{"full_name":"Baykan, Eda","first_name":"Eda","last_name":"Baykan"},{"first_name":"Ingmar","last_name":"Weber","full_name":"Weber, Ingmar"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"}],"abstract":[{"text":"Given only the URL of a Web page, can we identify its language? In this article we examine this question. URL-based language classification is useful when the content of the Web page is not available or downloading the content is a waste of bandwidth and time.\r\nWe built URL-based language classifiers for English, German, French, Spanish, and Italian by applying a variety of algorithms and features. As algorithms we used machine learning algorithms which are widely applied for text classification and state-of-art algorithms for language identification of text. As features we used words, various sized n-grams, and custom-made features (our novel feature set). We compared our approaches with two baseline methods, namely classification by country code top-level domains and classification by IP addresses of the hosting Web servers.\r\n\r\nWe trained and tested our classifiers in a 10-fold cross-validation setup on a dataset obtained from the Open Directory Project and from querying a commercial search engine. We obtained the lowest F1-measure for English (94) and the highest F1-measure for German (98) with the best performing classifiers.\r\n\r\nWe also evaluated the performance of our methods: (i) on a set of Web pages written in Adobe Flash and (ii) as part of a language-focused crawler. In the first case, the content of the Web page is hard to extract and in the second page downloading pages of the “wrong” language constitutes a waste of bandwidth. In both settings the best classifiers have a high accuracy with an F1-measure between 95 (for English) and 98 (for Italian) for the Adobe Flash pages and a precision between 90 (for Italian) and 97 (for French) for the language-focused crawler.","lang":"eng"}],"publication_status":"published","publication":"ACM Transactions on the Web","title":"A comprehensive study of techniques for URL-based web page language classification","_id":"11671","publisher":"Association for Computing Machinery","article_type":"original","volume":7,"issue":"1","month":"03","date_created":"2022-07-27T12:50:18Z","article_number":"3","status":"public","intvolume":"         7"},{"quality_controlled":"1","author":[{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"},{"last_name":"Miskin","first_name":"Marc","full_name":"Miskin, Marc"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","first_name":"Scott R"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"short":"H. Jaeger, M. Miskin, S.R. Waitukaitis, in:,  AIP Conference Proceedings, AIP, 2013, pp. 3–6.","chicago":"Jaeger, Heinrich, Marc Miskin, and Scott R Waitukaitis. “From Nanoscale Cohesion to Macroscale Entanglement: Opportunities for Designing Granular Aggregate Behaviour by Tailoring Grain Shape and Interactions.” In <i> AIP Conference Proceedings</i>, 1542:3–6. AIP, 2013. <a href=\"https://doi.org/10.1063/1.4811858\">https://doi.org/10.1063/1.4811858</a>.","ista":"Jaeger H, Miskin M, Waitukaitis SR. 2013. From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions.  AIP Conference Proceedings. Powders and Grains vol. 1542, 3–6.","ama":"Jaeger H, Miskin M, Waitukaitis SR. From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions. In: <i> AIP Conference Proceedings</i>. Vol 1542. AIP; 2013:3-6. doi:<a href=\"https://doi.org/10.1063/1.4811858\">10.1063/1.4811858</a>","ieee":"H. Jaeger, M. Miskin, and S. R. Waitukaitis, “From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions,” in <i> AIP Conference Proceedings</i>, Sydney, Australia, 2013, vol. 1542, pp. 3–6.","mla":"Jaeger, Heinrich, et al. “From Nanoscale Cohesion to Macroscale Entanglement: Opportunities for Designing Granular Aggregate Behaviour by Tailoring Grain Shape and Interactions.” <i> AIP Conference Proceedings</i>, vol. 1542, AIP, 2013, pp. 3–6, doi:<a href=\"https://doi.org/10.1063/1.4811858\">10.1063/1.4811858</a>.","apa":"Jaeger, H., Miskin, M., &#38; Waitukaitis, S. R. (2013). From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions. In <i> AIP Conference Proceedings</i> (Vol. 1542, pp. 3–6). Sydney, Australia: AIP. <a href=\"https://doi.org/10.1063/1.4811858\">https://doi.org/10.1063/1.4811858</a>"},"day":"01","year":"2013","type":"conference","date_updated":"2021-01-12T06:48:49Z","oa_version":"None","language":[{"iso":"eng"}],"doi":"10.1063/1.4811858","_id":"117","publication":" AIP Conference Proceedings","title":"From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions","publication_status":"published","abstract":[{"lang":"eng","text":"The packing arrangement of individual particles inside a granular material and the resulting response to applied stresses depend critically on particle-particle interactions. One aspect that recently received attention are nanoscale surface features of particles, which play an important role in determining the strength of cohesive van der Waals and capillary interactions and also affect tribo-charging of grains. We describe experiments on freely falling granular streams that can detect the contributions from all three of these forces. We show that it is possible to measure the charge of individual grains and build up distributions that are detailed enough to provide stringent tests of tribo-charging models currently available. A second aspect concerns particle shape. In this case steric interactions become important and new types of aggregate behavior can be expected when non-convex particle shapes are considered that can interlock or entangle. However, a general connection between the mechanical response of a granular material and the constituents\\' shape remains unknown. This has made it infeasible to tackle the &quot;inverse packing problem&quot;, namely to start from a given, desired behavior for the aggregate as a whole and then find the particle shape the produces it. We discuss a new approach, using concepts rooted in artificial evolution that provides a way to solve this inverse problem. This approach facilitates exploring the role of arbitrary particle geometry in jammed systems and invites the discovery and design of granular matter with optimized properties."}],"acknowledgement":"This work was supported by the NSF MRSEC program under DMR-0820054. Additional support came from the US Army Research Office through W911NF-12-1-0182.","page":"3 - 6","volume":1542,"date_published":"2013-06-01T00:00:00Z","publisher":"AIP","publist_id":"7937","intvolume":"      1542","status":"public","date_created":"2018-12-11T11:44:43Z","conference":{"name":"Powders and Grains","end_date":"2013-07-12","start_date":"2013-07-08","location":"Sydney, Australia"},"month":"06"},{"publication_status":"published","publication":"Information and Computation","title":"38th International Colloquium on Automata, Languages and Programming","_id":"11758","language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2012.11.002","oa_version":"None","date_updated":"2023-02-23T10:09:19Z","type":"journal_article","year":"2013","day":"01","citation":{"ama":"Aceto L, Henzinger MH, Sgall J. 38th International Colloquium on Automata, Languages and Programming. <i>Information and Computation</i>. 2013;222(1):1. doi:<a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">10.1016/j.ic.2012.11.002</a>","ieee":"L. Aceto, M. H. Henzinger, and J. Sgall, “38th International Colloquium on Automata, Languages and Programming,” <i>Information and Computation</i>, vol. 222, no. 1. Elsevier, p. 1, 2013.","ista":"Aceto L, Henzinger MH, Sgall J. 2013. 38th International Colloquium on Automata, Languages and Programming. Information and Computation. 222(1), 1.","short":"L. Aceto, M.H. Henzinger, J. Sgall, Information and Computation 222 (2013) 1.","chicago":"Aceto, Luca, Monika H Henzinger, and Jiří Sgall. “38th International Colloquium on Automata, Languages and Programming.” <i>Information and Computation</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">https://doi.org/10.1016/j.ic.2012.11.002</a>.","mla":"Aceto, Luca, et al. “38th International Colloquium on Automata, Languages and Programming.” <i>Information and Computation</i>, vol. 222, no. 1, Elsevier, 2013, p. 1, doi:<a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">10.1016/j.ic.2012.11.002</a>.","apa":"Aceto, L., Henzinger, M. H., &#38; Sgall, J. (2013). 38th International Colloquium on Automata, Languages and Programming. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">https://doi.org/10.1016/j.ic.2012.11.002</a>"},"author":[{"last_name":"Aceto","first_name":"Luca","full_name":"Aceto, Luca"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Sgall, Jiří","last_name":"Sgall","first_name":"Jiří"}],"quality_controlled":"1","article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","date_created":"2022-08-08T11:25:34Z","status":"public","intvolume":"       222","scopus_import":"1","publication_identifier":{"issn":["0890-5401"]},"article_type":"letter_note","publisher":"Elsevier","date_published":"2013-01-01T00:00:00Z","issue":"1","volume":222,"page":"1"},{"volume":113,"issue":"3","publisher":"Elsevier","article_type":"original","intvolume":"       113","status":"public","date_created":"2022-08-08T11:29:08Z","month":"02","author":[{"last_name":"Dütting","first_name":"Paul","full_name":"Dütting, Paul"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"}],"extern":"1","quality_controlled":"1","citation":{"apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2013). Sponsored search, market equilibria, and the Hungarian Method. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">https://doi.org/10.1016/j.ipl.2012.11.006</a>","mla":"Dütting, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian Method.” <i>Information Processing Letters</i>, vol. 113, no. 3, Elsevier, 2013, pp. 67–73, doi:<a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">10.1016/j.ipl.2012.11.006</a>.","ista":"Dütting P, Henzinger MH, Weber I. 2013. Sponsored search, market equilibria, and the Hungarian Method. Information Processing Letters. 113(3), 67–73.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Sponsored Search, Market Equilibria, and the Hungarian Method.” <i>Information Processing Letters</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">https://doi.org/10.1016/j.ipl.2012.11.006</a>.","short":"P. Dütting, M.H. Henzinger, I. Weber, Information Processing Letters 113 (2013) 67–73.","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” <i>Information Processing Letters</i>, vol. 113, no. 3. Elsevier, pp. 67–73, 2013.","ama":"Dütting P, Henzinger MH, Weber I. Sponsored search, market equilibria, and the Hungarian Method. <i>Information Processing Letters</i>. 2013;113(3):67-73. doi:<a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">10.1016/j.ipl.2012.11.006</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/0912.1934","open_access":"1"}],"year":"2013","oa":1,"_id":"11759","publication":"Information Processing Letters","title":"Sponsored search, market equilibria, and the Hungarian Method","publication_status":"published","abstract":[{"lang":"eng","text":"Matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market. Here, as in other markets of that kind, market equilibria correspond to feasible, envy free, and bidder optimal outcomes. For settings without budgets such an outcome always exists and can be computed in polynomial-time by the so-called Hungarian Method. Moreover, every mechanism that computes such an outcome is incentive compatible. We show that the Hungarian Method can be modified so that it finds a feasible, envy free, and bidder optimal outcome for settings with budgets. We also show that in settings with budgets no mechanism that computes such an outcome can be incentive compatible for all inputs. For inputs in general position, however, the presented mechanism—as any other mechanism that computes such an outcome for settings with budgets—is incentive compatible."}],"page":"67-73","date_published":"2013-02-15T00:00:00Z","external_id":{"arxiv":["0912.1934"]},"publication_identifier":{"issn":["0020-0190"]},"scopus_import":"1","arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","date_updated":"2022-09-12T09:36:15Z","type":"journal_article","oa_version":"Preprint","language":[{"iso":"eng"}],"doi":"10.1016/j.ipl.2012.11.006"},{"day":"01","date_updated":"2023-02-13T11:20:42Z","type":"conference","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-45046-4_13","page":"146–159","date_published":"2013-12-01T00:00:00Z","external_id":{"arxiv":["1310.3153"]},"arxiv":1,"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642450457"]},"scopus_import":"1","alternative_title":["LNCS"],"year":"2013","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"extern":"1","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1310.3153","open_access":"1"}],"citation":{"mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>9th International Conference on Web and Internet Economics</i>, vol. 8289, Springer Nature, 2013, pp. 146–159, doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Starnberger, M. (2013). Valuation compressions in VCG-based combinatorial auctions. In <i>9th International Conference on Web and Internet Economics</i> (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in <i>9th International Conference on Web and Internet Economics</i>, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.","ama":"Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. In: <i>9th International Conference on Web and Internet Economics</i>. Vol 8289. Springer Nature; 2013:146–159. doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>","ista":"Dütting P, Henzinger MH, Starnberger M. 2013. Valuation compressions in VCG-based combinatorial auctions. 9th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8289, 146–159.","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” In <i>9th International Conference on Web and Internet Economics</i>, 8289:146–159. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, in:, 9th International Conference on Web and Internet Economics, Springer Nature, 2013, pp. 146–159."},"publication_status":"published","abstract":[{"lang":"eng","text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes."}],"oa":1,"_id":"11791","title":"Valuation compressions in VCG-based combinatorial auctions","publication":"9th International Conference on Web and Internet Economics","publisher":"Springer Nature","volume":8289,"status":"public","date_created":"2022-08-11T11:05:14Z","month":"12","conference":{"location":"Cambridge, MA, USA","start_date":"2013-12-01","end_date":"2013-12-14","name":"WINE: International Conference on Web and Internet Economics"},"intvolume":"      8289"},{"volume":8125,"publisher":"Springer Nature","intvolume":"      8125","status":"public","month":"09","conference":{"start_date":"2013-09-02","location":"Sophia Antipolis, France","name":"ESA: European Symposium on Algorithms","end_date":"2013-09-04"},"date_created":"2022-08-11T11:18:19Z","quality_controlled":"1","author":[{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Williamson","first_name":"David P.","full_name":"Williamson, David P."}],"extern":"1","citation":{"chicago":"Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” In <i>21st Annual European Symposium on Algorithms</i>, 8125:409–20. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>.","short":"W. Dvořák, M.H. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium on Algorithms, Springer Nature, 2013, pp. 409–420.","ista":"Dvořák W, Henzinger MH, Williamson DP. 2013. Maximizing a submodular function with viability constraints. 21st Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 8125, 409–420.","ama":"Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. In: <i>21st Annual European Symposium on Algorithms</i>. Vol 8125. Springer Nature; 2013:409-420. doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>","ieee":"W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in <i>21st Annual European Symposium on Algorithms</i>, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.","mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” <i>21st Annual European Symposium on Algorithms</i>, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>.","apa":"Dvořák, W., Henzinger, M. H., &#38; Williamson, D. P. (2013). Maximizing a submodular function with viability constraints. In <i>21st Annual European Symposium on Algorithms</i> (Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>"},"main_file_link":[{"url":"https://arxiv.org/abs/1611.05753","open_access":"1"}],"year":"2013","_id":"11792","oa":1,"related_material":{"record":[{"status":"public","relation":"later_version","id":"11792"}]},"title":"Maximizing a submodular function with viability constraints","publication":"21st Annual European Symposium on Algorithms","abstract":[{"text":"We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithm. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1𝑒√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting.","lang":"eng"}],"publication_status":"published","page":"409 - 420","external_id":{"arxiv":["1611.05753"]},"date_published":"2013-09-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["1611-3349"],"isbn":["9783642404498"]},"alternative_title":["LNCS"],"arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Preprint","type":"conference","date_updated":"2023-02-21T16:28:24Z","doi":"10.1007/978-3-642-40450-4_35","language":[{"iso":"eng"}]},{"day":"01","type":"conference","date_updated":"2023-02-21T16:28:26Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-39212-2_53","page":"607–619","date_published":"2013-07-01T00:00:00Z","external_id":{"arxiv":["1512.08147"]},"arxiv":1,"publication_identifier":{"isbn":["9783642392115"],"issn":["1611-3349"]},"scopus_import":"1","alternative_title":["LNCS"],"year":"2013","author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"quality_controlled":"1","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08147"}],"citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. 40th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In <i>40th International Colloquium on Automata, Languages, and Programming</i>, 7966:607–619. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in <i>40th International Colloquium on Automata, Languages, and Programming</i>, Riga, Latvia, 2013, vol. 7966, pp. 607–619.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: <i>40th International Colloquium on Automata, Languages, and Programming</i>. Vol 7966. Springer Nature; 2013:607–619. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” <i>40th International Colloquium on Automata, Languages, and Programming</i>, vol. 7966, Springer Nature, 2013, pp. 607–619, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In <i>40th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1 + ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing “from scratch”.\r\n\r\nOur technique also leads to a (1 + ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed."}],"oa":1,"related_material":{"record":[{"status":"public","relation":"later_version","id":"11793"}]},"_id":"11793","title":"Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks","publication":"40th International Colloquium on Automata, Languages, and Programming","publisher":"Springer Nature","volume":7966,"status":"public","date_created":"2022-08-11T11:25:13Z","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2013-07-12","start_date":"2013-07-08","location":"Riga, Latvia"},"month":"07","intvolume":"      7966"},{"author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"extern":"1","quality_controlled":"1","citation":{"mla":"Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” <i>54th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2013, pp. 538–47, doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2013). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In <i>54th Annual Symposium on Foundations of Computer Science</i> (pp. 538–547). Berkeley, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in <i>54th Annual Symposium on Foundations of Computer Science</i>, Berkeley, CA, United States, 2013, pp. 538–547.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: <i>54th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” In <i>54th Annual Symposium on Foundations of Computer Science</i>, 538–47. Institute of Electrical and Electronics Engineers, 2013. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–547.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 538–547."},"main_file_link":[{"url":"https://arxiv.org/abs/1308.0776","open_access":"1"}],"year":"2013","oa":1,"_id":"11856","publication":"54th Annual Symposium on Foundations of Computer Science","title":"Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization","publication_status":"published","abstract":[{"text":"We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n)) ) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.","lang":"eng"}],"publisher":"Institute of Electrical and Electronics Engineers","status":"public","date_created":"2022-08-16T08:22:37Z","month":"10","conference":{"name":"FOCS: Symposium on Foundations of Computer Science","end_date":"2013-10-29","location":"Berkeley, CA, United States","start_date":"2013-10-26"},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2023-02-17T09:56:04Z","type":"conference","oa_version":"Preprint","doi":"10.1109/focs.2013.64","language":[{"iso":"eng"}],"page":"538-547","date_published":"2013-10-01T00:00:00Z","external_id":{"arxiv":["1308.0776"]},"publication_identifier":{"eisbn":["978-0-7695-5135-7"],"issn":["0272-5428"]},"scopus_import":"1","arxiv":1},{"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2013.01.030","day":"25","date_updated":"2023-02-21T16:28:41Z","type":"journal_article","oa_version":"None","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0304-3975"]},"scopus_import":"1","page":"22-32","date_published":"2013-03-25T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj. For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under\r\nwhich every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders."}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11799"}]},"_id":"11902","publication":"Theoretical Computer Science","title":"Bidder optimal assignments for general utilities","year":"2013","author":[{"full_name":"Dütting, Paul","last_name":"Dütting","first_name":"Paul"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Weber","first_name":"Ingmar","full_name":"Weber, Ingmar"}],"extern":"1","quality_controlled":"1","citation":{"ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” <i>Theoretical Computer Science</i>, vol. 478, no. 3. Elsevier, pp. 22–32, 2013.","ama":"Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. 2013;478(3):22-32. doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>.","short":"P. Dütting, M.H. Henzinger, I. Weber, Theoretical Computer Science 478 (2013) 22–32.","ista":"Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32.","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2013). Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>","mla":"Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>."},"status":"public","date_created":"2022-08-17T11:11:04Z","month":"03","intvolume":"       478","publisher":"Elsevier","article_type":"original","volume":478,"issue":"3"},{"article_type":"letter_note","publisher":"Wiley","date_published":"2013-09-23T00:00:00Z","volume":52,"issue":"39","page":"10241-10244","date_created":"2022-08-24T11:01:47Z","month":"09","status":"public","intvolume":"        52","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"scopus_import":"1","type":"journal_article","date_updated":"2023-02-21T10:09:21Z","oa_version":"None","day":"23","year":"2013","citation":{"short":"B. Pieber, S.T. Martinez, D. Cantillo, C.O. Kappe, Angewandte Chemie International Edition 52 (2013) 10241–10244.","chicago":"Pieber, Bartholomäus, Sabrina Teixeira Martinez, David Cantillo, and C. Oliver Kappe. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” <i>Angewandte Chemie International Edition</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/anie.201303528\">https://doi.org/10.1002/anie.201303528</a>.","ista":"Pieber B, Martinez ST, Cantillo D, Kappe CO. 2013. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. Angewandte Chemie International Edition. 52(39), 10241–10244.","ama":"Pieber B, Martinez ST, Cantillo D, Kappe CO. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. <i>Angewandte Chemie International Edition</i>. 2013;52(39):10241-10244. doi:<a href=\"https://doi.org/10.1002/anie.201303528\">10.1002/anie.201303528</a>","ieee":"B. Pieber, S. T. Martinez, D. Cantillo, and C. O. Kappe, “In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins,” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 39. Wiley, pp. 10241–10244, 2013.","mla":"Pieber, Bartholomäus, et al. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 39, Wiley, 2013, pp. 10241–44, doi:<a href=\"https://doi.org/10.1002/anie.201303528\">10.1002/anie.201303528</a>.","apa":"Pieber, B., Martinez, S. T., Cantillo, D., &#38; Kappe, C. O. (2013). In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201303528\">https://doi.org/10.1002/anie.201303528</a>"},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","extern":"1","author":[{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"},{"first_name":"Sabrina Teixeira","last_name":"Martinez","full_name":"Martinez, Sabrina Teixeira"},{"last_name":"Cantillo","first_name":"David","full_name":"Cantillo, David"},{"first_name":"C. Oliver","last_name":"Kappe","full_name":"Kappe, C. Oliver"}],"publication_status":"published","abstract":[{"text":"No catalyst required! A highly efficient, catalyst-free process to generate diimide in situ from hydrazine monohydrate and molecular oxygen for the selective reduction of alkenes has been developed. The use of a gas–liquid segmented flow system allowed safe operating conditions and dramatically enhanced this atom-economical reaction, resulting in short processing times.","lang":"eng"}],"publication":"Angewandte Chemie International Edition","title":"In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins","doi":"10.1002/anie.201303528","language":[{"iso":"eng"}],"_id":"11959"}]