36th International Symposium on Theoretical Aspects of Computer Science
March 13—16, 2019, TU Berlin, Berlin, Germany
Authors are invited to submit papers presenting original and unpublished
research on theoretical aspects of computer science. Typical areas
include (but are not limited to):
* algorithms and data structures,
including: design of parallel, distributed, approximation,
parameterized and randomized algorithms; analysis of algorithms and
combinatorics of data structures; computational geometry,
cryptography, algorithmic learning theory, algorithmic game theory;
* automata and formal languages,
including: algebraic and categorical methods, coding theory;
* complexity and computability,
including: computational and structural complexity theory,
parameterized complexity, randomness in computation;
* logic in computer science,
including: finite model theory, database theory, semantics,
specification verification, rewriting and deduction;
* current challenges,
for example: natural computing, quantum computing, mobile and net
computing, computational social choice.
Leslie Ann Goldberg (Oxford),
"Computational Complexity and the Independence Polynomial"
Anca Muscholl (Bordeaux),
"The Many Facets of String Transducers"
Petra Mutzel (Dortmund),
"Algorithmic Data Analysis"
Christoph Berkholz (Berlin)
Benedikt Bollig (Cachan)
Karl Bringmann (Saarbrücken)
Gerth Stølting Brodal (Aarhus)
Maike Buchin (Bochum)
David Eppstein (Irvine)
Serge Gaspers (Sydney)
Edward Hirsch (St. Petersburg)
Telikepalli Kavitha (Mumbai)
Hartmut Klauck (Singapore)
Antonín Kučera (Brno)
K Narayan Kumar (Chennai)
Dietrich Kuske (Ilmenau)
Jérôme Lang (Paris)
Sophie Laplante (Paris)
Kazuhisa Makino (Kyoto)
Barnaby Martin (Durham)
Cyril Nicaud (Marne-la-Vallée)
Rolf Niedermeier (Berlin, co-chair)
Jakob Nordström (Stockholm)
Christophe Paul (Montpellier, co-chair)
Pascal Schweitzer (Kaiserslautern)
Shinnosuke Seki (Tokyo)
Michał Skrzypczak (Warsaw)
Srikanth Srinivasan (Mumbai)
Jan Arne Telle (Bergen)
Denis Trystram (Grenoble)
Takeaki Uno (Tokyo)
Mikhail Volkov (Ekaterinburg)
Stefan Woltran (Wien)
There will be the following two tutorials taking place on March 13, 2019:
Tobias Friedrich (HPI Potsdam):
Karl Bringmann (MPI Saarbrücken):
"Fine-Grained Complexity Theory"
Submissions can be uploaded to EasyChair:
Authors are invited to submit a draft of a full paper with at most 12
pages (excluding the title page and the references section).
The title page consists exclusively of the title of the paper, author
information, and abstract.
The usage of pdflatex and the LIPIcs style file (see
http://www.dagstuhl.de/en/publications/lipics) are mandatory; no changes
to font size, page geometry, etc. are permitted.
Submissions not in the correct format or submitted after the deadline
will not be considered.
The paper should contain a succinct statement of the issues and of their
motivation, a summary of the main results, and a brief explanation of
their significance, accessible to non-specialist readers.
Proofs omitted due to space constraints must be put into an appendix, to
be read by the program committee members at their discretion.
Simultaneous submission to other conferences with published proceedings
or to journals is not allowed. PC members are excluded from submitting.
There will be a rebuttal period for authors between November 26—29, 2018.
Authors will receive the reviews of their submissions (via EasyChair)
and have three days to submit rebuttals (via EasyChair).
These rebuttals become part of the PC meeting, but entail no specific
Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work. With their submission,
authors consent to sign a license authorizing the program committee
chairs to organize the electronic publication of their paper, provided
the paper is accepted.
* Deadline for submissions: October 1, 2018 (AoE)
* Rebuttal: November 26–29, 2018
* Author notification: December 20, 2018
* Final version: January 16, 2019
* STACS 2019: March 13–16, 2019
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)