SEA: Symposium on Experimental and Efficient Algorithms



Past:   Proceedings on DBLP

Future:  Post a CFP for 2018 or later   |   Invite the Organizers Email


All CFPs on WikiCFP

Event When Where Deadline
SEA 2017 Symposium on Experimental and Efficient Algorithms
Jun 21, 2017 - Jun 23, 2017 London, UK Feb 13, 2017 (Feb 6, 2017)
SEA 2014 13th International Symposium on Experimental Algorithms
Jun 29, 2014 - Jul 1, 2014 Copenhagen, Denmark Feb 7, 2014
SEA 2013 12th International Symposium on Experimental Algorithms
Jun 5, 2013 - Jun 7, 2013 Rome, Italy Jan 23, 2013
SEA 2011 SEA 2011 : 10th International Symposium on Experimental Algorithms (Ranked as B, CORE 2008)
May 5, 2011 - May 7, 2011 Kolimpari Chania, Creete (Greece) Jan 26, 2011

Present CFP : 2017

SEA (Symposium on Experimental Algorithms), previously known as WEA (Workshop on Experimental Algorithms), is an international forum for researchers in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The preceding symposia were held in Riga, Monte VeritĂ , Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod, Dortmund, Ischia Island, Crete, Bordeaux, Rome, Copenhagen, Paris, and St. Petersburg.

SEA aims to attract papers from both the CS and the OR/Mathematical Programming communities.

The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. 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.

In 2017 the proceedings of SEA will be published for the first time in the Leibniz International Proceedings in Informatics (LIPIcs) open-access series.

Topics of Interest
Contributions solicited cover a variety of topics including but not limited to:

Algorithm Engineering
Algorithmic Libraries
Algorithmic Mechanism Design
Analysis of Algorithms
Algorithms for Memory Hierarchies
Approximation Techniques
Branch-and-Bound Algorithms
Combinatorial and Irregular Problems
Combinatorial Structures and Graphs
Communication Networks
Complex Networks
Computational Geometry
Computational Learning Theory
Computational Optimization
Computer Systems
Cryptography and Security
Data Streams
Data Structures
Distributed and Parallel Algorithms
Evaluation of Algorithms for Realistic Environments
Experimental Techniques and Statistics
Graph Drawing
Heuristics for Combinatorial Optimization
Implementation, Testing, Evaluation and Fine-tuning
Information Retrieval
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Metaheuristic Methodologies
Multiple Criteria Decision Making
Network Analysis
Novel Applications of Algorithms in Other Disciplines
Online Problems
Parallel Algorithms and Computing
Railway Optimization using Algorithmic Methods
Randomized Techniques
Semidefinite Programming
Software Repositories and Platforms for using Algorithms
Telecommunications and Networking
World-Wide-Web Algorithms


Authors are invited to submit an extended abstract not exceeding 12 single-spaced pages, including references, figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract. 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

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.

Related Resources

NSDI 2017   14th USENIX Symposium on Networked Systems Design and Implementation
SEA 2017   16th International Symposium on Experimental Algorithms
ICACS 2017   2017 International Conference on Algorithms, Computing and Systems (ICACS 2017)--Ei Compendex and Scopus
CIbSE 2017   20th Ibero-American Conference on Software Engineering
ICACS - EI 2017   2017 International Conference on Algorithms, Computing and Systems (ICACS 2017)--Ei Compendex and Scopus
EfficientConvNets 2017   Challenge on Efficient ConvNets for Semantic Segmentation
LOPAL 2018   International Conference on Learning and Optimization Algorithms: Theory and Applications
HIP3ES 2017   International Workshop on High Performance Energy Efficient Embedded Systems (5th Edition)
ISAAC 2017   International Symposium on Algorithms and Computation