[{"day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"32nd Annual European Symposium on Algorithms","alternative_title":["LIPIcs"],"has_accepted_license":"1","article_number":"72","_id":"18309","citation":{"ieee":"B. Hu, E. Kosinas, and A. Polak, “Connectivity oracles for predictable vertex failures,” in 32nd Annual European Symposium on Algorithms, London, United Kingdom, 2024, vol. 308.","chicago":"Hu, Bingbing, Evangelos Kosinas, and Adam Polak. “Connectivity Oracles for Predictable Vertex Failures.” In 32nd Annual European Symposium on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.72.","short":"B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","apa":"Hu, B., Kosinas, E., & Polak, A. (2024). Connectivity oracles for predictable vertex failures. In 32nd Annual European Symposium on Algorithms (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.72","ista":"Hu B, Kosinas E, Polak A. 2024. Connectivity oracles for predictable vertex failures. 32nd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 308, 72.","ama":"Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72","mla":"Hu, Bingbing, et al. “Connectivity Oracles for Predictable Vertex Failures.” 32nd Annual European Symposium on Algorithms, vol. 308, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ESA.2024.72."},"quality_controlled":"1","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","oa":1,"year":"2024","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"file_date_updated":"2024-10-21T10:03:48Z","researchdata_availability":"no","das_tickbox":"0","oa_version":"Published Version","article_processing_charge":"Yes","month":"09","title":"Connectivity oracles for predictable vertex failures","publication_identifier":{"isbn":["9783959773386"],"issn":["1868-8969"]},"ddc":["000"],"arxiv":1,"file":[{"creator":"dernst","file_size":853914,"file_id":"18455","checksum":"ab1f2f9161549a8763eda15db40e022c","access_level":"open_access","date_updated":"2024-10-21T10:03:48Z","content_type":"application/pdf","success":1,"date_created":"2024-10-21T10:03:48Z","file_name":"2024_LIPICs_Hu.pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"The problem of designing connectivity oracles supporting vertex failures is one of the basic data structures problems for undirected graphs. It is already well understood: previous works [Duan-Pettie STOC'10; Long-Saranurak FOCS'22] achieve query time linear in the number of failed vertices, and it is conditionally optimal as long as we require preprocessing time polynomial in the size of the graph and update time polynomial in the number of failed vertices. We revisit this problem in the paradigm of algorithms with predictions: we ask if the query time can be improved if the set of failed vertices can be predicted beforehand up to a small number of errors. More specifically, we design a data structure that, given a graph G = (V,E) and a set of vertices predicted to fail D̂ ⊆ V of size d = |D̂|, preprocesses it in time Õ(d|E|) and then can receive an update given as the symmetric difference between the predicted and the actual set of failed vertices D̂△D = (D̂ ⧵ D) ∪ (D ⧵ D̂) of size η = |D̂△D|, process it in time Õ(η⁴), and after that answer connectivity queries in G ⧵ D in time O(η). Viewed from another perspective, our data structure provides an improvement over the state of the art for the fully dynamic subgraph connectivity problem in the sensitivity setting [Henzinger-Neumann ESA'16]. We argue that the preprocessing time and query time of our data structure are conditionally optimal under standard fine-grained complexity assumptions."}],"volume":308,"type":"conference","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2024.72","doi":"10.4230/LIPIcs.ESA.2024.72","acknowledgement":"Part of this work was done when Evangelos Kosinas was at University of Ioannina and Adam Polak was at Max Planck Institute of Informatics.\r\n","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","OA_type":"gold","date_created":"2024-10-13T22:01:50Z","author":[{"last_name":"Hu","first_name":"Bingbing","full_name":"Hu, Bingbing"},{"last_name":"Kosinas","id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949","first_name":"Evangelos","full_name":"Kosinas, Evangelos"},{"last_name":"Polak","full_name":"Polak, Adam","first_name":"Adam"}],"department":[{"_id":"MoHe"}],"intvolume":" 308","date_updated":"2026-10-21T08:04:56Z","supplementarymaterial":"no","corr_author":"1","external_id":{"isi":["001545622400072"],"arxiv":["2312.08489"]},"conference":{"start_date":"2024-09-02","end_date":"2024-09-04","location":"London, United Kingdom","name":"ESA: European Symposium on Algorithms"},"publication_status":"published","isi":1,"OA_place":"publisher"},{"arxiv":1,"ddc":["000"],"publication_identifier":{"eissn":["2640-3498"]},"month":"09","title":"Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond","volume":235,"abstract":[{"text":"We study the data selection problem, whose aim is to select a small representative subset of data that can be used to efficiently train a machine learning model. We present a new data selection approach based on k-means clustering and sensitivity sampling. Assuming access to an embedding representation of the data with respect to which the model loss is Holder continuous, our approach provably allows selecting a set of “typical” k+1/ε2 elements whose average loss corresponds to the average loss of the whole dataset, up to a multiplicative (1±ε)\r\n factor and an additive ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the Holder constant. We furthermore demonstrate the performance and scalability of our approach on fine-tuning foundation models and show that it outperforms state-of-the-art methods. We also show how it can be applied on linear regression, leading to a new sampling strategy that surprisingly matches the performance of leverage score sampling, while being conceptually simpler and more scalable.","lang":"eng"}],"type":"conference","project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"author":[{"last_name":"Axiotis","first_name":"Kyriakos","full_name":"Axiotis, Kyriakos"},{"full_name":"Cohen-Addad, Vincent","first_name":"Vincent","last_name":"Cohen-Addad"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Sammy","full_name":"Jerome, Sammy","last_name":"Jerome"},{"last_name":"Mirrokni","first_name":"Vahab","full_name":"Mirrokni, Vahab"},{"first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","full_name":"Saulpic, David","last_name":"Saulpic"},{"last_name":"Woodruff","first_name":"David P.","full_name":"Woodruff, David P."},{"last_name":"Wunder","full_name":"Wunder, Michael","first_name":"Michael"}],"date_created":"2024-09-22T22:01:44Z","date_updated":"2026-10-21T08:03:43Z","intvolume":" 235","department":[{"_id":"MoHe"}],"page":"2086-2107","publisher":"ML Research Press","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the\r\nMarie Sklodowska-Curie grant agreement No 101034413. Work was done while David Woodruff was visiting Google Research.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.17327"}],"publication_status":"published","external_id":{"arxiv":["2402.17327"]},"conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21","end_date":"2024-07-27","location":"Vienna, Austria"},"supplementarymaterial":"no","ec_funded":1,"alternative_title":["PMLR"],"publication":"Proceedings of the 41st International Conference on Machine Learning","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","quality_controlled":"1","status":"public","_id":"18115","citation":{"ieee":"K. Axiotis et al., “Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 2086–2107.","chicago":"Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” In Proceedings of the 41st International Conference on Machine Learning, 235:2086–2107. ML Research Press, 2024.","short":"K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107.","ista":"Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff DP, Wunder M. 2024. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 2086–2107.","apa":"Axiotis, K., Cohen-Addad, V., Henzinger, M., Jerome, S., Mirrokni, V., Saulpic, D., … Wunder, M. (2024). Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 2086–2107). Vienna, Austria: ML Research Press.","ama":"Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:2086-2107.","mla":"Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 2086–107."},"year":"2024","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"das_tickbox":"0","oa_version":"Published Version","article_processing_charge":"No","researchdata_availability":"no"},{"department":[{"_id":"MoHe"}],"date_updated":"2026-10-21T08:05:18Z","date_created":"2024-11-04T10:54:21Z","author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Jason","full_name":"Li, Jason","last_name":"Li"},{"last_name":"Rao","first_name":"Satish","full_name":"Rao, Satish"},{"last_name":"Wang","first_name":"Di","full_name":"Wang, Di"}],"OA_type":"free access","publisher":"Society for Industrial and Applied Mathematics","page":"3089-3139","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.05627"}],"acknowledgement":"This project has received funding from the European Research Council(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDyn-Struct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","doi":"10.1137/1.9781611977912.111","OA_place":"repository","publication_status":"published","conference":{"location":"Alexandria, VA, United States","start_date":"2024-01-07","end_date":"2024-01-10","name":"SODA: Symposium on Discrete Algorithms"},"corr_author":"1","external_id":{"arxiv":["2401.05627"]},"supplementarymaterial":"yes","arxiv":1,"publication_identifier":{"eisbn":["9781611977912"]},"title":"Deterministic near-linear time minimum cut in weighted graphs","month":"01","fulldoi":"https://doi.org/10.1137/1.9781611977912.111","type":"conference","abstract":[{"text":"In 1996, Karger [Kar96] gave a startling randomized algorithm that finds a minimum-cut in a (weighted) graph in time O(m log3 n) which he termed near-linear time meaning linear (in the size of the input) times a polylogarthmic factor. In this paper, we give the first deterministic algorithm which runs in near-linear time for weighted graphs.\r\nPreviously, the breakthrough results of Kawarabayashi and Thorup [KT19] gave a near-linear time algorithm for simple graphs (which was improved to have running time O(m log2 n log log n) in [HRW20].) The main technique here is a clustering procedure that perfectly preserves minimum cuts. Recently, Li [Li21] gave an m1+o(1) deterministic minimum-cut algorithm for weighted graphs; this form of running time has been termed “almost-linear”. Li uses almost-linear time deterministic expander decompositions which do not perfectly preserve minimum cuts, but he can use these clusterings to, in a sense, “derandomize” the methods of Karger.\r\nIn terms of techniques, we provide a structural theorem that says there exists a sparse clustering that preserves minimum cuts in a weighted graph with o(1) error. In addition, we construct it deterministically in near linear time. This was done exactly for simple graphs in [KT19, HRW20] and with polylogarithmic error for weighted graphs in [Li21]. Extending the techniques in [KT19, HRW20] to weighted graphs presents significant challenges, and moreover, the algorithm can only polylogarithmically approximately preserve minimum cuts. A remaining challenge is to reduce the polylogarithmic-approximate clusterings to 1 + o(1/ log n)-approximate so that they can be applied recursively as in [Li21] over O(log n) many levels. This is an additional challenge that requires building on properties of tree-packings in the presence of a wide range of edge weights to, for example, find sources for local flow computations which identify minimum cuts that cross clusters.","lang":"eng"}],"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"language":[{"iso":"eng"}],"year":"2024","date_published":"2024-01-04T00:00:00Z","oa":1,"article_processing_charge":"No","oa_version":"Preprint","das_tickbox":"0","researchdata_availability":"no","ec_funded":1,"day":"04","publication":"35th Annual ACM-SIAM Symposium on Discrete Algorithms","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","status":"public","quality_controlled":"1","citation":{"mla":"Henzinger, Monika, et al. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–139, doi:10.1137/1.9781611977912.111.","apa":"Henzinger, M., Li, J., Rao, S., & Wang, D. (2024). Deterministic near-linear time minimum cut in weighted graphs. In 35th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3089–3139). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.111","ista":"Henzinger M, Li J, Rao S, Wang D. 2024. Deterministic near-linear time minimum cut in weighted graphs. 35th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 3089–3139.","ama":"Henzinger M, Li J, Rao S, Wang D. Deterministic near-linear time minimum cut in weighted graphs. In: 35th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2024:3089-3139. doi:10.1137/1.9781611977912.111","short":"M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–3139.","chicago":"Henzinger, Monika, Jason Li, Satish Rao, and Di Wang. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” In 35th Annual ACM-SIAM Symposium on Discrete Algorithms, 3089–3139. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.111.","ieee":"M. Henzinger, J. Li, S. Rao, and D. Wang, “Deterministic near-linear time minimum cut in weighted graphs,” in 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2024, pp. 3089–3139."},"_id":"18503"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.11649"}],"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413.","publisher":"ML Research Press","page":"12046-12086","date_updated":"2026-10-21T08:04:04Z","intvolume":" 235","department":[{"_id":"MoHe"}],"author":[{"last_name":"La Tour","full_name":"La Tour, Max Dupré","first_name":"Max Dupré"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Saulpic","full_name":"Saulpic, David","first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964"}],"date_created":"2024-09-22T22:01:44Z","supplementarymaterial":"no","conference":{"location":"Vienna, Austria","start_date":"2024-07-21","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning"},"external_id":{"arxiv":["2406.11649"]},"corr_author":"1","publication_status":"published","title":"Making old things new: A unified algorithm for differentially private clustering","month":"09","publication_identifier":{"eissn":["2640-3498"]},"ddc":["000"],"arxiv":1,"project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"},{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"type":"conference","volume":235,"abstract":[{"lang":"eng","text":"As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied, under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local and the shuffle variation. In each case, the goal is to design an algorithm that computes privately a clustering, with the smallest possible error. The study of each variation gave rise to new algorithm: the landscape of private clustering algorithm is therefore quite intricate. In this paper, we show that a 20 year-old algorithm can be slightly modified to work for any of those models. This provides a unified picture: while matching almost all previously known results, it allows us to improve some of them, and extend to a new privacy model, the continual observation setting, where the input is changing over time and the algorithm must output a new solution at each time step."}],"oa":1,"language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z","year":"2024","researchdata_availability":"no","article_processing_charge":"No","das_tickbox":"0","oa_version":"Published Version","day":"01","publication":"Proceedings of the 41st International Conference on Machine Learning","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["PMLR"],"ec_funded":1,"citation":{"short":"M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.","ieee":"M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified algorithm for differentially private clustering,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 12046–12086.","chicago":"La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In Proceedings of the 41st International Conference on Machine Learning, 235:12046–86. ML Research Press, 2024.","mla":"La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12046–86.","ista":"La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified algorithm for differentially private clustering. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12046–12086.","apa":"La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Making old things new: A unified algorithm for differentially private clustering. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 12046–12086). Vienna, Austria: ML Research Press.","ama":"La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm for differentially private clustering. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:12046-12086."},"_id":"18116","status":"public","quality_controlled":"1","scopus_import":"1"},{"publication_status":"published","supplementarymaterial":"no","conference":{"start_date":"2024-01-07","end_date":"2024-01-10","location":"Alexandria, VA, United States","name":"SODA: Symposium on Discrete Algorithms"},"external_id":{"arxiv":["2307.08970"]},"corr_author":"1","publisher":"Society for Industrial and Applied Mathematics","page":"995-1018","department":[{"_id":"MoHe"}],"intvolume":" 2024","date_updated":"2026-10-21T08:03:24Z","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Jalaj","full_name":"Upadhyay, Jalaj","last_name":"Upadhyay"},{"last_name":"Upadhyay","first_name":"Sarvagya","full_name":"Upadhyay, Sarvagya"}],"date_created":"2024-03-31T22:01:13Z","doi":"10.1137/1.9781611977912.38","acknowledgement":"This project has received funding from the European Research Council (ERC)under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and the AustrianScience Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, andproject “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netideeSCIENCE Stiftung, 2020–2024. JU’s research was funded by the Decanal Research Grant. We thank the anonymousreviewers for their useful feedback and pointing us to the results in Matousek et al","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.08970"}],"type":"conference","fulldoi":"https://doi.org/10.1137/1.9781611977912.38","abstract":[{"lang":"eng","text":"We study the problem of maintaining a differentially private decaying sum under continual observation. We give a unifying framework and an efficient algorithm for this problem for any sufficiently smooth function. Our algorithm is the first differentially private algorithm that does not have a multiplicative error for polynomially decaying weights. Our algorithm improves on all prior works on differentially private decaying sums under continual observation and recovers exactly the additive error for the special case of continual counting from Henzinger et al. (SODA 2023) as a corollary.\r\nOur algorithm is a variant of the matrix mechanism whose error depends on the γ2 and γF norm of the underlying matrix. We give a constructive proof for an almost exact upper bound on the γ2 and γF norm and an almost tight lower bound on the γ2 norm for a large class of lower-triangular matrices. This is the first non-trivial lower bound for lower-triangular matrices whose non-zero entries are not all the same. It includes matrices for all continual decaying sums problems, resulting in an upper bound on the additive error of any differentially private decaying sums algorithm under continual observation.\r\nWe also explore some implications of our result in discrepancy theory and operator algebra. Given the importance of the γ2 norm in computer science and the extensive work in mathematics, we believe our result will have further applications."}],"volume":2024,"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"arxiv":1,"title":"A unifying framework for differentially private sums under continual observation","month":"01","publication_identifier":{"eisbn":["9781611977912"]},"researchdata_availability":"no","article_processing_charge":"No","oa_version":"Preprint","das_tickbox":"0","language":[{"iso":"eng"}],"date_published":"2024-01-04T00:00:00Z","year":"2024","oa":1,"scopus_import":"1","citation":{"apa":"Henzinger, M., Upadhyay, J., & Upadhyay, S. (2024). A unifying framework for differentially private sums under continual observation. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2024, pp. 995–1018). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.38","ista":"Henzinger M, Upadhyay J, Upadhyay S. 2024. A unifying framework for differentially private sums under continual observation. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2024, 995–1018.","ama":"Henzinger M, Upadhyay J, Upadhyay S. A unifying framework for differentially private sums under continual observation. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2024. Society for Industrial and Applied Mathematics; 2024:995-1018. doi:10.1137/1.9781611977912.38","mla":"Henzinger, Monika, et al. “A Unifying Framework for Differentially Private Sums under Continual Observation.” Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2024, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018, doi:10.1137/1.9781611977912.38.","chicago":"Henzinger, Monika, Jalaj Upadhyay, and Sarvagya Upadhyay. “A Unifying Framework for Differentially Private Sums under Continual Observation.” In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, 2024:995–1018. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.38.","ieee":"M. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially private sums under continual observation,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2024, vol. 2024, pp. 995–1018.","short":"M. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018."},"_id":"15253","status":"public","quality_controlled":"1","ec_funded":1,"day":"04","publication":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"supplementarymaterial":"no","external_id":{"isi":["001300389400062"],"arxiv":["2307.16771"]},"corr_author":"1","conference":{"location":"Berkeley, CA, United States","start_date":"2024-01-30","end_date":"2024-02-02","name":"ITCS: Innovations in Theoretical Computer Science"},"publication_status":"published","isi":1,"OA_place":"publisher","doi":"10.4230/LIPIcs.ITCS.2024.62","acknowledgement":"Henzinger, Monika: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project Z 422-N, project I 5982-N, and project P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020-2024.\r\nSaha, Barna: This project is partially supported by NSF grants 1652303, 1909046, 2112533, and HDR TRIPODS Phase II grant 2217058.\r\nWe would like to thank Andrea Lincoln for many helpful discussions and insightful comments.","page":"62:1-62:25","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","OA_type":"gold","date_created":"2025-01-27T15:33:42Z","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Barna","full_name":"Saha, Barna","last_name":"Saha"},{"first_name":"Martin P.","full_name":"Seybold, Martin P.","last_name":"Seybold"},{"full_name":"Ye, Christopher","first_name":"Christopher","last_name":"Ye"}],"intvolume":" 287","date_updated":"2026-10-21T08:07:36Z","department":[{"_id":"MoHe"}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"file":[{"file_id":"18929","file_size":1084372,"checksum":"15085a5b3697a408b92a4a7a27293927","creator":"dernst","file_name":"2024_LIPICs_HenzingerMo.pdf","relation":"main_file","access_level":"open_access","date_updated":"2025-01-27T15:33:24Z","content_type":"application/pdf","success":1,"date_created":"2025-01-27T15:33:24Z"}],"volume":287,"abstract":[{"lang":"eng","text":"Algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike online algorithms, the goal in dynamic data structures is to maintain the solution efficiently with every update.\r\nWe investigate three natural models of prediction: (1) δ-accurate predictions where each predicted request matches the true request with probability δ, (2) list-accurate predictions where a true request comes from a list of possible requests, and (3) bounded delay predictions where the true requests are a permutation of the predicted requests. We give general reductions among the prediction models, showing that bounded delay is the strongest prediction model, followed by list-accurate, and δ-accurate.\r\nFurther, we identify two broad problem classes based on lower bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show that locally correctable dynamic problems have strong conditional lower bounds for list-accurate predictions that are equivalent to the non-prediction setting, unless list-accurate predictions are perfect. Moreover, we show that locally reducible dynamic problems have time complexity that degrades gracefully with the quality of bounded delay predictions. We categorize problems with known OMv lower bounds accordingly and give several upper bounds in the delay model that show that our lower bounds are almost tight.\r\nWe note that concurrent work by v.d.Brand et al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic graph algorithms with predictions, but their work is mostly focused on showing upper bounds."}],"type":"conference","fulldoi":"https://doi.org/10.4230/LIPIcs.ITCS.2024.62","month":"01","title":"On the complexity of algorithms with predictions for dynamic graph problems","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773096"]},"ddc":["000"],"arxiv":1,"file_date_updated":"2025-01-27T15:33:24Z","researchdata_availability":"no","das_tickbox":"0","oa_version":"Published Version","article_processing_charge":"Yes","oa":1,"date_published":"2024-01-24T00:00:00Z","year":"2024","language":[{"iso":"eng"}],"_id":"18928","citation":{"short":"M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25.","ieee":"M. Henzinger, B. Saha, M. P. Seybold, and C. Ye, “On the complexity of algorithms with predictions for dynamic graph problems,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287, p. 62:1-62:25.","chicago":"Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In 15th Innovations in Theoretical Computer Science Conference, 287:62:1-62:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.62.","mla":"Henzinger, Monika, et al. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” 15th Innovations in Theoretical Computer Science Conference, vol. 287, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25, doi:10.4230/LIPIcs.ITCS.2024.62.","ama":"Henzinger M, Saha B, Seybold MP, Ye C. On the complexity of algorithms with predictions for dynamic graph problems. In: 15th Innovations in Theoretical Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:62:1-62:25. doi:10.4230/LIPIcs.ITCS.2024.62","apa":"Henzinger, M., Saha, B., Seybold, M. P., & Ye, C. (2024). On the complexity of algorithms with predictions for dynamic graph problems. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287, p. 62:1-62:25). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.62","ista":"Henzinger M, Saha B, Seybold MP, Ye C. 2024. On the complexity of algorithms with predictions for dynamic graph problems. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 287, 62:1-62:25."},"quality_controlled":"1","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"24","publication":"15th Innovations in Theoretical Computer Science Conference","alternative_title":["LIPIcs"],"ec_funded":1,"has_accepted_license":"1"},{"scopus_import":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","quality_controlled":"1","citation":{"ama":"Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, et al. Unveiling the mechanism of phonon-polariton damping in α‑MoO3. ACS Photonics. 2024;11(9):3570-3577. doi:10.1021/acsphotonics.4c00485","apa":"Taboada-Gutiérrez, J., Zhou, Y., Tresguerres-Mata, A. I. F., Lanza, C., Martínez-Suárez, A., Álvarez-Pérez, G., … Alonso-González, P. (2024). Unveiling the mechanism of phonon-polariton damping in α‑MoO3. ACS Photonics. American Chemical Society. https://doi.org/10.1021/acsphotonics.4c00485","ista":"Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, Lanza C, Martínez-Suárez A, Álvarez-Pérez G, Duan J, Martín JI, Vélez M, Prieto Gonzalez I, Bercher A, Teyssier J, Errea I, Nikitin AY, Martín-Sánchez J, Kuzmenko AB, Alonso-González P. 2024. Unveiling the mechanism of phonon-polariton damping in α‑MoO3. ACS Photonics. 11(9), 3570–3577.","mla":"Taboada-Gutiérrez, Javier, et al. “Unveiling the Mechanism of Phonon-Polariton Damping in Α‑MoO3.” ACS Photonics, vol. 11, no. 9, American Chemical Society, 2024, pp. 3570–77, doi:10.1021/acsphotonics.4c00485.","ieee":"J. Taboada-Gutiérrez et al., “Unveiling the mechanism of phonon-polariton damping in α‑MoO3,” ACS Photonics, vol. 11, no. 9. American Chemical Society, pp. 3570–3577, 2024.","chicago":"Taboada-Gutiérrez, Javier, Yixi Zhou, Ana I.F. Tresguerres-Mata, Christian Lanza, Abel Martínez-Suárez, Gonzalo Álvarez-Pérez, Jiahua Duan, et al. “Unveiling the Mechanism of Phonon-Polariton Damping in Α‑MoO3.” ACS Photonics. American Chemical Society, 2024. https://doi.org/10.1021/acsphotonics.4c00485.","short":"J. Taboada-Gutiérrez, Y. Zhou, A.I.F. Tresguerres-Mata, C. Lanza, A. Martínez-Suárez, G. Álvarez-Pérez, J. Duan, J.I. Martín, M. Vélez, I. Prieto Gonzalez, A. Bercher, J. Teyssier, I. Errea, A.Y. Nikitin, J. Martín-Sánchez, A.B. Kuzmenko, P. Alonso-González, ACS Photonics 11 (2024) 3570–3577."},"_id":"17479","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","publication":"ACS Photonics","day":"01","article_processing_charge":"No","oa_version":"Published Version","das_tickbox":"0","researchdata_availability":"no","file_date_updated":"2025-01-09T14:01:06Z","language":[{"iso":"eng"}],"pmid":1,"year":"2024","date_published":"2024-09-01T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1021/acsphotonics.4c00485","type":"journal_article","abstract":[{"text":"Phonon polaritons (PhPs), light coupled to lattice vibrations, in the highly anisotropic polar layered material molybdenum trioxide (α-MoO3) are currently the focus of intense research efforts due to their extreme subwavelength field confinement, directional propagation, and unprecedented low losses. Nevertheless, prior research has primarily concentrated on exploiting the squeezing and steering capabilities of α-MoO3 PhPs, without inquiring much into the dominant microscopic mechanism that determines their long lifetimes, which is key for their implementation in nanophotonic applications. This study delves into the fundamental processes that govern PhP damping in α-MoO3 by combining ab initio calculations with scattering-type scanning near-field optical microscopy (s-SNOM) and Fourier transform infrared (FTIR) spectroscopy measurements across a broad temperature range (8–300 K). The remarkable agreement between our theoretical predictions and experimental observations allows us to identify third-order anharmonic phonon–phonon scattering as the main damping mechanism of α-MoO3 PhPs. These findings shed light on the fundamental limits of low-loss PhPs, which is a crucial factor for assessing their implementation into nanophotonic devices.","lang":"eng"}],"volume":11,"file":[{"content_type":"application/pdf","date_updated":"2025-01-09T14:01:06Z","success":1,"date_created":"2025-01-09T14:01:06Z","access_level":"open_access","relation":"main_file","file_name":"2024_ACSPhotonics_TaboadaGutierrez_.pdf","creator":"dernst","checksum":"bd7e6a138c406e93eaf0a6268fc42bfe","file_id":"18819","file_size":2664512}],"arxiv":1,"ddc":["530"],"publication_identifier":{"eissn":["2330-4022"]},"title":"Unveiling the mechanism of phonon-polariton damping in α‑MoO3","month":"09","OA_place":"publisher","isi":1,"publication_status":"published","issue":"9","external_id":{"pmid":["39310295"],"arxiv":["2408.09811"],"isi":["001298164600001"]},"supplementarymaterial":"yes","intvolume":" 11","date_updated":"2026-10-21T08:08:01Z","department":[{"_id":"NanoFab"}],"OA_type":"hybrid","date_created":"2024-09-01T22:01:09Z","author":[{"last_name":"Taboada-Gutiérrez","full_name":"Taboada-Gutiérrez, Javier","first_name":"Javier"},{"full_name":"Zhou, Yixi","first_name":"Yixi","last_name":"Zhou"},{"first_name":"Ana I.F.","full_name":"Tresguerres-Mata, Ana I.F.","last_name":"Tresguerres-Mata"},{"last_name":"Lanza","full_name":"Lanza, Christian","first_name":"Christian"},{"last_name":"Martínez-Suárez","full_name":"Martínez-Suárez, Abel","first_name":"Abel"},{"full_name":"Álvarez-Pérez, Gonzalo","first_name":"Gonzalo","last_name":"Álvarez-Pérez"},{"last_name":"Duan","full_name":"Duan, Jiahua","first_name":"Jiahua"},{"first_name":"José Ignacio","full_name":"Martín, José Ignacio","last_name":"Martín"},{"first_name":"María","full_name":"Vélez, María","last_name":"Vélez"},{"last_name":"Prieto Gonzalez","full_name":"Prieto Gonzalez, Ivan","orcid":"0000-0002-7370-5357","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ivan"},{"last_name":"Bercher","first_name":"Adrien","full_name":"Bercher, Adrien"},{"first_name":"Jérémie","full_name":"Teyssier, Jérémie","last_name":"Teyssier"},{"full_name":"Errea, Ion","first_name":"Ion","last_name":"Errea"},{"first_name":"Alexey Y.","full_name":"Nikitin, Alexey Y.","last_name":"Nikitin"},{"last_name":"Martín-Sánchez","first_name":"Javier","full_name":"Martín-Sánchez, Javier"},{"full_name":"Kuzmenko, Alexey B.","first_name":"Alexey B.","last_name":"Kuzmenko"},{"first_name":"Pablo","full_name":"Alonso-González, Pablo","last_name":"Alonso-González"}],"publisher":"American Chemical Society","page":"3570-3577","acknowledgement":"Funding Sources ─ A.I.F.T.-M. and G.Á.-P. acknowledge support through the Severo Ochoa program from the Government of the Principality of Asturias (references PA-21-PF-BP20-117 and PA20-PF-BP19-053, respectively). A.B.K. and J.T.-G. acknowledge support from the Swiss National Science Foundation (grant # 200020_201096). J.M.-S. acknowledges financial support from the Ramón y Cajal Program of the Government of Spain and FSE (RYC2018-026196-I), the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-110308GA-I00/AEI/10.13039/501100011033) and project PCI2022-132953 funded by MCIN/AEI/10.13039/501100011033 and the EU “NextGenerationEU”/PRTR”. P.A.-G. acknowledges support from the European Research Council under starting grant no. 715496, 2DNANOPTICA and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-111156GB-I00). A.Y.N. acknowledges the Spanish Ministry of Science and Innovation (grant PID2020-115221GB-C42) and the Basque Department of Education (grant PIBA-2023-1-0007). M.V. and J.I.M. acknowledge support by Spanish MCIN/AEI/10.13039/501100011033/FEDER, UE under grant PID2022-136784NB and by Asturias FICYT under grant AYUD/2021/51185 with the support of FEDER funds. I.E. acknowledges funding from the Spanish Ministry of Science and Innovation (Grant No. PID2022-142861NA-I00) and the Department of Education, Universities, and Research of the Eusko Jaurlaritza and the University of the Basque Country UPV/EHU (Grant No. IT1527-22). J. Duan acknowledges the support from the Beijing Natural Science Foundation (Grant No. Z240005), and National Natural Science Foundation of China.","doi":"10.1021/acsphotonics.4c00485"},{"fulldoi":"https://doi.org/10.1145/3637528.3671978","type":"conference","abstract":[{"text":"Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we introduce the first practically efficient algorithm for computing expander decompositions and their hierarchies and demonstrate its effectiveness and utility by incorporating it as the core component in a novel solver for the normalized cut graph clustering objective.\r\nOur extensive experiments on a variety of large graphs show that our expander-based algorithm outperforms state-of-the-art solvers for normalized cut with respect to solution quality by a large margin on a variety of graph classes such as citation, e-mail, and social networks or web graphs while remaining competitive in running time.","lang":"eng"}],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"file":[{"success":1,"date_created":"2025-01-27T13:25:23Z","content_type":"application/pdf","date_updated":"2025-01-27T13:25:23Z","access_level":"open_access","relation":"main_file","file_name":"2024_ACMKDD_Hanauer.pdf","creator":"dernst","checksum":"1265d5cf6aa5f94157631651723c4a2b","file_size":1450331,"file_id":"18907"}],"ddc":["000"],"publication_identifier":{"isbn":["9798400704901"]},"title":"Expander hierarchies for normalized cuts on graphs","month":"09","OA_place":"publisher","isi":1,"publication_status":"published","conference":{"name":"KDD: Knowledge Discovery and Data Mining","location":"Barcelona, Spain","start_date":"2024-08-05","end_date":"2024-08-29"},"external_id":{"isi":["001324524201013"]},"supplementarymaterial":"yes","department":[{"_id":"MoHe"}],"date_updated":"2026-10-21T08:06:58Z","date_created":"2025-01-27T13:20:26Z","OA_type":"hybrid","author":[{"last_name":"Hanauer","first_name":"Kathrin","full_name":"Hanauer, Kathrin"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"full_name":"Münk, Robin","first_name":"Robin","last_name":"Münk"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"full_name":"Vötsch, Maximilian","first_name":"Maximilian","last_name":"Vötsch"}],"publisher":"ACM","page":"1016-1027","acknowledgement":"Monika Henzinger: This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke, Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","doi":"10.1145/3637528.3671978","scopus_import":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","quality_controlled":"1","citation":{"mla":"Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–27, doi:10.1145/3637528.3671978.","ama":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for normalized cuts on graphs. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM; 2024:1016-1027. doi:10.1145/3637528.3671978","ista":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.","apa":"Hanauer, K., Henzinger, M., Münk, R., Räcke, H., & Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 1016–1027). Barcelona, Spain: ACM. https://doi.org/10.1145/3637528.3671978","short":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.","chicago":"Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 1016–27. ACM, 2024. https://doi.org/10.1145/3637528.3671978.","ieee":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies for normalized cuts on graphs,” in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Barcelona, Spain, 2024, pp. 1016–1027."},"_id":"18906","has_accepted_license":"1","ec_funded":1,"publication":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (in subscription journal)","das_tickbox":"0","oa_version":"Published Version","researchdata_availability":"no","file_date_updated":"2025-01-27T13:25:23Z","language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z","year":"2024","oa":1},{"scopus_import":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","status":"public","_id":"17188","citation":{"ama":"Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171","apa":"Braun, P., Hahn, N., Hoefer, M., & Schecker, C. (2024). Delegated online search. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2024.104171","ista":"Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial Intelligence. 334, 104171.","mla":"Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171.","ieee":"P. Braun, N. Hahn, M. Hoefer, and C. Schecker, “Delegated online search,” Artificial Intelligence, vol. 334. Elsevier, 2024.","chicago":"Braun, Pirmin, Niklas Hahn, Martin Hoefer, and Conrad Schecker. “Delegated Online Search.” Artificial Intelligence. Elsevier, 2024. https://doi.org/10.1016/j.artint.2024.104171.","short":"P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024)."},"dataavailabilitystatement":"No data was used for the research described in the article.\r\n","has_accepted_license":"1","article_number":"104171","article_type":"original","publication":"Artificial Intelligence","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","das_tickbox":"1","oa_version":"Published Version","article_processing_charge":"Yes (in subscription journal)","researchdata_availability":"not applicable","file_date_updated":"2025-01-09T10:45:24Z","year":"2024","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"abstract":[{"lang":"eng","text":"In a delegation problem, a principal P with commitment power tries to pick one out of 𝑛 options.\r\nEach option is drawn independently from a known distribution. Instead of inspecting the options\r\nherself, P delegates the information acquisition to a rational and self-interested agent A. After\r\ninspection, A proposes one of the options, and P can accept or reject.\r\nDelegation is a classic setting in economic information design with many prominent applications,\r\nbut the computational problems are only poorly understood. In this paper, we study a natural\r\nonline variant of delegation, in which the agent searches through the options in an online fashion.\r\nFor each option, he has to irrevocably decide if he wants to propose the current option or discard\r\nit, before seeing information on the next option(s). How can we design algorithms for P that\r\napproximate the utility of her best option in hindsight?\r\nWe show that in general P can obtain a Θ(1∕𝑛)-approximation and extend this result to ratios\r\nof Θ(𝑘∕𝑛) in case (1) A has a lookahead of 𝑘 rounds, or (2) A can propose up to 𝑘 different\r\noptions. We provide fine-grained bounds independent of 𝑛 based on three parameters. If the ratio\r\nof maximum and minimum utility for A is bounded by a factor 𝛼, we obtain an Ω(loglog 𝛼∕ log 𝛼)-\r\napproximation algorithm, and we show that this is best possible. Additionally, if P cannot\r\ndistinguish options with the same value for herself, we show that ratios polynomial in 1∕𝛼 cannot\r\nbe avoided. If there are at most 𝛽 different utility values for A, we show a Θ(1∕𝛽)-approximation.\r\nIf the utilities of P and A for each option are related by a factor 𝛾, we obtain an Ω(1∕ log 𝛾)-\r\napproximation, where 𝑂(log log 𝛾∕ log 𝛾) is best possible."}],"volume":334,"type":"journal_article","fulldoi":"https://doi.org/10.1016/j.artint.2024.104171","file":[{"creator":"dernst","file_id":"18806","file_size":772226,"checksum":"f02a56bc7ea88f41fcc68968e4ceddf3","access_level":"open_access","date_created":"2025-01-09T10:45:24Z","success":1,"content_type":"application/pdf","date_updated":"2025-01-09T10:45:24Z","file_name":"2024_ArtificialIntelligence_Braun.pdf","relation":"main_file"}],"arxiv":1,"ddc":["000"],"publication_identifier":{"issn":["0004-3702"]},"month":"09","title":"Delegated online search","OA_place":"publisher","isi":1,"publication_status":"published","external_id":{"isi":["001260448100001"],"arxiv":["2203.01084"]},"corr_author":"1","supplementarymaterial":"no","date_created":"2024-06-30T22:01:05Z","OA_type":"hybrid","author":[{"last_name":"Braun","first_name":"Pirmin","full_name":"Braun, Pirmin"},{"last_name":"Hahn","full_name":"Hahn, Niklas","id":"0a01c7b2-b823-11ed-9928-cc3f874f9ffd","first_name":"Niklas"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"},{"last_name":"Schecker","first_name":"Conrad","full_name":"Schecker, Conrad"}],"date_updated":"2026-10-21T08:06:15Z","intvolume":" 334","department":[{"_id":"MoHe"}],"publisher":"Elsevier","acknowledgement":"Hahn gratefully acknowledges the support of GIF grant I-1419-118.4/2017. Hoefer gratefully acknowledges the support of GIF grant I-1419-118.4/2017, DFG Research Unit ADYN (project number 411362735), and DFG grant Ho 3831/9-1 (project number 514505843).","doi":"10.1016/j.artint.2024.104171"},{"researchdata_availability":"yes (supplementary data)","das_tickbox":"1","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-07-15T09:45:25Z","date_published":"2024-06-01T00:00:00Z","year":"2024","language":[{"iso":"eng"}],"pmid":1,"oa":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","_id":"17238","citation":{"chicago":"Barton, Nicholas H. “Limits to Species’ Range: The Tension between Local and Global Adaptation.” Journal of Evolutionary Biology. Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae052.","ieee":"N. H. Barton, “Limits to species’ range: The tension between local and global adaptation,” Journal of Evolutionary Biology, vol. 37, no. 6. Oxford University Press, pp. 605–615, 2024.","short":"N.H. Barton, Journal of Evolutionary Biology 37 (2024) 605–615.","ama":"Barton NH. Limits to species’ range: The tension between local and global adaptation. Journal of Evolutionary Biology. 2024;37(6):605-615. doi:10.1093/jeb/voae052","apa":"Barton, N. H. (2024). Limits to species’ range: The tension between local and global adaptation. Journal of Evolutionary Biology. Oxford University Press. https://doi.org/10.1093/jeb/voae052","ista":"Barton NH. 2024. Limits to species’ range: The tension between local and global adaptation. Journal of Evolutionary Biology. 37(6), 605–615.","mla":"Barton, Nicholas H. “Limits to Species’ Range: The Tension between Local and Global Adaptation.” Journal of Evolutionary Biology, vol. 37, no. 6, Oxford University Press, 2024, pp. 605–15, doi:10.1093/jeb/voae052."},"quality_controlled":"1","status":"public","has_accepted_license":"1","dataavailabilitystatement":"All code used to generate the figures is in the accompanying Mathematica notebook.","article_type":"review","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","publication":"Journal of Evolutionary Biology","publication_status":"published","isi":1,"supplementarymaterial":"yes","corr_author":"1","external_id":{"pmid":["38683160"],"isi":["001225323900001"]},"issue":"6","page":"605-615","publisher":"Oxford University Press","date_created":"2024-07-14T22:01:12Z","author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"intvolume":" 37","department":[{"_id":"NiBa"}],"date_updated":"2026-10-21T08:11:09Z","doi":"10.1093/jeb/voae052","acknowledgement":"This work was supported by a grant from the ERC, 101055327, “HaplotypeStructure”. I thank Himani Sachdeva, Michal Hledik, Jitka Polechova, and the reviewers for their helpful comments.","abstract":[{"lang":"eng","text":"We know that heritable variation is abundant, and that selection causes all but the smallest populations to rapidly shift beyond their original trait distribution. So then, what limits the range of a species? There are physical constraints and also population genetic limits to the effectiveness of selection, ultimately set by population size. Global adaptation, where the same genotype is favoured over the whole range, is most efficient when based on a multitude of weakly selected alleles and is effective even when local demes are small, provided that there is some gene flow. In contrast, local adaptation is sensitive to gene flow and may require alleles with substantial effect. How can populations combine the advantages of large effective size with the ability to specialise into local niches? To what extent does reproductive isolation help resolve this tension? I address these questions using eco-evolutionary models of polygenic adaptation, contrasting discrete demes with continuousspace."}],"volume":37,"type":"journal_article","fulldoi":"https://doi.org/10.1093/jeb/voae052","project":[{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","name":"Understanding the evolution of continuous genomes","grant_number":"101055327"}],"file":[{"file_size":1194263,"file_id":"17241","checksum":"94e6b68bddf6cadcec29c7f41647359f","creator":"dernst","file_name":"2024_JourEvolutionaryBiology_Barton.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2024-07-15T09:45:25Z","success":1,"date_created":"2024-07-15T09:45:25Z"}],"ddc":["570"],"month":"06","title":"Limits to species' range: The tension between local and global adaptation","publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]}},{"oa":1,"language":[{"iso":"eng"}],"pmid":1,"year":"2024","date_published":"2024-06-01T00:00:00Z","researchdata_availability":"yes","article_processing_charge":"No","das_tickbox":"1","oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Journal of Evolutionary Biology","day":"01","article_type":"original","dataavailabilitystatement":"Individual high-quality reads (paired-end reads) generated in the present study (fq.gz files) and the filtered vcf file can be accessed via the Dryad repository at https://doi.org/10.5061/dryad.tb2rbp064. Additionally, the scaffolds assembly of the Laminaria digitata genome, utilized for read mapping and produced by Gernot Glöckner, is also available in the same repository. Furthermore, the custom R script developed for identifying temporal outlier SNPs, along with the FST datasets comparing observed and simulated FST between time points, can be found on GitHub at https://doi.org/10.5281/zenodo.10946282.","citation":{"short":"L. Reynes, L. Fouqueau, D. Aurelle, S. Mauger, C. Destombe, M. Valero, Journal of Evolutionary Biology 37 (2024) 677–692.","chicago":"Reynes, Lauric, Louise Fouqueau, Didier Aurelle, Stephane Mauger, Christophe Destombe, and Myriam Valero. “Temporal Genomics Help in Deciphering Neutral and Adaptive Patterns in the Contemporary Evolution of Kelp Populations.” Journal of Evolutionary Biology. Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae048.","ieee":"L. Reynes, L. Fouqueau, D. Aurelle, S. Mauger, C. Destombe, and M. Valero, “Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary evolution of kelp populations,” Journal of Evolutionary Biology, vol. 37, no. 6. Oxford University Press, pp. 677–692, 2024.","mla":"Reynes, Lauric, et al. “Temporal Genomics Help in Deciphering Neutral and Adaptive Patterns in the Contemporary Evolution of Kelp Populations.” Journal of Evolutionary Biology, vol. 37, no. 6, Oxford University Press, 2024, pp. 677–92, doi:10.1093/jeb/voae048.","ista":"Reynes L, Fouqueau L, Aurelle D, Mauger S, Destombe C, Valero M. 2024. Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary evolution of kelp populations. Journal of Evolutionary Biology. 37(6), 677–692.","apa":"Reynes, L., Fouqueau, L., Aurelle, D., Mauger, S., Destombe, C., & Valero, M. (2024). Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary evolution of kelp populations. Journal of Evolutionary Biology. Oxford University Press. https://doi.org/10.1093/jeb/voae048","ama":"Reynes L, Fouqueau L, Aurelle D, Mauger S, Destombe C, Valero M. Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary evolution of kelp populations. Journal of Evolutionary Biology. 2024;37(6):677-692. doi:10.1093/jeb/voae048"},"_id":"17237","status":"public","quality_controlled":"1","scopus_import":"1","doi":"10.1093/jeb/voae048","acknowledgement":"This work was funded by the EU project MARFOR Biodiversa/004/2015. L.F. was additionally funded by the Region Bretagne (ARED 2017 REEALG) and the NOMIS Foundation. The project leading to this publication has received funding from the EC2CO (CNRS) fund and from the European FEDER Fund under project 1166-39417.\r\nThis work is especially dedicated to the memory of Gernot Glöckner who contributed to the sequencing of Laminaria digitata genome and passed away in very recent time. The authors thank the ABiMS platform of the Roscoff biological station (http://abims.sb-roscoff.fr) for providing the HPC resources that contributed to the search results reported in this document. We also acknowledge the staff of the “Cluster de calcul intensif HPC” Platform of the OSU Institut Pythéas (Aix-Marseille Université, INSU-CNRS) for providing the computing facilities.","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.14003","open_access":"1"}],"publisher":"Oxford University Press","page":"677-692","intvolume":" 37","date_updated":"2026-10-21T08:10:14Z","department":[{"_id":"NiBa"}],"author":[{"last_name":"Reynes","full_name":"Reynes, Lauric","first_name":"Lauric"},{"id":"1676e173-8143-11ed-8927-fe165216a93f","first_name":"Louise","full_name":"Fouqueau, Louise","orcid":"0000-0003-0371-9339","last_name":"Fouqueau"},{"first_name":"Didier","full_name":"Aurelle, Didier","last_name":"Aurelle"},{"last_name":"Mauger","full_name":"Mauger, Stephane","first_name":"Stephane"},{"first_name":"Christophe","full_name":"Destombe, Christophe","last_name":"Destombe"},{"first_name":"Myriam","full_name":"Valero, Myriam","last_name":"Valero"}],"date_created":"2024-07-14T22:01:12Z","supplementarymaterial":"yes","issue":"6","external_id":{"pmid":["38629140"],"arxiv":["2404.14003"]},"publication_status":"published","title":"Temporal genomics help in deciphering neutral and adaptive patterns in the contemporary evolution of kelp populations","month":"06","related_material":{"record":[{"id":"22867","status":"public","relation":"research_data"}]},"publication_identifier":{"eissn":["1420-9101"],"issn":["1010-061X"]},"arxiv":1,"type":"journal_article","fulldoi":"https://doi.org/10.1093/jeb/voae048","abstract":[{"text":"The impact of climate change on populations will be contingent upon their contemporary adaptive evolution. In this study, we investigated the contemporary evolution of 4 populations of the cold-water kelp Laminaria digitata by analyzing their spatial and temporal genomic variations using ddRAD-sequencing. These populations were sampled from the center to the southern margin of its north-eastern Atlantic distribution at 2 time points, spanning at least 2 generations. Through genome scans for local adaptation at a single time point, we identified candidate loci that showed clinal variation correlated with changes in sea surface temperature (SST) along latitudinal gradients. This finding suggests that SST may drive the adaptive response of these kelp populations, although factors such as species’ demographic history should also be considered. Additionally, we performed a simulation approach to distinguish the effect of selection from genetic drift in allele frequency changes over time. This enabled the detection of loci in the southernmost population that exhibited temporal differentiation beyond what would be expected from genetic drift alone: these are candidate loci which could have evolved under selection over time. In contrast, we did not detect any outlier locus based on temporal differentiation in the population from the North Sea, which also displayed low and decreasing levels of genetic diversity. The diverse evolutionary scenarios observed among populations can be attributed to variations in the prevalence of selection relative to genetic drift across different environments. Therefore, our study highlights the potential of temporal genomics to offer valuable insights into the contemporary evolution of marine foundation species facing climate change.","lang":"eng"}],"volume":37},{"quality_controlled":"1","status":"public","_id":"18922","citation":{"ama":"Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components of directed graphs in linear time. In: 65th Annual Symposium on Foundations of Computer Science. IEEE; 2024:62-85. doi:10.1109/focs61266.2024.00015","apa":"Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In 65th Annual Symposium on Foundations of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015","ista":"Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 62–85.","mla":"Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85, doi:10.1109/focs61266.2024.00015.","ieee":"L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected components of directed graphs in linear time,” in 65th Annual Symposium on Foundations of Computer Science, Chicago, IL, United States, 2024, pp. 62–85.","chicago":"Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In 65th Annual Symposium on Foundations of Computer Science, 62–85. IEEE, 2024. https://doi.org/10.1109/focs61266.2024.00015.","short":"L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85."},"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"65th Annual Symposium on Foundations of Computer Science","day":"01","oa_version":"None","das_tickbox":"0","article_processing_charge":"No","researchdata_availability":"no","date_published":"2024-10-01T00:00:00Z","year":"2024","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Let G be a directed graph with m edges and n vertices. We present a deterministic linear-time algorithm for computing the 3-edge-connected components of G. This is a significant improvement over the previous best bound by Georgiadis et al. [SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel characterization of 2-edge cuts in directed graphs and on a new technique that exploits the concept of divergent spanning trees and 2-connectivity-light graphs, and requires a careful modification of the minset-poset technique of Gabow [TALG 2016]. As a side result, our new technique yields also an oracle for providing in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected. The oracle uses space O(n) and can be built in O(mlog n) time: given two query vertices, it determines in constant time whether they are 3-edge-connected, or provides a k-edge cut, with k≤ 2, that separates them."}],"type":"conference","fulldoi":"https://doi.org/10.1109/focs61266.2024.00015","publication_identifier":{"isbn":["9798331516741"]},"month":"10","title":"Computing the 3-edge-connected components of directed graphs in linear time","external_id":{"isi":["001419526400005"]},"corr_author":"1","conference":{"start_date":"2024-10-27","end_date":"2024-10-30","location":"Chicago, IL, United States","name":"FOCS: Foundations of Computer Science"},"supplementarymaterial":"no","isi":1,"publication_status":"published","acknowledgement":"Giuseppe F. Italiano was partially supported by the Italian Ministry of\r\nUniversity and Reseach under PRIN Project n. 2022TS4Y3N - EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.\r\n","doi":"10.1109/focs61266.2024.00015","OA_type":"closed access","author":[{"first_name":"Loukas","full_name":"Georgiadis, Loukas","last_name":"Georgiadis"},{"last_name":"Italiano","first_name":"Giuseppe F.","full_name":"Italiano, Giuseppe F."},{"first_name":"Evangelos","id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949","full_name":"Kosinas, Evangelos","last_name":"Kosinas"}],"date_created":"2025-01-27T14:50:23Z","department":[{"_id":"MoHe"}],"date_updated":"2026-10-21T08:07:18Z","page":"62-85","publisher":"IEEE"},{"oa":1,"year":"2024","date_published":"2024-06-28T00:00:00Z","language":[{"iso":"eng"}],"pmid":1,"researchdata_availability":"no","das_tickbox":"0","oa_version":"Published Version","article_processing_charge":"No","day":"28","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"letter_note","publication":"Journal of evolutionary biology","_id":"17207","citation":{"ama":"Fouqueau L, Polechova J. Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of evolutionary biology. 2024;37(6):579-587. doi:10.1093/jeb/voae067","apa":"Fouqueau, L., & Polechova, J. (2024). Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of Evolutionary Biology. Oxford University Press. https://doi.org/10.1093/jeb/voae067","ista":"Fouqueau L, Polechova J. 2024. Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of evolutionary biology. 37(6), 579–587.","mla":"Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing Environments: Integrating Theory with Data.” Journal of Evolutionary Biology, vol. 37, no. 6, Oxford University Press, 2024, pp. 579–87, doi:10.1093/jeb/voae067.","chicago":"Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing Environments: Integrating Theory with Data.” Journal of Evolutionary Biology. Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae067.","ieee":"L. Fouqueau and J. Polechova, “Eco-evolutionary dynamics in changing environments: Integrating theory with data,” Journal of evolutionary biology, vol. 37, no. 6. Oxford University Press, pp. 579–587, 2024.","short":"L. Fouqueau, J. Polechova, Journal of Evolutionary Biology 37 (2024) 579–587."},"quality_controlled":"1","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","doi":"10.1093/jeb/voae067","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/jeb/voae067"}],"acknowledgement":"This research was funded by the Austrian Science Fund (FWF), project doi: 10.55776/P32896, Institutional Identifier: 501100002428, grant number: P32896 and L.F. acknowledges the support of the NOMIS-ISTA Fellowship Program.\r\nWe would like to thank Nick Barton, Roger Butlin, Stuart Baird, Patrik Nosil, and Jason Sexton for their insightful comments on the earlier drafts, and to John Carchrae for his valuable contribution in refining phrasing and enhancing clarity. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","page":"579-587","publisher":"Oxford University Press","author":[{"last_name":"Fouqueau","first_name":"Louise","id":"1676e173-8143-11ed-8927-fe165216a93f","orcid":"0000-0003-0371-9339","full_name":"Fouqueau, Louise"},{"id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","first_name":"Jitka","orcid":"0000-0003-0951-3112","full_name":"Polechova, Jitka","last_name":"Polechova"}],"date_created":"2024-07-07T22:01:04Z","intvolume":" 37","date_updated":"2026-10-21T08:08:57Z","department":[{"_id":"NiBa"}],"supplementarymaterial":"no","external_id":{"pmid":["38941551"],"isi":["001258359900001"]},"issue":"6","publication_status":"published","isi":1,"month":"06","title":"Eco-evolutionary dynamics in changing environments: Integrating theory with data","publication_identifier":{"eissn":["1420-9101"]},"ddc":["570"],"project":[{"grant_number":"P32896","name":"Causes and consequences of population fragmentation","_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"volume":37,"fulldoi":"https://doi.org/10.1093/jeb/voae067","type":"journal_article"},{"ddc":["570"],"month":"09","title":"Multiscale spatial analysis of two plant–insect interactions: Effects of landscape, resource distribution, and other insects","publication_identifier":{"eissn":["1572-9761"],"issn":["0921-2973"]},"abstract":[{"lang":"eng","text":"Context: Biotic resource exploitation is a critical determinant of species’ distributions. However, quantifying resource exploitation patterns through space and time can be difficult, complicating their incorporation in spatial ecology studies. Therefore, understanding the local drivers of spatial patterns of resource exploitation may contribute to better large-scale species distribution models.\r\nObjectives: We investigated (1) how the resource exploitation patterns of two trophic interactions (plant–insect) are explained by insect behaviour, resource aggregation, and potential insect-insect interactions. We also analyzed how (2) resource patch size and (3) resource accessibility in a heterogeneous landscape affected host exploitation patterns.\r\nMethods: We quantified nectar robbing by insects in the genus Bombus (bumblebees) and seed predation by Brachypterolus vestitus larvae (Antirrhinum beetle) on Antirrhinum majus L. (wild snapdragons) in the Pyrenees Mountains, Catalonia, Spain. We tested hypotheses about resource exploitation by integrating spatial analyses at multiple scales.\r\nResults: Both trophic interactions were aggregated, explained by the aggregation of their resource. At some scales, nectar robbing is more aggregated than the resource. Trophic interaction abundance is proportional to resource patch size, following the ideal free distribution model. Landscape features do not explain the locations exploited. Nectar robbing and seed predation occur together more often than expected.\r\nConclusions: Our findings suggest that multiple biotic and ecological spatial factors may simultaneously affect resource exploitation at a local scale. These findings should be considered when developing agricultural projects, management plans and conservation policies."}],"volume":39,"fulldoi":"https://doi.org/10.1007/s10980-024-01899-9","type":"journal_article","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"P32166","name":"Snapdragon Speciation","_id":"05959E1C-7A3F-11EA-A408-12923DDC885E"}],"file":[{"checksum":"2e1cbc320ec1b4447a5a8562a90bcbc3","file_id":"18054","file_size":1494987,"creator":"dernst","relation":"main_file","file_name":"2024_LandscapeEcology_Pocull.pdf","date_created":"2024-09-11T07:14:03Z","success":1,"content_type":"application/pdf","date_updated":"2024-09-11T07:14:03Z","access_level":"open_access"}],"publisher":"Springer Nature","author":[{"last_name":"Pocull Belles","first_name":"Guillem","id":"54359172-700c-11ef-a103-c1d91ceac6d6","full_name":"Pocull Belles, Guillem"},{"last_name":"Baskett","full_name":"Baskett, Carina","orcid":"0000-0002-7354-8574","first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2024-09-08T22:01:11Z","intvolume":" 39","department":[{"_id":"NiBa"}],"date_updated":"2026-10-21T08:12:11Z","doi":"10.1007/s10980-024-01899-9","acknowledgement":"For the beetle barcoding, we are very thankful to Brent Emerson’s laboratory at the Consejo Superior de Investigaciones Científicas (CSIC) at the Instituto de Productos Naturales y Agrobiología (IPNA) in La Laguna, Tenerife. Many thanks to numerous field assistants, especially Sandra Cuevas Gallego, Beatriz Pablo Carmona, Luís Santos Cid and Alex Fuster, for their assistance in data collection. Finally, we thank Jesús Muñoz, Virgilio Gómez-Rubio, and two anonymous reviewers for comments that greatly improved the quality of the manuscript.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). CB received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. NB was funded by the FWF grant “Löwenmaul speciation” P 32166-B32.","publication_status":"published","isi":1,"supplementarymaterial":"yes","corr_author":"1","external_id":{"isi":["001304011900001"]},"issue":"9","ec_funded":1,"article_number":"172","has_accepted_license":"1","dataavailabilitystatement":"The datasets generated and analysed during the current study will be deposited to the ISTA Research Explorer repository upon manuscript acceptance. Voucher specimens of insects are deposited in the Museo Nacional de Ciencias Naturales, Spain.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Landscape Ecology","article_type":"original","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","_id":"17888","citation":{"short":"G. Pocull Belles, C. Baskett, N.H. Barton, Landscape Ecology 39 (2024).","chicago":"Pocull Belles, Guillem, Carina Baskett, and Nicholas H Barton. “Multiscale Spatial Analysis of Two Plant–Insect Interactions: Effects of Landscape, Resource Distribution, and Other Insects.” Landscape Ecology. Springer Nature, 2024. https://doi.org/10.1007/s10980-024-01899-9.","ieee":"G. Pocull Belles, C. Baskett, and N. H. Barton, “Multiscale spatial analysis of two plant–insect interactions: Effects of landscape, resource distribution, and other insects,” Landscape Ecology, vol. 39, no. 9. Springer Nature, 2024.","mla":"Pocull Belles, Guillem, et al. “Multiscale Spatial Analysis of Two Plant–Insect Interactions: Effects of Landscape, Resource Distribution, and Other Insects.” Landscape Ecology, vol. 39, no. 9, 172, Springer Nature, 2024, doi:10.1007/s10980-024-01899-9.","ama":"Pocull Belles G, Baskett C, Barton NH. Multiscale spatial analysis of two plant–insect interactions: Effects of landscape, resource distribution, and other insects. Landscape Ecology. 2024;39(9). doi:10.1007/s10980-024-01899-9","apa":"Pocull Belles, G., Baskett, C., & Barton, N. H. (2024). Multiscale spatial analysis of two plant–insect interactions: Effects of landscape, resource distribution, and other insects. Landscape Ecology. Springer Nature. https://doi.org/10.1007/s10980-024-01899-9","ista":"Pocull Belles G, Baskett C, Barton NH. 2024. Multiscale spatial analysis of two plant–insect interactions: Effects of landscape, resource distribution, and other insects. Landscape Ecology. 39(9), 172."},"quality_controlled":"1","status":"public","year":"2024","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"researchdata_availability":"yes","das_tickbox":"1","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-09-11T07:14:03Z"},{"fulldoi":"https://doi.org/10.1242/jeb.246217","type":"journal_article","volume":227,"abstract":[{"lang":"eng","text":"Elaborate sexual signals are thought to have evolved and be maintained to serve as honest indicators of signaller quality. One measure of quality is health, which can be affected by parasite infection. Cnemaspis mysoriensis is a diurnal gecko that is often infested with ectoparasites in the wild, and males of this species express visual (coloured gular patches) and chemical (femoral gland secretions) traits that receivers could assess during social interactions. In this paper, we tested whether ectoparasites affect individual health, and whether signal quality is an indicator of ectoparasite levels. In wild lizards, we found that ectoparasite level was negatively correlated with body condition in both sexes. Moreover, some characteristics of both visual and chemical traits in males were strongly associated with ectoparasite levels. Specifically, males with higher ectoparasite levels had yellow gular patches with lower brightness and chroma, and chemical secretions with a lower proportion of aromatic compounds. We then determined whether ectoparasite levels in males influence female behaviour. Using sequential choice trials, wherein females were provided with either the visual or the chemical signals of wild-caught males that varied in ectoparasite level, we found that only chemical secretions evoked an elevated female response towards less parasitised males. Simultaneous choice trials in which females were exposed to the chemical secretions from males that varied in parasite level further confirmed a preference for males with lower parasites loads. Overall, we find that although health (body condition) or ectoparasite load can be honestly advertised through multiple modalities, the parasite-mediated female response is exclusively driven by chemical signals."}],"file":[{"access_level":"open_access","success":1,"date_created":"2024-01-23T12:08:24Z","content_type":"application/pdf","date_updated":"2024-01-23T12:08:24Z","file_name":"2024_JourExperimBiology_Pal.pdf","relation":"main_file","creator":"dernst","file_id":"14877","file_size":594128,"checksum":"136325372f6f45abaa62a71e2d23bfb6"}],"ddc":["570"],"keyword":["Insect Science","Molecular Biology","Animal Science and Zoology","Aquatic Science","Physiology","Ecology","Evolution","Behavior and Systematics"],"title":"Too much information? Males convey parasite levels using more signal modalities than females utilise","month":"01","related_material":{"record":[{"id":"22868","status":"public","relation":"research_data"}],"link":[{"relation":"software","url":"https://github.com/arka-pal/Cnemaspis-SexualSignaling"}]},"publication_identifier":{"issn":["1477-9145"],"eissn":["0022-0949"]},"publication_status":"published","isi":1,"supplementarymaterial":"yes","issue":"1","external_id":{"isi":["001214515700016"],"pmid":["38054353"]},"corr_author":"1","publisher":"The Company of Biologists","department":[{"_id":"NiBa"}],"date_updated":"2026-10-21T08:13:07Z","intvolume":" 227","author":[{"orcid":"0000-0002-4530-8469","full_name":"Pal, Arka","first_name":"Arka","id":"6AAB2240-CA9A-11E9-9C1A-D9D1E5697425","last_name":"Pal"},{"last_name":"Joshi","first_name":"Mihir","full_name":"Joshi, Mihir"},{"first_name":"Maria","full_name":"Thaker, Maria","last_name":"Thaker"}],"date_created":"2024-01-22T08:14:49Z","doi":"10.1242/jeb.246217","acknowledgement":"We thank Anuradha Batabyal and Shakilur Kabir for scientific discussions, and help with sampling and colour analyses. We thank Muralidhar and the central LCMS facility of the IISc for their technical support with the GCMS.\r\nResearch funding was provided by the Department of Science and Technology Fund for Improvement of S&T Infrastructure (DST-FIST), the Department of Biotechnology-Indian Institute of Science (DBT-IISc) partnership program and a Science and Engineering Research Board (SERB) grant to M.T. (EMR/2017/002228). Open Access funding provided by Indian Institute of Science. Deposited in PMC for immediate release.","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","citation":{"short":"A. Pal, M. Joshi, M. Thaker, Journal of Experimental Biology 227 (2024).","ieee":"A. Pal, M. Joshi, and M. Thaker, “Too much information? Males convey parasite levels using more signal modalities than females utilise,” Journal of Experimental Biology, vol. 227, no. 1. The Company of Biologists, 2024.","chicago":"Pal, Arka, Mihir Joshi, and Maria Thaker. “Too Much Information? Males Convey Parasite Levels Using More Signal Modalities than Females Utilise.” Journal of Experimental Biology. The Company of Biologists, 2024. https://doi.org/10.1242/jeb.246217.","mla":"Pal, Arka, et al. “Too Much Information? Males Convey Parasite Levels Using More Signal Modalities than Females Utilise.” Journal of Experimental Biology, vol. 227, no. 1, jeb246217, The Company of Biologists, 2024, doi:10.1242/jeb.246217.","ista":"Pal A, Joshi M, Thaker M. 2024. Too much information? Males convey parasite levels using more signal modalities than females utilise. Journal of Experimental Biology. 227(1), jeb246217.","apa":"Pal, A., Joshi, M., & Thaker, M. (2024). Too much information? Males convey parasite levels using more signal modalities than females utilise. Journal of Experimental Biology. The Company of Biologists. https://doi.org/10.1242/jeb.246217","ama":"Pal A, Joshi M, Thaker M. Too much information? Males convey parasite levels using more signal modalities than females utilise. Journal of Experimental Biology. 2024;227(1). doi:10.1242/jeb.246217"},"_id":"14850","status":"public","quality_controlled":"1","has_accepted_license":"1","article_number":"jeb246217","dataavailabilitystatement":"Raw data for this paper are available from Zenodo (doi:10.5281/zenodo.10423540). All analysis code is available from GitHub (https://github.com/arka-pal/Cnemaspis-SexualSignaling)","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"10","publication":"Journal of Experimental Biology","researchdata_availability":"yes","article_processing_charge":"Yes (via OA deal)","das_tickbox":"1","oa_version":"Published Version","file_date_updated":"2024-01-23T12:08:24Z","language":[{"iso":"eng"}],"pmid":1,"date_published":"2024-01-10T00:00:00Z","year":"2024","oa":1},{"file_date_updated":"2024-05-13T08:22:21Z","researchdata_availability":"yes","article_processing_charge":"Yes (via OA deal)","das_tickbox":"1","oa_version":"Published Version","oa":1,"pmid":1,"language":[{"iso":"eng"}],"year":"2024","date_published":"2024-06-01T00:00:00Z","citation":{"apa":"Barton, N. H., & Sachdeva, H. (2024). Limits to selection on standing variation in an asexual population. Theoretical Population Biology. Elsevier. https://doi.org/10.1016/j.tpb.2024.04.001","ista":"Barton NH, Sachdeva H. 2024. Limits to selection on standing variation in an asexual population. Theoretical Population Biology. 157, 129–137.","ama":"Barton NH, Sachdeva H. Limits to selection on standing variation in an asexual population. Theoretical Population Biology. 2024;157:129-137. doi:10.1016/j.tpb.2024.04.001","mla":"Barton, Nicholas H., and Himani Sachdeva. “Limits to Selection on Standing Variation in an Asexual Population.” Theoretical Population Biology, vol. 157, Elsevier, 2024, pp. 129–37, doi:10.1016/j.tpb.2024.04.001.","chicago":"Barton, Nicholas H, and Himani Sachdeva. “Limits to Selection on Standing Variation in an Asexual Population.” Theoretical Population Biology. Elsevier, 2024. https://doi.org/10.1016/j.tpb.2024.04.001.","ieee":"N. H. Barton and H. Sachdeva, “Limits to selection on standing variation in an asexual population,” Theoretical Population Biology, vol. 157. Elsevier, pp. 129–137, 2024.","short":"N.H. Barton, H. Sachdeva, Theoretical Population Biology 157 (2024) 129–137."},"_id":"15358","status":"public","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","publication":"Theoretical Population Biology","day":"01","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","dataavailabilitystatement":"Selection_SGV_Asexual (Original data) (GitHub).","supplementarymaterial":"yes","external_id":{"isi":["001237016800001"],"pmid":["38643838"]},"corr_author":"1","publication_status":"published","isi":1,"doi":"10.1016/j.tpb.2024.04.001","acknowledgement":"We thank Emmanuel Schertzer and two reviewers for comments on this manuscript. NB thanks the European Research Council for support via the grant “HaplotypeStructure” 101055327. We would also like to give our sincere thanks to Alison Etheridge for her insight, inspiration and support over the years.","publisher":"Elsevier","page":"129-137","intvolume":" 157","date_updated":"2026-10-21T08:14:58Z","department":[{"_id":"NiBa"}],"date_created":"2024-05-05T22:01:03Z","author":[{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani","full_name":"Sachdeva, Himani","last_name":"Sachdeva"}],"project":[{"grant_number":"101055327","name":"Understanding the evolution of continuous genomes","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"}],"file":[{"creator":"dernst","file_size":1098292,"file_id":"15383","checksum":"78f36488d24f868d5913624e9c8d88bf","access_level":"open_access","success":1,"date_created":"2024-05-13T08:22:21Z","content_type":"application/pdf","date_updated":"2024-05-13T08:22:21Z","file_name":"2024_TheorPopulationBiology_Barton.pdf","relation":"main_file"}],"fulldoi":"https://doi.org/10.1016/j.tpb.2024.04.001","type":"journal_article","volume":157,"abstract":[{"lang":"eng","text":"We consider how a population of N haploid individuals responds to directional selection on standing variation, with no new variation from recombination or mutation. Individuals have trait values z1,…,zN, which are drawn from a distribution ψ; the fitness of individual i is proportional to [Formula: see text] . For illustration, we consider the Laplace and Gaussian distributions, which are parametrised only by the variance V0, and show that for large N, there is a scaling limit which depends on a single parameter NV0. When selection is weak relative to drift (NV0≪1), the variance decreases exponentially at rate 1/N, and the expected ultimate gain in log fitness (scaled by V0), is just NV0, which is the same as Robertson's (1960) prediction for a sexual population. In contrast, when selection is strong relative to drift (NV0≫1), the ultimate gain can be found by approximating the establishment of alleles by a branching process in which each allele competes independently with the population mean and the fittest allele to establish is certain to fix. Then, if the probability of survival to time t∼1/V0 of an allele with value z is P(z), with mean P¯, the winning allele is the fittest of NP¯ survivors drawn from a distribution ψP/P¯. The expected ultimate change is ∼2log(1.15NV0) for a Gaussian distribution, and ∼-12log0.36NV0-log-log0.36NV0 for a Laplace distribution. This approach also predicts the variability of the process, and its dynamics; we show that in the strong selection regime, the expected genetic variance decreases as ∼t-3 at large times. We discuss how these results may be related to selection on standing variation that is spread along a linear chromosome."}],"title":"Limits to selection on standing variation in an asexual population","month":"06","publication_identifier":{"eissn":["1096-0325"],"issn":["0040-5809"]},"ddc":["570"]},{"publication_identifier":{"eissn":["1362-4555"],"issn":["0168-9525"]},"month":"04","title":"Diverse pathways to speciation revealed by marine snails","ddc":["570"],"file":[{"creator":"dernst","checksum":"3077ea808c4cdc24d02dc58aced7eb35","file_id":"17313","file_size":2288340,"content_type":"application/pdf","date_updated":"2024-07-22T12:05:58Z","success":1,"date_created":"2024-07-22T12:05:58Z","access_level":"open_access","relation":"main_file","file_name":"2024_TrendsGenetics_Johannesson.pdf"}],"abstract":[{"lang":"eng","text":"Speciation is a key evolutionary process that is not yet fully understood. Combining population genomic and ecological data from multiple diverging pairs of marine snails (Littorina) supports the search for speciation mechanisms. Placing pairs on a one-dimensional speciation continuum, from undifferentiated populations to species, obscured the complexity of speciation. Adding multiple axes helped to describe either speciation routes or reproductive isolation in the snails. Divergent ecological selection repeatedly generated barriers between ecotypes, but appeared less important in completing speciation while genetic incompatibilities played a key role. Chromosomal inversions contributed to genomic barriers, but with variable impact. A multidimensional (hypercube) approach supported framing of questions and identification of knowledge gaps and can be useful to understand speciation in many other systems."}],"volume":40,"fulldoi":"https://doi.org/10.1016/j.tig.2024.01.002","type":"journal_article","acknowledgement":"KJ, MR, and RKB were supported by grants from the Swedish Research Council (2021-0419, 2021-05243, and 2018-03695, respectively). RKB was also supported by the Leverhulme Trust (RPG-2021-141), RF by FCT- Portuguese Science Foundation (PTDC/BIA-EVL/1614/2021 and 2020.00275.CEECIND), and AMW by Norwegian Research Council RCN (Project number 315287). We thank the members of the Integration of Speciation Research network for stimulating discussions, the Littorina research community for important contributions of data and analyses, and Cynthia Riginos for useful comments on an earlier draft.","doi":"10.1016/j.tig.2024.01.002","author":[{"first_name":"Kerstin","full_name":"Johannesson, Kerstin","last_name":"Johannesson"},{"first_name":"Rui","full_name":"Faria, Rui","last_name":"Faria"},{"last_name":"Le Moan","first_name":"Alan","full_name":"Le Moan, Alan"},{"last_name":"Rafajlović","full_name":"Rafajlović, Marina","first_name":"Marina"},{"last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Butlin","first_name":"Roger K.","full_name":"Butlin, Roger K."},{"full_name":"Stankowski, Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","first_name":"Sean","last_name":"Stankowski"}],"date_created":"2024-03-10T23:00:54Z","date_updated":"2026-10-21T08:13:54Z","intvolume":" 40","department":[{"_id":"NiBa"}],"page":"337-351","publisher":"Elsevier","external_id":{"pmid":["38395682"],"isi":["001224671300001"]},"issue":"4","supplementarymaterial":"yes","isi":1,"publication_status":"published","article_type":"review","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Trends in Genetics","has_accepted_license":"1","quality_controlled":"1","status":"public","_id":"15099","citation":{"mla":"Johannesson, Kerstin, et al. “Diverse Pathways to Speciation Revealed by Marine Snails.” Trends in Genetics, vol. 40, no. 4, Elsevier, 2024, pp. 337–51, doi:10.1016/j.tig.2024.01.002.","ama":"Johannesson K, Faria R, Le Moan A, et al. Diverse pathways to speciation revealed by marine snails. Trends in Genetics. 2024;40(4):337-351. doi:10.1016/j.tig.2024.01.002","ista":"Johannesson K, Faria R, Le Moan A, Rafajlović M, Westram AM, Butlin RK, Stankowski S. 2024. Diverse pathways to speciation revealed by marine snails. Trends in Genetics. 40(4), 337–351.","apa":"Johannesson, K., Faria, R., Le Moan, A., Rafajlović, M., Westram, A. M., Butlin, R. K., & Stankowski, S. (2024). Diverse pathways to speciation revealed by marine snails. Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2024.01.002","short":"K. Johannesson, R. Faria, A. Le Moan, M. Rafajlović, A.M. Westram, R.K. Butlin, S. Stankowski, Trends in Genetics 40 (2024) 337–351.","ieee":"K. Johannesson et al., “Diverse pathways to speciation revealed by marine snails,” Trends in Genetics, vol. 40, no. 4. Elsevier, pp. 337–351, 2024.","chicago":"Johannesson, Kerstin, Rui Faria, Alan Le Moan, Marina Rafajlović, Anja M Westram, Roger K. Butlin, and Sean Stankowski. “Diverse Pathways to Speciation Revealed by Marine Snails.” Trends in Genetics. Elsevier, 2024. https://doi.org/10.1016/j.tig.2024.01.002."},"scopus_import":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"year":"2024","date_published":"2024-04-01T00:00:00Z","pmid":1,"language":[{"iso":"eng"}],"file_date_updated":"2024-07-22T12:05:58Z","oa_version":"Published Version","das_tickbox":"0","article_processing_charge":"Yes (in subscription journal)","researchdata_availability":"no"},{"quality_controlled":"1","status":"public","_id":"18949","citation":{"ama":"Stankowski S, Cutter AD, Satokangas I, et al. Toward the integration of speciation research. Evolutionary Journal of the Linnean Society. 2024;3(1). doi:10.1093/evolinnean/kzae001","apa":"Stankowski, S., Cutter, A. D., Satokangas, I., Lerch, B. A., Rolland, J., Smadja, C. M., … Kulmuni, J. (2024). Toward the integration of speciation research. Evolutionary Journal of the Linnean Society. Oxford University Press. https://doi.org/10.1093/evolinnean/kzae001","ista":"Stankowski S, Cutter AD, Satokangas I, Lerch BA, Rolland J, Smadja CM, Segami Marzal JC, Cooney CR, Feulner PGD, Domingos FMCB, North HL, Yamaguchi R, Butlin RK, Wolf JBW, Coughlan J, Heidbreder P, Hernández-Gutiérrez R, Barnard-Kubow KB, Peede D, Rancilhac L, Salvador RB, Thompson KA, Stacy EA, Moyle LC, Garlovsky MD, Maulana A, Kantelinen A, Cacho NI, Schneemann H, Domínguez M, Dopman EB, Lohse K, Rometsch SJ, Comeault AA, Merrill RM, Scordato ESC, Singhal S, Pärssinen V, Lackey ACR, Kumar S, Meier JI, Barton NH, Fraisse C, Ravinet M, Kulmuni J. 2024. Toward the integration of speciation research. Evolutionary Journal of the Linnean Society. 3(1), kzae001.","mla":"Stankowski, Sean, et al. “Toward the Integration of Speciation Research.” Evolutionary Journal of the Linnean Society, vol. 3, no. 1, kzae001, Oxford University Press, 2024, doi:10.1093/evolinnean/kzae001.","chicago":"Stankowski, Sean, Asher D Cutter, Ina Satokangas, Brian A Lerch, Jonathan Rolland, Carole M Smadja, J Carolina Segami Marzal, et al. “Toward the Integration of Speciation Research.” Evolutionary Journal of the Linnean Society. Oxford University Press, 2024. https://doi.org/10.1093/evolinnean/kzae001.","ieee":"S. Stankowski et al., “Toward the integration of speciation research,” Evolutionary Journal of the Linnean Society, vol. 3, no. 1. Oxford University Press, 2024.","short":"S. Stankowski, A.D. Cutter, I. Satokangas, B.A. Lerch, J. Rolland, C.M. Smadja, J.C. Segami Marzal, C.R. Cooney, P.G.D. Feulner, F.M.C.B. Domingos, H.L. North, R. Yamaguchi, R.K. Butlin, J.B.W. Wolf, J. Coughlan, P. Heidbreder, R. Hernández-Gutiérrez, K.B. Barnard-Kubow, D. Peede, L. Rancilhac, R.B. Salvador, K.A. Thompson, E.A. Stacy, L.C. Moyle, M.D. Garlovsky, A. Maulana, A. Kantelinen, N.I. Cacho, H. Schneemann, M. Domínguez, E.B. Dopman, K. Lohse, S.J. Rometsch, A.A. Comeault, R.M. Merrill, E.S.C. Scordato, S. Singhal, V. Pärssinen, A.C.R. Lackey, S. Kumar, J.I. Meier, N.H. Barton, C. Fraisse, M. Ravinet, J. Kulmuni, Evolutionary Journal of the Linnean Society 3 (2024)."},"scopus_import":"1","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"16","publication":"Evolutionary Journal of the Linnean Society","article_type":"original","article_number":"kzae001","has_accepted_license":"1","file_date_updated":"2025-01-29T10:52:40Z","oa_version":"Published Version","das_tickbox":"0","article_processing_charge":"Yes","researchdata_availability":"no","oa":1,"date_published":"2024-02-16T00:00:00Z","year":"2024","language":[{"iso":"eng"}],"file":[{"file_name":"2024_EvolJourLinneanSoc_Stankowski.pdf","relation":"main_file","access_level":"open_access","date_updated":"2025-01-29T10:52:40Z","content_type":"application/pdf","success":1,"date_created":"2025-01-29T10:52:40Z","file_size":3935454,"file_id":"18950","checksum":"db08120a92527acaef476bd93f2b87f9","creator":"dernst"}],"volume":3,"abstract":[{"text":"Speciation research—the scientific field focused on understanding the origin and diversity of species—has a long and complex history. While relevant to one another, the specific goals and activities of speciation researchers are highly diverse, and scattered across a collection of different perspectives. Thus, our understanding of speciation will benefit from efforts to bridge scientific findings and the diverse people who do the work. In this paper, we outline two ways of integrating speciation research: (i) scientific integration, through the bringing together of ideas, data, and approaches; and (ii) social integration, by creating ways for a diversity of researchers to participate in the scientific process. We then discuss five challenges to integration: (i) the multidisciplinary nature of speciation research, (ii) the complex language of speciation; (iii) a bias toward certain study systems; (iv) the challenges of working across scales; and (v) inconsistent measures and reporting standards. We provide practical steps that individuals and groups can take to help overcome these challenges, and argue that integration is a team effort in which we all have a role to play.","lang":"eng"}],"type":"journal_article","fulldoi":"https://doi.org/10.1093/evolinnean/kzae001","license":"https://creativecommons.org/licenses/by-nc/4.0/","publication_identifier":{"issn":["2752-938X"]},"month":"02","title":"Toward the integration of speciation research","ddc":["570"],"corr_author":"1","issue":"1","supplementarymaterial":"yes","OA_place":"publisher","publication_status":"published","acknowledgement":"We thank the staff of the Tvärminne Zoological Station (University of Helsinki) for their hospitality during the workshop. We are also grateful to everyone who applied to attend the workshop.\r\nFunding for the workshop was provided by the European Society for Evolutionary Biology through the Special Topic Network (STN) funding scheme.","doi":"10.1093/evolinnean/kzae001","author":[{"last_name":"Stankowski","full_name":"Stankowski, Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","first_name":"Sean"},{"last_name":"Cutter","first_name":"Asher D","full_name":"Cutter, Asher D"},{"last_name":"Satokangas","first_name":"Ina","full_name":"Satokangas, Ina"},{"first_name":"Brian A","full_name":"Lerch, Brian A","last_name":"Lerch"},{"full_name":"Rolland, Jonathan","first_name":"Jonathan","last_name":"Rolland"},{"last_name":"Smadja","first_name":"Carole M","full_name":"Smadja, Carole M"},{"first_name":"J Carolina","full_name":"Segami Marzal, J Carolina","last_name":"Segami Marzal"},{"last_name":"Cooney","first_name":"Christopher R","full_name":"Cooney, Christopher R"},{"last_name":"Feulner","full_name":"Feulner, Philine G D","first_name":"Philine G D"},{"last_name":"Domingos","full_name":"Domingos, Fabricius Maia Chaves Bicalho","first_name":"Fabricius Maia Chaves Bicalho"},{"last_name":"North","full_name":"North, Henry L","first_name":"Henry L"},{"full_name":"Yamaguchi, Ryo","first_name":"Ryo","last_name":"Yamaguchi"},{"last_name":"Butlin","full_name":"Butlin, Roger K","first_name":"Roger K"},{"full_name":"Wolf, Jochen B W","first_name":"Jochen B W","last_name":"Wolf"},{"full_name":"Coughlan, Jenn","first_name":"Jenn","last_name":"Coughlan"},{"full_name":"Heidbreder, Patrick","first_name":"Patrick","last_name":"Heidbreder"},{"first_name":"Rebeca","full_name":"Hernández-Gutiérrez, Rebeca","last_name":"Hernández-Gutiérrez"},{"last_name":"Barnard-Kubow","first_name":"Karen B","full_name":"Barnard-Kubow, Karen B"},{"last_name":"Peede","full_name":"Peede, David","first_name":"David"},{"first_name":"Loïs","full_name":"Rancilhac, Loïs","last_name":"Rancilhac"},{"last_name":"Salvador","full_name":"Salvador, Rodrigo Brincalepe","first_name":"Rodrigo Brincalepe"},{"full_name":"Thompson, Ken A","first_name":"Ken A","last_name":"Thompson"},{"last_name":"Stacy","first_name":"Elizabeth A","full_name":"Stacy, Elizabeth A"},{"full_name":"Moyle, Leonie C","first_name":"Leonie C","last_name":"Moyle"},{"last_name":"Garlovsky","full_name":"Garlovsky, Martin D","first_name":"Martin D"},{"last_name":"Maulana","full_name":"Maulana, Arif","first_name":"Arif"},{"full_name":"Kantelinen, Annina","first_name":"Annina","last_name":"Kantelinen"},{"full_name":"Cacho, N Ivalú","first_name":"N Ivalú","last_name":"Cacho"},{"last_name":"Schneemann","full_name":"Schneemann, Hilde","first_name":"Hilde"},{"full_name":"Domínguez, Marisol","first_name":"Marisol","last_name":"Domínguez"},{"last_name":"Dopman","first_name":"Erik B","full_name":"Dopman, Erik B"},{"last_name":"Lohse","first_name":"Konrad","full_name":"Lohse, Konrad"},{"first_name":"Sina J","full_name":"Rometsch, Sina J","last_name":"Rometsch"},{"full_name":"Comeault, Aaron A","first_name":"Aaron A","last_name":"Comeault"},{"first_name":"Richard M","full_name":"Merrill, Richard M","last_name":"Merrill"},{"full_name":"Scordato, Elizabeth S C","first_name":"Elizabeth S C","last_name":"Scordato"},{"last_name":"Singhal","first_name":"Sonal","full_name":"Singhal, Sonal"},{"first_name":"Varpu","full_name":"Pärssinen, Varpu","last_name":"Pärssinen"},{"first_name":"Alycia C R","full_name":"Lackey, Alycia C R","last_name":"Lackey"},{"full_name":"Kumar, Sanghamitra","first_name":"Sanghamitra","last_name":"Kumar"},{"last_name":"Meier","first_name":"Joana I","full_name":"Meier, Joana I"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton"},{"id":"32DF5794-F248-11E8-B48F-1D18A9856A87","first_name":"Christelle","full_name":"Fraisse, Christelle","orcid":"0000-0001-8441-5075","last_name":"Fraisse"},{"last_name":"Ravinet","full_name":"Ravinet, Mark","first_name":"Mark"},{"full_name":"Kulmuni, Jonna","first_name":"Jonna","last_name":"Kulmuni"}],"OA_type":"gold","date_created":"2025-01-29T10:38:17Z","intvolume":" 3","date_updated":"2026-10-21T08:21:06Z","department":[{"_id":"NiBa"}],"publisher":"Oxford University Press"},{"volume":8,"abstract":[{"lang":"eng","text":"Chromosomal rearrangements can lead to the coupling of reproductive barriers, but whether and how they contribute to the completion of speciation remains unclear. Marine snails of the genus Littorina repeatedly form hybrid zones between populations segregating for multiple inversion arrangements, providing opportunities to study their barrier effects. Here, we analyzed 2 adjacent transects across hybrid zones between 2 ecotypes of Littorina fabalis (“large” and “dwarf”) adapted to different wave exposure conditions on a Swedish island. Applying whole-genome sequencing, we found 12 putative inversions on 9 of 17 chromosomes. Nine of the putative inversions reached near differential fixation between the 2 ecotypes, and all were in strong linkage disequilibrium. These inversions cover 20% of the genome and carry 93% of divergent single nucleotide polymorphisms (SNPs). Bimodal hybrid zones in both transects indicated that the 2 ecotypes of Littorina fabalis maintain their genetic and phenotypic integrity following contact. The bimodality reflects the strong coupling between inversion clines and the extension of the barrier effect across the whole genome. Demographic inference suggests that coupling arose during a period of allopatry and has been maintained for > 1,000 generations after secondary contact. Overall, this study shows that the coupling of multiple chromosomal inversions contributes to strong reproductive isolation. Notably, 2 of the putative inversions overlap with inverted genomic regions associated with ecotype differences in a closely related species (Littorina saxatilis), suggesting the same regions, with similar structural variants, repeatedly contribute to ecotype evolution in distinct species."}],"fulldoi":"https://doi.org/10.1093/evlett/qrae014","type":"journal_article","file":[{"file_name":"2024_EvolutionLetter_Moan.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2025-01-27T13:33:14Z","date_created":"2025-01-27T13:33:14Z","success":1,"file_size":24356661,"file_id":"18909","checksum":"2f7780b7b6b3489755f1815f476639c6","creator":"dernst"}],"ddc":["570"],"month":"04","title":"Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes","publication_identifier":{"issn":["2056-3744"]},"related_material":{"record":[{"relation":"research_data","status":"public","id":"22870"}]},"publication_status":"published","OA_place":"publisher","isi":1,"supplementarymaterial":"yes","external_id":{"pmid":["39479507"],"isi":["001206532900001"]},"issue":"4","page":"575-586","publisher":"Oxford University Press","author":[{"full_name":"Le Moan, Alan","first_name":"Alan","last_name":"Le Moan"},{"last_name":"Stankowski","id":"43161670-5719-11EA-8025-FABC3DDC885E","first_name":"Sean","full_name":"Stankowski, Sean"},{"first_name":"Marina","full_name":"Rafajlović, Marina","last_name":"Rafajlović"},{"last_name":"Ortega-Martinez","first_name":"Olga","full_name":"Ortega-Martinez, Olga"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"last_name":"Butlin","first_name":"Roger K","full_name":"Butlin, Roger K"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"}],"date_created":"2025-01-27T13:30:27Z","OA_type":"gold","department":[{"_id":"NiBa"}],"intvolume":" 8","date_updated":"2026-10-21T08:20:21Z","doi":"10.1093/evlett/qrae014","acknowledgement":"The computations and data handling were enabled by resources provided by the Swedish National Infrastructure for Computing at UPPMAX partially funded by the Swedish Research Council through grant agreement no. 2018-05973. We thank all the member of the Littorina team for the stimulating discussions about the manuscripts, James Reeves for his help the implementation of Hsplit, and Thomas Broquet for his useful comments in the latter stage of manuscript revisions.","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"scopus_import":"1","_id":"18908","citation":{"short":"A. Le Moan, S. Stankowski, M. Rafajlović, O. Ortega-Martinez, R. Faria, R.K. Butlin, K. Johannesson, Evolution Letters 8 (2024) 575–586.","ieee":"A. Le Moan et al., “Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes,” Evolution Letters, vol. 8, no. 4. Oxford University Press, pp. 575–586, 2024.","chicago":"Le Moan, Alan, Sean Stankowski, Marina Rafajlović, Olga Ortega-Martinez, Rui Faria, Roger K Butlin, and Kerstin Johannesson. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” Evolution Letters. Oxford University Press, 2024. https://doi.org/10.1093/evlett/qrae014.","mla":"Le Moan, Alan, et al. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” Evolution Letters, vol. 8, no. 4, Oxford University Press, 2024, pp. 575–86, doi:10.1093/evlett/qrae014.","ama":"Le Moan A, Stankowski S, Rafajlović M, et al. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. 2024;8(4):575-586. doi:10.1093/evlett/qrae014","apa":"Le Moan, A., Stankowski, S., Rafajlović, M., Ortega-Martinez, O., Faria, R., Butlin, R. K., & Johannesson, K. (2024). Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrae014","ista":"Le Moan A, Stankowski S, Rafajlović M, Ortega-Martinez O, Faria R, Butlin RK, Johannesson K. 2024. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. 8(4), 575–586."},"quality_controlled":"1","status":"public","has_accepted_license":"1","dataavailabilitystatement":"The raw fasta files are available on NCBI SRA under the project name “Littorina fabalis transect WGS” with accession number PRJNA836378. The filtered vcf file, metadata, as well as the R scripts used to analyse these datasets, are available as a zenodo archive here: doi: 10.5281/zenodo.10790257.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"letter_note","day":"23","publication":"Evolution Letters","researchdata_availability":"yes","oa_version":"Published Version","das_tickbox":"1","article_processing_charge":"Yes","file_date_updated":"2025-01-27T13:33:14Z","year":"2024","date_published":"2024-04-23T00:00:00Z","pmid":1,"language":[{"iso":"eng"}],"oa":1},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Science Advances","day":"11","article_type":"original","dataavailabilitystatement":"All analysis scripts and data needed to evaluate the conclusions of the paper are present in the paper and/or the Supplementary Materials and have been archived on Zenodo (63) at https://zenodo.org/doi/10.5281/zenodo.12159343 and are available on Github at https://github.com/fernandoGarcia21/littorina_saxatilis_skerry.","article_number":"eadp2102","has_accepted_license":"1","status":"public","quality_controlled":"1","citation":{"mla":"Garcia Castillo, Diego Fernando, et al. “Predicting Rapid Adaptation in Time from Adaptation in Space: A 30-Year Field Experiment in Marine Snails.” Science Advances, vol. 10, no. 41, eadp2102, AAAS, 2024, doi:10.1126/sciadv.adp2102.","ama":"Garcia Castillo DF, Barton NH, Faria R, et al. Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails. Science Advances. 2024;10(41). doi:10.1126/sciadv.adp2102","apa":"Garcia Castillo, D. F., Barton, N. H., Faria, R., Larsson, J., Stankowski, S., Butlin, R., … Westram, A. M. (2024). Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails. Science Advances. AAAS. https://doi.org/10.1126/sciadv.adp2102","ista":"Garcia Castillo DF, Barton NH, Faria R, Larsson J, Stankowski S, Butlin R, Johannesson K, Westram AM. 2024. Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails. Science Advances. 10(41), eadp2102.","short":"D.F. Garcia Castillo, N.H. Barton, R. Faria, J. Larsson, S. Stankowski, R. Butlin, K. Johannesson, A.M. Westram, Science Advances 10 (2024).","chicago":"Garcia Castillo, Diego Fernando, Nicholas H Barton, Rui Faria, Jenny Larsson, Sean Stankowski, Roger Butlin, Kerstin Johannesson, and Anja M Westram. “Predicting Rapid Adaptation in Time from Adaptation in Space: A 30-Year Field Experiment in Marine Snails.” Science Advances. AAAS, 2024. https://doi.org/10.1126/sciadv.adp2102.","ieee":"D. F. Garcia Castillo et al., “Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails,” Science Advances, vol. 10, no. 41. AAAS, 2024."},"_id":"18491","scopus_import":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"APC_amount":"4569,23 EUR","oa":1,"language":[{"iso":"eng"}],"year":"2024","date_published":"2024-10-11T00:00:00Z","file_date_updated":"2024-11-04T09:35:49Z","article_processing_charge":"Yes","oa_version":"Published Version","das_tickbox":"1","researchdata_availability":"yes (supplementary data)","related_material":{"record":[{"status":"public","id":"18498","relation":"research_data"},{"relation":"dissertation_contains","id":"20991","status":"public"}],"link":[{"relation":"software","url":"https://github.com/fernandoGarcia21/littorina_saxatilis_skerry"}]},"publication_identifier":{"eissn":["2375-2548"]},"title":"Predicting rapid adaptation in time from adaptation in space: A 30-year field experiment in marine snails","PlanS_conform":"1","month":"10","DOAJ_listed":"1","ddc":["570"],"file":[{"checksum":"96aa0d3640fa9401975138e59054f84e","file_size":1154107,"file_id":"18499","creator":"dernst","relation":"main_file","file_name":"2024_ScienceAdv_Castillo.pdf","date_created":"2024-11-04T09:35:49Z","success":1,"content_type":"application/pdf","date_updated":"2024-11-04T09:35:49Z","access_level":"open_access"}],"project":[{"grant_number":"101055327","name":"Understanding the evolution of continuous genomes","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"},{"_id":"05959E1C-7A3F-11EA-A408-12923DDC885E","name":"Snapdragon Speciation","grant_number":"P32166"},{"call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund"}],"fulldoi":"https://doi.org/10.1126/sciadv.adp2102","type":"journal_article","volume":10,"abstract":[{"text":"Predicting the outcomes of adaptation is a major goal of evolutionary biology. When temporal changes in the environment mirror spatial gradients, it opens up the potential for predicting the course of adaptive evolution over time based on patterns of spatial genetic and phenotypic variation. We assessed this approach in a 30-year transplant experiment in the intertidal snail Littorina saxatilis. In 1992, snails were transplanted from a predation-dominated environment to one dominated by wave action. On the basis of spatial patterns, we predicted transitions in shell size and morphology, allele frequencies at positions throughout the genome, and chromosomal rearrangement frequencies. Observed changes closely agreed with predictions and transformation was both dramatic and rapid. Hence, adaptation can be predicted from knowledge of the phenotypic and genetic variation among populations.","lang":"eng"}],"acknowledgement":"This work was received funding from the following: Norwegian Research Council RCN project 315287 (A.M.W.), Swedish Research Council 2021-04191 (K.J.), European Research Council grant 101055327 HaplotypeStructure (N.B.), Austrian Science Fund FWF; P 32166-B32 Snapdragon Speciation (N.B.), European Research Council (R.B.), and Portuguese Foundation for Science and Technology FCT: 2020.00275.CEECIND and PTDC/BIA-EVL/1614/2021 (R.F.).","doi":"10.1126/sciadv.adp2102","intvolume":" 10","department":[{"_id":"NiBa"}],"date_updated":"2026-10-21T08:18:22Z","date_created":"2024-11-03T23:01:44Z","OA_type":"gold","author":[{"full_name":"Garcia Castillo, Diego Fernando","first_name":"Diego Fernando","id":"ae681a14-dc74-11ea-a0a7-c6ef18161701","last_name":"Garcia Castillo"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"last_name":"Larsson","first_name":"Jenny","full_name":"Larsson, Jenny"},{"last_name":"Stankowski","first_name":"Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","full_name":"Stankowski, Sean"},{"full_name":"Butlin, Roger","first_name":"Roger","last_name":"Butlin"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"last_name":"Westram","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"}],"publisher":"AAAS","issue":"41","corr_author":"1","external_id":{"isi":["001354405400018"]},"supplementarymaterial":"yes","isi":1,"OA_place":"publisher","publication_status":"published"}]