[{"publisher":"World Scientific Publishing","quality_controlled":"1","oa":1,"isi":1,"year":"2023","day":"09","publication":"Reviews in Mathematical Physics","date_published":"2023-01-09T00:00:00Z","doi":"10.1142/S0129055X2350006X","date_created":"2023-01-29T23:00:59Z","article_number":"2350006","citation":{"short":"M. Falconi, N.K. Leopold, D.J. Mitrouskas, S.P. Petrat, Reviews in Mathematical Physics 35 (2023).","ieee":"M. Falconi, N. K. Leopold, D. J. Mitrouskas, and S. P. Petrat, “Bogoliubov dynamics and higher-order corrections for the regularized Nelson model,” Reviews in Mathematical Physics, vol. 35, no. 4. World Scientific Publishing, 2023.","apa":"Falconi, M., Leopold, N. K., Mitrouskas, D. J., & Petrat, S. P. (2023). Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X2350006X","ama":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 2023;35(4). doi:10.1142/S0129055X2350006X","mla":"Falconi, Marco, et al. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics, vol. 35, no. 4, 2350006, World Scientific Publishing, 2023, doi:10.1142/S0129055X2350006X.","ista":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. 2023. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 35(4), 2350006.","chicago":"Falconi, Marco, Nikolai K Leopold, David Johannes Mitrouskas, and Sören P Petrat. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics. World Scientific Publishing, 2023. https://doi.org/10.1142/S0129055X2350006X."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Falconi, Marco","last_name":"Falconi","first_name":"Marco"},{"id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","last_name":"Leopold"},{"full_name":"Mitrouskas, David Johannes","last_name":"Mitrouskas","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","first_name":"David Johannes"},{"id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","first_name":"Sören P","last_name":"Petrat","orcid":"0000-0002-9166-5889","full_name":"Petrat, Sören P"}],"external_id":{"isi":["000909760300001"],"arxiv":["2110.00458"]},"article_processing_charge":"No","title":"Bogoliubov dynamics and higher-order corrections for the regularized Nelson model","abstract":[{"lang":"eng","text":"We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2110.00458","open_access":"1"}],"month":"01","intvolume":" 35","publication_identifier":{"issn":["0129-055X"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":35,"_id":"12430","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-08-16T11:47:27Z","department":[{"_id":"RoSe"}]},{"acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"20","publication":"Nature Computational Science","has_accepted_license":"1","year":"2023","doi":"10.1038/s43588-023-00410-9","date_published":"2023-03-20T00:00:00Z","date_created":"2023-03-26T22:01:08Z","page":"254-263","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67","name":"Functional Advantages of Critical Brain Dynamics","grant_number":"M03318"},{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","name":"Efficient coding with biophysical realism","grant_number":"P34015"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” Nature Computational Science, vol. 3. Springer Nature, pp. 254–263, 2023.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 2023;3:254-263. doi:10.1038/s43588-023-00410-9","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-023-00410-9","mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science, vol. 3, Springer Nature, 2023, pp. 254–63, doi:10.1038/s43588-023-00410-9.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science. Springer Nature, 2023. https://doi.org/10.1038/s43588-023-00410-9."},"title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","author":[{"first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","full_name":"Lombardi, Fabrizio","orcid":"0000-0003-2623-5249"},{"id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","first_name":"Selver","full_name":"Pepic, Selver","last_name":"Pepic"},{"first_name":"Oren","last_name":"Shriki","full_name":"Shriki, Oren"},{"first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","last_name":"Tkačik"},{"last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2108.06686"]},"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations."}],"month":"03","intvolume":" 3","scopus_import":"1","file":[{"date_created":"2023-08-16T12:39:57Z","file_name":"2023_NatureCompScience_Lombardi.pdf","date_updated":"2023-08-16T12:39:57Z","file_size":4474284,"creator":"dernst","file_id":"14073","checksum":"7c63b2b2edfd68aaffe96d70ca6a865a","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2662-8457"]},"publication_status":"published","volume":3,"ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","_id":"12762","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2023-08-16T12:41:53Z","department":[{"_id":"GaTk"},{"_id":"GradSch"}],"file_date_updated":"2023-08-16T12:39:57Z"},{"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.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the\r\nAustrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”,\r\nI 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nThis work was done in part while Gramoz Goranci was at Institute for Theoretical Studies, ETH Zurich, Switzerland. There, he was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. We also thank Richard Peng, Thatchaphol Saranurak, Sebastian Forster and Sushant Sachdeva for helpful discussions, and the anonymous reviewers for their insightful comments.","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","year":"2023","has_accepted_license":"1","date_created":"2023-08-20T22:01:14Z","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.69","article_number":"69","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":"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.","ista":"Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69.","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69.","apa":"Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69","ama":"Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69","ieee":"G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"title":"Efficient data structures for incremental exact and approximate maximum flow","article_processing_charge":"Yes","external_id":{"unknown":["2211.09606"]},"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"oa_version":"Published Version","abstract":[{"text":"We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.","lang":"eng"}],"intvolume":" 261","month":"07","alternative_title":["LIPIcs"],"scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_name":"2023_LIPIcsICALP_Goranci.pdf","date_created":"2023-08-21T06:59:05Z","creator":"dernst","file_size":875910,"date_updated":"2023-08-21T06:59:05Z","success":1,"file_id":"14089","checksum":"074177e815a1656de5d4071c7a3dffa6","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"ec_funded":1,"volume":261,"_id":"14085","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"type":"conference","ddc":["000"],"date_updated":"2023-08-21T07:00:49Z","department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T06:59:05Z"},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"We thank Heng Guo for helpful explanations of algorithms for sampling connected subgraphs and matchings, Maksym Serbyn for bringing to our attention the Wang-Landau algorithm and its use in physics.","date_created":"2023-08-20T22:01:14Z","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.72","publication":"50th International Colloquium on Automata, Languages, and Programming","day":"01","year":"2023","has_accepted_license":"1","article_number":"72","title":"Parameter estimation for Gibbs distributions","external_id":{"arxiv":["2007.10824"]},"article_processing_charge":"Yes","author":[{"first_name":"David G.","full_name":"Harris, David G.","last_name":"Harris"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.","ieee":"D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","apa":"Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72","ama":"Harris DG, Kolmogorov V. Parameter estimation for Gibbs distributions. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.72","chicago":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72.","ista":"Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72."},"intvolume":" 261","month":"07","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"text":"A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n].\r\nThe partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min)\r\nWe develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph.","lang":"eng"}],"volume":261,"language":[{"iso":"eng"}],"file":[{"file_name":"2023_LIPIcsICALP_Harris.pdf","date_created":"2023-08-21T06:45:16Z","file_size":917791,"date_updated":"2023-08-21T06:45:16Z","creator":"dernst","success":1,"file_id":"14088","checksum":"6dee0684245bb1c524b9c955db1e933d","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14","location":"Paderborn, Germany","start_date":"2023-07-10"},"type":"conference","_id":"14084","department":[{"_id":"VlKo"}],"file_date_updated":"2023-08-21T06:45:16Z","ddc":["000","510"],"date_updated":"2023-08-21T06:49:11Z"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014].\r\nTo achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges."}],"month":"07","intvolume":" 261","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"date_created":"2023-08-21T07:04:36Z","file_name":"2023_LIPIcsICALP_HenzingerM.pdf","date_updated":"2023-08-21T07:04:36Z","file_size":930943,"creator":"dernst","checksum":"a5eef225014e003efbfbe4830fdd23cb","file_id":"14090","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959772785"],"issn":["18688969"]},"publication_status":"published","volume":261,"ec_funded":1,"_id":"14086","status":"public","type":"conference","conference":{"location":"Paderborn, Germany","end_date":"2023-07-14","start_date":"2023-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2023-08-21T07:05:47Z","file_date_updated":"2023-08-21T07:04:36Z","department":[{"_id":"MoHe"}],"acknowledgement":" Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Jan Vondrák: Supported by NSF Award 2127781.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","has_accepted_license":"1","year":"2023","doi":"10.4230/LIPIcs.ICALP.2023.74","date_published":"2023-07-01T00:00:00Z","date_created":"2023-08-20T22:01:14Z","article_number":"74","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.","ista":"Henzinger MH, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 74.","mla":"Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.","ama":"Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74","apa":"Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74","ieee":"M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","short":"M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"title":"Faster submodular maximization for several classes of matroids","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Paul","full_name":"Liu, Paul","last_name":"Liu"},{"first_name":"Jan","full_name":"Vondrák, Jan","last_name":"Vondrák"},{"first_name":"Da Wei","last_name":"Zheng","full_name":"Zheng, Da Wei"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2305.00122"]}}]