ICALP 2019 Booklet
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Lipics-ICALP-2019-0.Pdf (0.4
46th International Colloquium on Automata, Languages, and Programming ICALP 2019, July 9–12, 2019, Patras, Greece Edited by Christel Baier Ioannis Chatzigiannakis Paola Flocchini Stefano Leonardi E A T C S L I P I c s – Vo l . 132 – ICALP 2019 w w w . d a g s t u h l . d e / l i p i c s Editors Christel Baier TU Dresden, Germany [email protected] Ioannis Chatzigiannakis Sapienza University of Rome, Italy [email protected] Paola Flocchini University of Ottawa, Canada paola.fl[email protected] Stefano Leonardi Sapienza University of Rome, Italy [email protected] ACM Classification 2012 Theory of computation ISBN 978-3-95977-109-2 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-109-2. Publication date July, 2019 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at https://portal.dnb.de. License This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0): https://creativecommons.org/licenses/by/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.ICALP.2019.0 ISBN 978-3-95977-109-2 ISSN 1868-8969 https://www.dagstuhl.de/lipics 0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics. -
The Presburger Award for Young Scientists 2020
The Presburger Award for Young Scientists 2020 Call for Nominations Deadline: 15 February 2020 Starting in 2010, the European Association for Theoretical Computer Science (EATCS) established the Presburger Award. The Award is conferred annually at the International Colloquium on Automata, Languages and Programming (ICALP) to a young scientist (in exceptional cases to several young scientists) for outstand- ing contributions in theoretical computer science, documented by a published pa- per or a series of published papers. The Award is named after Moj˙zeszPresburger who accomplished his path- breaking work on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929. Nominations for the Presburger Award can be submitted by any member or group of members of the theoretical computer science community except the nom- inee and his/her advisors for the master thesis and the doctoral dissertation. Nom- inated scientists have to be at most 35 years at the time of the deadline of nomi- nation (i.e., for the Presburger Award of 2020 the date of birth should be in 1984 or later). The Presburger Award Committee of 2020 consists of Thore Husfeldt (Lund University and IT University of Copenhagen), Meena Mahajan (Chennai Mathematical Institute) and Anca Muscholl (LaBRI, Bordeaux, chair). Nomina- tions, consisting of a two page justification and (links to) the respective papers, as well as additional supporting letters, should be sent by e-mail to: [email protected] The subject line of every nomination should start with Presburger Award 2020, and the message must be received before February 15th, 2020. -
48Th International Colloquium on Automata, Languages, and Programming
48th International Colloquium on Automata, Languages, and Programming ICALP 2021, July 12–16, 2021, Glasgow, Scotland (Virtual Conference) Edited by Nikhil Bansal Emanuela Merelli James Worrell E A T C S L I P I c s – Vo l . 198 – ICALP 2021 w w w . d a g s t u h l . d e / l i p i c s Editors Nikhil Bansal CWI Amsterdam, Netherlands [email protected] Emanuela Merelli University of Camerino, Italy [email protected] James Worrell University of Oxford, UK [email protected] ACM Classification 2012 Theory of Computation ISBN 978-3-95977-195-5 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at https://www.dagstuhl.de/dagpub/978-3-95977-195-5. Publication date July, 2021 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at https://portal.dnb.de. License This work is licensed under a Creative Commons Attribution 4.0 International license (CC-BY 4.0): https://creativecommons.org/licenses/by/4.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.ICALP.2021.0 ISBN 978-3-95977-195-5 ISSN 1868-8969 https://www.dagstuhl.de/lipics 0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics. -
The Presburger Award for Young Scientists 2021
The Presburger Award for Young Scientists 2021 Call for Nominations Deadline: 15 February 2021 The Presburger Award recognises outstanding contributions by a young scientist in theoretical computer science, documented by a published paper or a series of published papers. It is named after Mojzesz Presburger who accomplished his ground-breaking work on decidability of the theory of addition (known today as Presburger arithmetic) as a student in 1929. The award is conferred annually by the European Association for Theoretical Computer Science (EATCS) at the International Colloquium on Automata, Languages, and Programming (ICALP). Nominated scientists can be at most 35 years old on January 1st of the year of the award. Thus, for the 2021 award, the nominee should be born in 1985 or later. Nominations for the Presburger Award can be submitted by any member or group of members of the theoretical computer science community, but not by the nom- inee themselves nor the advisors for their master’s thesis or doctoral dissertation. The Presburger Award Committee of 2021 consists of Thore Husfeldt (Lund University and IT University of Copenhagen, chair), Meena Mahajan (The Insti- tute of Mathematical Sciences, Chennai) and Mikołaj Bojanczyk,´ (University of Warsaw). Nominations, consisting of a two page justification and (links to) the re- spective papers, as well as additional supporting letters, should be sent by e-mail to: [email protected] The subject line of every nomination should start with Presburger Award 2021, and the message must be received before February 15th, 2021. The award includes an amount of 1000 Euro and an invitation to ICALP 2021 for a lecture. -
Accepted Papers Paper Titles and Author Information Appears As Submitted to Easy Chair
SODA17 – List of Accepted Papers Paper titles and author information appears as submitted to Easy Chair. Paper title and author changes will not be made to this document. The online program will reflect the most up-to-date presentation details, and is scheduled for posting in November (http://www.siam.org/meetings/da17/program.php). Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds Yixin Cao and R. B. Sandeep An O(nm) time algorithm for finding the min length directed cycle in a weighted graph James Orlin Random cluster dynamics for the Ising model is rapidly mixing Heng Guo and Mark Jerrum A constant-time algorithm for middle levels Gray codes Jerri Nummenpalo and Torsten Mütze Maximum Scatter TSP in Doubling Metrics László Kozma and Tobias Mömke Improved bounds and parallel algorithms for the Lovasz Local Lemma David Harris and Bernhard Haeupler Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lov\'{a}sz Local Lemma David Harris A Logarithmic Additive Integrality Gap for Bin Packing Rebecca Hoberg and Thomas Rothvoss Firefighting on Trees Beyond Integrality Gaps David Adjiashvili, Andrea Baggio and Rico Zenklusen Three Colors Suffice: Conflict-Free Coloring of Planar Graphs Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich and Christian Scheffer Counting matchings in irregular bipartite graphs and random lifts Marc Lelarge Geodesic Spanners for Points on a Polyhedral Terrain Mohammad Ali Abam, Mark de Berg and Mohammad Javad Rezaei seraji -
The Presburger Award 2021 Laudatio for Shayan Oveis Gharan
The Presburger Award 2021 Laudatio for Shayan Oveis Gharan The 2021 Presburger Committee has unanimously selected Shayan Oveis Gharan as the recipient of the 2021 EATCS Presburger Award for Young Scientists for his creative, profound, and ambitious contributions to the Traveling Salesman problem. Traveling Salesman is a drosophilia of theoretical computer science: immedi- ately accessible, intellectually appealing, computationally difficult, and extremely well-studied. It serves as a milestone and showcase for progress in our scientific understanding of the design and analysis of algorithms. Oveis Gharan’s work began during his PhD thesis, in a paper that presents an asymptotically sublogarithmic approximation guarantee for the Traveling Sales- man problem for the general (or, “asymmetric”) case. The primary tool is the neg- ative dependence between the presence of edges in a certain distribution on ran- dom spanning trees of a graph, a theme that has matured and expanded throughout much of the recipient’s work. In a remarkable tour de force, Oveis Gharan and his coauthors followed this up with a (3=2 − ")-approximation for the symmetric graphic case, and later also for the metric case. These results rely on a deeper understanding of negative dependence through the lens of strongly Rayleigh mea- sures and real-stable polynomials, the polyhedral structure of the Held–Karp poly- tope, and the combinatorics of near-minimum cuts in a graph. Besides his work on TSP, Oveis Gharan exhibits an amazingly consistent abil- ity to make progress on many other problems that had remained open for decades. For example, a Cheeger inequality proved by Oveis Gharan and co-authors was the main technical tool in Miclo’s proof of a 40-year old conjecture of Simon and Høegh-Krohn in the field of mathematical physics.