[{"type":"conference","article_number":"674 - 683","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"}],"extern":"1","_id":"11870","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","publisher":"Association for Computing Machinery","publication_status":"published","status":"public","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"oa_version":"Preprint","date_created":"2022-08-16T09:41:57Z","date_updated":"2023-02-17T11:18:52Z","scopus_import":"1","article_processing_charge":"No","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145032710-7"]},"day":"01","month":"05","oa":1,"citation":{"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.","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.","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."},"main_file_link":[{"url":"https://arxiv.org/abs/1504.07959","open_access":"1"}],"external_id":{"arxiv":["1504.07959"]},"publication":"46th Annual ACM Symposium on Theory of Computing","quality_controlled":"1","doi":"10.1145/2591796.2591869","date_published":"2014-05-01T00:00:00Z","conference":{"start_date":"2014-05-31","location":"New York, NY, United States","end_date":"2014-06-03","name":"STOC: Symposium on Theory of Computing"},"language":[{"iso":"eng"}]},{"author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"oa_version":"Published Version","date_updated":"2023-02-17T11:58:42Z","date_created":"2022-08-16T12:58:31Z","year":"2014","_id":"11876","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","status":"public","title":"A subquadratic-time algorithm for decremental single-source shortest paths","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"}],"extern":"1","type":"conference","doi":"10.1137/1.9781611973402.79","date_published":"2014-01-01T00:00:00Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2014-01-07","start_date":"2014-01-05","location":"Portland, OR, United States"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1137/1.9781611973402.79","open_access":"1"}],"citation":{"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.","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","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","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.","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."},"publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1053-1072","quality_controlled":"1","publication_identifier":{"isbn":["978-1-61197-338-9"],"eisbn":["978-1-61197-340-2"]},"article_processing_charge":"No","day":"01","month":"01","scopus_import":"1"},{"year":"2014","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","related_material":{"record":[{"id":"11890","status":"public","relation":"later_version"}]},"author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Giuseppe F.","last_name":"Italiano","full_name":"Italiano, Giuseppe F."}],"date_created":"2022-08-16T12:36:42Z","date_updated":"2023-02-21T16:32:06Z","extern":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"external_id":{"arxiv":["1412.1318"]},"quality_controlled":"1","doi":"10.1137/1.9781611973730.54","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2015-01-04","location":"San Diego, CA, United States","end_date":"2015-01-06"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"month":"01","_id":"11875","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Deterministic fully dynamic data structures for vertex cover and matching","oa_version":"Preprint","type":"conference","abstract":[{"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].","lang":"eng"}],"citation":{"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.","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","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.","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","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.","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.","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."},"publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"785-804","date_published":"2014-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"issue":"21","abstract":[{"lang":"eng","text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging."}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 112","title":"Size-dependent same-material tribocharging in insulating grains","status":"public","_id":"119","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"30","date_published":"2014-05-30T00:00:00Z","citation":{"short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014).","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.","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.","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","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.","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","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."},"publication":"APS Physics, Physical Review Letters","extern":"1","publist_id":"7935","article_number":"218001","volume":112,"date_created":"2018-12-11T11:44:44Z","date_updated":"2021-01-12T06:48:58Z","author":[{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R"},{"full_name":"Lee, Victor","last_name":"Lee","first_name":"Victor"},{"first_name":"James","last_name":"Pierson","full_name":"Pierson, James"},{"last_name":"Forman","first_name":"Steven","full_name":"Forman, Steven"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"publisher":"American Physical Society","publication_status":"published","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.","year":"2014","month":"05","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevLett.112.218001","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2578"}],"external_id":{"arxiv":["1309.2578"]}},{"month":"06","publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"doi":"10.1016/j.devcel.2014.04.025","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2014.04.025","open_access":"1"}],"external_id":{"pmid":["24960695"]},"oa":1,"quality_controlled":"1","extern":"1","author":[{"last_name":"Hofbauer","first_name":"Harald F.","full_name":"Hofbauer, Harald F."},{"full_name":"Schopf, Florian H.","last_name":"Schopf","first_name":"Florian H."},{"full_name":"Schleifer, Hannes","last_name":"Schleifer","first_name":"Hannes"},{"full_name":"Knittelfelder, Oskar L.","last_name":"Knittelfelder","first_name":"Oskar L."},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus"},{"last_name":"Rechberger","first_name":"Gerald N.","full_name":"Rechberger, Gerald N."},{"full_name":"Wolinski, Heimo","last_name":"Wolinski","first_name":"Heimo"},{"full_name":"Gaspar, Maria L.","first_name":"Maria L.","last_name":"Gaspar"},{"last_name":"Kappe","first_name":"C. Oliver","full_name":"Kappe, C. Oliver"},{"full_name":"Stadlmann, Johannes","first_name":"Johannes","last_name":"Stadlmann"},{"last_name":"Mechtler","first_name":"Karl","full_name":"Mechtler, Karl"},{"last_name":"Zenz","first_name":"Alexandra","full_name":"Zenz, Alexandra"},{"full_name":"Lohner, Karl","first_name":"Karl","last_name":"Lohner"},{"full_name":"Tehlivets, Oksana","first_name":"Oksana","last_name":"Tehlivets"},{"full_name":"Henry, Susan A.","last_name":"Henry","first_name":"Susan A."},{"last_name":"Kohlwein","first_name":"Sepp D.","full_name":"Kohlwein, Sepp D."}],"date_updated":"2023-02-21T10:09:45Z","date_created":"2022-08-25T08:42:42Z","volume":29,"year":"2014","pmid":1,"publication_status":"published","publisher":"Elsevier","day":"23","article_processing_charge":"No","scopus_import":"1","date_published":"2014-06-23T00:00:00Z","publication":"Developmental Cell","citation":{"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","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.","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.","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","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.","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.","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."},"article_type":"original","page":"P729-739","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"}],"issue":"6","type":"journal_article","oa_version":"Published Version","_id":"11968","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","intvolume":" 29"},{"scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 2014;7(11):3122-3131. doi:10.1002/cssc.201402455","ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131.","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. Wiley. https://doi.org/10.1002/cssc.201402455","ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” ChemSusChem, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” ChemSusChem, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:10.1002/cssc.201402455.","short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131.","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” ChemSusChem. Wiley, 2014. https://doi.org/10.1002/cssc.201402455."},"publication":"ChemSusChem","page":"3122-3131","article_type":"original","date_published":"2014-11-01T00:00:00Z","type":"journal_article","issue":"11","abstract":[{"text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11967","intvolume":" 7","title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","status":"public","oa_version":"None","publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]},"month":"11","external_id":{"pmid":["25209099"]},"quality_controlled":"1","doi":"10.1002/cssc.201402455","language":[{"iso":"eng"}],"extern":"1","pmid":1,"year":"2014","publisher":"Wiley","publication_status":"published","author":[{"full_name":"Moghaddam, Mojtaba Mirhosseini","last_name":"Moghaddam","first_name":"Mojtaba Mirhosseini"},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"first_name":"Toma","last_name":"Glasnov","full_name":"Glasnov, Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"volume":7,"date_updated":"2023-02-21T10:09:42Z","date_created":"2022-08-25T08:36:54Z"},{"extern":"1","abstract":[{"lang":"eng","text":"A method for the direct lithiation of terminal alkynes and heterocycles with subsequent carboxylation in a continuous flow format was developed. This method provides carboxylic acids at ambient conditions within less than five seconds with only little excess of the organometallic base and CO2."}],"issue":"26","article_number":"13430","type":"journal_article","date_updated":"2023-02-21T10:10:31Z","date_created":"2022-08-25T11:48:19Z","oa_version":"None","volume":4,"author":[{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"last_name":"Glasnov","first_name":"Toma","full_name":"Glasnov, Toma"},{"full_name":"Kappe, C. O.","first_name":"C. O.","last_name":"Kappe"}],"publication_status":"published","status":"public","title":"Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow","intvolume":" 4","publisher":"Royal Society of Chemistry","_id":"11987","year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"03","month":"03","article_processing_charge":"No","publication_identifier":{"eissn":["2046-2069"]},"scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2014-03-03T00:00:00Z","doi":"10.1039/c4ra01442a","article_type":"letter_note","quality_controlled":"1","publication":"RSC Advances","citation":{"chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. O. Kappe. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” RSC Advances. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c4ra01442a.","short":"B. Pieber, T. Glasnov, C.O. Kappe, RSC Advances 4 (2014).","mla":"Pieber, Bartholomäus, et al. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” RSC Advances, vol. 4, no. 26, 13430, Royal Society of Chemistry, 2014, doi:10.1039/c4ra01442a.","apa":"Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. Royal Society of Chemistry. https://doi.org/10.1039/c4ra01442a","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow,” RSC Advances, vol. 4, no. 26. Royal Society of Chemistry, 2014.","ista":"Pieber B, Glasnov T, Kappe CO. 2014. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 4(26), 13430.","ama":"Pieber B, Glasnov T, Kappe CO. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 2014;4(26). doi:10.1039/c4ra01442a"}},{"type":"journal_article","abstract":[{"lang":"eng","text":"We show that weak solutions of the Derrida-Lebowitz-Speer-Spohn (DLSS) equation display infinite speed of support propagation. We apply our method to the case of the quantum drift-diffusion equation which augments the DLSS equation with a drift term and possibly a second-order diffusion term. The proof is accomplished using weighted entropy estimates, Hardy's inequality and a family of singular weight functions to derive a differential inequality; the differential inequality shows exponential growth of the weighted entropy, with the growth constant blowing up very fast as the singularity of the weight becomes sharper. To the best of our knowledge, this is the first example of a nonnegativity-preserving higher-order parabolic equation displaying infinite speed of support propagation."}],"issue":"1","publist_id":"5960","extern":1,"_id":"1309","year":"2014","publication_status":"published","status":"public","title":"Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models","publisher":"Birkhäuser","intvolume":" 21","author":[{"full_name":"Julian Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer"}],"date_updated":"2021-01-12T06:49:47Z","date_created":"2018-12-11T11:51:17Z","volume":21,"day":"01","month":"01","publication":"Nonlinear Differential Equations and Applications","citation":{"ista":"Fischer JL. 2014. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. 21(1), 27–50.","ieee":"J. L. Fischer, “Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models,” Nonlinear Differential Equations and Applications, vol. 21, no. 1. Birkhäuser, pp. 27–50, 2014.","apa":"Fischer, J. L. (2014). Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. Birkhäuser. https://doi.org/10.1007/s00030-013-0235-0","ama":"Fischer JL. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. 2014;21(1):27-50. doi:10.1007/s00030-013-0235-0","chicago":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations and Applications. Birkhäuser, 2014. https://doi.org/10.1007/s00030-013-0235-0.","mla":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations and Applications, vol. 21, no. 1, Birkhäuser, 2014, pp. 27–50, doi:10.1007/s00030-013-0235-0.","short":"J.L. Fischer, Nonlinear Differential Equations and Applications 21 (2014) 27–50."},"quality_controlled":0,"page":"27 - 50","doi":"10.1007/s00030-013-0235-0","date_published":"2014-01-01T00:00:00Z"},{"date_published":"2014-01-01T00:00:00Z","doi":"10.1007/s00205-013-0690-0","quality_controlled":0,"page":"771 - 818","publication":"Archive for Rational Mechanics and Analysis","citation":{"ama":"Fischer JL. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. 2014;211(3):771-818. doi:10.1007/s00205-013-0690-0","ista":"Fischer JL. 2014. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. 211(3), 771–818.","apa":"Fischer, J. L. (2014). Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-013-0690-0","ieee":"J. L. Fischer, “Upper bounds on waiting times for the Thin-film equation: The case of weak slippage,” Archive for Rational Mechanics and Analysis, vol. 211, no. 3. Springer, pp. 771–818, 2014.","mla":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis, vol. 211, no. 3, Springer, 2014, pp. 771–818, doi:10.1007/s00205-013-0690-0.","short":"J.L. Fischer, Archive for Rational Mechanics and Analysis 211 (2014) 771–818.","chicago":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis. Springer, 2014. https://doi.org/10.1007/s00205-013-0690-0."},"month":"01","day":"01","date_updated":"2021-01-12T06:49:48Z","date_created":"2018-12-11T11:51:18Z","volume":211,"author":[{"orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","first_name":"Julian L","full_name":"Julian Fischer"}],"status":"public","title":"Upper bounds on waiting times for the Thin-film equation: The case of weak slippage","publication_status":"published","publisher":"Springer","intvolume":" 211","year":"2014","_id":"1312","extern":1,"abstract":[{"text":"We derive upper bounds on the waiting time of solutions to the thin-film equation in the regime of weak slippage n ∈ [2, 32\\11). In particular, we give sufficient conditions on the initial data for instantaneous forward motion of the free boundary. For n ∈ (2, 32\\11), our estimates are sharp, for n = 2, they are sharp up to a logarithmic correction term. Note that the case n = 2 corresponds-with a grain of salt-to the assumption of the Navier slip condition at the fluid-solid interface. We also obtain results in the regime of strong slippage n ∈ (1,2); however, in this regime we expect them not to be optimal. Our method is based on weighted backward entropy estimates, Hardy's inequality and singular weight functions; we deduce a differential inequality which would enforce blowup of the weighted entropy if the contact line were to remain stationary for too long.","lang":"eng"}],"publist_id":"5959","issue":"3","type":"journal_article"},{"oa":1,"external_id":{"arxiv":["1307.4473"]},"main_file_link":[{"url":"http://arxiv.org/abs/1307.4473","open_access":"1"}],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","doi":"10.1016/j.tcs.2014.06.031","language":[{"iso":"eng"}],"month":"08","year":"2014","department":[{"_id":"KrCh"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"},{"full_name":"Raskin, Michael","last_name":"Raskin","first_name":"Michael"}],"volume":547,"date_created":"2018-12-11T11:51:40Z","date_updated":"2022-09-09T11:50:58Z","ec_funded":1,"publist_id":"5836","citation":{"mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116. doi:10.1016/j.tcs.2014.06.031","ista":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014."},"publication":"Theoretical Computer Science","page":"104 - 116","article_type":"original","date_published":"2014-08-28T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1375","intvolume":" 547","status":"public","title":"Approximating the minimum cycle mean","oa_version":"Preprint","type":"journal_article","issue":"C","abstract":[{"lang":"eng","text":"We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound."}]}]