{"id":18,"date":"2021-07-23T14:56:15","date_gmt":"2021-07-23T12:56:15","guid":{"rendered":"https:\/\/hpi.de\/algo2022\/?page_id=18"},"modified":"2022-09-07T14:58:01","modified_gmt":"2022-09-07T12:58:01","slug":"esa","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2022\/esa\/","title":{"rendered":"ESA 2022"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\" id=\"scope\">Scope<\/h3>\n\n\n\n<p>The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms. It is organized in collaboration with the&nbsp;<a href=\"https:\/\/eatcs.org\/\">European Association for Theoretical Computer Science (EATCS)<\/a>&nbsp;and is a part of&nbsp;<a href=\"https:\/\/algo2022.eu\/\" data-type=\"page\" data-id=\"40\">ALGO 2022<\/a>.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"dates\">Important Dates<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li>Paper submission deadline: April 21,&nbsp;23:59&nbsp;AoE. (<strong><a href=\"https:\/\/easychair.org\/my\/conference?conf=esa20220\">EasyChair submission system<\/a><\/strong>)<\/li><li>Notification:<mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-cyan-bluish-gray-color\"> <\/mark>June 18 <\/li><li>Camera ready:<mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-cyan-bluish-gray-color\"> <\/mark><mark style=\"background-color:rgba(0, 0, 0, 0)\" class=\"has-inline-color has-black-color\">July 3<\/mark><\/li><li>LIPIcs receives files: July 8<\/li><li>Proceedings published: September 2<\/li><li>Conference:&nbsp;September 5-7, 2022, in Potsdam, Germany (early on Monday &#8211; late on Wednesday)<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"cfp\">Call for Papers<\/h3>\n\n\n\n<p>The symposium seeks original algorithmic contributions for problems with relevant theoretical and\/or practical applications. Papers with a strong emphasis on the theoretical analysis of algorithms should be submitted to Track A, while papers reporting on the results of extensive experimental evaluations and\/or providing original contributions to the engineering of algorithms for practical applications should be submitted to Track B. Submissions that prove or explain known results in a much clearer, simpler or more elegant way than done before should be submitted to track S. There will be a Best Student Paper Award as well as a Best Paper Award, both sponsored by EATCS. In order for a paper to be considered for the Best Student Paper Award, all of its authors are required to be students.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"paper-submission-and-proceedings\">Paper submission and proceedings<\/h4>\n\n\n\n<p>Papers should be submitted electronically via the&nbsp;<a href=\"https:\/\/easychair.org\/my\/conference?conf=esa20220\">EasyChair submission system<\/a>. The ESA 2022 proceedings will be published in the&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/submission.dagstuhl.de\/documentation\/authors#lipics\" target=\"_blank\">Leibniz International Proceedings in Informatics (LIPIcs) series<\/a>.<\/p>\n\n\n\n<h5 class=\"wp-block-heading\" id=\"submission-guidelines\">Submission Guidelines<\/h5>\n\n\n\n<p>Authors are invited to submit an extended abstract or full paper of at most 11 pages excluding the title page, references, and an optional appendix. The submission should be typeset using a 10-point or larger font in a single-column format with ample spacing throughout and 2cm margins all around on A4-size paper. We recommend, but not strictly require, making your initial submission adhere to&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/submission.dagstuhl.de\/documentation\/authors#lipics\" target=\"_blank\">LIPIcs publication guidelines<\/a>. Proofs omitted due to space constraints must be placed in an appendix. This appendix can even comprise an entire full version of the paper. The appendix will be read by the program committee members at their discretion. In particular, appendices of accepted papers are&nbsp;<em>not<\/em>&nbsp;going to be published in the proceedings. The main part of the submission should therefore contain a clear technical presentation of the merits of the paper, including a discussion of the paper&#8217;s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. These guidelines are strict: submissions deviating significantly from these guidelines risk being rejected without consideration of their merits. Papers should be submitted electronically via the&nbsp;<a href=\"https:\/\/easychair.org\/my\/conference?conf=esa20220\" target=\"_blank\" rel=\"noreferrer noopener\">EasyChair submission system<\/a>. Results previously published (or scheduled for publication) in another conference proceedings or journal will not be accepted at ESA. Simultaneous submission to other conferences with published proceedings, or to multiple tracks of ESA 2022, is also not permitted. By submitting a paper the authors acknowledge that in case of acceptance, at least one of the authors must register at ALGO 2022, attend the conference, and present the paper.<\/p>\n\n\n\n<h5 class=\"wp-block-heading\" id=\"double-blind-reviewing\">Double-Blind Reviewing<\/h5>\n\n\n\n<p>The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors&#8217; names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not &#8220;We build on our previous work &#8230;&#8221; but rather &#8220;We build on the work of &#8230;&#8221;). The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. In case there exist publicly available versions of the submission online, the authors might mention this in their submission (without providing references\/links), and briefly explain the differences if any. Alternatively, they might communicate the details to the chairs, who will keep them confidential unless revealing them to the PC is needed for a fair judgment. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"topics\">Topics<\/h4>\n\n\n\n<p>Papers presenting original research in all areas of algorithmic research are sought, including but not limited to:<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><strong>Algorithm engineering<\/strong><\/li><li><strong>Algorithmic aspects of networks<\/strong><\/li><li><strong>Algorithmic game theory<\/strong><\/li><li><strong>Algorithmic Data Science<\/strong><\/li><li><strong>Approximation algorithms<\/strong><\/li><li><strong>Computational biology<\/strong><\/li><li><strong>Computational finance<\/strong><\/li><li><strong>Computational geometry<\/strong><\/li><li><strong>Combinatorial optimization<\/strong><\/li><li><strong>Data compression<\/strong><\/li><li><strong>Data structures<\/strong><\/li><li><strong>Databases and information retrieval<\/strong><\/li><li><strong>Distributed and parallel computing<\/strong><\/li><li><strong>Graph algorithms<\/strong><\/li><li><strong>Hierarchical memories<\/strong><\/li><li><strong>Heuristics and meta-heuristics<\/strong><\/li><li><strong>Mathematical programming<\/strong><\/li><li><strong>Mobile computing<\/strong><\/li><li><strong>Online algorithms<\/strong><\/li><li><strong>Parameterized algorithms<\/strong><\/li><li><strong>Pattern matching<\/strong><\/li><li><strong>Quantum computing<\/strong><\/li><li><strong>Randomized algorithms<\/strong><\/li><li><strong>Scheduling and resource allocation problems<\/strong><\/li><li><strong>Streaming algorithms<\/strong><\/li><\/ul>\n\n\n\n<p><strong>Announcement: ESA Track S<\/strong><\/p>\n\n\n\n<p>This year, the&nbsp;European Symposium on Algorithms&nbsp;ESA\u201922 will have a Track S&nbsp; (for Simplicity) inviting contributions that simplify algorithmic results.<br><br>We would like to expand the community around simplification of algorithmic<br>results, encourage and reward research towards simplification and clarity.&nbsp;<br>We find that simpler algorithms are easier to implement, bridging the gap<br>between theory and practice, and we find that new simple or elegant proofs<br>are easier to understand and to teach, and may contain interesting new<br>insights whose relevance only the future will reveal.<br><br>Scope: We invite submissions that prove or explain known results in a<br>much clearer, simpler or more elegant way than done before. Submissions<br>that improve on the state of the art from a theoretical or practical<br>viewpoint should instead be submitted to tracks A or B.<br><br>Paper assessment: Contingent on being in scope for ESA, submitted<br>papers will primarily be judged on the simplicity and elegance of their<br>proofs or algorithms, and the clarity of their presentation.<br><br>Track S will run as an experiment for the 2022 ESA in Potsdam, Germany.&nbsp;<br>It&nbsp;will have its own PC and PC chair, and the submission\/acceptance<br>deadlines follow the schedule for tracks A and B.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"papers\">Accepted Papers<\/h3>\n\n\n\n<p>The proceedings are available <a href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16937\/\" data-type=\"URL\" data-id=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16937\/\">here<\/a>.<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><span class=\"authors\"><span>Valentin Bartier, <a href=\"https:\/\/perso.liris.cnrs.fr\/nbousquet\/\">Nicolas Bousquet<\/a> and Amer Mouawad<\/span>. <\/span><span class=\"title\">Galactic Token Sliding<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.cs.cmu.edu\/~haeupler\/\">Bernhard Haeupler<\/a>, <a href=\"https:\/\/dhershko.github.io\/\">D. Ellis Hershkowitz<\/a> and <a href=\"http:\/\/people.inf.ethz.ch\/gzuzic\/\">Goran Zuzic<\/a><\/span>. <\/span><span class=\"title\">Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.ii.uni.wroc.pl\/~msz\">Marek Szyku\u0142a<\/a> and Adam Zyzik<\/span>. <\/span><span class=\"title\">An Improved Algorithm for Finding the Shortest Synchronizing Words<\/span><\/li><li><span class=\"authors\"><span>Sheng Yang, <a href=\"http:\/\/samirkhuller.com\">Samir Khuller<\/a>, Sunav Choudhary, Kanak Mahadik and Subrata Mitra<\/span>. <\/span><span class=\"title\">Correlated Stochastic Knapsack with a Submodular Objective<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.cs.dartmouth.edu\/~ac\">Amit Chakrabarti<\/a> and Themistoklis Haris<\/span>. <\/span><span class=\"title\">Counting Simplices in Hypergraph Streams<\/span><\/li><li><span class=\"authors\"><span>Nikhil Bansal and Christian Coester<\/span>. <\/span><span class=\"title\">Online metric allocation and time-varying regularization<\/span><\/li><li><span class=\"authors\">Jonas Ellert. <\/span><span class=\"title\">Lyndon Arrays Simplified<\/span><\/li><li><span class=\"authors\"><span>Aleksander Figiel, Vincent Froese, <a href=\"http:\/\/www.akt.tu-berlin.de\/menue\/team\/nichterlein-andre\/\">Andr\u00e9 Nichterlein<\/a> and <a href=\"http:\/\/www.akt.tu-berlin.de\/menue\/team\/niedermeier-rolf\/\">Rolf Niedermeier<\/a><\/span>. <\/span><span class=\"title\">There and Back Again: On Applying Data Reduction Rules by Undoing Others<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/i11www.iti.kit.edu\/en\/members\/tim_zeitz\/index\">Tim Zeitz<\/a> and Nils Werner<\/span>. <\/span><span class=\"title\">Combining Predicted and Live Traffic with Time-Dependent A* Potentials<\/span><\/li><li><span class=\"authors\"><span>Andrew Goldberg, Yuanyuan Dong, Alexander Noe, Nikos Parotsidis, Mauricio Resende and Quico Spaen<\/span>. <\/span><span class=\"title\">A Local Search Algorithm for Large Maximum Weight Independent Set Problems<\/span><\/li><li><span class=\"authors\"><span>Susanne Albers and Sebastian Schubert<\/span>. <\/span><span class=\"title\">Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.durham.ac.uk\/staff\/thomas-erlebach\/\">Thomas Erlebach<\/a>, <a href=\"http:\/\/www.ime.usp.br\/~mslima\/\">Murilo de Lima<\/a>, <a href=\"http:\/\/www.cslog.uni-bremen.de\/nmegow\/\">Nicole Megow<\/a> and <a href=\"https:\/\/www.uni-bremen.de\/en\/cslog\/team\/jens-schloeter\">Jens Schl\u00f6ter<\/a><\/span>. <\/span><span class=\"title\">Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty<\/span><\/li><li><span class=\"authors\"><span>Aleksander \u0141ukasiewicz and <a href=\"https:\/\/sites.google.com\/site\/pkuznanski\/\">Przemys\u0142aw Uzna\u0144ski<\/a><\/span>. <\/span><span class=\"title\">Cardinality estimation using Gumbel distribution<\/span><\/li><li><span class=\"authors\"><a href=\"http:\/\/www.afloresv.com\">Alejandro Flores-Velazco<\/a>. <\/span><span class=\"title\">Improved Search of Relevant Points for Nearest-Neighbor Classification<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.di.ens.fr\/~cchuang\/\">Chien-Chung Huang<\/a> and Fran\u00e7ois Sellier<\/span>. <\/span><span class=\"title\">Maximum Weight b-Matchings in Random-Order Streams<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.ii.uib.no\/~fomin\/\">Fedor Fomin<\/a>, Petr Golovach, <a href=\"http:\/\/danilka.pro\">Danil Sagunov<\/a> and Kirill Simonov<\/span>. <\/span><span class=\"title\">Longest Cycle above Erd\u0151s\u2013Gallai Bound<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/antoniosatnoniadis.net\">Antonios Antoniadis<\/a>, <a href=\"http:\/\/www.win.tue.nl\/~mdberg\/\">Mark de Berg<\/a>, S\u00e1ndor Kisfaludi-Bak and Antonis Skarlatos<\/span>. <\/span><span class=\"title\">Computing Smallest Convex Intersecting Polygons<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.ccs.neu.edu\/home\/rraj\/\">Rajmohan Rajaraman<\/a> and Omer Wasim<\/span>. <\/span><span class=\"title\">Improved bounds for online balanced graph re-partitioning<\/span><\/li><li><span class=\"authors\"><span>Esther Ezra and Micha Sharir<\/span>. <\/span><span class=\"title\">Intersection Searching amid Tetrahedra in 4-space and Efficient Continuous Collision Detection<\/span><\/li><li><span class=\"authors\"><span>Jendrik Brachter and Pascal Schweitzer<\/span>. <\/span><span class=\"title\">A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension<\/span><\/li><li><span class=\"authors\"><span>\u0141ukasz Bo\u017cyk and Micha\u0142 Pilipczuk<\/span>. <\/span><span class=\"title\">Polynomial kernel for immersion hitting in tournaments<\/span><\/li><li><span class=\"authors\"><span>Bart\u0142omiej Bosek and <a href=\"https:\/\/www.mimuw.edu.pl\/~anka\/\">Anna Zych-Pawlewicz<\/a><\/span>. <\/span><span class=\"title\">Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget<\/span><\/li><li><span class=\"authors\"><span>Baris Can Esmer, Ariel Kulik, D\u00e1niel Marx, Daniel Neuen and Roohani Sharma<\/span>. <\/span><span class=\"title\">Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search<\/span><\/li><li><span class=\"authors\"><span>Evangelos Kosinas, <a href=\"http:\/\/www.cs.uoi.gr\/~loukas\/\">Loukas Georgiadis<\/a>, Giuseppe F. Italiano and Thodoris Dimas<\/span>. <\/span><span class=\"title\">Computing the $4$-Edge-Connected Components of a Graph: An Experimental Study<\/span><\/li><li><span class=\"authors\"><span>Hans L. Bodlaender, Carla Groenland and Hugo Jacob<\/span>. <\/span><span class=\"title\">List Colouring Trees in Logarithmic Space<\/span><\/li><li><span class=\"authors\">Travis Gagie. <\/span><span class=\"title\">Simple worst-case optimal adaptive prefix-free coding<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.csm.lau.edu.lb\/fabukhzam\">Faisal Abu-Khzam<\/a>, <a href=\"http:\/\/www.informatik.uni-trier.de\/~fernau\">Henning Fernau<\/a>, Benjamin Gras, <a href=\"http:\/\/www.univ-orleans.fr\/lifo\/Members\/Mathieu.Liedloff\/\">Mathieu Liedloff<\/a> and Kevin Mann<\/span>. <\/span><span class=\"title\">Enumerating Minimal Connected Dominating Sets<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/dhershko.github.io\/\">D Ellis Hershkowitz<\/a> and <a href=\"https:\/\/q3r.github.io\/\">Jason Li<\/a><\/span>. <\/span><span class=\"title\">O(1) Steiner Point Removal in Series-Parallel Graphs<\/span><\/li><li><span class=\"authors\"><span>Jonathan Allcock, <a href=\"https:\/\/www.irif.fr\/~hamoudi\/\">Yassine Hamoudi<\/a>, Antoine Joux, Felix Klingelhoefer and Miklos Santha<\/span>. <\/span><span class=\"title\">Classical and quantum algorithms for variants of Subset-Sum via dynamic programming<\/span><\/li><li><span class=\"authors\"><span>Han Jiang, Shang-En Huang, <a href=\"https:\/\/sites.google.com\/site\/thsaranurak\/\">Thatchaphol Saranurak<\/a> and Tian Zhang<\/span>. <\/span><span class=\"title\">Vertex Sparsifiers for Hyperedge Connectivity<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/pcharalampo.github.io\/\">Panagiotis Charalampopoulos<\/a>, <a href=\"http:\/\/mimuw.edu.pl\/~kociumaka\/\">Tomasz Kociumaka<\/a>, <a href=\"http:\/\/mimuw.edu.pl\/~jrad\">Jakub Radoszewski<\/a>, <a href=\"https:\/\/homepages.cwi.nl\/~solon\/\">Solon Pissis<\/a>, <a href=\"http:\/\/www.mimuw.edu.pl\/~rytter\">Wojciech Rytter<\/a>, <a href=\"http:\/\/www.mimuw.edu.pl\/~walen\/\">Tomasz Walen<\/a> and Wiktor Zuba<\/span>. <\/span><span class=\"title\">Approximate Circular Pattern Matching<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.ac.tuwien.ac.at\/jchen\/about\/\">Jiehua Chen<\/a> and <a href=\"https:\/\/sites.google.com\/view\/sanjuktaroy\">Sanjukta Roy<\/a><\/span>. <\/span><span class=\"title\">Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space<\/span><\/li><li><span class=\"authors\"><span>Oswin Aichholzer, Erik Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masarova, Mikhail Rudoy, Virginia Vassilevska Williams and Nicole Wein<\/span>. <\/span><span class=\"title\">Hardness of Token Swapping on Trees<\/span><\/li><li><span class=\"authors\"><span>Monika Henzinger, <a href=\"https:\/\/sites.google.com\/view\/amipaz\/\">Ami Paz<\/a> and <a href=\"https:\/\/arsricharan.in\">A. R. Sricharan<\/a><\/span>. <\/span><span class=\"title\">Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs<\/span><\/li><li><span class=\"authors\"><span>Younan Gao and <a href=\"https:\/\/web.cs.dal.ca\/~mhe\/\">Meng He<\/a><\/span>. <\/span><span class=\"title\">Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product<\/span><\/li><li><span class=\"authors\"><span>Debajyoti Kar, <a href=\"https:\/\/www.csa.iisc.ac.in\/~arindamkhan\/\">Arindam Khan<\/a> and <a href=\"https:\/\/licrete.ma.tum.de\/people\/professors\/andreas-wiese.html\">Andreas Wiese<\/a><\/span>. <\/span><span class=\"title\">Approximation Algorithms for ROUND-UFP and ROUND-SAP<\/span><\/li><li><span class=\"authors\"><span>Manoj Gupta and Dipan Dey<\/span>. <\/span><span class=\"title\">Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem<\/span><\/li><li><span class=\"authors\"><span>Zachary Friggstad and Mahya Jamshidian<\/span>. <\/span><span class=\"title\">Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.isical.ac.in\/~sourav\/\">Sourav Chakraborty<\/a>, <a href=\"http:\/\/www.kuldeepmeel.com\">Kuldeep S. Meel<\/a> and <a href=\"https:\/\/cse.unl.edu\/~vinod\/\">N.V. Vinodchandran<\/a><\/span>. <\/span><span class=\"title\">Distinct Elements in Streams: An Algorithm for the (Text) Book<\/span><\/li><li><span class=\"authors\"><span>Syamantak Das and Andreas Wiese<\/span>. <\/span><span class=\"title\">A simpler QPTAS for scheduling jobs with precedence constraints<\/span><\/li><li><span class=\"authors\"><span>Kobi Bodek and <a href=\"http:\/\/cs.haifa.ac.il\/~moranfe\/\">Moran Feldman<\/a><\/span>. <\/span><span class=\"title\">Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case<\/span><\/li><li><span class=\"authors\"><span>Du\u0161an Knop and <a href=\"http:\/\/kam.mff.cuni.cz\/~koutecky\/\">Martin Koutecky<\/a><\/span>. <\/span><span class=\"title\">Scheduling Kernels via Configuration LP<\/span><\/li><li><span class=\"authors\"><span>Martin Balko, Steven Chaplick, Siddharth Gupta, Robert Ganian, Michael Hoffmann, Pavel Valtr and <a href=\"http:\/\/www1.informatik.uni-wuerzburg.de\/en\/staff\/wolff_alexander\/\">Alexander Wolff<\/a><\/span>. <\/span><span class=\"title\">Bounding and Computing Obstacle Numbers of Graphs<\/span><\/li><li><span class=\"authors\"><span>Argyrios Deligkas, Michail Fasoulakis and <a href=\"http:\/\/pages.cs.aueb.gr\/~markakis\/\">Evangelos Markakis<\/a><\/span>. <\/span><span class=\"title\">A Polynomial-Time Algorithm for 1\/3-Approximate Nash Equilibria in Bimatrix Games<\/span><\/li><li><span class=\"authors\"><span>Eduard Eiben, <a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/rganian\/\">Robert Ganian<\/a>, <a href=\"http:\/\/facweb.cs.depaul.edu\/ikanj\/\">Iyad Kanj<\/a>, Sebastian Ordyniak and <a href=\"http:\/\/ac.tuwien.ac.at\/people\/szeider\">Stefan Szeider<\/a><\/span>. <\/span><span class=\"title\">Finding a Cluster in Incomplete Data<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/adobler\/\">Alexander Dobler<\/a>, <a href=\"https:\/\/manyu.pro\">Manuel Sorge<\/a> and Ana\u00efs Villedieu<\/span>. <\/span><span class=\"title\">Turbocharging Heuristics for Weak Coloring Numbers<\/span><\/li><li><span class=\"authors\"><span>Georg Anegg, Laura Vargas Koch and Rico Zenklusen<\/span>. <\/span><span class=\"title\">Techniques for Generalized Colorful k-Center Problems<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/scale.iti.kit.edu\/people\/thomasblaesius\">Thomas Bl\u00e4sius<\/a> and <a href=\"https:\/\/hpi.de\/friedrich\/people\/philipp-fischbeck.html\">Philipp Fischbeck<\/a><\/span>. <\/span><span class=\"title\">On the External Validity of Average-Case Analyses of Graph Algorithms<\/span><\/li><li><span class=\"authors\"><span>Manuel C\u00e1ceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru Tomescu and Lucia Williams<\/span>. <\/span><span class=\"title\">Width Helps and Hinders Splitting Flows<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.bmbumpus.com\/\">Benjamin Merlin Bumpus<\/a>, <a href=\"http:\/\/www.win.tue.nl\/~bjansen\/index.html\">Bart M. P. Jansen<\/a> and Jari J. H. de Kroon<\/span>. <\/span><span class=\"title\">Search-Space Reduction via Essential Vertices<\/span><\/li><li><span class=\"authors\"><a href=\"https:\/\/cs.uni-koeln.de\/en\/ls-sohler\/team\/dr-stefan-walzer\">Stefan Walzer<\/a>. <\/span><span class=\"title\">Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold (extended abstract)<\/span><\/li><li><span class=\"authors\"><span>Miriam Goetze, Paul Jungeblut and <a href=\"https:\/\/i11www.iti.kit.edu\/members\/torsten_ueckerdt\/\">Torsten Ueckerdt<\/a><\/span>. <\/span><span class=\"title\">Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs<\/span><\/li><li><span class=\"authors\"><span>Sujoy Bhore, Arnold Filtser, <a href=\"https:\/\/www.ics.uci.edu\/~khodabah\/\">Hadi Khodabandeh<\/a> and Csaba Toth<\/span>. <\/span><span class=\"title\">Online Spanners in Metric Spaces<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/fmi.uni-stuttgart.de\/alg\/team\/barth\/\">Florian Barth<\/a>, <a href=\"http:\/\/www.fmi.uni-stuttgart.de\/alg\">Stefan Funke<\/a> and Claudius Proissl<\/span>. <\/span><span class=\"title\">An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions<\/span><\/li><li><span class=\"authors\">Alexander Tiskin. <\/span><span class=\"title\">Fast RSK correspondence by doubling search<\/span><\/li><li><span class=\"authors\"><span>Anna Arutyunova and <a href=\"http:\/\/www.roeglin.org\">Heiko R\u00f6glin<\/a><\/span>. <\/span><span class=\"title\">The Price of Hierarchical Clustering<\/span><\/li><li><span class=\"authors\"><span>Arghya Bhattacharya, Helen Xu, Abiyaz Chowdhury, Rezaul A. Chowdhury, Rathish Das, Rob Johnson, Rishab Nithyanand and Michael A. Bender<\/span>. <\/span><span class=\"title\">When Are Cache-Oblivious Algorithms Cache Adaptive?  A Case Study of Matrix Multiplication and Sorting<\/span><\/li><li><span class=\"authors\"><a href=\"http:\/\/www.openu.ac.il\/Personal_sites\/Zeev-Nutov\/\">Zeev Nutov<\/a>. <\/span><span class=\"title\">Data structures for node connectivity queries<\/span><\/li><li><span class=\"authors\"><span>Soh Kumabe and Yuichi Yoshida<\/span>. <\/span><span class=\"title\">Average sensitivity of the Knapsack Problem<\/span><\/li><li><span class=\"authors\">Daniel Blankenburg. <\/span><span class=\"title\">Resource Sharing Revisited: Local Weak Duality and Optimal Convergence<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/cs.au.dk\/~schwiegelshohn\/\">Chris Schwiegelshohn<\/a> and Omar Ali Sheikh-Omar<\/span>. <\/span><span class=\"title\">An Empirical Evaluation of $k$-Means Coresets<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.cs.duke.edu\/~bsayan\/\">Sayan Bhattacharya<\/a>, <a href=\"https:\/\/sites.google.com\/site\/thsaranurak\/\">Thatchaphol Saranurak<\/a> and Pattara Sukprasert<\/span>. <\/span><span class=\"title\">Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary\t<\/span><\/li><li><span class=\"authors\"><span>Thijs van der Horst, <a href=\"http:\/\/www.staff.science.uu.nl\/~loffl001\">Maarten L\u00f6ffler<\/a> and <a href=\"https:\/\/fstaals.net\">Frank Staals<\/a><\/span>. <\/span><span class=\"title\">Chromatic $k$-Nearest Neighbor Queries<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.cs.purdue.edu\/homes\/tamaldey\/\">Tamal Dey<\/a> and <a href=\"https:\/\/taohou01.github.io\/\">Tao Hou<\/a><\/span>. <\/span><span class=\"title\">Fast Computation of Zigzag Persistence<\/span><\/li><li><span class=\"authors\"><span>Henk Alkema, <a href=\"http:\/\/www.win.tue.nl\/~mdberg\/\">Mark de Berg<\/a>, Leonidas Theocharous and Morteza Monemizadeh<\/span>. <\/span><span class=\"title\">TSP in a Simple Polygon<\/span><\/li><li><span class=\"authors\"><span>Bento Natura, Meike Neuwohner and Stefan Weltge<\/span>. <\/span><span class=\"title\">\tThe Pareto cover problem<\/span><\/li><li><span class=\"authors\"><span>Mark Jones, Mathias Weller and <a href=\"http:\/\/leovaniersel.wordpress.com\">Leo van Iersel<\/a><\/span>. <\/span><span class=\"title\">Embedding phylogenetic trees in networks of low treewidth<\/span><\/li><li><span class=\"authors\"><span>Zoe Xi and William Kuszmaul<\/span>. <\/span><span class=\"title\">Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings<\/span><\/li><li><span class=\"authors\"><span>Hideo Bannai, <a href=\"http:\/\/kgoto.org\">Keisuke Goto<\/a>, Masakazu Ishihata, Shunsuke Kanda, <a href=\"https:\/\/dkppl.de\">Dominik K\u00f6ppl<\/a> and Takaaki Nishimoto<\/span>. <\/span><span class=\"title\">Computing NP-hard Repetitiveness Measures via MAX-SAT<\/span><\/li><li><span class=\"authors\"><span>Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi and <a href=\"http:\/\/www.math.mi.i.nagoya-u.ac.jp\/~otachi\/\">Yota Otachi<\/a><\/span>. <\/span><span class=\"title\">Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited<\/span><\/li><li><span class=\"authors\"><span>Marten Maack, Simon Pukrop and Anna Rodriguez Rasmussen<\/span>. <\/span><span class=\"title\">(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling<\/span><\/li><li><span class=\"authors\"><span>Owen Rouille and <a href=\"http:\/\/www-sop.inria.fr\/members\/Clement.Maria\/\">Cl\u00e9ment Maria<\/a><\/span>. <\/span><span class=\"title\">Localized geometric moves to compute hyperbolic structures on triangulated 3-manifolds<\/span><\/li><li><span class=\"authors\"><span>Frederik Br\u00fcning, Jacobus Conradi and Anne Driemel<\/span>. <\/span><span class=\"title\">Faster Approximate Covering of Subcurves under the Fr\u00e9chet Distance<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/sites.google.com\/view\/tesshu-hanaka\/home\">Tesshu Hanaka<\/a> and <a href=\"http:\/\/www.lamsade.dauphine.fr\/~mlampis\/\">Michael Lampis<\/a><\/span>. <\/span><span class=\"title\">Hedonic Games and Treewidth Revisited<\/span><\/li><li><span class=\"authors\"><a href=\"http:\/\/www-cc.cs.uni-saarland.de\/curticapean\/\">Radu Curticapean<\/a>. <\/span><span class=\"title\">Determinants from homomorphisms<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/people.cs.umass.edu\/~raddanki\/\">Raghavendra Addanki<\/a>, <a href=\"https:\/\/people.cs.umass.edu\/~mcgregor\/\">Andrew McGregor<\/a> and <a href=\"https:\/\/people.cs.umass.edu\/~cmusco\/\">Cameron Musco<\/a><\/span>. <\/span><span class=\"title\">Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries<\/span><\/li><li><span class=\"authors\"><span>Justin Dallant and John Iacono<\/span>. <\/span><span class=\"title\">Conditional Lower Bounds for Dynamic Geometric Measure Problems<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.ruhr-uni-bochum.de\/lmi\/buchin\/\u200e\">Maike Buchin<\/a>, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, <a href=\"http:\/\/dccg.upc.edu\/people\/rodrigo\/\">Rodrigo Silveira<\/a> and <a href=\"https:\/\/fstaals.net\">Frank Staals<\/a><\/span>. <\/span><span class=\"title\">Efficient Fr\u00e9chet distance queries for segments<\/span><\/li><li><span class=\"authors\"><span>Lex de Kogel, <a href=\"https:\/\/www.uu.nl\/staff\/MJvanKreveld\">Marc van Kreveld<\/a> and Jordi L. Vermeulen<\/span>. <\/span><span class=\"title\">Abstract morphing using the Hausdorff distance and Voronoi diagrams<\/span><\/li><li><span class=\"authors\"><span>V\u00e1clav Bla\u017eej, Pratibha Choudhary, Du\u0161an Knop, \u0160imon Schierreich, Ond\u0159ej Such\u00fd and Tom\u00e1\u0161 Valla<\/span>. <\/span><span class=\"title\">On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations<\/span><\/li><li><span class=\"authors\"><span>Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu and Julian Shun<\/span>. <\/span><span class=\"title\">ParGeo: A Library for Parallel Computational Geometry<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/dreier\/\">Jan Dreier<\/a>, Sebastian Ordyniak and <a href=\"https:\/\/www.ac.tuwien.ac.at\/people\/szeider\/\">Stefan Szeider<\/a><\/span>. <\/span><span class=\"title\">SAT Backdoors: Depth Beats Size<\/span><\/li><li><span class=\"authors\"><span>Jakub Gajarsk\u00fd, Lars Jaffke, Paloma Lima, Jana Novotn\u00e1, <a href=\"http:\/\/www.mimuw.edu.pl\/~malcin\">Marcin Pilipczuk<\/a>, <a href=\"http:\/\/www.mini.pw.edu.pl\/~rzazewsk\">Pawe\u0142 Rz\u0105\u017cewski<\/a> and U\u00e9verton Souza<\/span>. <\/span><span class=\"title\">Taming graphs with no large creatures and skinny ladders<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/www.cs.bgu.ac.il\/~neimano\/\">Ofer Neiman<\/a> and Idan Shabat<\/span>. <\/span><span class=\"title\">A Unified Framework for Hopsets<\/span><\/li><li><span class=\"authors\"><span>Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson and Rico Zenklusen<\/span>. <\/span><span class=\"title\">Submodular Maximization Subject to Matroid Intersection on the Fly<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/www.cs.dartmouth.edu\/~deepc\/\">Deeparnab Chakrabarty<\/a>, <a href=\"https:\/\/www.cs.dartmouth.edu\/~maryam\/\">Maryam Negahbani<\/a> and <a href=\"https:\/\/ankitasarkar.net\">Ankita Sarkar<\/a><\/span>. <\/span><span class=\"title\">Approximation Algorithms for Continuous Clustering and Facility Location Problems<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/sites.google.com\/site\/bilodavide\/\">Davide Bil\u00f2<\/a>, <a href=\"https:\/\/cs.gssi.it\/gianlorenzo.dangelo\/\">Gianlorenzo D&#8217;Angelo<\/a>, Luciano Gual\u00e0, <a href=\"https:\/\/www.stefanoleucci.com\">Stefano Leucci<\/a> and Mirko Rossi<\/span>. <\/span><span class=\"title\">Sparse Temporal Spanners with Low Stretch<\/span><\/li><li><span class=\"authors\"><span><a href=\"https:\/\/shahbazk.github.io\/\">Shahbaz Khan<\/a> and <a href=\"http:\/\/cs.helsinki.fi\/u\/tomescu\">Alexandru I. Tomescu<\/a><\/span>. <\/span><span class=\"title\">Optimizing the Safe Flow Decompositions in DAGs<\/span><\/li><li><span class=\"authors\"><span><a href=\"http:\/\/tcs.uos.de\">Markus Chimani<\/a> and Finn Stutzenstein<\/span>. <\/span><span class=\"title\">Spanner Approximations in Practice<\/span><\/li><li><span class=\"authors\"><span>Wojciech Nadara, Micha\u0142 Pilipczuk and Marcin Smulewicz<\/span>. <\/span><span class=\"title\">Computing treedepth in polynomial space and linear fpt time<\/span><\/li><li><span class=\"authors\"><a href=\"https:\/\/www.cs.tau.ac.il\/~orzamir\/\">Or Zamir<\/a>. <\/span><span class=\"title\">Faster algorithm for Unique (k,2)-CSP<\/span><\/li><li><span class=\"authors\"><span>Mohammad Ansari, Mohammad Saneian and <a href=\"http:\/\/sharif.edu\/~zarrabi\">Hamid Zarrabi-Zadeh<\/a><\/span>. <\/span><span class=\"title\">Simple Streaming Algorithms for Edge Coloring<\/span><\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"committees\">Committees<\/h3>\n\n\n\n<h4 class=\"wp-block-heading\" id=\"chairs\">Chairs<\/h4>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"http:\/\/www.cs.tau.ac.il\/~schechik\/\">Shiri Chechik<\/a> (track A), Tel Aviv University<\/li><li><a href=\"https:\/\/users.dcc.uchile.cl\/~gnavarro\/\">Gonzalo Navarro<\/a> (track B), Universidad de Chile<\/li><li><a href=\"http:\/\/www2.compute.dtu.dk\/~erot\/\">Eva Rotenberg<\/a> (track S), Technical University of Denmark<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"steering-committee\">Steering Committee<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/ad.informatik.uni-freiburg.de\/staff\/bast\">Hannah Bast<\/a> (chair), Albert-Ludwigs-Universit\u00e4t Freiburg<\/li><li><a href=\"http:\/\/www.cs.tau.ac.il\/~schechik\/\">Shiri Chechik<\/a>, Tel Aviv University<\/li><li><a rel=\"noreferrer noopener\" href=\"http:\/\/people.idsia.ch\/~grandoni\/\" target=\"_blank\">Fabrizio Grandoni<\/a>, IDSIA, USI-SUPSI<\/li><li><a rel=\"noreferrer noopener\" href=\"http:\/\/www.wisdom.weizmann.ac.il\/~robi\/\" target=\"_blank\">Robert Krauthgamer<\/a>, The Weizmann Institute of Science<\/li><li><a rel=\"noreferrer noopener\" href=\"https:\/\/ca.cs.uni-bonn.de\/doku.php?id=people:mutzel\" target=\"_blank\">Petra Mutzel (Chair)<\/a>, University of Bonn<\/li><li><a href=\"https:\/\/users.dcc.uchile.cl\/~gnavarro\/\">Gonzalo Navarro<\/a>, Universidad de Chile<\/li><li><a rel=\"noreferrer noopener\" href=\"https:\/\/rasmuspagh.net\/\" target=\"_blank\">Rasmus Pagh <\/a>, University of Copenhagen<\/li><li><a rel=\"noreferrer noopener\" href=\"https:\/\/www.dtu.dk\/english\/service\/phonebook\/person?id=33822\" target=\"_blank\">Eva Rotenberg<\/a>, Technical University of Denmark<\/li><li><a rel=\"noreferrer noopener\" href=\"https:\/\/algo2.iti.kit.edu\/sanders.php\" target=\"_blank\">Peter Sanders<\/a>, Karlsruhe Institute of Technology (KIT)<\/li><li><a rel=\"noreferrer noopener\" href=\"https:\/\/www.algo.uni-konstanz.de\/team\/storandt\/\" target=\"_blank\">Sabine Storandt<\/a>, University of Konstanz<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"pc-members-track-a\">PC members (Track A)<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/sites.google.com\/view\/mikkel-abrahamsen\">Mikkel Abrahamsen<\/a>,&nbsp;&nbsp;University of Copenhagen<\/li><li><a href=\"https:\/\/cs.au.dk\/~peyman\/\">Peyman Afshani<\/a>, Aarhus University<\/li><li><a href=\"https:\/\/users.cs.duke.edu\/~pankaj\/\">Pankaj K. Agarwal<\/a>, Duke University<\/li><li><a href=\"https:\/\/people.cs.rutgers.edu\/~sa1497\/\">Sepehr Assadi<\/a>, Rutgers University<\/li><li><a href=\"https:\/\/www.csc.kth.se\/~austrin\/\">Per Austrin<\/a>, &nbsp;KTH<\/li><li><a href=\"https:\/\/www.openu.ac.il\/en\/personalsites\/ProfLeonidBarenboim.aspx\">Leonid Barenboim<\/a>, The Open University of Israel<\/li><li><a href=\"https:\/\/www.cse.iitk.ac.in\/users\/sbaswana\/\">Surender Baswana<\/a>, IIT Kanpur<\/li><li><a href=\"https:\/\/www.ruhr-uni-bochum.de\/lmi\/buchin\/\">Maike Buchin<\/a>, Ruhr University Bochum<\/li><li><a href=\"https:\/\/sites.google.com\/cs.uni.wroc.pl\/jby\/\/\">Jaroslaw Byrka<\/a>, University of Wroc\u0142aw<\/li><li><a href=\"https:\/\/sites.google.com\/view\/diptarka\/\">Diptarka Chakraborty<\/a>,&nbsp;&nbsp; National University of Singapore<\/li><li><a href=\"http:\/\/www.cs.tau.ac.il\/~schechik\/\">Shiri Chechik<\/a><span style=\"color: initial;\"> (chair), Tel Aviv University<\/span><\/li><li><a href=\"https:\/\/www.di.ens.fr\/~vcohen\/\">Vincent Cohen-Addad<\/a>, Google Research<\/li><li><a href=\"https:\/\/www.win.tue.nl\/~mdberg\/\">Mark de Berg<\/a><strong>, <\/strong>TU Eindhoven<\/li><li><a href=\"https:\/\/www.cs.umd.edu\/~mahsa\/\">Mahsa Derakhshan<\/a>,&nbsp;UC Berkley and Northeastern University<\/li><li><a href=\"https:\/\/www.cs.jhu.edu\/~mdinitz\/\">Michael Dinitz<\/a>, Johns Hopkins University<\/li><li><a href=\"https:\/\/sites.google.com\/view\/michal-dory\">Michal Dory<\/a>, ETH Zurich<\/li><li><a href=\"https:\/\/www.dcs.warwick.ac.uk\/~englert\/\">Matthias Englert<\/a>, University of Warwick<\/li><li><a href=\"https:\/\/www.cs.le.ac.uk\/people\/te17\/\">Thomas Erlebach<\/a>, Durham University<\/li><li><a href=\"https:\/\/folk.uib.no\/nmiff\/\">Fedor Fomin<\/a>,&nbsp;University of Bergen<\/li><li><a href=\"https:\/\/www.softlab.ntua.gr\/~fotakis\/\">Dimitris Fotakis<\/a>, National Technical University of Athens<\/li><li><a href=\"https:\/\/sites.google.com\/site\/distributedhsinhao\/\">Hsin Hao Su<\/a>, Boston College<\/li><li><a href=\"https:\/\/algo.cs.uni-frankfurt.de\/~mhoefer\/\">Martin Hoefer<\/a>, Goethe University<\/li><li><a href=\"https:\/\/rakri.github.io\/\">Ravishankar Krishnaswamy<\/a>, Microsoft Research<\/li><li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jakul\/\">Janardhan Kulkarni<\/a>, Microsoft Research<\/li><li><a href=\"https:\/\/divyarthi.github.io\/\">Divyarthi Mohan<\/a>, Tel Aviv University<\/li><li><a href=\"https:\/\/cs.idc.ac.il\/~smozes\/index.html\">Shay Mozes<\/a>, Reichman University<\/li><li><a href=\"http:\/\/page.mi.fu-berlin.de\/mulzer\/\">Wolfgang Mulzer<\/a>, Freie Universit\u00e4t Berlin<\/li><li><a rel=\"noreferrer noopener\" href=\"http:\/\/www.cs.bgu.ac.il\/~neimano\/\" target=\"_blank\">Ofer Neiman<\/a>, Ben-Gurion University<\/li><li><a href=\"https:\/\/www.cs.toronto.edu\/~anikolov\/\">Aleksandar Nikolov<\/a>, University of Toronto<\/li><li><a href=\"https:\/\/sites.google.com\/site\/sigal3\/\">Sigal Oren<\/a>, Ben-Gurion University<\/li><li><a href=\"https:\/\/iith.ac.in\/~fahad\/\">Fahad Panolan<\/a>, IIT Hyderabad<\/li><li><a href=\"https:\/\/www.irif.fr\/~adiro\/\">Adi Ros\u00e9n<\/a>, FILOFOCS &#8211; CNRS<\/li><li><a href=\"https:\/\/sachdevasushant.github.io\/\">Sushant Sachdeva<\/a>, University of Toronto<\/li><li><a href=\"https:\/\/www.univie.ac.at\/ct\/stefan\/\">Stefan Schmid<\/a>, University of Vienna and TU Berlin<\/li><li><a href=\"https:\/\/schwartz.cswp.cs.technion.ac.il\/\">Roy Schwartz<\/a>, Technion<\/li><li><a href=\"https:\/\/bshepherd.ca\/\">Bruce&nbsp;Shepherd<\/a>,<strong> <\/strong>University of British Columbia<\/li><li><a href=\"https:\/\/sites.google.com\/site\/soloshay\/\">Shay Solomon<\/a>, Tel Aviv University<\/li><li><a href=\"https:\/\/www.cs.uic.edu\/~xiaorui\/\">Xiaorui Sun<\/a>, University of Illinois<\/li><li><a href=\"https:\/\/www.lirmm.fr\/~thilikosto\/\">Dimitrios Thilikos<\/a>, LIRMM, Universit\u00e9 de Montpellier, CNRS<\/li><li><a href=\"https:\/\/sites.google.com\/view\/ohadtrabelsi\">Ohad Trabelsi<\/a>, The University of Michigan<\/li><li><a href=\"https:\/\/www.cs.haifa.ac.il\/~oren\/\">Oren Weimann<\/a>, University of Haifa<\/li><li><a href=\"https:\/\/people.mpi-inf.mpg.de\/~wellnitz\/\">Philip Wellnitz<\/a>, Max Planck Institute for Informatics<\/li><li><a href=\"http:\/\/research.haifa.ac.il\/~raphy\/\">Raphael Yuster<\/a>, University of Haifa<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"pc-members-track-b\">PC members (Track B)<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/www.inf.utfsm.cl\/~darroyue\/\" data-type=\"URL\" data-id=\"https:\/\/www.inf.utfsm.cl\/~darroyue\/\">Diego Arroyuelo<\/a>, Universidad T\u00e9cnica Federico Santa Mar\u00eda<\/li><li><a href=\"http:\/\/www2.compute.dtu.dk\/~phbi\/\">Philip Bille<\/a>, Danmarks Tekniske Universitet<\/li><li><a href=\"https:\/\/scale.iti.kit.edu\/people\/thomasblaesius\">Thomas Bl\u00e4sius<\/a>, Karlsruhe Institute of Technology<\/li><li><a href=\"https:\/\/www.christinaboucher.com\/\">Christina Boucher<\/a>, University of Florida<\/li><li><a href=\"https:\/\/www.ibr.cs.tu-bs.de\/users\/fekete\/\">S\u00e1ndor Fekete<\/a>, Technische Universit\u00e4t Braunschweig<\/li><li><a href=\"http:\/\/www.inf.udec.cl\/~jfuentess\/\">Jos\u00e9 Fuentes-Sep\u00falveda<\/a>, Universidad de Concepci\u00f3n<\/li><li><a href=\"https:\/\/sites.google.com\/view\/ggoranci\/\">Gramoz Goranci<\/a>, Universitat Wien<\/li><li><a href=\"http:\/\/people.uniroma2.it\/giuseppe.italiano\/\">Giuseppe Italiano<\/a>, Universit\u00e0 degli studi di Roma &#8220;Tor Vergata&#8221;<\/li><li>Shweta Jain, University of Utah<\/li><li><a href=\"https:\/\/www.cs.stonybrook.edu\/people\/faculty\/DominikKempa\">Dominik Kempa<\/a>, Stony Brook University<\/li><li><a href=\"https:\/\/www2.helsinki.fi\/en\/researchgroups\/genome-scale-algorithmics\/people\/veli-makinen\">Veli M\u00e4kinen<\/a>, University of Helsinki<\/li><li><a href=\"https:\/\/cs.amherst.edu\/~ccmcgeoch\/\">Catherine McGeoch<\/a>, Amherst College<\/li><li><a href=\"http:\/\/www.cs.umd.edu\/~mount\/\">David Mount<\/a>, University of Maryland<\/li><li><a href=\"https:\/\/users.dcc.uchile.cl\/~gnavarro\/\">Gonzalo Navarro<\/a> (chair), Universidad de Chile<\/li><li><a href=\"https:\/\/www3.cs.stonybrook.edu\/~skiena\/\">Steven Skiena<\/a>, Stony Brook University<\/li><li><a href=\"https:\/\/people.engr.ncsu.edu\/mfms\/\">Matthias Stallmann<\/a>, North Carolina State University<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"pc-members-track-s\">PC members (Track S)<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"http:\/\/joshalman.com\/\">Josh Alman<\/a>, Columbia University<\/li><li><a href=\"https:\/\/www3.cs.stonybrook.edu\/~bender\/\">Michael Bender<\/a>, Stony Brook University<\/li><li><a href=\"https:\/\/people.mpi-inf.mpg.de\/~kbringma\/\">Karl Bringmann<\/a>, Saarland University<\/li><li><a href=\"http:\/\/people.cs.bris.ac.uk\/~clifford\/\">Rapha\u00ebl Clifford<\/a>, University of Bristol<\/li><li><a href=\"https:\/\/nerva.cs.uni-bonn.de\/doku.php?id=staff:annedriemel\">Anne Driemel<\/a>, Universit\u00e4t Bonn<\/li><li><a href=\"https:\/\/sites.google.com\/a\/cs.uni.wroc.pl\/gawry\/\">Pawe\u0142 Gawrychowski<\/a>, University of Wroc\u0142aw<\/li><li><a href=\"https:\/\/homepage.univie.ac.at\/monika.henzinger\/\">Monika Henzinger<\/a>, University of Vienna<\/li><li><a href=\"https:\/\/di.ulb.ac.be\/algo\/iacono\/\">John Iacono<\/a>, Universit\u00e9 libre de Bruxelles<\/li><li><a href=\"https:\/\/mimuw.edu.pl\/~kociumaka\/\">Tomasz Kociumaka<\/a>, University of California, Berkeley<\/li><li><a href=\"https:\/\/www.tue.nl\/en\/research\/researchers\/irina-kostitsyna\/\">Irina Kostitsyna<\/a>, Eindhoven University of Technology<\/li><li><a href=\"https:\/\/sites.google.com\/site\/williamkuszmaul\">William Kuszmaul<\/a>, Massachusetts Institute of Technology<\/li><li><a href=\"http:\/\/rasmuskyng.com\/\">Rasmus Kyng<\/a>, ETH Z\u00fcrich<\/li><li><a href=\"http:\/\/www.dcs.gla.ac.uk\/~kitty\/\">Kitty Meeks<\/a>, University of Glasgow<\/li><li><a href=\"https:\/\/www.mimuw.edu.pl\/~malcin\/\">Marcin Pilipczuk<\/a>, University of Warsaw<\/li><li><a href=\"https:\/\/kentquanrud.com\/\">Kent Quanrud<\/a>, Purdue University<\/li><li><a href=\"http:\/\/www2.compute.dtu.dk\/~erot\/\">Eva Rotenberg<\/a> (chair), Technical University of Denmark<\/li><li><a href=\"http:\/\/www.shikhas.com\/\">Shikha Singh<\/a>, Williams College<\/li><li><a href=\"https:\/\/jukkasuomela.fi\/\">Jukka Suomela<\/a>, Aalto University<\/li><li><a href=\"https:\/\/cs.usu.edu\/people\/haitaowang\/\">Haitao Wang<\/a>, Utah State University<\/li><li><a href=\"https:\/\/www.dii.uchile.cl\/~awiese\/\">Andreas Wiese<\/a>, TU Munich<\/li><li><a href=\"https:\/\/www.mimuw.edu.pl\/~anka\/\">Anna Zych-Pawlewicz<\/a>, University of Warsaw<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"speaker\">Invited Speakers<\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/people.csail.mit.edu\/virgi\/\" data-type=\"URL\" data-id=\"https:\/\/people.csail.mit.edu\/virgi\/\">Virginia Vassilevska Williams<\/a>, Massachusetts Institute of Technology<\/li><li><a href=\"https:\/\/www.cs.helsinki.fi\/u\/puglisi\/\" data-type=\"URL\" data-id=\"https:\/\/www.cs.helsinki.fi\/u\/puglisi\/\">Simon Puglisi<\/a>, University of Helsinki<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"proceedings\">Proceedings<\/h3>\n\n\n\n<p>The ESA 2022 proceedings will be published in the&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/submission.dagstuhl.de\/documentation\/authors#lipics\" target=\"_blank\">Leibniz International Proceedings in Informatics (LIPIcs) series<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Scope The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms. It is organized in collaboration with the&nbsp;European Association for Theoretical Computer Science (EATCS)&nbsp;and is a part of&nbsp;ALGO 2022. Important Dates Paper submission deadline: April 21,&nbsp;23:59&nbsp;AoE. (EasyChair submission system) Notification: June 18 Camera ready: July 3 LIPIcs receives files: July 8 &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/algo-conference.org\/2022\/esa\/\" class=\"more-link\">Read more<span class=\"screen-reader-text\"> &#8220;ESA 2022&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-18","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/18","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":57,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/18\/revisions"}],"predecessor-version":[{"id":1126,"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/pages\/18\/revisions\/1126"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2022\/wp-json\/wp\/v2\/media?parent=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}