[{"doi":"10.48550/arXiv.1906.09611","oa":1,"year":"2019","type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.09611"}],"abstract":[{"text":"The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars.","lang":"eng"}],"oa_version":"Preprint","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"],"article_number":"1906.09611","external_id":{"arxiv":["1906.09611"]},"date_created":"2022-07-21T06:57:10Z","article_processing_charge":"No","status":"public","title":"Automatic classification of K2 pulsating stars using machine learning techniques","extern":"1","publication":"arXiv","language":[{"iso":"eng"}],"_id":"11630","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, 1906.09611, doi:<a href=\"https://doi.org/10.48550/arXiv.1906.09611\">10.48550/arXiv.1906.09611</a>.","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611.","chicago":"Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>.","ieee":"A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” <i>arXiv</i>. .","apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., &#38; Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1906.09611\">https://doi.org/10.48550/arXiv.1906.09611</a>"},"month":"06","author":[{"full_name":"Saux, A. Le","first_name":"A. Le","last_name":"Saux"},{"orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"S.","full_name":"Mathur, S.","last_name":"Mathur"},{"last_name":"Breton","full_name":"Breton, S. N.","first_name":"S. N."},{"full_name":"Garcia, R. A.","first_name":"R. A.","last_name":"Garcia"}],"date_published":"2019-06-23T00:00:00Z","publication_status":"submitted","date_updated":"2022-08-22T08:20:29Z","arxiv":1,"day":"23"},{"oa":1,"doi":"10.4230/LIPICS.ICALP.2019.13","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ICALP.2019.13","open_access":"1"}],"conference":{"start_date":"2019-07-09","name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2019-07-12","location":"Patras, Greece"},"type":"conference","article_number":"13","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-109-2"]},"article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ama":"Ancona B, Henzinger M, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: <i>46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">10.4230/LIPICS.ICALP.2019.13</a>","short":"B. Ancona, M. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” <i>46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">10.4230/LIPICS.ICALP.2019.13</a>.","ista":"Ancona B, Henzinger M, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.","chicago":"Ancona, Bertie, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In <i>46th International Colloquium on Automata, Languages, and Programming</i>, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>.","ieee":"B. Ancona, M. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in <i>46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132.","apa":"Ancona, B., Henzinger, M., Roditty, L., Williams, V. V., &#38; Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In <i>46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.13\">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"date_published":"2019-07-04T00:00:00Z","intvolume":"       132","arxiv":1,"day":"04","quality_controlled":"1","year":"2019","volume":132,"abstract":[{"text":"The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported.\r\nThis paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include:\r\n- Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal.","lang":"eng"}],"oa_version":"Published Version","external_id":{"arxiv":["811.12527"]},"date_created":"2022-08-12T08:14:51Z","extern":"1","scopus_import":"1","status":"public","title":"Algorithms and hardness for diameter in dynamic graphs","_id":"11826","publication":"46th International Colloquium on Automata, Languages, and Programming","language":[{"iso":"eng"}],"author":[{"last_name":"Ancona","full_name":"Ancona, Bertie","first_name":"Bertie"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Roditty, Liam","first_name":"Liam","last_name":"Roditty"},{"last_name":"Williams","full_name":"Williams, Virginia Vassilevska","first_name":"Virginia Vassilevska"},{"last_name":"Wein","full_name":"Wein, Nicole","first_name":"Nicole"}],"month":"07","publication_status":"published","date_updated":"2024-11-06T11:56:23Z"},{"year":"2019","volume":2074,"page":"215–231","abstract":[{"text":"This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks.","lang":"eng"}],"oa_version":"None","external_id":{"pmid":["31583641"]},"date_created":"2022-08-16T06:54:48Z","status":"public","scopus_import":"1","title":"Vienna Graph Clustering","extern":"1","language":[{"iso":"eng"}],"publication":"Protein-Protein Interaction Networks","_id":"11847","month":"10","author":[{"last_name":"Biedermann","first_name":"Sonja","full_name":"Biedermann, Sonja"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"},{"last_name":"Schuster","first_name":"Bernhard","full_name":"Schuster, Bernhard"}],"editor":[{"last_name":"Canzar","first_name":"Stefan","full_name":"Canzar, Stefan"},{"last_name":"Rojas Ringeling","first_name":"Francisca","full_name":"Rojas Ringeling, Francisca"}],"series_title":"MIMB","publication_status":"published","date_updated":"2024-11-06T12:17:08Z","doi":"10.1007/978-1-4939-9873-9_16","pmid":1,"type":"book_chapter","article_processing_charge":"No","publication_identifier":{"eissn":["1940-6029"],"isbn":["9781493998722"],"eisbn":["9781493998739"],"issn":["1064-3745"]},"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"S. Biedermann, M. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231.","ama":"Biedermann S, Henzinger M, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. <i>Protein-Protein Interaction Networks</i>. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:<a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">10.1007/978-1-4939-9873-9_16</a>","ista":"Biedermann S, Henzinger M, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.","chicago":"Biedermann, Sonja, Monika Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In <i>Protein-Protein Interaction Networks</i>, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">https://doi.org/10.1007/978-1-4939-9873-9_16</a>.","ieee":"S. Biedermann, M. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in <i>Protein-Protein Interaction Networks</i>, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.","apa":"Biedermann, S., Henzinger, M., Schulz, C., &#38; Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar &#38; F. Rojas Ringeling (Eds.), <i>Protein-Protein Interaction Networks</i> (Vol. 2074, pp. 215–231). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">https://doi.org/10.1007/978-1-4939-9873-9_16</a>","mla":"Biedermann, Sonja, et al. “Vienna Graph Clustering.” <i>Protein-Protein Interaction Networks</i>, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:<a href=\"https://doi.org/10.1007/978-1-4939-9873-9_16\">10.1007/978-1-4939-9873-9_16</a>."},"alternative_title":["Methods in Molecular Biology"],"intvolume":"      2074","date_published":"2019-10-04T00:00:00Z","quality_controlled":"1","day":"04"},{"author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"Stefan","full_name":"Neumann, Stefan","last_name":"Neumann"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"month":"06","publication_status":"published","date_updated":"2024-11-06T12:17:32Z","status":"public","scopus_import":"1","title":"Efficient distributed workload (re-)embedding","extern":"1","language":[{"iso":"eng"}],"publication":"SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems","_id":"11850","oa_version":"Preprint","external_id":{"arxiv":["1904.05474"]},"date_created":"2022-08-16T07:14:57Z","year":"2019","page":"43–44","abstract":[{"text":"Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.","lang":"eng"}],"date_published":"2019-06-20T00:00:00Z","quality_controlled":"1","day":"20","arxiv":1,"article_processing_charge":"No","publication_identifier":{"isbn":["978-1-4503-6678-6"]},"publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Monika, et al. “Efficient Distributed Workload (Re-)Embedding.” <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2019, pp. 43–44, doi:<a href=\"https://doi.org/10.1145/3309697.3331503\">10.1145/3309697.3331503</a>.","ieee":"M. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, Phoenix, AZ, United States, 2019, pp. 43–44.","apa":"Henzinger, M., Neumann, S., &#38; Schmid, S. (2019). Efficient distributed workload (re-)embedding. In <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i> (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3309697.3331503\">https://doi.org/10.1145/3309697.3331503</a>","chicago":"Henzinger, Monika, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>, 43–44. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3309697.3331503\">https://doi.org/10.1145/3309697.3331503</a>.","ista":"Henzinger M, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44.","ama":"Henzinger M, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: <i>SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2019:43–44. doi:<a href=\"https://doi.org/10.1145/3309697.3331503\">10.1145/3309697.3331503</a>","short":"M. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44."},"doi":"10.1145/3309697.3331503","oa":1,"type":"conference","conference":{"location":"Phoenix, AZ, United States","end_date":"2019-06-28","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","start_date":"2019-06-24"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.05474"}]},{"article_number":"8820968","type":"conference","conference":{"end_date":"2019-05-24","location":"Rio de Janeiro, Brazil","start_date":"2019-05-20","name":"IPDPS: International Parallel and Distributed Processing Symposium"},"main_file_link":[{"url":"https://arxiv.org/abs/1808.05458"}],"doi":"10.1109/ipdps.2019.00013","quality_controlled":"1","arxiv":1,"day":"01","date_published":"2019-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Henzinger M, Noe A, Schulz C. Shared-memory exact minimum cuts. In: <i>33rd International Parallel and Distributed Processing Symposium</i>. Institute of Electrical and Electronics Engineers; 2019. doi:<a href=\"https://doi.org/10.1109/ipdps.2019.00013\">10.1109/ipdps.2019.00013</a>","short":"M. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019.","mla":"Henzinger, Monika, et al. “Shared-Memory Exact Minimum Cuts.” <i>33rd International Parallel and Distributed Processing Symposium</i>, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:<a href=\"https://doi.org/10.1109/ipdps.2019.00013\">10.1109/ipdps.2019.00013</a>.","apa":"Henzinger, M., Noe, A., &#38; Schulz, C. (2019). Shared-memory exact minimum cuts. In <i>33rd International Parallel and Distributed Processing Symposium</i>. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ipdps.2019.00013\">https://doi.org/10.1109/ipdps.2019.00013</a>","ieee":"M. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in <i>33rd International Parallel and Distributed Processing Symposium</i>, Rio de Janeiro, Brazil, 2019.","chicago":"Henzinger, Monika, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In <i>33rd International Parallel and Distributed Processing Symposium</i>. Institute of Electrical and Electronics Engineers, 2019. <a href=\"https://doi.org/10.1109/ipdps.2019.00013\">https://doi.org/10.1109/ipdps.2019.00013</a>.","ista":"Henzinger M, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968."},"publisher":"Institute of Electrical and Electronics Engineers","article_processing_charge":"No","publication_identifier":{"eissn":["1530-2075"],"isbn":["978-1-7281-1247-3"],"eisbn":["978-1-7281-1246-6"]},"related_material":{"record":[{"id":"11851","relation":"later_version","status":"public"}]},"external_id":{"arxiv":["1808.05458"]},"date_created":"2022-08-16T07:25:23Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem."}],"year":"2019","date_updated":"2024-11-06T12:17:43Z","publication_status":"published","month":"05","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Alexander","full_name":"Noe, Alexander","last_name":"Noe"},{"first_name":"Christian","full_name":"Schulz, Christian","last_name":"Schulz"}],"publication":"33rd International Parallel and Distributed Processing Symposium","language":[{"iso":"eng"}],"_id":"11851","title":"Shared-memory exact minimum cuts","status":"public","scopus_import":"1","extern":"1"},{"title":"A new deterministic algorithm for dynamic set cover","status":"public","scopus_import":"1","extern":"1","publication":"60th Annual Symposium on Foundations of Computer Science","language":[{"iso":"eng"}],"_id":"11853","month":"11","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"date_updated":"2024-11-06T12:18:05Z","publication_status":"published","year":"2019","page":"406-423","abstract":[{"text":"We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.","lang":"eng"}],"oa_version":"Preprint","external_id":{"arxiv":["1909.11600"]},"date_created":"2022-08-16T08:00:00Z","article_processing_charge":"No","publication_identifier":{"isbn":["978-1-7281-4953-0"],"issn":["2575-8454"],"eisbn":["978-1-7281-4952-3"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423.","ama":"Bhattacharya S, Henzinger M, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: <i>60th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>","ista":"Bhattacharya S, Henzinger M, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In <i>60th Annual Symposium on Foundations of Computer Science</i>, 406–23. Institute of Electrical and Electronics Engineers, 2019. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>.","ieee":"S. Bhattacharya, M. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in <i>60th Annual Symposium on Foundations of Computer Science</i>, Baltimore, MD, United States, 2019, pp. 406–423.","apa":"Bhattacharya, S., Henzinger, M., &#38; Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In <i>60th Annual Symposium on Foundations of Computer Science</i> (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2019.00033\">https://doi.org/10.1109/focs.2019.00033</a>","mla":"Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” <i>60th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:<a href=\"https://doi.org/10.1109/focs.2019.00033\">10.1109/focs.2019.00033</a>."},"publisher":"Institute of Electrical and Electronics Engineers","date_published":"2019-11-01T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"01","doi":"10.1109/focs.2019.00033","oa":1,"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1909.11600","open_access":"1"}],"conference":{"end_date":"2019-11-12","location":"Baltimore, MD, United States","start_date":"2019-11-09","name":"FOCS: Annual Symposium on Foundations of Computer Science"}},{"publication_status":"published","date_updated":"2024-11-06T12:19:15Z","month":"06","author":[{"full_name":"Daga, Mohit","first_name":"Mohit","last_name":"Daga"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"},{"last_name":"Saranurak","full_name":"Saranurak, Thatchaphol","first_name":"Thatchaphol"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","_id":"11865","status":"public","scopus_import":"1","title":"Distributed edge connectivity in sublinear time","extern":"1","date_created":"2022-08-16T09:11:17Z","external_id":{"arxiv":["1904.04341"]},"oa_version":"Preprint","page":"343–354","abstract":[{"text":"We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs.","lang":"eng"}],"year":"2019","quality_controlled":"1","day":"01","arxiv":1,"date_published":"2019-06-01T00:00:00Z","publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"M. Daga, M. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.","ama":"Daga M, Henzinger M, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>. Association for Computing Machinery; 2019:343–354. doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>","ista":"Daga M, Henzinger M, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.","ieee":"M. Daga, M. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, Phoenix, AZ, United States, 2019, pp. 343–354.","apa":"Daga, M., Henzinger, M., Nanongkai, D., &#38; Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i> (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>","chicago":"Daga, Mohit, Monika Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, 343–354. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3313276.3316346\">https://doi.org/10.1145/3313276.3316346</a>.","mla":"Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” <i>Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing</i>, Association for Computing Machinery, 2019, pp. 343–354, doi:<a href=\"https://doi.org/10.1145/3313276.3316346\">10.1145/3313276.3316346</a>."},"article_processing_charge":"No","publication_identifier":{"issn":["0737-8017"],"isbn":["978-1-4503-6705-9"]},"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1904.04341","open_access":"1"}],"conference":{"location":"Phoenix, AZ, United States","end_date":"2019-06-26","name":"STOC: Symposium on Theory of Computing","start_date":"2019-06-23"},"doi":"10.1145/3313276.3316346","oa":1},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.10932"}],"conference":{"location":"San Diego, CA, United States","end_date":"2019-01-09","name":"SODA: Symposium on Discrete Algorithms","start_date":"2019-01-06"},"type":"conference","oa":1,"doi":"10.1137/1.9781611975482.115","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>.","ista":"Bernstein A, Forster S, Henzinger M. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.","ieee":"A. Bernstein, S. Forster, and M. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2019, pp. 1899–1918.","chicago":"Bernstein, Aaron, Sebastian Forster, and Monika Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1899–1918. Society for Industrial and Applied Mathematics, 2019. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>.","apa":"Bernstein, A., Forster, S., &#38; Henzinger, M. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611975482.115\">https://doi.org/10.1137/1.9781611975482.115</a>","ama":"Bernstein A, Forster S, Henzinger M. A deamortization approach for dynamic spanner and dynamic maximal matching. In: <i>30th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:<a href=\"https://doi.org/10.1137/1.9781611975482.115\">10.1137/1.9781611975482.115</a>","short":"A. Bernstein, S. Forster, M. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918."},"publisher":"Society for Industrial and Applied Mathematics","publication_identifier":{"eisbn":["978-1-61197-548-2"]},"article_processing_charge":"No","day":"01","arxiv":1,"quality_controlled":"1","date_published":"2019-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms."}],"page":"1899-1918","year":"2019","date_created":"2022-08-16T09:50:33Z","external_id":{"arxiv":["1810.10932"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11871"}]},"oa_version":"Preprint","_id":"11871","language":[{"iso":"eng"}],"publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","extern":"1","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","scopus_import":"1","status":"public","date_updated":"2024-11-06T12:20:24Z","publication_status":"published","month":"01","author":[{"last_name":"Bernstein","full_name":"Bernstein, Aaron","first_name":"Aaron"},{"last_name":"Forster","first_name":"Sebastian","full_name":"Forster, Sebastian"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}]},{"scopus_import":"1","status":"public","title":"New amortized cell-probe lower bounds for dynamic problems","extern":"1","article_type":"original","publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"_id":"11898","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Neumann","first_name":"Stefan","full_name":"Neumann, Stefan"}],"month":"08","publication_status":"published","date_updated":"2024-11-06T12:23:49Z","year":"2019","volume":779,"page":"72-87","abstract":[{"lang":"eng","text":"We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model."}],"oa_version":"Preprint","date_created":"2022-08-17T09:02:15Z","external_id":{"arxiv":["1902.02304"]},"article_processing_charge":"No","publication_identifier":{"issn":["0304-3975"]},"publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Bhattacharya S, Henzinger M, Neumann S. New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. 2019;779:72-87. doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>","short":"S. Bhattacharya, M. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.","mla":"Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>, vol. 779, Elsevier, 2019, pp. 72–87, doi:<a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">10.1016/j.tcs.2019.01.043</a>.","ista":"Bhattacharya S, Henzinger M, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.","apa":"Bhattacharya, S., Henzinger, M., &#38; Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” <i>Theoretical Computer Science</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.tcs.2019.01.043\">https://doi.org/10.1016/j.tcs.2019.01.043</a>.","ieee":"S. Bhattacharya, M. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” <i>Theoretical Computer Science</i>, vol. 779. Elsevier, pp. 72–87, 2019."},"intvolume":"       779","date_published":"2019-08-02T00:00:00Z","quality_controlled":"1","day":"02","arxiv":1,"doi":"10.1016/j.tcs.2019.01.043","oa":1,"type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1902.02304","open_access":"1"}]},{"pmid":1,"type":"journal_article","doi":"10.1002/anie.201902785","quality_controlled":"1","day":"08","intvolume":"        58","date_published":"2019-07-08T00:00:00Z","issue":"28","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T. Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019) 9575–9580.","ama":"Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. <i>Angewandte Chemie International Edition</i>. 2019;58(28):9575-9580. doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>","ista":"Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 58(28), 9575–9580.","chicago":"Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” <i>Angewandte Chemie International Edition</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>.","ieee":"B. Pieber <i>et al.</i>, “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” <i>Angewandte Chemie International Edition</i>, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.","apa":"Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201902785\">https://doi.org/10.1002/anie.201902785</a>","mla":"Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” <i>Angewandte Chemie International Edition</i>, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:<a href=\"https://doi.org/10.1002/anie.201902785\">10.1002/anie.201902785</a>."},"article_processing_charge":"No","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"date_created":"2022-08-24T10:50:19Z","external_id":{"pmid":["31050132"]},"oa_version":"None","page":"9575-9580","abstract":[{"text":"Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales.","lang":"eng"}],"year":"2019","volume":58,"publication_status":"published","date_updated":"2024-10-14T11:43:18Z","month":"07","author":[{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"last_name":"Malik","full_name":"Malik, Jamal A.","first_name":"Jamal A."},{"last_name":"Cavedon","first_name":"Cristian","full_name":"Cavedon, Cristian"},{"last_name":"Gisbertz","first_name":"Sebastian","full_name":"Gisbertz, Sebastian"},{"full_name":"Savateev, Aleksandr","first_name":"Aleksandr","last_name":"Savateev"},{"full_name":"Cruz, Daniel","first_name":"Daniel","last_name":"Cruz"},{"full_name":"Heil, Tobias","first_name":"Tobias","last_name":"Heil"},{"full_name":"Zhang, Guigang","first_name":"Guigang","last_name":"Zhang"},{"full_name":"Seeberger, Peter H.","first_name":"Peter H.","last_name":"Seeberger"}],"publication":"Angewandte Chemie International Edition","language":[{"iso":"eng"}],"_id":"11957","status":"public","scopus_import":"1","title":"Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides","extern":"1","article_type":"letter_note"},{"oa":1,"doi":"10.1021/acs.orglett.9b01957","main_file_link":[{"url":"https://doi.org/10.1021/acs.orglett.9b01957","open_access":"1"}],"type":"journal_article","pmid":1,"date_published":"2019-07-05T00:00:00Z","intvolume":"        21","day":"05","quality_controlled":"1","publication_identifier":{"eissn":["1523-7052"],"issn":["1523-7060"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334.","ama":"Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. 2019;21(13):5331-5334. doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>","ista":"Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334.","ieee":"C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” <i>Organic Letters</i>, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.","apa":"Cavedon, C., Madani, A., Seeberger, P. H., &#38; Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. <i>Organic Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>","chicago":"Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">https://doi.org/10.1021/acs.orglett.9b01957</a>.","mla":"Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” <i>Organic Letters</i>, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:<a href=\"https://doi.org/10.1021/acs.orglett.9b01957\">10.1021/acs.orglett.9b01957</a>."},"publisher":"American Chemical Society","issue":"13","oa_version":"Published Version","external_id":{"pmid":["31247752"]},"date_created":"2022-08-25T11:18:00Z","volume":21,"year":"2019","abstract":[{"text":"A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well.","lang":"eng"}],"page":"5331-5334","author":[{"first_name":"Cristian","full_name":"Cavedon, Cristian","last_name":"Cavedon"},{"last_name":"Madani","first_name":"Amiera","full_name":"Madani, Amiera"},{"last_name":"Seeberger","full_name":"Seeberger, Peter H.","first_name":"Peter H."},{"last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus"}],"month":"07","date_updated":"2024-10-14T12:07:10Z","publication_status":"published","article_type":"letter_note","extern":"1","title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","status":"public","scopus_import":"1","_id":"11982","language":[{"iso":"eng"}],"publication":"Organic Letters"},{"oa":1,"doi":"10.1021/acs.oprd.9b00456","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"type":"journal_article","publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"article_processing_charge":"No","citation":{"chicago":"Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>.","ieee":"M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” <i>Organic Process Research and Development</i>, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019.","apa":"Guberman, M., Pieber, B., &#38; Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">https://doi.org/10.1021/acs.oprd.9b00456</a>","ista":"Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770.","mla":"Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” <i>Organic Process Research and Development</i>, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>.","short":"M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770.","ama":"Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. <i>Organic Process Research and Development</i>. 2019;23(12):2764-2770. doi:<a href=\"https://doi.org/10.1021/acs.oprd.9b00456\">10.1021/acs.oprd.9b00456</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Chemical Society","issue":"12","date_published":"2019-12-20T00:00:00Z","intvolume":"        23","day":"20","quality_controlled":"1","volume":23,"year":"2019","abstract":[{"lang":"eng","text":"Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product."}],"page":"2764-2770","oa_version":"Published Version","date_created":"2022-08-25T11:30:33Z","article_type":"letter_note","extern":"1","title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","scopus_import":"1","status":"public","_id":"11984","publication":"Organic Process Research and Development","language":[{"iso":"eng"}],"month":"12","author":[{"first_name":"Mónica","full_name":"Guberman, Mónica","last_name":"Guberman"},{"orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"first_name":"Peter H.","full_name":"Seeberger, Peter H.","last_name":"Seeberger"}],"date_updated":"2023-02-21T10:10:23Z","publication_status":"published"},{"volume":29,"year":"2019","abstract":[{"text":"Meiotic crossover frequency varies within genomes, which influences genetic diversity and adaptation. In turn, genetic variation within populations can act to modify crossover frequency in cis and trans. To identify genetic variation that controls meiotic crossover frequency, we screened Arabidopsis accessions using fluorescent recombination reporters. We mapped a genetic modifier of crossover frequency in Col × Bur populations of Arabidopsis to a premature stop codon within TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare variant found in the British Isles, originating in South-West Ireland. Using genetics, genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers, with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq) from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread transcriptional changes, including in genes that regulate the meiotic cell cycle and recombination. Therefore, TAF4b duplication is associated with acquisition of meiocyte-specific expression and promotion of germline transcription, which act directly or indirectly to elevate crossovers. This identifies a novel mode of meiotic recombination control via a general transcription factor.","lang":"eng"}],"page":"2676-2686.e3","oa_version":"None","external_id":{"pmid":["31378616"]},"date_created":"2023-01-16T09:16:33Z","article_type":"original","extern":"1","title":"Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis","status":"public","scopus_import":"1","_id":"12190","publication":"Current Biology","language":[{"iso":"eng"}],"author":[{"full_name":"Lawrence, Emma J.","first_name":"Emma J.","last_name":"Lawrence"},{"full_name":"Gao, Hongbo","first_name":"Hongbo","last_name":"Gao"},{"last_name":"Tock","first_name":"Andrew J.","full_name":"Tock, Andrew J."},{"last_name":"Lambing","first_name":"Christophe","full_name":"Lambing, Christophe"},{"full_name":"Blackwell, Alexander R.","first_name":"Alexander R.","last_name":"Blackwell"},{"first_name":"Xiaoqi","orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","last_name":"Feng"},{"last_name":"Henderson","first_name":"Ian R.","full_name":"Henderson, Ian R."}],"month":"08","date_updated":"2025-01-14T14:31:02Z","publication_status":"published","doi":"10.1016/j.cub.2019.06.084","type":"journal_article","pmid":1,"acknowledgement":"We thank Gregory Copenhaver (University of North Carolina), Avraham Levy (The Weizmann Institute), and Scott Poethig (University of Pennsylvania) for FTLs; Piotr Ziolkowski for Col-420/Bur seed; Sureshkumar Balasubramanian\r\n(Monash University) for providing British and Irish Arabidopsis accessions; Mathilde Grelon (INRA, Versailles) for providing the MLH1 antibody; and the Gurdon Institute for access to microscopes. This work was supported by a BBSRC DTP studentship (E.J.L.), European Research Area Network for Coordinating Action in Plant Sciences/BBSRC ‘‘DeCOP’’ (BB/M004937/1; C.L.), a BBSRC David Phillips Fellowship (BB/L025043/1; H.G. and X.F.), the European Research Council (CoG ‘‘SynthHotspot,’’ A.J.T., C.L., and I.R.H.; StG ‘‘SexMeth,’’ X.F.), and a Sainsbury Charitable Foundation Studentship (A.R.B.).","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"publication_identifier":{"issn":["0960-9822"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Lawrence, Emma J., et al. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” <i>Current Biology</i>, vol. 29, no. 16, Elsevier, 2019, p. 2676–2686.e3, doi:<a href=\"https://doi.org/10.1016/j.cub.2019.06.084\">10.1016/j.cub.2019.06.084</a>.","apa":"Lawrence, E. J., Gao, H., Tock, A. J., Lambing, C., Blackwell, A. R., Feng, X., &#38; Henderson, I. R. (2019). Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2019.06.084\">https://doi.org/10.1016/j.cub.2019.06.084</a>","ieee":"E. J. Lawrence <i>et al.</i>, “Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis,” <i>Current Biology</i>, vol. 29, no. 16. Elsevier, p. 2676–2686.e3, 2019.","chicago":"Lawrence, Emma J., Hongbo Gao, Andrew J. Tock, Christophe Lambing, Alexander R. Blackwell, Xiaoqi Feng, and Ian R. Henderson. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” <i>Current Biology</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.cub.2019.06.084\">https://doi.org/10.1016/j.cub.2019.06.084</a>.","ista":"Lawrence EJ, Gao H, Tock AJ, Lambing C, Blackwell AR, Feng X, Henderson IR. 2019. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. 29(16), 2676–2686.e3.","ama":"Lawrence EJ, Gao H, Tock AJ, et al. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. <i>Current Biology</i>. 2019;29(16):2676-2686.e3. doi:<a href=\"https://doi.org/10.1016/j.cub.2019.06.084\">10.1016/j.cub.2019.06.084</a>","short":"E.J. Lawrence, H. Gao, A.J. Tock, C. Lambing, A.R. Blackwell, X. Feng, I.R. Henderson, Current Biology 29 (2019) 2676–2686.e3."},"department":[{"_id":"XiFe"}],"issue":"16","publisher":"Elsevier","date_published":"2019-08-19T00:00:00Z","intvolume":"        29","day":"19","quality_controlled":"1"},{"file_date_updated":"2023-02-07T09:42:46Z","type":"journal_article","doi":"10.7554/elife.42530","oa":1,"article_number":"42530","keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Medicine","General Neuroscience"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"We thank David Twell for the pDONR-P4-P1R-pLAT52 and pDONR-P2R-P3-mRFP vectors, the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder) for their assistance with microscopy, and the Norwich BioScience Institute Partnership Computing infrastructure for Science Group for High Performance Computing resources. This work was funded by a Biotechnology and Biological Sciences Research Council (BBSRC) David Phillips Fellowship (BB/L025043/1; SH, JZ and XF), a European Research Council Starting Grant ('SexMeth' 804981; XF) and a Grant to Exceptional Researchers by the Gatsby Charitable Foundation (SH and XF).","department":[{"_id":"XiFe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"He, Shengbo, Martin Vickers, Jingyi Zhang, and Xiaoqi Feng. “Natural Depletion of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation and Transposon Activation.” <i>ELife</i>. eLife Sciences Publications, 2019. <a href=\"https://doi.org/10.7554/elife.42530\">https://doi.org/10.7554/elife.42530</a>.","ieee":"S. He, M. Vickers, J. Zhang, and X. Feng, “Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation,” <i>eLife</i>, vol. 8. eLife Sciences Publications, 2019.","apa":"He, S., Vickers, M., Zhang, J., &#38; Feng, X. (2019). Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.42530\">https://doi.org/10.7554/elife.42530</a>","ista":"He S, Vickers M, Zhang J, Feng X. 2019. Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. eLife. 8, 42530.","mla":"He, Shengbo, et al. “Natural Depletion of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation and Transposon Activation.” <i>ELife</i>, vol. 8, 42530, eLife Sciences Publications, 2019, doi:<a href=\"https://doi.org/10.7554/elife.42530\">10.7554/elife.42530</a>.","short":"S. He, M. Vickers, J. Zhang, X. Feng, ELife 8 (2019).","ama":"He S, Vickers M, Zhang J, Feng X. Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. <i>eLife</i>. 2019;8. doi:<a href=\"https://doi.org/10.7554/elife.42530\">10.7554/elife.42530</a>"},"publisher":"eLife Sciences Publications","article_processing_charge":"No","publication_identifier":{"issn":["2050-084X"]},"quality_controlled":"1","day":"28","intvolume":"         8","date_published":"2019-05-28T00:00:00Z","abstract":[{"text":"Transposable elements (TEs), the movement of which can damage the genome, are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis thaliana. However, the extent and mechanism of this activation are unknown. Here we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed DNA demethylation. We further demonstrate that DEMETER access to some of these TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent mechanism. We demonstrate that H1 is required for heterochromatin condensation in plant cells and show that H1 overexpression creates heterochromatic foci in the VC progenitor cell. Taken together, our results demonstrate that the natural depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation, heterochromatin relaxation, and TE activation.","lang":"eng"}],"volume":8,"year":"2019","external_id":{"unknown":["31135340"]},"date_created":"2023-01-16T09:17:21Z","oa_version":"Published Version","language":[{"iso":"eng"}],"publication":"eLife","_id":"12192","title":"Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation","status":"public","scopus_import":"1","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2019_elife_He.pdf","file_id":"12525","creator":"alisjak","success":1,"date_created":"2023-02-07T09:42:46Z","date_updated":"2023-02-07T09:42:46Z","checksum":"ea6b89c20d59e5eb3646916fe5d568ad","file_size":2493837}],"article_type":"original","extern":"1","date_updated":"2025-01-14T14:31:41Z","publication_status":"published","ddc":["580"],"author":[{"first_name":"Shengbo","full_name":"He, Shengbo","last_name":"He"},{"last_name":"Vickers","full_name":"Vickers, Martin","first_name":"Martin"},{"full_name":"Zhang, Jingyi","first_name":"Jingyi","last_name":"Zhang"},{"last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","full_name":"Feng, Xiaoqi"}],"month":"05"},{"date_published":"2019-04-01T00:00:00Z","intvolume":"       149","day":"01","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","citation":{"chicago":"Amberg, Nicole, Susanne Laukoter, and Simon Hippenmeyer. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>.","ieee":"N. Amberg, S. Laukoter, and S. Hippenmeyer, “Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex,” <i>Journal of Neurochemistry</i>, vol. 149, no. 1. Wiley, pp. 12–26, 2019.","apa":"Amberg, N., Laukoter, S., &#38; Hippenmeyer, S. (2019). Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. Wiley. <a href=\"https://doi.org/10.1111/jnc.14601\">https://doi.org/10.1111/jnc.14601</a>","ista":"Amberg N, Laukoter S, Hippenmeyer S. 2019. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 149(1), 12–26.","mla":"Amberg, Nicole, et al. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” <i>Journal of Neurochemistry</i>, vol. 149, no. 1, Wiley, 2019, pp. 12–26, doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>.","short":"N. Amberg, S. Laukoter, S. Hippenmeyer, Journal of Neurochemistry 149 (2019) 12–26.","ama":"Amberg N, Laukoter S, Hippenmeyer S. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. <i>Journal of Neurochemistry</i>. 2019;149(1):12-26. doi:<a href=\"https://doi.org/10.1111/jnc.14601\">10.1111/jnc.14601</a>"},"department":[{"_id":"SiHi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"1","publisher":"Wiley","corr_author":"1","has_accepted_license":"1","acknowledgement":" This work was supported by IST Austria institutional funds; NÖ Forschung und Bildung \r\nn[f+b]   (C13-002)   to   SH;   a   program   grant   from   the   Human   Frontiers   Science   Program (RGP0053/2014)  to SH;  the  People  Programme  (Marie  Curie  Actions)  of  the  European  Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No 618444 to SH, and the  European  Research  Council  (ERC)  under  the  European  Union’s  Horizon  2020  research  and innovation programme (grant agreement No 725780 LinPro)to SH.\r\n","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"doi":"10.1111/jnc.14601","file_date_updated":"2020-07-14T12:45:45Z","type":"journal_article","month":"04","author":[{"id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","last_name":"Amberg","full_name":"Amberg, Nicole","first_name":"Nicole","orcid":"0000-0002-3183-8207"},{"first_name":"Susanne","orcid":"0000-0002-7903-3010","full_name":"Laukoter, Susanne","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","last_name":"Laukoter"},{"full_name":"Hippenmeyer, Simon","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer"}],"ddc":["570"],"date_updated":"2025-04-14T07:43:05Z","publication_status":"published","article_type":"review","title":"Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex","status":"public","file":[{"file_id":"7239","creator":"kschuh","file_name":"2019_Wiley_Amberg.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":889709,"checksum":"db027721a95d36f5de36aadcd0bdf7e6","date_updated":"2020-07-14T12:45:45Z","date_created":"2020-01-07T13:35:52Z"}],"scopus_import":"1","_id":"27","publication":"Journal of Neurochemistry","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:44:14Z","external_id":{"isi":["000462680200002"]},"isi":1,"volume":149,"project":[{"name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain","_id":"25D92700-B435-11E9-9278-68D0E5697425","grant_number":"LS13-002"},{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014"},{"_id":"25D61E48-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Molecular Mechanisms of Cerebral Cortex Development","grant_number":"618444"},{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020"}],"year":"2019","abstract":[{"lang":"eng","text":"The cerebral cortex is composed of a large variety of distinct cell-types including projection neurons, interneurons and glial cells which emerge from distinct neural stem cell (NSC) lineages. The vast majority of cortical projection neurons and certain classes of glial cells are generated by radial glial progenitor cells (RGPs) in a highly orchestrated manner. Recent studies employing single cell analysis and clonal lineage tracing suggest that NSC and RGP lineage progression are regulated in a profound deterministic manner. In this review we focus on recent advances based mainly on correlative phenotypic data emerging from functional genetic studies in mice. We establish hypotheses to test in future research and outline a conceptual framework how epigenetic cues modulate the generation of cell-type diversity during cortical development. This article is protected by copyright. All rights reserved."}],"ec_funded":1,"page":"12-26"},{"abstract":[{"lang":"eng","text":"A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense."}],"page":"995-1012","year":"2019","isi":1,"volume":129,"external_id":{"isi":["000458945300012"],"arxiv":["1611.04177"]},"date_created":"2018-12-11T11:45:42Z","oa_version":"Preprint","_id":"301","publication":"Stochastic Processes and their Applications","language":[{"iso":"eng"}],"article_type":"original","scopus_import":"1","status":"public","title":"A Feynman–Kac formula for stochastic Dirichlet problems","publication_status":"published","date_updated":"2023-08-24T14:20:49Z","author":[{"first_name":"Mate","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser"},{"first_name":"István","full_name":"Gyöngy, István","last_name":"Gyöngy"}],"month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.04177"}],"type":"journal_article","oa":1,"doi":"10.1016/j.spa.2018.04.003","issue":"3","publisher":"Elsevier","citation":{"ista":"Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012.","chicago":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>.","apa":"Gerencser, M., &#38; Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and Their Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">https://doi.org/10.1016/j.spa.2018.04.003</a>","ieee":"M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” <i>Stochastic Processes and their Applications</i>, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019.","mla":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” <i>Stochastic Processes and Their Applications</i>, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>.","short":"M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012.","ama":"Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. <i>Stochastic Processes and their Applications</i>. 2019;129(3):995-1012. doi:<a href=\"https://doi.org/10.1016/j.spa.2018.04.003\">10.1016/j.spa.2018.04.003</a>"},"department":[{"_id":"JaMa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","day":"01","arxiv":1,"quality_controlled":"1","date_published":"2019-03-01T00:00:00Z","intvolume":"       129"},{"publisher":"Wiley","issue":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Bian T, Chu Z, Klajn R. The many ways to assemble nanoparticles using light. <i>Advanced Materials</i>. 2019;32(20). doi:<a href=\"https://doi.org/10.1002/adma.201905866\">10.1002/adma.201905866</a>","short":"T. Bian, Z. Chu, R. Klajn, Advanced Materials 32 (2019).","mla":"Bian, Tong, et al. “The Many Ways to Assemble Nanoparticles Using Light.” <i>Advanced Materials</i>, vol. 32, no. 20, 1905866, Wiley, 2019, doi:<a href=\"https://doi.org/10.1002/adma.201905866\">10.1002/adma.201905866</a>.","chicago":"Bian, Tong, Zonglin Chu, and Rafal Klajn. “The Many Ways to Assemble Nanoparticles Using Light.” <i>Advanced Materials</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/adma.201905866\">https://doi.org/10.1002/adma.201905866</a>.","apa":"Bian, T., Chu, Z., &#38; Klajn, R. (2019). The many ways to assemble nanoparticles using light. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201905866\">https://doi.org/10.1002/adma.201905866</a>","ieee":"T. Bian, Z. Chu, and R. Klajn, “The many ways to assemble nanoparticles using light,” <i>Advanced Materials</i>, vol. 32, no. 20. Wiley, 2019.","ista":"Bian T, Chu Z, Klajn R. 2019. The many ways to assemble nanoparticles using light. Advanced Materials. 32(20), 1905866."},"article_processing_charge":"No","publication_identifier":{"issn":["0935-9648"],"eissn":["1521-4095"]},"quality_controlled":"1","day":"19","intvolume":"        32","date_published":"2019-11-19T00:00:00Z","type":"journal_article","pmid":1,"doi":"10.1002/adma.201905866","article_number":"1905866","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"publication":"Advanced Materials","language":[{"iso":"eng"}],"_id":"13366","scopus_import":"1","status":"public","title":"The many ways to assemble nanoparticles using light","extern":"1","article_type":"original","publication_status":"published","date_updated":"2024-10-14T12:13:25Z","author":[{"last_name":"Bian","full_name":"Bian, Tong","first_name":"Tong"},{"full_name":"Chu, Zonglin","first_name":"Zonglin","last_name":"Chu"},{"last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","full_name":"Klajn, Rafal"}],"month":"11","abstract":[{"text":"The ability to reversibly assemble nanoparticles using light is both fundamentally interesting and important for applications ranging from reversible data storage to controlled drug delivery. Here, the diverse approaches that have so far been developed to control the self-assembly of nanoparticles using light are reviewed and compared. These approaches include functionalizing nanoparticles with monolayers of photoresponsive molecules, placing them in photoresponsive media capable of reversibly protonating the particles under light, and decorating plasmonic nanoparticles with thermoresponsive polymers, to name just a few. The applicability of these methods to larger, micrometer-sized particles is also discussed. Finally, several perspectives on further developments in the field are offered.","lang":"eng"}],"year":"2019","volume":32,"external_id":{"pmid":["31709655"]},"date_created":"2023-08-01T09:37:26Z","oa_version":"None"},{"publisher":"Beilstein Institut","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Hanopolskyi AI, De S, Białek MJ, et al. Reversible switching of arylazopyrazole within a metal–organic cage. <i>Beilstein Journal of Organic Chemistry</i>. 2019;15:2398-2407. doi:<a href=\"https://doi.org/10.3762/bjoc.15.232\">10.3762/bjoc.15.232</a>","short":"A.I. Hanopolskyi, S. De, M.J. Białek, Y. Diskin-Posner, L. Avram, M. Feller, R. Klajn, Beilstein Journal of Organic Chemistry 15 (2019) 2398–2407.","mla":"Hanopolskyi, Anton I., et al. “Reversible Switching of Arylazopyrazole within a Metal–Organic Cage.” <i>Beilstein Journal of Organic Chemistry</i>, vol. 15, Beilstein Institut, 2019, pp. 2398–407, doi:<a href=\"https://doi.org/10.3762/bjoc.15.232\">10.3762/bjoc.15.232</a>.","ista":"Hanopolskyi AI, De S, Białek MJ, Diskin-Posner Y, Avram L, Feller M, Klajn R. 2019. Reversible switching of arylazopyrazole within a metal–organic cage. Beilstein Journal of Organic Chemistry. 15, 2398–2407.","apa":"Hanopolskyi, A. I., De, S., Białek, M. J., Diskin-Posner, Y., Avram, L., Feller, M., &#38; Klajn, R. (2019). Reversible switching of arylazopyrazole within a metal–organic cage. <i>Beilstein Journal of Organic Chemistry</i>. Beilstein Institut. <a href=\"https://doi.org/10.3762/bjoc.15.232\">https://doi.org/10.3762/bjoc.15.232</a>","chicago":"Hanopolskyi, Anton I, Soumen De, Michał J Białek, Yael Diskin-Posner, Liat Avram, Moran Feller, and Rafal Klajn. “Reversible Switching of Arylazopyrazole within a Metal–Organic Cage.” <i>Beilstein Journal of Organic Chemistry</i>. Beilstein Institut, 2019. <a href=\"https://doi.org/10.3762/bjoc.15.232\">https://doi.org/10.3762/bjoc.15.232</a>.","ieee":"A. I. Hanopolskyi <i>et al.</i>, “Reversible switching of arylazopyrazole within a metal–organic cage,” <i>Beilstein Journal of Organic Chemistry</i>, vol. 15. Beilstein Institut, pp. 2398–2407, 2019."},"article_processing_charge":"No","publication_identifier":{"eissn":["1860-5397"]},"quality_controlled":"1","day":"10","intvolume":"        15","date_published":"2019-10-10T00:00:00Z","type":"journal_article","pmid":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.3762/bjoc.15.232"}],"doi":"10.3762/bjoc.15.232","oa":1,"keyword":["Organic Chemistry"],"publication":"Beilstein Journal of Organic Chemistry","language":[{"iso":"eng"}],"_id":"13369","status":"public","scopus_import":"1","title":"Reversible switching of arylazopyrazole within a metal–organic cage","extern":"1","article_type":"original","publication_status":"published","date_updated":"2024-10-14T12:13:46Z","month":"10","author":[{"last_name":"Hanopolskyi","first_name":"Anton I","full_name":"Hanopolskyi, Anton I"},{"last_name":"De","first_name":"Soumen","full_name":"De, Soumen"},{"last_name":"Białek","full_name":"Białek, Michał J","first_name":"Michał J"},{"full_name":"Diskin-Posner, Yael","first_name":"Yael","last_name":"Diskin-Posner"},{"last_name":"Avram","full_name":"Avram, Liat","first_name":"Liat"},{"first_name":"Moran","full_name":"Feller, Moran","last_name":"Feller"},{"last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","full_name":"Klajn, Rafal"}],"page":"2398-2407","abstract":[{"lang":"eng","text":"Arylazopyrazoles represent a new family of molecular photoswitches characterized by a near-quantitative conversion between two states and long thermal half-lives of the metastable state. Here, we investigated the behavior of a model arylazopyrazole in the presence of a self-assembled cage based on Pd–imidazole coordination. Owing to its high water solubility, the cage can solubilize the E isomer of arylazopyrazole, which, by itself, is not soluble in water. NMR spectroscopy and X-ray crystallography have independently demonstrated that each cage can encapsulate two molecules of E-arylazopyrazole. UV-induced switching to the Z isomer was accompanied by the release of one of the two guests from the cage and the formation of a 1:1 cage/Z-arylazopyrazole inclusion complex. DFT calculations suggest that this process involves a dramatic change in the conformation of the cage. Back-isomerization was induced with green light and resulted in the initial 1:2 cage/E-arylazopyrazole complex. This back-isomerization reaction also proceeded in the dark, with a rate significantly higher than in the absence of the cage."}],"year":"2019","volume":15,"date_created":"2023-08-01T09:38:06Z","external_id":{"pmid":["31666874"]},"oa_version":"Published Version"},{"oa_version":"None","external_id":{"pmid":["31539469"]},"date_created":"2023-08-01T09:38:23Z","volume":19,"year":"2019","abstract":[{"lang":"eng","text":"Efficient isomerization of photochromic molecules often requires conformational freedom and is typically not available under solvent-free conditions. Here, we report a general methodology allowing for reversible switching of such molecules on the surfaces of solid materials. Our method is based on dispersing photochromic compounds within polysilsesquioxane nanowire networks (PNNs), which can be fabricated as transparent, highly porous, micrometer-thick layers on various substrates. We found that azobenzene switching within the PNNs proceeded unusually fast compared with the same molecules in liquid solvents. Efficient isomerization of another photochromic system, spiropyran, from a colorless to a colored form was used to create reversible images in PNN-coated glass. The coloration reaction could be induced with sunlight and is of interest for developing “smart” windows."}],"page":"7106-7111","month":"09","author":[{"full_name":"Chu, Zonglin","first_name":"Zonglin","last_name":"Chu"},{"last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","full_name":"Klajn, Rafal"}],"date_updated":"2024-10-14T12:13:57Z","publication_status":"published","article_type":"original","extern":"1","title":"Polysilsesquioxane nanowire networks as an “Artificial Solvent” for reversible operation of photochromic molecules","scopus_import":"1","status":"public","_id":"13370","publication":"Nano Letters","language":[{"iso":"eng"}],"keyword":["Mechanical Engineering","Condensed Matter Physics","General Materials Science","General Chemistry","Bioengineering"],"doi":"10.1021/acs.nanolett.9b02642","type":"journal_article","pmid":1,"date_published":"2019-09-20T00:00:00Z","intvolume":"        19","day":"20","quality_controlled":"1","publication_identifier":{"eissn":["1530-6992"],"issn":["1530-6984"]},"article_processing_charge":"No","citation":{"ama":"Chu Z, Klajn R. Polysilsesquioxane nanowire networks as an “Artificial Solvent” for reversible operation of photochromic molecules. <i>Nano Letters</i>. 2019;19(10):7106-7111. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.9b02642\">10.1021/acs.nanolett.9b02642</a>","short":"Z. Chu, R. Klajn, Nano Letters 19 (2019) 7106–7111.","mla":"Chu, Zonglin, and Rafal Klajn. “Polysilsesquioxane Nanowire Networks as an ‘Artificial Solvent’ for Reversible Operation of Photochromic Molecules.” <i>Nano Letters</i>, vol. 19, no. 10, American Chemical Society, 2019, pp. 7106–11, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.9b02642\">10.1021/acs.nanolett.9b02642</a>.","chicago":"Chu, Zonglin, and Rafal Klajn. “Polysilsesquioxane Nanowire Networks as an ‘Artificial Solvent’ for Reversible Operation of Photochromic Molecules.” <i>Nano Letters</i>. American Chemical Society, 2019. <a href=\"https://doi.org/10.1021/acs.nanolett.9b02642\">https://doi.org/10.1021/acs.nanolett.9b02642</a>.","ieee":"Z. Chu and R. Klajn, “Polysilsesquioxane nanowire networks as an ‘Artificial Solvent’ for reversible operation of photochromic molecules,” <i>Nano Letters</i>, vol. 19, no. 10. American Chemical Society, pp. 7106–7111, 2019.","apa":"Chu, Z., &#38; Klajn, R. (2019). Polysilsesquioxane nanowire networks as an “Artificial Solvent” for reversible operation of photochromic molecules. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.9b02642\">https://doi.org/10.1021/acs.nanolett.9b02642</a>","ista":"Chu Z, Klajn R. 2019. Polysilsesquioxane nanowire networks as an “Artificial Solvent” for reversible operation of photochromic molecules. Nano Letters. 19(10), 7106–7111."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"10","publisher":"American Chemical Society"},{"day":"12","quality_controlled":"1","date_published":"2019-09-12T00:00:00Z","intvolume":"         5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Białek MJ, Klajn R. Diamond grows up. <i>Chem</i>. 2019;5(9):2283-2285. doi:<a href=\"https://doi.org/10.1016/j.chempr.2019.08.012\">10.1016/j.chempr.2019.08.012</a>","short":"M.J. Białek, R. Klajn, Chem 5 (2019) 2283–2285.","mla":"Białek, Michał J., and Rafal Klajn. “Diamond Grows Up.” <i>Chem</i>, vol. 5, no. 9, Elsevier, 2019, pp. 2283–85, doi:<a href=\"https://doi.org/10.1016/j.chempr.2019.08.012\">10.1016/j.chempr.2019.08.012</a>.","ista":"Białek MJ, Klajn R. 2019. Diamond grows up. Chem. 5(9), 2283–2285.","chicago":"Białek, Michał J., and Rafal Klajn. “Diamond Grows Up.” <i>Chem</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.chempr.2019.08.012\">https://doi.org/10.1016/j.chempr.2019.08.012</a>.","ieee":"M. J. Białek and R. Klajn, “Diamond grows up,” <i>Chem</i>, vol. 5, no. 9. Elsevier, pp. 2283–2285, 2019.","apa":"Białek, M. J., &#38; Klajn, R. (2019). Diamond grows up. <i>Chem</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.chempr.2019.08.012\">https://doi.org/10.1016/j.chempr.2019.08.012</a>"},"publisher":"Elsevier","issue":"9","publication_identifier":{"eissn":["2451-9294"],"issn":["2451-9308"]},"article_processing_charge":"No","keyword":["Materials Chemistry","Biochemistry (medical)","General Chemical Engineering","Environmental Chemistry","Biochemistry","General Chemistry"],"main_file_link":[{"url":"https://doi.org/10.1016/j.chempr.2019.08.012","open_access":"1"}],"type":"journal_article","oa":1,"doi":"10.1016/j.chempr.2019.08.012","date_updated":"2024-10-14T12:14:05Z","publication_status":"published","month":"09","author":[{"last_name":"Białek","first_name":"Michał J.","full_name":"Białek, Michał J."},{"last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","full_name":"Klajn, Rafal"}],"_id":"13371","language":[{"iso":"eng"}],"publication":"Chem","article_type":"original","extern":"1","title":"Diamond grows up","scopus_import":"1","status":"public","date_created":"2023-08-01T09:38:38Z","oa_version":"Published Version","abstract":[{"text":"Diamondoid nanoporous crystals represent a synthetically challenging class of materials that typically have been obtained from tetrahedral building blocks. In this issue of Chem, Stoddart and coworkers demonstrate that it is possible to generate diamondoid frameworks from a hexacationic building block lacking a tetrahedral symmetry. These results highlight the great potential of self-assembly for rapidly transforming small molecules into structurally complex functional materials.","lang":"eng"}],"page":"2283-2285","volume":5,"year":"2019"}]