SEA 2020: 18th International Symposium on Experimental Algorithms Benedictine Monastery of “San Nicolò” Catania, Italy, June 16-18, 2020 |
Conference website | http://www.sea2020.dmi.unict.it |
Submission link | https://easychair.org/conferences/?conf=sea2020 |
Abstract registration deadline | January 10, 2020 |
Submission deadline | January 17, 2020 |
SEA (International Symposium on Experimental Algorithms), previously known as Workshop on Experimental Algorithms (WEA), is an international forum for researchers in the area of the design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications.
The Conference will be held in Catania (Italy) at the Benedictine Monastery of “San Nicolò”, a unique place that tells us about the human and historic events of the city on the slope at the foot of Etna, from the ancient times until today.
Submission Guidelines
The authors should submit an extended abstract not exceeding 12 pages, including figures, title, authors, affiliations, e-mail addresses, and a short abstract. References will not be counted in the page limit. At least 10-point font should be used. Authors are strongly advised to use the LaTeX style file supplied for the LIPIcs style here. Final proceedings papers must be camera-ready in this format. A clearly marked Appendix, which will not count toward the 12 page submission limit, can be included and will be read at the referees’ discretion. All submissions have to be made via the EasyChair submission page for the conference at
https://easychair.org/conferences/?conf=sea2020
Authors are encouraged to include a link to the source code and/or datasets to increase confidence in the reproducibility of their experiments; the code may be read and/or executed at the referees' discretion.
Papers submitted for review should represent original, previously unpublished work or surveys of important results. At the time the extended abstract is submitted to SEA, and for the entire review period, the paper (or essentially the same paper) should not be under review by any other conference with published proceedings or by a scientific journal. At least one author of each accepted paper will be expected to attend the conference and present the paper.
Topics of interest
SEA aims to attract papers from both the Computer Science and the Operations Research/Mathematical Programming communities. Submissions should present significant contributions supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-) heuristics, or application-driven case studies that deepen the understanding of the complexity of a problem.
SEA calls papers for a main general track, covering the above concepts, and two specific tracks, covering aspects of string processing and aspects of graph theory, as presented below.
Main Track on Experimental Algorithms
This track covers the main themes of the symposium and specifically the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Topics include but are not restricted to:
- Algorithm engineering
- Algorithmic libraries
- Analysis of algorithms
- Algorithms for memory hierarchies
- Algorithms for the World-Wide-Web
- Approximation techniques
- Bioinformatics
- Branch-and-bound algorithms
- Combinatorial problems and combinatorial structures
- Computational geometry and computational optimization
- Cryptography and security
- Heuristics for combinatorial optimization
- Information retrieval
- Integer programming
- Logistics and operations management
- Machine learning and data mining
- Mathematical programming
- Metaheuristic methodologies
- Multiple criteria decision making
- Novel applications of algorithms in other disciplines
- Online problems
- Parallel algorithms and computing
- Railway optimization using algorithmic methods
- Randomized techniques
- Robotics
- Semidefinite programming
- Simulation
- Software repositories and platforms for using algorithms
- Telecommunications and networking
Track on Experimental Algorithms on Strings
This track covers research in all aspects of experimental algorithms on string processing, including but not restricted to:
- Algorithms for pattern matching in strings
- Text indexing, data structures for string processing
- Coding and text compression
- Compressed data structures
- Compressed string processing
- Text mining, 2D pattern matching
- Automata based string processing
- Searching for regularities
Track on Experimental Algorithms on Graphs
This track covers research in all aspects of experimental algorithms on graphs, including but not restricted to:
- Design and analysis of sequential, parallel algorithms on graphs
- Randomized and parameterized algorithms on graphs
- Distributed graph and network algorithms
- Structural graph theory with algorithmic or complexity applications
- Computational complexity of graph and network problems
- Graph grammars
- Graph rewriting systems and graph modeling
- Graph drawing and layouts
- Graph mining
- Random graphs and models of the web and scale-free networks
Program Committees
- Golnaz Badkobeh, Goldsmiths University of London (UK)
- Gianfranco Bilardi, University of Padova (Italy)
- Christina Boucher, University of Florida (USA)
- Domenico Cantone (chair), University of Catania (Italy)
- Pierluigi Crescenzi, Université de Paris-IRIF (France)
- Maxime Crochemore, Kings College London (UK)
- Simone Faro (chair), University of Catania (Italy)
- Paola Festa, University of Naples Federico II (Italy)
- Irene Finocchi, Sapienza University of Rome (Italy)
- Travis Gagie, Dalhousie University (Canada)
- Arie Koster, RWTH Aachen University (Germany)
- Oguzhan Kulekci, Istanbul Technical University (Turkey)
- Susana Ladra, University of A Coruña (Spain)
- Thierry Lecroq, University of Rouen Normandy (France)
- Veli Mäkinen, University of Helsinki (Finland)
- Petra Mutzel, TU Dortmund (Germany)
- Gonzalo Navarro, University of Chile (Chile)
- Panos Pardalos, University of Florida (USA)
- Nadia Pisanti, University of Pisa (Italy)
- Ely Porat, Bar-Ilan University (Israel)
- Simon J. Puglisi, University of Helsinki (Finland)
- Ilya Razenshteyn, Microsoft Research (USA)
- Mauricio Resende, Amazon.com Inc. (USA)
- Marie-France Sagot, INRIA (France)
- Alessandra Sala, Bell Labs (Ireland)
- Peter Sanders, Karlsruhe Institute of Technology (Germany)
- Stefan Schmid, University of Vienna (Austria)
- Sabine Storandt, Universität Konstanz (Germany)
- Dorothea Wagner, Karlsruhe Institute of Technology (Germany)
- Renato Werneck, Amazon.com Inc. (USA)
- Weili Wu, University of Texas at Dallas (USA)
Invited Speakers
- Martin Aumüller, IT University of Copenhagen, Denmark
- Stefan Edelkamp, King's College London, UK
- Nicola Prezza, University of Pisa, Italy
Publication
The conference proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs), a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl Leibniz Center for Informatics. SEA Proceedings volumes are published according to the principle of OpenAccess, i.e., they are available online and free of charge.
A special issue of selected papers will be published in the ACM Journal of Experimental Algorithmics.
Web Page
http://www.sea2020.dmi.unict.it