[{"article_number":"48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48","apa":"Henzinger, M. H., Leniowski, D., & Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.48","ieee":"M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” 25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.","ista":"Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.","chicago":"Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.48."},"title":"Dynamic clustering to minimize the sum of radii","article_processing_charge":"No","external_id":{"arxiv":["1707.02577"]},"author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"},{"first_name":"Claire","full_name":"Mathieu, Claire","last_name":"Mathieu"}],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","publication":"25th Annual European Symposium on Algorithms","day":"01","year":"2017","date_created":"2022-08-12T09:58:46Z","date_published":"2017-09-01T00:00:00Z","doi":"10.4230/LIPICS.ESA.2017.48","_id":"11832","status":"public","conference":{"name":"ESA: Annual European Symposium on Algorithms","location":"Vienna, Austria","end_date":"2017-09-06","start_date":"2017-09-04"},"type":"conference","extern":"1","date_updated":"2023-02-16T11:54:12Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\r\n\r\nWe present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem."}],"intvolume":" 87","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.ESA.2017.48"}],"scopus_import":"1","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"volume":87},{"citation":{"ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 0, 470–489.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 0:470–89. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.30.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, vol. 0, pp. 470–489.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:10.1137/1.9781611974782.30","apa":"Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.30","mla":"Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:10.1137/1.9781611974782.30."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"external_id":{"arxiv":["1704.02844"]},"article_processing_charge":"No","title":"Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time","quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","oa":1,"year":"2017","day":"01","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"470 - 489","date_published":"2017-01-01T00:00:00Z","doi":"10.1137/1.9781611974782.30","date_created":"2022-08-16T12:28:27Z","_id":"11874","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","end_date":"2017-01-19","location":"Barcelona, Spain"},"status":"public","date_updated":"2023-02-17T11:54:22Z","extern":"1","abstract":[{"lang":"eng","text":"We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best known worst case update time and the best known amortised update time for this problem, even after allowing for randomisation. Specifically, Bernstein and Stein [ICALP 2015, SODA 2016] have the best known worst case update time. They present a deterministic data structure with approximation ratio (3/2 + ∊) and worst case update time O(m1/4/ ∊2), where m is the number of edges in the graph. In recent past, Gupta and Peng [FOCS 2013] gave a deterministic data structure with approximation ratio (1+ ∊) and worst case update time No known randomised data structure beats the worst case update times of these two results. In contrast, the paper by Onak and Rubinfeld [STOC 2010] gave a randomised data structure with approximation ratio O(1) and amortised update time O(log2 n), where n is the number of nodes in the graph. This was later improved by Baswana, Gupta and Sen [FOCS 2011] and Solomon [FOCS 2016], leading to a randomised date structure with approximation ratio 2 and amortised update time O(1).\r\n\r\nWe bridge the polynomial gap between the worst case and amortised update times for this problem, without using any randomisation. We present a deterministic data structure with approximation ratio (2 + ∊) and worst case update time O(log3 n), for all sufficiently small constants ∊."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1704.02844","open_access":"1"}],"month":"01","publication_identifier":{"eisbn":["978-161197478-2"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":"0"},{"date_updated":"2023-02-21T16:32:01Z","extern":"1","_id":"11873","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Barcelona, Spain","end_date":"2017-01-19","start_date":"2017-01-16"},"status":"public","publication_identifier":{"eisbn":["978-161197478-2"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11889"}]},"abstract":[{"lang":"eng","text":"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time of O(m log12 n) (Kawarabayashi and Thorup [12]) and the best previously known randomized running time of O(mlog3n) (Karger [11]) for this problem, though Karger's algorithm can be further applied to weighted graphs.\r\n\r\nOur approach is using the Kawarabayashi and Tho- rup graph compression technique, which repeatedly finds low-conductance cuts. To find these cuts they use a diffusion-based local algorithm. We use instead a flow- based local algorithm and suitably adjust their framework to work with our flow-based subroutine. Both flow and diffusion based methods have a long history of being applied to finding low conductance cuts. Diffusion algorithms have several variants that are naturally local while it is more complicated to make flow methods local. Some prior work has proven nice properties for local flow based algorithms with respect to improving or cleaning up low conductance cuts. Our flow subroutine, however, is the first that is both local and produces low conductance cuts. Thus, it may be of independent interest."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.01254"}],"month":"01","citation":{"ieee":"M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 1919–1938.","short":"M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.","apa":"Henzinger, M. H., Rao, S., & Wang, D. (2017). Local flow partitioning for faster edge connectivity. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.125","ama":"Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:10.1137/1.9781611974782.125","mla":"Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:10.1137/1.9781611974782.125.","ista":"Henzinger MH, Rao S, Wang D. 2017. Local flow partitioning for faster edge connectivity. 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1919–1938.","chicago":"Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 1919–38. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.125."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"full_name":"Wang, Di","last_name":"Wang","first_name":"Di"}],"external_id":{"arxiv":["1704.01254"]},"article_processing_charge":"No","title":"Local flow partitioning for faster edge connectivity","year":"2017","day":"01","publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1919-1938","date_published":"2017-01-01T00:00:00Z","doi":"10.1137/1.9781611974782.125","date_created":"2022-08-16T12:20:59Z","publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","oa":1},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2022-08-12T09:27:11Z","doi":"10.4230/LIPICS.ESA.2017.44","date_published":"2017-09-01T00:00:00Z","publication":"25th Annual European Symposium on Algorithms","day":"01","year":"2017","article_number":"44","title":"Improved guarantees for vertex sparsification in planar graphs","external_id":{"arxiv":["1702.01136"]},"article_processing_charge":"No","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Goranci, G., Henzinger, M. H., & Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.44","ama":"Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.","short":"G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44.","ista":"Goranci G, Henzinger MH, Peng P. 2017. Improved guarantees for vertex sparsification in planar graphs. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 44.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.44."},"intvolume":" 87","month":"09","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2017.44","open_access":"1"}],"scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Graph Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. Given a weighted graph G=(V,E), and a terminal set K with |K|=k, a quality-q vertex cut sparsifier of G is a graph H with K contained in V_H that preserves the value of minimum cuts separating any bipartition of K, up to a factor of q. We show that planar graphs with all the k terminals lying on the same face admit quality-1 vertex cut sparsifier of size O(k^2) that are also planar. Our result extends to vertex flow and distance sparsifiers. It improves the previous best known bound of O(k^2 2^(2k)) for cut and flow sparsifiers by an exponential factor, and matches an Omega(k^2) lower-bound for this class of graphs.\r\n\r\nWe also study vertex reachability sparsifiers for directed graphs. Given a digraph G=(V,E) and a terminal set K, a vertex reachability sparsifier of G is a digraph H=(V_H,E_H), K contained in V_H that preserves all reachability information among terminal pairs. We introduce the notion of reachability-preserving minors, i.e., we require H to be a minor of G. Among others, for general planar digraphs, we construct reachability-preserving minors of size O(k^2 log^2 k). We complement our upper-bound by showing that there exists an infinite family of acyclic planar digraphs such that any reachability-preserving minor must have Omega(k^2) vertices."}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"11894"}]},"volume":87,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"status":"public","conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2017-09-06","location":"Vienna, Austria","start_date":"2017-09-04"},"type":"conference","_id":"11831","extern":"1","date_updated":"2023-02-21T16:32:16Z"},{"date_updated":"2023-02-21T16:29:58Z","extern":"1","article_type":"original","type":"journal_article","status":"public","_id":"11903","issue":"4","related_material":{"record":[{"relation":"earlier_version","id":"11837","status":"public"}]},"volume":61,"publication_identifier":{"issn":["1432-4350"],"eissn":["1433-0490"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1007/s00224-017-9759-8","open_access":"1"}],"month":"11","intvolume":" 61","abstract":[{"text":"Online social networks allow the collection of large amounts of data about the influence between users connected by a friendship-like relationship. When distributing items among agents forming a social network, this information allows us to exploit network externalities that each agent receives from his neighbors that get the same item. In this paper we consider Friends-of-Friends (2-hop) network externalities, i.e., externalities that not only depend on the neighbors that get the same item but also on neighbors of neighbors. For these externalities we study a setting where multiple different items are assigned to unit-demand agents. Specifically, we study the problem of welfare maximization under different types of externality functions. Let n be the number of agents and m be the number of items. Our contributions are the following: (1) We show that welfare maximization is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop) externalities it is NP-hard to approximate social welfare better than (1−1/e). (2) On the positive side we present (i) an 𝑂(𝑛√)-approximation algorithm for general concave externality functions, (ii) an O(log m)-approximation algorithm for linear externality functions, and (iii) a 518(1−1/𝑒)-approximation algorithm for 2-hop step function externalities. We also improve the result from [7] for 1-hop step function externalities by giving a 12(1−1/𝑒)-approximation algorithm.","lang":"eng"}],"oa_version":"Published Version","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"article_processing_charge":"No","title":"Welfare maximization with friends-of-friends network externalities","citation":{"mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems, vol. 61, no. 4, Springer Nature, 2017, pp. 948–86, doi:10.1007/s00224-017-9759-8.","short":"S. Bhattacharya, W. Dvořák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.","ieee":"S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.","ama":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 2017;61(4):948-986. doi:10.1007/s00224-017-9759-8","apa":"Bhattacharya, S., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. Springer Nature. https://doi.org/10.1007/s00224-017-9759-8","chicago":"Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems. Springer Nature, 2017. https://doi.org/10.1007/s00224-017-9759-8.","ista":"Bhattacharya S, Dvořák W, Henzinger MH, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"948-986","date_published":"2017-11-01T00:00:00Z","doi":"10.1007/s00224-017-9759-8","date_created":"2022-08-17T11:14:12Z","year":"2017","day":"01","publication":"Theory of Computing Systems","quality_controlled":"1","publisher":"Springer Nature","oa":1},{"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":79,"issue":"3","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed."}],"intvolume":" 79","month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"scopus_import":1,"date_updated":"2021-01-12T06:48:58Z","department":[{"_id":"NiBa"}],"_id":"1191","status":"public","type":"journal_article","publication":"Bulletin of Mathematical Biology","day":"01","year":"2017","date_created":"2018-12-11T11:50:38Z","doi":"10.1007/s11538-016-0244-3","date_published":"2017-03-01T00:00:00Z","page":"525-559","acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","oa":1,"publisher":"Springer","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017."},"title":"Existence of traveling waves for the generalized F–KPP equation","author":[{"last_name":"Kollár","full_name":"Kollár, Richard","first_name":"Richard"},{"last_name":"Novak","full_name":"Novak, Sebastian","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"6160","project":[{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}]},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2062-249X"],"eissn":["2063-0212"]},"publication_status":"published","issue":"3-4","volume":7,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The way organic multistep synthesis is performed is changing due to the adoption of flow chemical techniques, which has enabled the development of improved methods to make complex molecules. The modular nature of the technique provides not only access to target molecules via linear flow approaches but also for the targeting of structural cores with single systems. This perspective article summarizes the state of the art of continuous multistep synthesis and discusses the main challenges and opportunities in this area."}],"month":"09","intvolume":" 7","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1556/1846.2017.00016","open_access":"1"}],"extern":"1","date_updated":"2023-02-21T10:10:02Z","_id":"11976","status":"public","type":"journal_article","article_type":"original","day":"01","publication":"Journal of Flow Chemistry","year":"2017","date_published":"2017-09-01T00:00:00Z","doi":"10.1556/1846.2017.00016","date_created":"2022-08-25T10:47:51Z","page":"129-136","publisher":"AKJournals","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry. AKJournals, 2017. https://doi.org/10.1556/1846.2017.00016.","ista":"Pieber B, Gilmore K, Seeberger PH. 2017. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 7(3–4), 129–136.","mla":"Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” Journal of Flow Chemistry, vol. 7, no. 3–4, AKJournals, 2017, pp. 129–36, doi:10.1556/1846.2017.00016.","ama":"Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. 2017;7(3-4):129-136. doi:10.1556/1846.2017.00016","apa":"Pieber, B., Gilmore, K., & Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. Journal of Flow Chemistry. AKJournals. https://doi.org/10.1556/1846.2017.00016","ieee":"B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” Journal of Flow Chemistry, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017.","short":"B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136."},"title":"Integrated flow processing - challenges in continuous multistep synthesis","author":[{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","last_name":"Pieber"},{"first_name":"Kerry","last_name":"Gilmore","full_name":"Gilmore, Kerry"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."}],"article_processing_charge":"No"},{"title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","author":[{"last_name":"Budanur","full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"publist_id":"6136","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:10.1007/s10955-016-1672-z.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z","apa":"Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655."},"oa":1,"quality_controlled":"1","publisher":"Springer","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","date_created":"2018-12-11T11:50:44Z","date_published":"2017-05-01T00:00:00Z","doi":"10.1007/s10955-016-1672-z","page":"636-655","publication":"Journal of Statistical Physics","day":"01","year":"2017","has_accepted_license":"1","pubrep_id":"782","status":"public","type":"journal_article","_id":"1211","file_date_updated":"2020-07-14T12:44:39Z","department":[{"_id":"BjHo"}],"ddc":["530"],"date_updated":"2021-01-12T06:49:07Z","intvolume":" 167","month":"05","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here."}],"volume":167,"issue":"3-4","language":[{"iso":"eng"}],"file":[{"file_id":"5319","checksum":"3e971d09eb167761aa0888ed415b0056","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:18:01Z","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","date_updated":"2020-07-14T12:44:39Z","file_size":2820207,"creator":"system"}],"publication_status":"published"},{"acknowledgement":"A.S. acknowledges funding from the Delta Institute for Theoretical Physics and the hospitality of the IBS Center for Theoretical Physics of Complex Systems, Daejeon, South Korea. We acknowledge funding from the Netherlands Organisation for Scientific Research through grants VICI No. NWO-680-47-609 (M.v.H. and S.R.W.), VENI No. NWO-680-47-445 (C.C.) and VENI No. NWO-680-47-453 (S.R.W.).","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"day":"24","publication":"Nature Physics","year":"2017","doi":"10.1038/nphys4194","date_published":"2017-07-24T00:00:00Z","date_created":"2018-12-11T11:44:45Z","page":"1095 - 1099","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Waitukaitis, Scott R, Antal Zuiderwijk, Anton Souslov, Corentin Coulais, and Martin Van Hecke. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics. Nature Publishing Group, 2017. https://doi.org/10.1038/nphys4194.","ista":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. 2017. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 13(11), 1095–1099.","mla":"Waitukaitis, Scott R., et al. “Coupling the Leidenfrost Effect and Elastic Deformations to Power Sustained Bouncing.” Nature Physics, vol. 13, no. 11, Nature Publishing Group, 2017, pp. 1095–99, doi:10.1038/nphys4194.","short":"S.R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, M. Van Hecke, Nature Physics 13 (2017) 1095–1099.","ieee":"S. R. Waitukaitis, A. Zuiderwijk, A. Souslov, C. Coulais, and M. Van Hecke, “Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing,” Nature Physics, vol. 13, no. 11. Nature Publishing Group, pp. 1095–1099, 2017.","ama":"Waitukaitis SR, Zuiderwijk A, Souslov A, Coulais C, Van Hecke M. Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. 2017;13(11):1095-1099. doi:10.1038/nphys4194","apa":"Waitukaitis, S. R., Zuiderwijk, A., Souslov, A., Coulais, C., & Van Hecke, M. (2017). Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/nphys4194"},"title":"Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing","author":[{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zuiderwijk","full_name":"Zuiderwijk, Antal","first_name":"Antal"},{"last_name":"Souslov","full_name":"Souslov, Anton","first_name":"Anton"},{"last_name":"Coulais","full_name":"Coulais, Corentin","first_name":"Corentin"},{"first_name":"Martin","full_name":"Van Hecke, Martin","last_name":"Van Hecke"}],"publist_id":"7931","external_id":{"arxiv":["1705.03530"]},"oa_version":"Preprint","abstract":[{"text":"The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics.","lang":"eng"}],"month":"07","intvolume":" 13","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.03530"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":13,"issue":"11","_id":"123","status":"public","type":"journal_article","extern":"1","date_updated":"2021-01-12T06:49:14Z"},{"publication":"19th International Conference on Integer Programming and Combinatorial Optimization","day":"24","year":"2017","date_created":"2023-02-20T07:52:31Z","date_published":"2017-05-24T00:00:00Z","doi":"10.1007/978-3-319-59250-3_8","page":"86-98","oa":1,"publisher":"Springer Nature","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In 19th International Conference on Integer Programming and Combinatorial Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.","ieee":"S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: 19th International Conference on Integer Programming and Combinatorial Optimization. Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8","apa":"Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In 19th International Conference on Integer Programming and Combinatorial Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-319-59250-3_8","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8."},"title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","external_id":{"arxiv":["1611.00198"]},"article_processing_charge":"No","author":[{"first_name":"Sayan","full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya"},{"full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty","first_name":"Deeparnab"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783319592497"],"issn":["0302-9743","1611-3349"],"eisbn":["9783319592503"]},"volume":10328,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices."}],"intvolume":" 10328","month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00198"}],"scopus_import":"1","alternative_title":["LNCS"],"extern":"1","date_updated":"2023-02-20T07:57:24Z","_id":"12571","status":"public","conference":{"name":"IPCO: Integer Programming and Combinatorial Optimization","start_date":"2017-06-26","end_date":"2017-06-28","location":"Waterloo, ON, Canada"},"type":"conference"},{"oa_version":"Published Version","abstract":[{"text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth.","lang":"eng"}],"month":"01","intvolume":" 21","scopus_import":1,"file":[{"file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","date_created":"2019-10-24T10:54:37Z","file_size":573623,"date_updated":"2019-10-24T10:54:37Z","creator":"dernst","success":1,"file_id":"6967","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1","related_material":{"record":[{"relation":"earlier_version","id":"1164","status":"public"},{"relation":"earlier_version","status":"public","id":"1595"}]},"volume":21,"ec_funded":1,"_id":"1113","status":"public","article_type":"original","type":"journal_article","ddc":["510"],"date_updated":"2023-02-23T10:05:57Z","department":[{"_id":"UlWa"}],"file_date_updated":"2019-10-24T10:54:37Z","publisher":"Brown University","quality_controlled":"1","oa":1,"day":"01","publication":"Journal of Graph Algorithms and Applications","has_accepted_license":"1","year":"2017","doi":"10.7155/jgaa.00408","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:50:13Z","page":"135 - 154","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408."},"title":"Hanani-Tutte for radial planarity","publist_id":"6254","author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"first_name":"Michael","last_name":"Pelsmajer","full_name":"Pelsmajer, Michael"},{"first_name":"Marcus","full_name":"Schaefer, Marcus","last_name":"Schaefer"}],"external_id":{"arxiv":["1608.08662"]},"article_processing_charge":"No"},{"date_published":"2017-06-19T00:00:00Z","doi":"10.1093/imrn/rnx116","date_created":"2018-12-11T11:44:59Z","day":"19","publication":"International Mathematics Research Notices","language":[{"iso":"eng"}],"year":"2017","publication_status":"published","month":"06","publisher":"Oxford University Press","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.06097"}],"oa":1,"oa_version":"None","abstract":[{"lang":"eng","text":"We show that a twisted variant of Linnik’s conjecture on sums of Kloosterman sums leads to an optimal covering exponent for S3."}],"title":"Twisted Linnik implies optimal covering exponent for S3","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning"},{"first_name":"Vinay","full_name":"Kumaraswamy, Vinay","last_name":"Kumaraswamy"},{"first_name":"Rapael","last_name":"Steiner","full_name":"Steiner, Rapael"}],"publist_id":"7752","external_id":{"arxiv":["1609.06097"]},"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:32Z","citation":{"ista":"Browning TD, Kumaraswamy V, Steiner R. 2017. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices.","chicago":"Browning, Timothy D, Vinay Kumaraswamy, and Rapael Steiner. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx116.","ieee":"T. D. Browning, V. Kumaraswamy, and R. Steiner, “Twisted Linnik implies optimal covering exponent for S3,” International Mathematics Research Notices. Oxford University Press, 2017.","short":"T.D. Browning, V. Kumaraswamy, R. Steiner, International Mathematics Research Notices (2017).","apa":"Browning, T. D., Kumaraswamy, V., & Steiner, R. (2017). Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx116","ama":"Browning TD, Kumaraswamy V, Steiner R. Twisted Linnik implies optimal covering exponent for S3. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx116","mla":"Browning, Timothy D., et al. “Twisted Linnik Implies Optimal Covering Exponent for S3.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx116."},"status":"public","type":"journal_article","_id":"169"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"ista":"Browning TD, Schindler D. 2017. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices.","chicago":"Browning, Timothy D, and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices. Oxford University Press, 2017. https://doi.org/10.1093/imrn/rnx252.","ieee":"T. D. Browning and D. Schindler, “Strong approximation and a conjecture of Harpaz and Wittenberg,” International Mathematics Research Notices. Oxford University Press, 2017.","short":"T.D. Browning, D. Schindler, International Mathematics Research Notices (2017).","apa":"Browning, T. D., & Schindler, D. (2017). Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnx252","ama":"Browning TD, Schindler D. Strong approximation and a conjecture of Harpaz and Wittenberg. International Mathematics Research Notices. 2017. doi:10.1093/imrn/rnx252","mla":"Browning, Timothy D., and Damaris Schindler. “Strong Approximation and a Conjecture of Harpaz and Wittenberg.” International Mathematics Research Notices, Oxford University Press, 2017, doi:10.1093/imrn/rnx252."},"date_updated":"2021-01-12T06:52:45Z","title":"Strong approximation and a conjecture of Harpaz and Wittenberg","external_id":{"arxiv":["1509.07744"]},"article_processing_charge":"No","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"first_name":"Damaris","full_name":"Schindler, Damaris","last_name":"Schindler"}],"publist_id":"7749","_id":"172","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication":"International Mathematics Research Notices","day":"30","year":"2017","publication_status":"published","date_created":"2018-12-11T11:45:00Z","date_published":"2017-10-30T00:00:00Z","doi":"10.1093/imrn/rnx252","oa_version":"None","abstract":[{"text":"We study strong approximation for some algebraic varieties over ℚ which are defined using norm forms. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.","lang":"eng"}],"month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1509.07744","open_access":"1"}],"oa":1,"publisher":"Oxford University Press","quality_controlled":"1"},{"type":"journal_article","status":"public","_id":"393","publist_id":"7436","author":[{"first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"},{"first_name":"Edbert","last_name":"Sie","full_name":"Sie, Edbert"},{"full_name":"Mahmood, Fahad","last_name":"Mahmood","first_name":"Fahad"},{"last_name":"Cao","full_name":"Cao, Gang","first_name":"Gang"},{"full_name":"Gedik, Nuh","last_name":"Gedik","first_name":"Nuh"}],"title":"Origin of the exciton mass in the frustrated Mott insulator Na2IrO3","citation":{"mla":"Alpichshev, Zhanybek, et al. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B, vol. 96, no. 23, American Physical Society, 2017, doi:10.1103/PhysRevB.96.235141.","ieee":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, and N. Gedik, “Origin of the exciton mass in the frustrated Mott insulator Na2IrO3,” Physical Review B, vol. 96, no. 23. American Physical Society, 2017.","short":"Z. Alpichshev, E. Sie, F. Mahmood, G. Cao, N. Gedik, Physical Review B 96 (2017).","ama":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 2017;96(23). doi:10.1103/PhysRevB.96.235141","apa":"Alpichshev, Z., Sie, E., Mahmood, F., Cao, G., & Gedik, N. (2017). Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.235141","chicago":"Alpichshev, Zhanybek, Edbert Sie, Fahad Mahmood, Gang Cao, and Nuh Gedik. “Origin of the Exciton Mass in the Frustrated Mott Insulator Na2IrO3.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.235141.","ista":"Alpichshev Z, Sie E, Mahmood F, Cao G, Gedik N. 2017. Origin of the exciton mass in the frustrated Mott insulator Na2IrO3. Physical Review B. 96(23)."},"date_updated":"2021-01-12T07:53:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","oa":1,"main_file_link":[{"url":"http://dspace.mit.edu/handle/1721.1/114259","open_access":"1"}],"publisher":"American Physical Society","intvolume":" 96","month":"12","abstract":[{"text":"We use a three-pulse ultrafast optical spectroscopy to study the relaxation processes in a frustrated Mott insulator Na2IrO3. By being able to independently produce the out-of-equilibrium bound states (excitons) of doublons and holons with the first pulse and suppress the underlying antiferromagnetic order with the second one, we were able to elucidate the relaxation mechanism of quasiparticles in this system. By observing the difference in the exciton dynamics in the magnetically ordered and disordered phases we found that the mass of this quasiparticle is mostly determined by its interaction with the surrounding spins. ","lang":"eng"}],"acknowledgement":"Z.A. gratefully acknowledges discussions with P. A. Lee and A. Kemper. A conversation with J. Zaanen was instrumental in clarifying the physical picture described in this paper. We would also like to thank A. Kogar for thoroughly reading the manuscript and making valuable comments. This work was supported by Army Research Office Grant No. W911NF-15-1-0128 and Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4540 (time resolved optical spectroscopy), Skoltech, as part of the Skoltech NGP program (theory) and National Science Foundation Grant No. DMR-1265162 (material growth).\r\n\r\n","oa_version":"None","date_created":"2018-12-11T11:46:13Z","issue":"23","doi":"10.1103/PhysRevB.96.235141","volume":96,"date_published":"2017-12-26T00:00:00Z","year":"2017","publication_status":"published","publication":"Physical Review B","language":[{"iso":"eng"}],"day":"26"},{"title":"Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ","publist_id":"7437","author":[{"first_name":"Inna","full_name":"Vishik, Inna","last_name":"Vishik"},{"full_name":"Mahmood, Fahad","last_name":"Mahmood","first_name":"Fahad"},{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek","last_name":"Alpichshev","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek"},{"first_name":"Nuh","last_name":"Gedik","full_name":"Gedik, Nuh"},{"last_name":"Higgins","full_name":"Higgins, Joshu","first_name":"Joshu"},{"last_name":"Greene","full_name":"Greene, Richard","first_name":"Richard"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, and R. Greene, “Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ,” Physical Review B, vol. 95, no. 11. American Physical Society, 2017.","short":"I. Vishik, F. Mahmood, Z. Alpichshev, N. Gedik, J. Higgins, R. Greene, Physical Review B 95 (2017).","apa":"Vishik, I., Mahmood, F., Alpichshev, Z., Gedik, N., Higgins, J., & Greene, R. (2017). Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.95.115125","ama":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 2017;95(11). doi:10.1103/PhysRevB.95.115125","mla":"Vishik, Inna, et al. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B, vol. 95, no. 11, American Physical Society, 2017, doi:10.1103/PhysRevB.95.115125.","ista":"Vishik I, Mahmood F, Alpichshev Z, Gedik N, Higgins J, Greene R. 2017. Ultrafast dynamics in the presence of antiferromagnetic correlations in electron doped cuprate La2 xCexCuO4±δ. Physical Review B. 95(11).","chicago":"Vishik, Inna, Fahad Mahmood, Zhanybek Alpichshev, Nuh Gedik, Joshu Higgins, and Richard Greene. “Ultrafast Dynamics in the Presence of Antiferromagnetic Correlations in Electron Doped Cuprate La2 XCexCuO4±δ.” Physical Review B. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.95.115125."},"date_updated":"2021-01-12T07:53:12Z","status":"public","type":"journal_article","_id":"392","volume":95,"doi":"10.1103/PhysRevB.95.115125","issue":"11","date_published":"2017-03-13T00:00:00Z","date_created":"2018-12-11T11:46:13Z","day":"13","language":[{"iso":"eng"}],"publication":"Physical Review B","publication_status":"published","year":"2017","month":"03","intvolume":" 95","publisher":"American Physical Society","oa":1,"main_file_link":[{"open_access":"1","url":"http://dspace.mit.edu/handle/1721.1/109835"}],"oa_version":"None","acknowledgement":"Optical pump-probe work was supported by the Gordon and Betty Moore Foundation's EPiQS initiative through Grant No. GBMF4540. Materials growth and characterization was supported by AFOSR FA95501410332 and NSF DMR1410665.","abstract":[{"lang":"eng","text":"We used femtosecond optical pump-probe spectroscopy to study the photoinduced change in reflectivity of thin films of the electron-doped cuprate La2-xCexCuO4 (LCCO) with dopings of x=0.08 (underdoped) and x=0.11 (optimally doped). Above Tc, we observe fluence-dependent relaxation rates that begin at a temperature similar to the one where transport measurements first show signatures of antiferromagnetic correlations. Upon suppressing superconductivity with a magnetic field, it is found that the fluence and temperature dependence of relaxation rates are consistent with bimolecular recombination of electrons and holes across a gap (2ΔAF) originating from antiferromagnetic correlations which comprise the pseudogap in electron-doped cuprates. This can be used to learn about coupling between electrons and high-energy (ω>2ΔAF) excitations in these compounds and set limits on the time scales on which antiferromagnetic correlations are static."}]},{"year":"2017","has_accepted_license":"1","publication":"Cancer & Metabolism","day":"30","date_created":"2018-12-11T11:46:30Z","doi":"10.1186/s40170-017-0164-1","date_published":"2017-01-30T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"BioMed Central","citation":{"ista":"Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA, Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 5(2).","chicago":"Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1.","ama":"Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1","apa":"Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders, D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1","short":"R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese, M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond, L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer & Metabolism 5 (2017).","ieee":"R. Hardie et al., “Mitochondrial mutations and metabolic adaptation in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central, 2017.","mla":"Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017, doi:10.1186/s40170-017-0164-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Rae","full_name":"Hardie, Rae","last_name":"Hardie"},{"full_name":"Van Dam, Ellen","last_name":"Van Dam","first_name":"Ellen"},{"first_name":"Mark","full_name":"Cowley, Mark","last_name":"Cowley"},{"full_name":"Han, Ting","last_name":"Han","first_name":"Ting"},{"first_name":"Seher","full_name":"Balaban, Seher","last_name":"Balaban"},{"first_name":"Marina","last_name":"Pajic","full_name":"Pajic, Marina"},{"first_name":"Mark","full_name":"Pinese, Mark","last_name":"Pinese"},{"last_name":"Iconomou","full_name":"Iconomou, Mary","first_name":"Mary"},{"last_name":"Shearer","full_name":"Shearer, Robert","first_name":"Robert"},{"first_name":"Jessie","full_name":"Mckenna, Jessie","last_name":"Mckenna"},{"first_name":"David","full_name":"Miller, David","last_name":"Miller"},{"last_name":"Waddell","full_name":"Waddell, Nicola","first_name":"Nicola"},{"first_name":"John","last_name":"Pearson","full_name":"Pearson, John"},{"last_name":"Grimmond","full_name":"Grimmond, Sean","first_name":"Sean"},{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989"},{"first_name":"Andrew","last_name":"Biankin","full_name":"Biankin, Andrew"},{"first_name":"Silas","last_name":"Villas Boas","full_name":"Villas Boas, Silas"},{"first_name":"Andrew","full_name":"Hoy, Andrew","last_name":"Hoy"},{"first_name":"Nigel","last_name":"Turner","full_name":"Turner, Nigel"},{"first_name":"Darren","full_name":"Saunders, Darren","last_name":"Saunders"}],"publist_id":"7380","title":"Mitochondrial mutations and metabolic adaptation in pancreatic cancer","publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":1609174,"date_updated":"2020-07-14T12:46:29Z","file_name":"2017_Cancer_Hardie.pdf","date_created":"2019-01-22T08:17:56Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5868","checksum":"337a65786875f64a1fe9fc0ac24767dc"}],"issue":"2","volume":5,"abstract":[{"lang":"eng","text":"Pancreatic cancer has a five-year survival rate of ~8%, with characteristic molecular heterogeneity and restricted treatment options. Targeting metabolism has emerged as a potentially effective therapeutic strategy for cancers such as pancreatic cancer, which are driven by genetic alterations that are not tractable drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been observed in various tumors types, understanding of metabolic genotype-phenotype relationships is limited."}],"oa_version":"Published Version","intvolume":" 5","month":"01","date_updated":"2021-01-12T07:56:55Z","ddc":["570"],"extern":"1","file_date_updated":"2020-07-14T12:46:29Z","_id":"443","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public"},{"date_updated":"2021-01-12T07:57:03Z","citation":{"chicago":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.","ista":"Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 96(1).","mla":"Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized Phases.” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202.","ieee":"M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American Physical Society, 2017.","short":"M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials Physics 96 (2017).","ama":"Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202","apa":"Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized phases. Physical Review B - Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.014202"},"extern":1,"author":[{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","orcid":"0000-0002-2399-5827","full_name":"Maksym Serbyn","last_name":"Serbyn"},{"full_name":"Abanin, Dimitry A","last_name":"Abanin","first_name":"Dimitry"}],"publist_id":"7378","title":"Loschmidt echo in many body localized phases","_id":"445","type":"journal_article","status":"public","publication_status":"published","year":"2017","publication":"Physical Review B - Condensed Matter and Materials Physics","day":"12","date_created":"2018-12-11T11:46:31Z","date_published":"2017-07-12T00:00:00Z","volume":96,"doi":"10.1103/PhysRevB.96.014202","issue":"1","abstract":[{"lang":"eng","text":"The Loschmidt echo, defined as the overlap between quantum wave function evolved with different Hamiltonians, quantifies the sensitivity of quantum dynamics to perturbations and is often used as a probe of quantum chaos. In this work we consider the behavior of the Loschmidt echo in the many-body localized phase, which is characterized by emergent local integrals of motion and provides a generic example of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt echo decay as a power law in time in the many-body localized phase, in contrast to the exponential decay in few-body ergodic systems. We consider the spin-echo generalization of the Loschmidt echo and argue that the corresponding correlation function saturates to a finite value in localized systems. Slow, power-law decay of fluctuations of such spin-echo-type overlap is related to the operator spreading and is present only in the many-body localized phase, but not in a noninteracting Anderson insulator. While most of the previously considered probes of dephasing dynamics could be understood by approximating physical spin operators with local integrals of motion, the Loschmidt echo and its generalizations crucially depend on the full expansion of the physical operators via local integrals of motion operators, as well as operators which flip local integrals of motion. Hence these probes allow one to get insights into the relation between physical operators and local integrals of motion and access the operator spreading in the many-body localized phase."}],"acknowledgement":"This research was supported in part by the National\nScience Foundation under Grant No. NSF PHY11-25915.\nM.S. was supported by Gordon and Betty Moore Foundation’s\nEPiQS Initiative through Grant No. GBMF4307. D.A. also\nacknowledges support by Swiss National Science Foundation.","main_file_link":[{"url":"https://arxiv.org/abs/1701.07772","open_access":"1"}],"oa":1,"publisher":"American Physical Society","quality_controlled":0,"intvolume":" 96","month":"07"},{"day":"07","publication":"Biophysical Journal","has_accepted_license":"1","year":"2017","doi":"10.1016/j.bpj.2017.09.006","date_published":"2017-11-07T00:00:00Z","date_created":"2018-12-11T11:46:33Z","page":"2055 - 2067","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","quality_controlled":"1","publisher":"Biophysical Society","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006."},"title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","author":[{"first_name":"Todd","last_name":"Fallesen","full_name":"Fallesen, Todd"},{"full_name":"Roostalu, Johanna","last_name":"Roostalu","first_name":"Johanna"},{"id":"459064DC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian F","last_name":"Düllberg","orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F"},{"first_name":"Gunnar","full_name":"Pruessner, Gunnar","last_name":"Pruessner"},{"first_name":"Thomas","last_name":"Surrey","full_name":"Surrey, Thomas"}],"publist_id":"7369","article_processing_charge":"No","file":[{"file_id":"5052","checksum":"99a2474088e20ac74b1882c4fbbb45b1","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","date_created":"2018-12-12T10:14:03Z","file_size":977192,"date_updated":"2020-07-14T12:46:31Z","creator":"system"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":113,"issue":"9","oa_version":"Published Version","abstract":[{"text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor.","lang":"eng"}],"month":"11","intvolume":" 113","ddc":["570"],"date_updated":"2021-01-12T07:59:28Z","file_date_updated":"2020-07-14T12:46:31Z","department":[{"_id":"MaLo"}],"_id":"453","status":"public","pubrep_id":"965","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"date_updated":"2023-02-23T10:08:55Z","ddc":["004"],"file_date_updated":"2020-07-14T12:46:32Z","department":[{"_id":"KrCh"}],"_id":"464","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","pubrep_id":"956","publication_identifier":{"issn":["1860-5974"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5010","checksum":"12d469ae69b80361333d7dead965cf5d","file_size":582940,"date_updated":"2020-07-14T12:46:32Z","creator":"system","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z"}],"language":[{"iso":"eng"}],"issue":"3","related_material":{"record":[{"id":"1661","status":"public","relation":"earlier_version"}]},"volume":13,"license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"oa_version":"Published Version","scopus_import":"1","month":"09","intvolume":" 13","citation":{"chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publist_id":"7357","article_processing_charge":"No","external_id":{"arxiv":["1410.0833"]},"title":"Improved algorithms for parity and Streett objectives","article_number":"26","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","year":"2017","day":"26","publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(3:26)2017","date_published":"2017-09-26T00:00:00Z","date_created":"2018-12-11T11:46:37Z","quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1},{"_id":"470","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-23T12:20:26Z","ddc":["006"],"department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:46:34Z","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 36","month":"07","publication_status":"published","publication_identifier":{"issn":["07300301"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2020-01-24T09:32:35Z","file_name":"wavepackets_final.pdf","date_updated":"2020-07-14T12:46:34Z","file_size":13131683,"creator":"wojtan","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","file_id":"7359","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"ec_funded":1,"issue":"4","volume":36,"article_number":"103","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","publist_id":"7350","author":[{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan","last_name":"Jeschke"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"}],"title":"Water wave packets","oa":1,"quality_controlled":"1","publisher":"ACM","year":"2017","has_accepted_license":"1","publication":"ACM Transactions on Graphics","day":"01","date_created":"2018-12-11T11:46:39Z","date_published":"2017-07-01T00:00:00Z","doi":"10.1145/3072959.3073678"}]