Difference between revisions of "ESA 2020"

From Openresearch
Jump to: navigation, search
 
Line 15: Line 15:
 
|Notification=2020/06/18
 
|Notification=2020/06/18
 
|Camera ready=2020/06/28
 
|Camera ready=2020/06/28
 +
|Has host organization=European Association for Theoretical Computer Science
 
|has general chair=Fabrizio Grandoni, Peter Sanders
 
|has general chair=Fabrizio Grandoni, Peter Sanders
 
|Submitted papers=313
 
|Submitted papers=313

Latest revision as of 09:31, 1 September 2020

ESA 2020
28th Annual European Symposium on Algorithms
Event in series ESA
Subevent of ALGO 2020
Dates 2020/09/07 (iCal) - 2020/09/10
Homepage: http://algo2020.di.unipi.it/ESA2020/index.html
Location
Location: Pisa, Online
Loading map...

Important dates
Papers: 2020/04/29
Submissions: 2020/04/29
Notification: 2020/06/18
Camera ready due: 2020/06/28
Papers: Submitted 313 / Accepted 83 (26.5 %)
Committees
General chairs: Fabrizio Grandoni, Peter Sanders
Table of Contents

Contents


The following coordinate was not recognized: Geocoding failed.
The following coordinate was not recognized: Geocoding failed.


The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms. It is organized in collaboration with the European Association for Theoretical Computer Science (EATCS) and is a part of ALGO 2020. The Organization Committee (OC) and the Chairs of ALGO 2020 decided to run the conferences ONLINE in a virtual way.


ESA 2020 proceedings will to be available in the Leibniz International Proceedings in Informatics (LIPIcs) series.

Topics

Papers presenting original research in all areas of algorithmic research are sought, including but not limited to:

  • Algorithm engineering
  • Algorithmic aspects of networks
  • Algorithmic game theory
  • Approximation algorithms
  • Computational biology
  • Computational finance
  • Computational geometry
  • Combinatorial optimization
  • Data compression
  • Data structures
  • Databases and information retrieval
  • Distributed and parallel computing
  • Graph algorithms
  • Hierarchical memories
  • Heuristics and meta-heuristics
  • Mathematical programming
  • Mobile computing
  • Online algorithms
  • Parameterized algorithms
  • Pattern matching
  • Quantum computing
  • Randomized algorithms
  • Scheduling and resource allocation problems
  • Streaming algorithms