<div dir="ltr"><div class="gmail_quote"><div dir="ltr"><div class="gmail_quote"><div><p><br>
<br>
ESA 2022 - CALL FOR PAPERS<br>
<br>
30th European Symposium on Algorithms (ESA)<br>
<br>
September 5, 2022 - September 9, 2022 in Potsdam, Germany<br>
<br>
Conference page: <a href="https://algo2022.eu/esa/" target="_blank">https://algo2022.eu/esa/</a><br>
<br>
Easychair link: <a href="https://easychair.org/my/conference?conf=esa20220" target="_blank">https://easychair.org/my/conference?conf=esa20220</a><br>
<br>
Call for Papers<br>
<br>
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.<br>
<br>
Paper submission and proceedings<br>
<br>
Papers should be submitted electronically via the EasyChair
submission system. The ESA 2022 proceedings will be published in
the Leibniz International Proceedings in Informatics (LIPIcs)
series.<br>
<br>
Submission Guidelines<br>
<br>
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 LIPIcs publication guidelines. 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
not 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’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 EasyChair submission system. 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.<br>
<br>
Double-Blind Reviewing<br>
<br>
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’ 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 “We build on our
previous work …” but rather “We build on the work of …”). 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.<br>
<br>
Topics<br>
<br>
Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:<br>
<br>
Algorithm engineering<br>
Algorithmic aspects of networks<br>
Algorithmic game theory<br>
Algorithmic Data Science<br>
Approximation algorithms<br>
Computational biology<br>
Computational finance<br>
Computational geometry<br>
Combinatorial optimization<br>
Data compression<br>
Data structures<br>
Databases and information retrieval<br>
Distributed and parallel computing<br>
Graph algorithms<br>
Hierarchical memories<br>
Heuristics and meta-heuristics<br>
Mathematical programming<br>
Mobile computing<br>
Online algorithms<br>
Parameterized algorithms<br>
Pattern matching<br>
Quantum computing<br>
Randomized algorithms<br>
Scheduling and resource allocation problems<br>
Streaming algorithms<br>
<br>
Announcement: ESA Track S<br>
<br>
This year, the European Symposium on Algorithms ESA’22 will have a
Track S (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. <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. <br>
It has its own PC and PC chair, and the submission/acceptance<br>
deadlines follow the schedule for tracks A and B.<br>
<br>
Important Dates<br>
<br>
Paper submission deadline: April 21 <br>
Notification: June 18<br>
Camera ready: July 3<br>
Conference: September 5-9, 2022, in Potsdam, Germany<br>
<br>
Steering Committee<br>
<br>
Hannah Bast (chair), Albert-Ludwigs-Universität Freiburg<br>
Shiri Chechik, Tel Aviv University<br>
Fabrizio Grandoni, IDSIA, USI-SUPSI<br>
Robert Krauthgamer, The Weizmann Institute of Science<br>
Petra Mutzel (Chair), University of Bonn<br>
Gonzalo Navarro, Universidad de Chile<br>
Rasmus Pagh , University of Copenhagen<br>
Eva Rotenberg, Technical University of Denmark<br>
Peter Sanders, Karlsruhe Institute of Technology (KIT)<br>
Sabine Storandt, University of Konstanz<br>
<br>
PC members (Track A)<br>
<br>
Mikkel Abrahamsen, University of Copenhagen<br>
Peyman Afshani, Aarhus University<br>
Pankaj K. Agarwal, Duke University<br>
Sepehr Assadi, Rutgers University<br>
Per Austrin, KTH<br>
Leonid Barenboim, The Open University of Israel<br>
Surender Baswana, IIT Kanpur<br>
Maike Buchin, Ruhr University Bochum<br>
Jaroslaw Byrka, University of Wrocław<br>
Diptarka Chakraborty, National University of Singapore<br>
Shiri Chechik (chair), Tel Aviv University<br>
Vincent Cohen-Addad, Google Research<br>
Mark de Berg, TU Eindhoven<br>
Mahsa Derakhshan, UC Berkley and Northeastern University<br>
Michael Dinitz, Johns Hopkins University<br>
Michal Dory, ETH Zurich<br>
Matthias Englert, University of Warwick<br>
Thomas Erlebach, Durham University<br>
Fedor Fomin, University of Bergen<br>
Dimitris Fotakis, National Technical University of Athens<br>
Hsin Hao Su, Boston College<br>
Martin Hoefer, Goethe University<br>
Ravishankar Krishnaswamy, Microsoft Research<br>
Janardhan Kulkarni, Microsoft Research<br>
Divyarthi Mohan, Tel Aviv University<br>
Shay Mozes, Reichman University<br>
Wolfgang Mulzer, Freie Universität Berlin<br>
Ofer Neiman, Ben-Gurion University<br>
Aleksandar Nikolov, University of Toronto<br>
Sigal Oren, Ben-Gurion University<br>
Fahad Panolan, IIT Hyderabad<br>
Adi Rosén, FILOFOCS – CNRS<br>
Sushant Sachdeva, University of Toronto<br>
Stefan Schmid, University of Vienna and TU Berlin<br>
Roy Schwartz, Technion<br>
Bruce Shepherd, University of British Columbia<br>
Shay Solomon, Tel Aviv University<br>
Xiaorui Sun, University of Illinois<br>
Dimitrios Thilikos, LIRMM, Université de Montpellier, CNRS<br>
Ohad Trabelsi, The University of Michigan<br>
Oren Weimann, University of Haifa<br>
Philip Wellnitz, Max Planck Institute for Informatics<br>
Raphael Yuster, University of Haifa<br>
<br>
PC members (Track B)<br>
<br>
Diego Arroyuelo, Universidad Técnica Federico Santa María<br>
Philip Bille, Danmarks Tekniske Universitet<br>
Thomas Bläsius, Karlsruhe Institute of Technology<br>
Christina Boucher, University of Florida<br>
Sándor Fekete, Technische Universität Braunschweig<br>
José Fuentes-Sepúlveda, Universidad de Concepción<br>
Gramoz Goranci, Universitat Wien<br>
Giuseppe Italiano, Università degli studi di Roma “Tor
Vergata”<br>
Shweta Jain, University of Utah<br>
Dominik Kempa, Stony Brook University<br>
Veli Mäkinen, University of Helsinki<br>
Catherine McGeoch, Amherst College<br>
David Mount, University of Maryland<br>
Gonzalo Navarro (chair), Universidad de Chile<br>
Steven Skiena, Stony Brook University<br>
Matthias Stallmann, North Carolina State University<br>
<br>
PC members (Track S)<br>
<br>
Josh Alman, Columbia University<br>
Michael Bender, Stony Brook University<br>
Karl Bringmann, Saarland University<br>
Raphaël Clifford, University of Bristol<br>
Anne Driemel, Universität Bonn<br>
Paweł Gawrychowski, University of Wrocław<br>
Monika Henzinger, University of Vienna<br>
John Iacono, Université libre de Bruxelles<br>
Tomasz Kociumaka, University of California, Berkeley<br>
Irina Kostitsyna, Eindhoven University of Technology<br>
William Kuszmaul, Massachusetts Institute of Technology<br>
Rasmus Kyng, ETH Zürich<br>
Kitty Meeks, University of Glasgow<br>
Marcin Pilipczuk, University of Warsaw<br>
Kent Quanrud, Purdue University<br>
Eva Rotenberg (chair), Technical University of Denmark<br>
Shikha Singh, Williams College<br>
Jukka Suomela, Aalto University<br>
Haitao Wang, Utah State University<br>
Andreas Wiese, TU Munich<br>
Anna Zych-Pawlewicz, University of Warsaw<br>
<br>
Invited Speakers<br>
<br>
Virginia Williams, Massachusetts Institute of Technology<br>
Simon Puglisi, University of Helsinki<br>
<br>
Proceedings<br>
<br>
The ESA 2022 proceedings will be published in the Leibniz
International Proceedings in Informatics (LIPIcs) series.<br>
<br>
<br>
<br>
Kind regards,<br>
Shiri Chechik (track A chair), Tel Aviv University<br>
Gonzalo Navarro (track B chair), Universidad de Chile<br>
Eva Rotenberg (track S chair), Technical University of Denmark<br>
Tobias Friedrich (OC chair), University of Potsdam<br>
Grzegorz Herman (proceedings chair), Jagiellonian University
Kraków <br><br></p><blockquote type="cite"><div><div><div dir="auto" style="color:rgb(0,0,0);letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;text-decoration:none;word-wrap:break-word;line-break:after-white-space">
<div style="color:rgb(0,0,0);letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;word-wrap:break-word;line-break:after-white-space"><br>
</div>
</div>
</div>
<br>
</div>
<div><br>
</div>
</blockquote>
</div>
</div></div>
</div></div>