posted by user: wcfptilli || 7383 views || tracked by 10 users: [display]

STACS 2019 : 36th International Symposium on Theoretical Aspects of Computer Science

FacebookTwitterLinkedInGoogle


Conference Series : Symposium on Theoretical Aspects of Computer Science
 
Link: https://stacs2019.akt.tu-berlin.de/
 
When Mar 13, 2019 - Mar 16, 2019
Where TU Berlin, Berlin, Germany
Submission Deadline Oct 1, 2018
Notification Due Dec 20, 2018
Final Version Due Jan 16, 2019
Categories    algorithms and data structures   automata and formal languages   complexity and computability   logic in computer science
 

Call For Papers

STACS 2019 - Call for papers

The 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.

INVITED SPEAKERS

Leslie Ann Goldberg (Oxford)
Anca Muscholl (Bordeaux)
Petra Mutzel (Dortmund)

PROGRAM COMMITTEE

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)

TUTORIALS

There will be the following two tutorials taking place on March 13, 2019:

Tobias Friedrich (HPI Potsdam):
"Network Science"

Karl Bringmann (MPI Saarbrücken):
"Fine-Grained Complexity Theory"

SUBMISSIONS

Submissions can be uploaded to EasyChair: https://easychair.org/conferences/?conf=stacs2019.

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 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 responses.

PROCEEDINGS

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.

IMPORTANT DATES

* 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

CONTACT INFORMATION

Web: https://stacs2019.akt.tu-berlin.de/
Email: stacs2019 'at' akt 'dot' tu-berlin 'dot' de

Related Resources

STACS 2024   Symposium on Theoretical Aspects of Computer Science
CPAIOR 2024   International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research
DSIT 2024   2024 7th International Conference on Data Science and Information Technology (DSIT 2024)
ADMIT 2024   2024 3rd International Conference on Algorithms, Data Mining, and Information Technology (ADMIT 2024)
PCDS 2024   The 1st International Symposium on Parallel Computing and Distributed Systems
NLE Special Issue 2024   Natural Language Engineering- Special issue on NLP Approaches for Computational Analysis of Social Media Texts for Online Well-being and Social Order
CCBDIOT 2024   2024 3rd International Conference on Computing, Big Data and Internet of Things (CCBDIOT 2024)
FCSIT 2024   2024 3rd Eurasian Conference on Frontiers of Computer Science and Information Technology
ACIE 2024   CPS--2024 4th Asia Conference on Information Engineering (ACIE 2024)
Sensors journal 2024   Special Issue on Energy-Efficient Communication Networks and Systems: 2nd Eition