[{"publication_status":"published","external_id":{"arxiv":["1702.01136"]},"language":[{"iso":"eng"}],"year":"2017","related_material":{"record":[{"relation":"later_version","id":"11894","status":"public"}]},"publication":"25th Annual European Symposium on Algorithms","citation":{"apa":"Goranci, G., Henzinger, M., &#38; Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">https://doi.org/10.4230/LIPICS.ESA.2017.44</a>","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">10.4230/LIPICS.ESA.2017.44</a>.","ieee":"G. Goranci, M. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87.","ista":"Goranci G, Henzinger M, 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.","ama":"Goranci G, Henzinger M, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">10.4230/LIPICS.ESA.2017.44</a>","chicago":"Goranci, Gramoz, Monika Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.44\">https://doi.org/10.4230/LIPICS.ESA.2017.44</a>.","short":"G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017."},"conference":{"start_date":"2017-09-04","end_date":"2017-09-06","location":"Vienna, Austria","name":"ESA: Annual European Symposium on Algorithms"},"date_updated":"2024-11-06T11:57:54Z","month":"09","scopus_import":"1","date_created":"2022-08-12T09:27:11Z","volume":87,"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"}],"day":"01","title":"Improved guarantees for vertex sparsification in planar graphs","intvolume":"        87","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"_id":"11831","alternative_title":["LIPIcs"],"date_published":"2017-09-01T00:00:00Z","type":"conference","status":"public","extern":"1","article_processing_charge":"No","article_number":"44","oa":1,"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2017.44"}],"doi":"10.4230/LIPICS.ESA.2017.44","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."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"article_number":"48","doi":"10.4230/LIPICS.ESA.2017.48","main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ESA.2017.48","open_access":"1"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"date_published":"2017-09-01T00:00:00Z","type":"conference","article_processing_charge":"No","status":"public","extern":"1","intvolume":"        87","day":"01","title":"Dynamic clustering to minimize the sum of radii","_id":"11832","publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"volume":87,"scopus_import":"1","date_created":"2022-08-12T09:58:46Z","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Leniowski, Dariusz","last_name":"Leniowski","first_name":"Dariusz"},{"full_name":"Mathieu, Claire","last_name":"Mathieu","first_name":"Claire"}],"date_updated":"2024-11-06T11:59:20Z","month":"09","conference":{"location":"Vienna, Austria","start_date":"2017-09-04","end_date":"2017-09-06","name":"ESA: Annual European Symposium on Algorithms"},"publication":"25th Annual European Symposium on Algorithms","year":"2017","citation":{"apa":"Henzinger, M., Leniowski, D., &#38; Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>","short":"M. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Henzinger, Monika, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>.","mla":"Henzinger, Monika, et al. “Dynamic Clustering to Minimize the Sum of Radii.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>.","ieee":"M. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87.","ama":"Henzinger M, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>","ista":"Henzinger M, 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."},"external_id":{"arxiv":["1707.02577"]},"publication_status":"published","language":[{"iso":"eng"}]},{"oa":1,"article_number":"45","doi":"10.4230/LIPICS.ESA.2017.45","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2017.45"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsification, which is a way to compress large graphs into small ones that well preserve relevant properties among a subset of vertices and has previously mainly been used in the design of approximation algorithms.\r\n\r\nUsing this framework, we obtain a Monte Carlo randomized fully dynamic algorithm for (1 + epsilon)-approximating the energy of electrical flows in n-vertex planar graphs with tilde{O}(r epsilon^{-2}) worst-case update time and tilde{O}((r + n / sqrt{r}) epsilon^{-2}) worst-case query time, for any r larger than some constant. For r=n^{2/3}, this gives tilde{O}(n^{2/3} epsilon^{-2}) update time and tilde{O}(n^{2/3} epsilon^{-2}) query time. We also extend this algorithm to work for minor-free graphs with similar approximation and running time guarantees. Furthermore, we illustrate our framework on the all-pairs max flow and shortest path problems by giving corresponding dynamic algorithms in minor-free graphs with both sublinear update and query times. To the best of our knowledge, our results are the first to systematically establish such a connection between dynamic graph algorithms and vertex sparsification.\r\n\r\nWe also present both upper bound and lower bound for maintaining the energy of electrical flows in the incremental subgraph model, where updates consist of only vertex activations, which might be of independent interest."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        87","title":"The power of vertex sparsifiers in dynamic graph algorithms","day":"01","_id":"11833","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"type":"conference","alternative_title":["LIPIcs"],"date_published":"2017-09-01T00:00:00Z","article_processing_charge":"No","extern":"1","status":"public","month":"09","date_updated":"2024-11-06T11:58:29Z","conference":{"location":"Vienna, Austria","start_date":"2017-09-04","end_date":"2017-09-06","name":"ESA: Annual European Symposium on Algorithms"},"volume":87,"date_created":"2022-08-12T10:46:26Z","scopus_import":"1","author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"Pan","last_name":"Peng","full_name":"Peng, Pan"}],"external_id":{"arxiv":["1712.06473"]},"publication_status":"published","language":[{"iso":"eng"}],"publication":"25th Annual European Symposium on Algorithms","year":"2017","citation":{"short":"G. Goranci, M. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Goranci, Gramoz, Monika Henzinger, and Pan Peng. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">https://doi.org/10.4230/LIPICS.ESA.2017.45</a>.","ama":"Goranci G, Henzinger M, Peng P. The power of vertex sparsifiers in dynamic graph algorithms. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">10.4230/LIPICS.ESA.2017.45</a>","ista":"Goranci G, Henzinger M, Peng P. 2017. The power of vertex sparsifiers in dynamic graph algorithms. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 45.","ieee":"G. Goranci, M. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87.","mla":"Goranci, Gramoz, et al. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">10.4230/LIPICS.ESA.2017.45</a>.","apa":"Goranci, G., Henzinger, M., &#38; Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.45\">https://doi.org/10.4230/LIPICS.ESA.2017.45</a>"}},{"status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-10-01T00:00:00Z","department":[{"_id":"KrPi"}],"_id":"1187","ddc":["000"],"title":"Efficient authentication from hard learning problems","day":"01","ec_funded":1,"intvolume":"        30","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","abstract":[{"lang":"eng","text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol."}],"oa_version":"Submitted Version","has_accepted_license":"1","doi":"10.1007/s00145-016-9247-3","oa":1,"citation":{"ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. 2017;30(4):1238-1275. doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>","ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” <i>Journal of Cryptology</i>, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.","mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &#38; Jain, A. (2017). Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>"},"year":"2017","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3238"}]},"publication":"Journal of Cryptology","language":[{"iso":"eng"}],"publication_status":"published","publist_id":"6166","external_id":{"isi":["000410788600007"]},"article_type":"original","page":"1238 - 1275","file_date_updated":"2020-07-14T12:44:37Z","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Daniele","last_name":"Venturi","full_name":"Venturi, Daniele"},{"last_name":"Cash","first_name":"David","full_name":"Cash, David"},{"last_name":"Jain","first_name":"Abhishek","full_name":"Jain, Abhishek"}],"date_created":"2018-12-11T11:50:37Z","scopus_import":"1","issue":"4","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"},{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"file":[{"access_level":"open_access","checksum":"c647520d115b772a1682fc06fa273eb1","content_type":"application/pdf","file_id":"7843","date_created":"2020-05-14T16:30:17Z","relation":"main_file","file_name":"2017_JournalCrypto_Kiltz.pdf","date_updated":"2020-07-14T12:44:37Z","creator":"dernst","file_size":516959}],"volume":30,"month":"10","isi":1,"date_updated":"2025-04-14T07:22:06Z"},{"date_created":"2022-08-16T12:20:59Z","scopus_import":"1","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"last_name":"Wang","first_name":"Di","full_name":"Wang, Di"}],"page":"1919-1938","month":"01","date_updated":"2024-11-06T12:22:42Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","end_date":"2017-01-19","location":"Barcelona, Spain"},"publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","related_material":{"record":[{"status":"public","id":"11889","relation":"earlier_version"}]},"year":"2017","citation":{"ieee":"M. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Barcelona, Spain, 2017, pp. 1919–1938.","ama":"Henzinger M, Rao S, Wang D. Local flow partitioning for faster edge connectivity. In: <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2017:1919-1938. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.125\">10.1137/1.9781611974782.125</a>","ista":"Henzinger M, 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.","mla":"Henzinger, Monika, et al. “Local Flow Partitioning for Faster Edge Connectivity.” <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2017, pp. 1919–38, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.125\">10.1137/1.9781611974782.125</a>.","chicago":"Henzinger, Monika, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1919–38. Society for Industrial and Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.125\">https://doi.org/10.1137/1.9781611974782.125</a>.","short":"M. 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., Rao, S., &#38; Wang, D. (2017). Local flow partitioning for faster edge connectivity. In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1919–1938). Barcelona, Spain: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611974782.125\">https://doi.org/10.1137/1.9781611974782.125</a>"},"external_id":{"arxiv":["1704.01254"]},"publication_status":"published","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"publisher":"Society for Industrial and Applied Mathematics","oa":1,"doi":"10.1137/1.9781611974782.125","main_file_link":[{"url":"https://arxiv.org/abs/1704.01254","open_access":"1"}],"oa_version":"Preprint","type":"conference","date_published":"2017-01-01T00:00:00Z","article_processing_charge":"No","extern":"1","status":"public","title":"Local flow partitioning for faster edge connectivity","day":"01","_id":"11873","publication_identifier":{"eisbn":["978-161197478-2"]}},{"date_updated":"2024-11-06T12:20:58Z","month":"01","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","end_date":"2017-01-19","location":"Barcelona, Spain"},"volume":"0","scopus_import":"1","date_created":"2022-08-16T12:28:27Z","author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"page":"470 - 489","external_id":{"arxiv":["1704.02844"]},"publication_status":"published","language":[{"iso":"eng"}],"publication":"28th Annual ACM-SIAM Symposium on Discrete Algorithms","year":"2017","citation":{"apa":"Bhattacharya, S., Henzinger, M., &#38; Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611974782.30\">https://doi.org/10.1137/1.9781611974782.30</a>","chicago":"Bhattacharya, Sayan, Monika Henzinger, and Danupon Nanongkai. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” In <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 0:470–89. Society for Industrial and Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.30\">https://doi.org/10.1137/1.9781611974782.30</a>.","short":"S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.","ama":"Bhattacharya S, Henzinger M, Nanongkai D. Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In: <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 0. Society for Industrial and Applied Mathematics; 2017:470-489. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.30\">10.1137/1.9781611974782.30</a>","ista":"Bhattacharya S, Henzinger M, 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.","ieee":"S. Bhattacharya, M. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Barcelona, Spain, 2017, vol. 0, pp. 470–489.","mla":"Bhattacharya, Sayan, et al. “Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in o(Log3 n) Worst Case Update Time.” <i>28th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 0, Society for Industrial and Applied Mathematics, 2017, pp. 470–89, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.30\">10.1137/1.9781611974782.30</a>."},"oa":1,"doi":"10.1137/1.9781611974782.30","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1704.02844","open_access":"1"}],"abstract":[{"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 ∊.","lang":"eng"}],"quality_controlled":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","day":"01","title":"Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time","_id":"11874","publication_identifier":{"eisbn":["978-161197478-2"]},"date_published":"2017-01-01T00:00:00Z","type":"conference","article_processing_charge":"No","status":"public","extern":"1"},{"language":[{"iso":"eng"}],"publication_status":"published","citation":{"chicago":"Bhattacharya, Sayan, Wolfgang Dvořák, Monika Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” <i>Theory of Computing Systems</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00224-017-9759-8\">https://doi.org/10.1007/s00224-017-9759-8</a>.","short":"S. Bhattacharya, W. Dvořák, M. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.","ieee":"S. Bhattacharya, W. Dvořák, M. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” <i>Theory of Computing Systems</i>, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.","ista":"Bhattacharya S, Dvořák W, Henzinger M, Starnberger M. 2017. Welfare maximization with friends-of-friends network externalities. Theory of Computing Systems. 61(4), 948–986.","ama":"Bhattacharya S, Dvořák W, Henzinger M, Starnberger M. Welfare maximization with friends-of-friends network externalities. <i>Theory of Computing Systems</i>. 2017;61(4):948-986. doi:<a href=\"https://doi.org/10.1007/s00224-017-9759-8\">10.1007/s00224-017-9759-8</a>","mla":"Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” <i>Theory of Computing Systems</i>, vol. 61, no. 4, Springer Nature, 2017, pp. 948–86, doi:<a href=\"https://doi.org/10.1007/s00224-017-9759-8\">10.1007/s00224-017-9759-8</a>.","apa":"Bhattacharya, S., Dvořák, W., Henzinger, M., &#38; Starnberger, M. (2017). Welfare maximization with friends-of-friends network externalities. <i>Theory of Computing Systems</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00224-017-9759-8\">https://doi.org/10.1007/s00224-017-9759-8</a>"},"year":"2017","related_material":{"record":[{"status":"public","id":"11837","relation":"earlier_version"}]},"publication":"Theory of Computing Systems","month":"11","date_updated":"2024-11-06T12:24:23Z","page":"948-986","article_type":"original","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"last_name":"Dvořák","first_name":"Wolfgang","full_name":"Dvořák, Wolfgang"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Martin","last_name":"Starnberger","full_name":"Starnberger, Martin"}],"date_created":"2022-08-17T11:14:12Z","scopus_import":"1","issue":"4","volume":61,"publication_identifier":{"eissn":["1433-0490"],"issn":["1432-4350"]},"_id":"11903","title":"Welfare maximization with friends-of-friends network externalities","day":"01","intvolume":"        61","extern":"1","status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-11-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1007/s00224-017-9759-8","open_access":"1"}],"oa_version":"Published Version","doi":"10.1007/s00224-017-9759-8","oa":1,"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","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"}]},{"language":[{"iso":"eng"}],"external_id":{"isi":["000395156200005"],"arxiv":["1607.00944"]},"publist_id":"6160","publication_status":"published","citation":{"apa":"Kollár, R., &#38; Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>.","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>.","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.","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. 2017;79(3):525-559. doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3. Springer, pp. 525–559, 2017."},"publication":"Bulletin of Mathematical Biology","year":"2017","isi":1,"month":"03","date_updated":"2025-09-22T09:44:54Z","author":[{"first_name":"Richard","last_name":"Kollár","full_name":"Kollár, Richard"},{"last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-824X","first_name":"Sebastian","full_name":"Novak, Sebastian"}],"page":"525-559","volume":79,"date_created":"2018-12-11T11:50:38Z","scopus_import":"1","project":[{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"issue":"3","department":[{"_id":"NiBa"}],"_id":"1191","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.","ec_funded":1,"intvolume":"        79","title":"Existence of traveling waves for the generalized F–KPP equation","day":"01","article_processing_charge":"No","status":"public","type":"journal_article","date_published":"2017-03-01T00:00:00Z","doi":"10.1007/s11538-016-0244-3","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1607.00944","open_access":"1"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","arxiv":1,"publisher":"Springer","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."}]},{"department":[{"_id":"VlKo"}],"_id":"1192","publication_identifier":{"isbn":["978-161197478-2"]},"ec_funded":1,"title":"Even delta-matroids and the complexity of planar Boolean CSPs","day":"01","article_processing_charge":"No","status":"public","type":"conference","date_published":"2017-01-01T00:00:00Z","doi":"10.1137/1.9781611974782.20","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"publisher":"SIAM","abstract":[{"lang":"eng","text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary."}],"language":[{"iso":"eng"}],"publist_id":"6159","external_id":{"arxiv":["1602.03124"],"isi":["000426965800020"]},"publication_status":"published","citation":{"apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.","mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>."},"related_material":{"record":[{"relation":"later_version","id":"6032","status":"public"}]},"year":"2017","month":"01","isi":1,"date_updated":"2025-06-04T08:46:59Z","conference":{"location":"Barcelona, Spain","end_date":"2017-01019","start_date":"2017-01-16","name":"SODA: Symposium on Discrete Algorithms"},"author":[{"last_name":"Kazda","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek","full_name":"Rolinek, Michal"}],"page":"307 - 326","date_created":"2018-12-11T11:50:38Z","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}]},{"doi":"10.1016/j.nahs.2016.09.001","oa_version":"None","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","abstract":[{"text":"We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model.","lang":"eng"}],"_id":"1196","department":[{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/","ec_funded":1,"intvolume":"        23","day":"01","title":"Model measuring for discrete and hybrid systems","article_processing_charge":"No","status":"public","date_published":"2017-02-01T00:00:00Z","type":"journal_article","date_updated":"2025-04-15T06:25:59Z","month":"02","isi":1,"author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"page":"166 - 190","volume":23,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"scopus_import":"1","date_created":"2018-12-11T11:50:39Z","language":[{"iso":"eng"}],"publist_id":"6154","external_id":{"isi":["000390637000011"]},"publication_status":"published","citation":{"ama":"Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>","ista":"Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017, pp. 166–90, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>.","short":"T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>.","apa":"Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>"},"publication":"Nonlinear Analysis: Hybrid Systems","year":"2017"},{"year":"2017","publication":"Chemical Reviews","citation":{"apa":"Plutschack, M. B., Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017). The Hitchhiker’s Guide to flow chemistry. <i>Chemical Reviews</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">https://doi.org/10.1021/acs.chemrev.7b00183</a>","ama":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. The Hitchhiker’s Guide to flow chemistry. <i>Chemical Reviews</i>. 2017;117(18):11796-11893. doi:<a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">10.1021/acs.chemrev.7b00183</a>","ista":"Plutschack MB, Pieber B, Gilmore K, Seeberger PH. 2017. The Hitchhiker’s Guide to flow chemistry. Chemical Reviews. 117(18), 11796–11893.","ieee":"M. B. Plutschack, B. Pieber, K. Gilmore, and P. H. Seeberger, “The Hitchhiker’s Guide to flow chemistry,” <i>Chemical Reviews</i>, vol. 117, no. 18. American Chemical Society, pp. 11796–11893, 2017.","mla":"Plutschack, Matthew B., et al. “The Hitchhiker’s Guide to Flow Chemistry.” <i>Chemical Reviews</i>, vol. 117, no. 18, American Chemical Society, 2017, pp. 11796–893, doi:<a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">10.1021/acs.chemrev.7b00183</a>.","chicago":"Plutschack, Matthew B., Bartholomäus Pieber, Kerry Gilmore, and Peter H. Seeberger. “The Hitchhiker’s Guide to Flow Chemistry.” <i>Chemical Reviews</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acs.chemrev.7b00183\">https://doi.org/10.1021/acs.chemrev.7b00183</a>.","short":"M.B. Plutschack, B. Pieber, K. Gilmore, P.H. Seeberger, Chemical Reviews 117 (2017) 11796–11893."},"publication_status":"published","external_id":{"pmid":["28570059"]},"language":[{"iso":"eng"}],"scopus_import":"1","issue":"18","date_created":"2022-08-24T11:07:46Z","volume":117,"page":"11796-11893","article_type":"original","author":[{"full_name":"Plutschack, Matthew B.","first_name":"Matthew B.","last_name":"Plutschack"},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"},{"last_name":"Gilmore","first_name":"Kerry","full_name":"Gilmore, Kerry"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."}],"date_updated":"2023-02-21T10:09:28Z","month":"06","date_published":"2017-06-01T00:00:00Z","type":"journal_article","status":"public","extern":"1","article_processing_charge":"No","day":"01","title":"The Hitchhiker’s Guide to flow chemistry","intvolume":"       117","publication_identifier":{"issn":["0009-2665"],"eissn":["1520-6890"]},"_id":"11961","pmid":1,"abstract":[{"lang":"eng","text":"Flow chemistry involves the use of channels or tubing to conduct a reaction in a continuous stream rather than in a flask. Flow equipment provides chemists with unique control over reaction parameters enhancing reactivity or in some cases enabling new reactions. This relatively young technology has received a remarkable amount of attention in the past decade with many reports on what can be done in flow. Until recently, however, the question, “Should we do this in flow?” has merely been an afterthought. This review introduces readers to the basic principles and fundamentals of flow chemistry and critically discusses recent flow chemistry accounts."}],"publisher":"American Chemical Society","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","doi":"10.1021/acs.chemrev.7b00183"},{"doi":"10.1556/1846.2017.00016","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1556/1846.2017.00016"}],"oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"AKJournals","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."}],"_id":"11976","publication_identifier":{"issn":["2062-249X"],"eissn":["2063-0212"]},"intvolume":"         7","day":"01","title":"Integrated flow processing - challenges in continuous multistep synthesis","article_processing_charge":"No","status":"public","extern":"1","date_published":"2017-09-01T00:00:00Z","type":"journal_article","date_updated":"2023-02-21T10:10:02Z","month":"09","author":[{"last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus"},{"full_name":"Gilmore, Kerry","last_name":"Gilmore","first_name":"Kerry"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."}],"page":"129-136","article_type":"original","volume":7,"issue":"3-4","scopus_import":"1","date_created":"2022-08-25T10:47:51Z","language":[{"iso":"eng"}],"publication_status":"published","citation":{"apa":"Pieber, B., Gilmore, K., &#38; Seeberger, P. H. (2017). Integrated flow processing - challenges in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>. AKJournals. <a href=\"https://doi.org/10.1556/1846.2017.00016\">https://doi.org/10.1556/1846.2017.00016</a>","chicago":"Pieber, Bartholomäus, Kerry Gilmore, and Peter H. Seeberger. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” <i>Journal of Flow Chemistry</i>. AKJournals, 2017. <a href=\"https://doi.org/10.1556/1846.2017.00016\">https://doi.org/10.1556/1846.2017.00016</a>.","short":"B. Pieber, K. Gilmore, P.H. Seeberger, Journal of Flow Chemistry 7 (2017) 129–136.","mla":"Pieber, Bartholomäus, et al. “Integrated Flow Processing - Challenges in Continuous Multistep Synthesis.” <i>Journal of Flow Chemistry</i>, vol. 7, no. 3–4, AKJournals, 2017, pp. 129–36, doi:<a href=\"https://doi.org/10.1556/1846.2017.00016\">10.1556/1846.2017.00016</a>.","ama":"Pieber B, Gilmore K, Seeberger PH. Integrated flow processing - challenges in continuous multistep synthesis. <i>Journal of Flow Chemistry</i>. 2017;7(3-4):129-136. doi:<a href=\"https://doi.org/10.1556/1846.2017.00016\">10.1556/1846.2017.00016</a>","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.","ieee":"B. Pieber, K. Gilmore, and P. H. Seeberger, “Integrated flow processing - challenges in continuous multistep synthesis,” <i>Journal of Flow Chemistry</i>, vol. 7, no. 3–4. AKJournals, pp. 129–136, 2017."},"publication":"Journal of Flow Chemistry","year":"2017"},{"language":[{"iso":"eng"}],"publication_status":"published","publist_id":"6151","external_id":{"isi":["000392229100011"]},"citation":{"apa":"Barton, N. H. (2017). How does epistasis influence the response to selection? <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>","short":"N.H. Barton, Heredity 118 (2017) 96–109.","chicago":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>.","mla":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>.","ieee":"N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>, vol. 118. Nature Publishing Group, pp. 96–109, 2017.","ista":"Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109.","ama":"Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>. 2017;118:96-109. doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>"},"year":"2017","related_material":{"record":[{"relation":"research_data","id":"9710","status":"public"}]},"publication":"Heredity","isi":1,"month":"01","date_updated":"2025-04-15T07:11:02Z","page":"96 - 109","author":[{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"date_created":"2018-12-11T11:50:40Z","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"scopus_import":"1","volume":118,"department":[{"_id":"NiBa"}],"_id":"1199","title":"How does epistasis influence the response to selection?","day":"01","intvolume":"       118","ec_funded":1,"status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-01-01T00:00:00Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/","open_access":"1"}],"oa_version":"Submitted Version","doi":"10.1038/hdy.2016.109","oa":1,"publisher":"Nature Publishing Group","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","abstract":[{"lang":"eng","text":"Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects."}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer","abstract":[{"lang":"eng","text":"The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix."}],"pubrep_id":"722","doi":"10.1007/s00220-016-2805-6","has_accepted_license":"1","oa_version":"Published Version","oa":1,"license":"https://creativecommons.org/licenses/by/4.0/","article_processing_charge":"Yes (via OA deal)","status":"public","type":"journal_article","date_published":"2017-02-01T00:00:00Z","department":[{"_id":"LaEr"}],"_id":"1207","ddc":["530"],"publication_identifier":{"issn":["0010-3616"]},"ec_funded":1,"intvolume":"       349","title":"Local law of addition of random matrices on optimal scale","day":"01","author":[{"first_name":"Zhigang","orcid":"0000-0003-3036-1475","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","last_name":"Bao","full_name":"Bao, Zhigang"},{"full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"last_name":"Schnelli","orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","full_name":"Schnelli, Kevin"}],"file_date_updated":"2020-07-14T12:44:39Z","page":"947 - 990","volume":349,"date_created":"2018-12-11T11:50:43Z","file":[{"date_updated":"2020-07-14T12:44:39Z","creator":"system","file_size":1033743,"checksum":"ddff79154c3daf27237de5383b1264a9","access_level":"open_access","date_created":"2018-12-12T10:14:47Z","content_type":"application/pdf","file_id":"5102","relation":"main_file","file_name":"IST-2016-722-v1+1_s00220-016-2805-6.pdf"}],"issue":"3","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804"}],"scopus_import":"1","month":"02","isi":1,"date_updated":"2025-07-10T11:50:22Z","citation":{"apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>","short":"Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349 (2017) 947–990.","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>.","ama":"Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>","ista":"Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3. Springer, pp. 947–990, 2017.","mla":"Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017, pp. 947–90, doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>."},"publication":"Communications in Mathematical Physics","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2017","language":[{"iso":"eng"}],"external_id":{"isi":["000393696700005"]},"publist_id":"6141","publication_status":"published"},{"isi":1,"month":"09","date_updated":"2025-06-04T09:41:22Z","page":"1269 - 1292","author":[{"last_name":"Zwiernik","first_name":"Piotr","full_name":"Zwiernik, Piotr"},{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","first_name":"Caroline","last_name":"Uhler"},{"full_name":"Richards, Donald","last_name":"Richards","first_name":"Donald"}],"date_created":"2018-12-11T11:50:43Z","scopus_import":"1","issue":"4","project":[{"name":"Gaussian Graphical Models: Theory and Applications","call_identifier":"FWF","_id":"2530CA10-B435-11E9-9278-68D0E5697425","grant_number":"Y 903-N35"}],"volume":79,"language":[{"iso":"eng"}],"publication_status":"published","external_id":{"arxiv":["1408.5604"],"isi":["000411712300012"]},"publist_id":"6142","citation":{"mla":"Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>.","ista":"Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 79(4), 1269–1292.","ama":"Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society Series B: Statistical Methodology</i>. 2017;79(4):1269-1292. doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>","ieee":"P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for linear Gaussian covariance models,” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292, 2017.","short":"P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society. Series B: Statistical Methodology 79 (2017) 1269–1292.","chicago":"Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>.","apa":"Zwiernik, P., Uhler, C., &#38; Richards, D. (2017). Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>"},"year":"2017","publication":"Journal of the Royal Statistical Society. Series B: Statistical Methodology","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.5604"}],"oa_version":"Submitted Version","doi":"10.1111/rssb.12217","oa":1,"publisher":"Wiley-Blackwell","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"abstract":[{"lang":"eng","text":"We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ&gt;1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd."}],"publication_identifier":{"issn":["1369-7412"]},"department":[{"_id":"CaUh"}],"_id":"1208","title":"Maximum likelihood estimation for linear Gaussian covariance models","day":"01","intvolume":"        79","status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-09-01T00:00:00Z"},{"language":[{"iso":"eng"}],"publication_status":"published","external_id":{"isi":["000400233600014"]},"publist_id":"6136","citation":{"apa":"Budanur, N. B., &#38; Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. 2017;167(3-4):636-655. doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>","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.","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4. Springer, pp. 636–655, 2017."},"year":"2017","publication":"Journal of Statistical Physics","date_updated":"2025-09-22T09:36:50Z","month":"05","isi":1,"page":"636-655","file_date_updated":"2020-07-14T12:44:39Z","author":[{"last_name":"Budanur","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","first_name":"Nazmi B","full_name":"Budanur, Nazmi B"},{"full_name":"Cvitanović, Predrag","first_name":"Predrag","last_name":"Cvitanović"}],"issue":"3-4","file":[{"creator":"system","date_updated":"2020-07-14T12:44:39Z","file_size":2820207,"content_type":"application/pdf","file_id":"5319","date_created":"2018-12-12T10:18:01Z","access_level":"open_access","checksum":"3e971d09eb167761aa0888ed415b0056","file_name":"IST-2017-782-v1+1_BudCvi15.pdf","relation":"main_file"}],"scopus_import":"1","date_created":"2018-12-11T11:50:44Z","volume":167,"acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","ddc":["530"],"_id":"1211","department":[{"_id":"BjHo"}],"day":"01","title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","intvolume":"       167","status":"public","article_processing_charge":"No","date_published":"2017-05-01T00:00:00Z","type":"journal_article","oa_version":"Submitted Version","has_accepted_license":"1","doi":"10.1007/s10955-016-1672-z","oa":1,"publisher":"Springer","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pubrep_id":"782","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."}]},{"ec_funded":1,"intvolume":"       137","title":"Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers","day":"01","department":[{"_id":"MaLo"}],"_id":"1213","acknowledgement":"Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).","publication_identifier":{"issn":["0091-679X"]},"type":"book_chapter","date_published":"2017-12-01T00:00:00Z","alternative_title":["Methods in Cell Biology"],"article_processing_charge":"No","status":"public","doi":"10.1016/bs.mcb.2016.03.036","oa_version":"None","abstract":[{"lang":"eng","text":"Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin."}],"acknowledged_ssus":[{"_id":"Bio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Academic Press","publist_id":"6134","external_id":{"isi":["000403542900022"]},"publication_status":"published","editor":[{"first_name":"Arnaud ","last_name":"Echard","full_name":"Echard, Arnaud "}],"language":[{"iso":"eng"}],"publication":"Cytokinesis","year":"2017","citation":{"apa":"Baranova, N. S., &#38; Loose, M. (2017). Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), <i>Cytokinesis</i> (Vol. 137, pp. 355–370). Academic Press. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>","mla":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” <i>Cytokinesis</i>, edited by Arnaud  Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>.","ama":"Baranova NS, Loose M. Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. <i>Cytokinesis</i>. Vol 137. Academic Press; 2017:355-370. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>","ista":"Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol. 137, 355–370.","ieee":"N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers,” in <i>Cytokinesis</i>, vol. 137, A. Echard, Ed. Academic Press, 2017, pp. 355–370.","short":"N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press, 2017, pp. 355–370.","chicago":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In <i>Cytokinesis</i>, edited by Arnaud  Echard, 137:355–70. Academic Press, 2017. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>."},"month":"12","isi":1,"date_updated":"2025-07-10T11:50:24Z","volume":137,"date_created":"2018-12-11T11:50:45Z","project":[{"grant_number":"ALTF 2015-1163","_id":"2596EAB6-B435-11E9-9278-68D0E5697425","name":"Synthesis of bacterial cell wall"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"scopus_import":"1","author":[{"last_name":"Baranova","id":"38661662-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3086-9124","first_name":"Natalia","full_name":"Baranova, Natalia"},{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","last_name":"Loose","full_name":"Loose, Martin"}],"page":"355 - 370"},{"extern":"1","status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-09-07T00:00:00Z","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457.","publication_identifier":{"eissn":["1944-7833"]},"_id":"265","title":"Rational curves on smooth hypersurfaces of low degree","day":"07","intvolume":"        11","publisher":" Mathematical Sciences Publishers","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"abstract":[{"lang":"eng","text":"We establish the dimension and irreducibility of the moduli space of rational curves (of fixed degree) on arbitrary smooth hypersurfaces of sufficiently low degree. A spreading out argument reduces the problem to hypersurfaces defined over finite fields of large cardinality, which can then be tackled using a function field version of the Hardy-Littlewood circle method, in which particular care is taken to ensure uniformity in the size of the underlying finite field."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00553"}],"oa_version":"Preprint","doi":"10.2140/ant.2017.11.1657","oa":1,"citation":{"apa":"Browning, T. D., &#38; Vishe, P. (2017). Rational curves on smooth hypersurfaces of low degree. <i>Geometric Methods in Algebra and Number Theory</i>.  Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/ant.2017.11.1657\">https://doi.org/10.2140/ant.2017.11.1657</a>","mla":"Browning, Timothy D., and Pankaj Vishe. “Rational Curves on Smooth Hypersurfaces of Low Degree.” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 11, no. 7,  Mathematical Sciences Publishers, 2017, pp. 1657–75, doi:<a href=\"https://doi.org/10.2140/ant.2017.11.1657\">10.2140/ant.2017.11.1657</a>.","ieee":"T. D. Browning and P. Vishe, “Rational curves on smooth hypersurfaces of low degree,” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 11, no. 7.  Mathematical Sciences Publishers, pp. 1657–1675, 2017.","ista":"Browning TD, Vishe P. 2017. Rational curves on smooth hypersurfaces of low degree. Geometric Methods in Algebra and Number Theory. 11(7), 1657–1675.","ama":"Browning TD, Vishe P. Rational curves on smooth hypersurfaces of low degree. <i>Geometric Methods in Algebra and Number Theory</i>. 2017;11(7):1657-1675. doi:<a href=\"https://doi.org/10.2140/ant.2017.11.1657\">10.2140/ant.2017.11.1657</a>","chicago":"Browning, Timothy D, and Pankaj Vishe. “Rational Curves on Smooth Hypersurfaces of Low Degree.” <i>Geometric Methods in Algebra and Number Theory</i>.  Mathematical Sciences Publishers, 2017. <a href=\"https://doi.org/10.2140/ant.2017.11.1657\">https://doi.org/10.2140/ant.2017.11.1657</a>.","short":"T.D. Browning, P. Vishe, Geometric Methods in Algebra and Number Theory 11 (2017) 1657–1675."},"year":"2017","publication":"Geometric Methods in Algebra and Number Theory","language":[{"iso":"eng"}],"publication_status":"published","publist_id":"7637","external_id":{"arxiv":["1611.00553"]},"page":"1657 - 1675","article_type":"original","author":[{"last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","full_name":"Browning, Timothy D"},{"full_name":"Vishe, Pankaj","last_name":"Vishe","first_name":"Pankaj"}],"date_created":"2018-12-11T11:45:30Z","issue":"7","volume":11,"month":"09","date_updated":"2024-10-09T20:58:17Z"},{"doi":"10.4171/JEMS/668","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1403.5937"}],"oa_version":"Preprint","oa":1,"arxiv":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","publisher":"European Mathematical Society Publishing House","abstract":[{"lang":"eng","text":"We generalise Birch's seminal work on forms in many variables to handle a system of forms in which the degrees need not all be the same. This allows us to prove the Hasse principle, weak approximation, and the Manin-Peyre conjecture for a smooth and geometrically integral variety X Pm, provided only that its dimension is large enough in terms of its degree."}],"_id":"266","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457.","intvolume":"        19","day":"26","title":"Forms in many variables and differing degrees","article_processing_charge":"No","status":"public","extern":"1","date_published":"2017-01-26T00:00:00Z","type":"journal_article","date_updated":"2024-10-09T20:58:17Z","month":"01","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"article_type":"original","page":"357 - 394","volume":19,"issue":"2","date_created":"2018-12-11T11:45:31Z","language":[{"iso":"eng"}],"publist_id":"7636","external_id":{"arxiv":["1403.5937"]},"publication_status":"published","citation":{"chicago":"Browning, Timothy D, and Roger Heath Brown. “Forms in Many Variables and Differing Degrees.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society Publishing House, 2017. <a href=\"https://doi.org/10.4171/JEMS/668\">https://doi.org/10.4171/JEMS/668</a>.","short":"T.D. Browning, R. Heath Brown, Journal of the European Mathematical Society 19 (2017) 357–394.","mla":"Browning, Timothy D., and Roger Heath Brown. “Forms in Many Variables and Differing Degrees.” <i>Journal of the European Mathematical Society</i>, vol. 19, no. 2, European Mathematical Society Publishing House, 2017, pp. 357–94, doi:<a href=\"https://doi.org/10.4171/JEMS/668\">10.4171/JEMS/668</a>.","ista":"Browning TD, Heath Brown R. 2017. Forms in many variables and differing degrees. Journal of the European Mathematical Society. 19(2), 357–394.","ieee":"T. D. Browning and R. Heath Brown, “Forms in many variables and differing degrees,” <i>Journal of the European Mathematical Society</i>, vol. 19, no. 2. European Mathematical Society Publishing House, pp. 357–394, 2017.","ama":"Browning TD, Heath Brown R. Forms in many variables and differing degrees. <i>Journal of the European Mathematical Society</i>. 2017;19(2):357-394. doi:<a href=\"https://doi.org/10.4171/JEMS/668\">10.4171/JEMS/668</a>","apa":"Browning, T. D., &#38; Heath Brown, R. (2017). Forms in many variables and differing degrees. <i>Journal of the European Mathematical Society</i>. European Mathematical Society Publishing House. <a href=\"https://doi.org/10.4171/JEMS/668\">https://doi.org/10.4171/JEMS/668</a>"},"publication":"Journal of the European Mathematical Society","year":"2017"},{"language":[{"iso":"eng"}],"publication_status":"published","external_id":{"arxiv":["1701.00525"]},"publist_id":"7635","citation":{"apa":"Browning, T. D. (2017). Many cubic surfaces contain rational points. <i>Mathematika</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0025579317000195\">https://doi.org/10.1112/S0025579317000195</a>","mla":"Browning, Timothy D. “Many Cubic Surfaces Contain Rational Points.” <i>Mathematika</i>, vol. 63, no. 3, Cambridge University Press, 2017, pp. 818–39, doi:<a href=\"https://doi.org/10.1112/S0025579317000195\">10.1112/S0025579317000195</a>.","ama":"Browning TD. Many cubic surfaces contain rational points. <i>Mathematika</i>. 2017;63(3):818-839. doi:<a href=\"https://doi.org/10.1112/S0025579317000195\">10.1112/S0025579317000195</a>","ieee":"T. D. Browning, “Many cubic surfaces contain rational points,” <i>Mathematika</i>, vol. 63, no. 3. Cambridge University Press, pp. 818–839, 2017.","ista":"Browning TD. 2017. Many cubic surfaces contain rational points. Mathematika. 63(3), 818–839.","chicago":"Browning, Timothy D. “Many Cubic Surfaces Contain Rational Points.” <i>Mathematika</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1112/S0025579317000195\">https://doi.org/10.1112/S0025579317000195</a>.","short":"T.D. Browning, Mathematika 63 (2017) 818–839."},"year":"2017","publication":"Mathematika","month":"11","date_updated":"2024-10-09T20:58:16Z","article_type":"original","page":"818 - 839","author":[{"last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","full_name":"Browning, Timothy D"}],"date_created":"2018-12-11T11:45:31Z","issue":"3","volume":63,"acknowledgement":"While working on this paper the author was supported by ERC grant 306457.","publication_identifier":{"issn":["0025-5793"]},"_id":"267","title":"Many cubic surfaces contain rational points","day":"29","intvolume":"        63","extern":"1","status":"public","article_processing_charge":"No","type":"journal_article","date_published":"2017-11-29T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1701.00525"}],"oa_version":"Preprint","doi":"10.1112/S0025579317000195","oa":1,"publisher":"Cambridge University Press","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","arxiv":1,"abstract":[{"lang":"eng","text":"Building on recent work of Bhargava, Elkies and Schnidman and of Kriz and Li, we produce infinitely many smooth cubic surfaces defined over the field of rational numbers that contain rational points."}]}]