SEA: Symposium on Experimental and Efficient Algorithms



Past:   Proceedings on DBLP

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


All CFPs on WikiCFP

Event When Where Deadline
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 : 2014


13th International Symposium on Experimental Algorithms
June 29-2014July 1, 2014
Copenhagen, Denmark

Call for Papers



Submission deadline: February 7, 2014
Author notification: March 14, 2014
Camera-ready submission: April 4, 2014


SEA, 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
Verita, Rio de Janeiro, Santorini, Menorca Island, Rome, Cape Cod,
Dortmund, Ischia Island, Crete, Bordeaux, and Rome.

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

Topics of interest include, but are not limited to:

- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- 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
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World-Wide-Web Algorithms


Benjamin Doerr, Max-Planck Institut für Informatik
Camil Demetrescu, Sapienza University of Rome
David G. Andersen, Carnegie Mellon University
David Mount, University of Maryland
Erwin Pesch, University of Siegen
Gerhard J. Woeginger, Technical University of Eindhoven
Joachim Gudmundsson (chair), University of Sydney and NICTA
Jyrki Katajainen, University of Copenhagen
Maike Buchin, Ruhr-University of Bochum
Martin Skutella, Technical University of Berlin
Matt Stallmann, North Carolina State University
Peter Sanders, Karlsruhe Institute of Technology
Petra Mutzel, Technical University of Dortmund
Philippas Tsigas, Chalmers University of Technology
Rolf Niedermeier, Technical University of Berlin
Simon Puglisi, University of Helsinki
Suresh Venkatasubramanian, University of Utah
Toby Walsh, NICTA and University of New South Wales
Yusu Wang, Ohio State University


Jon Bentley, Avaya Labs Research
Robert Bixby, Rice University
Rasmus Pagh, IT University of Copenhagen


Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.

Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.


Accepted papers will appear in the SEA 2014 proceedings published
by Springer in the LNCS series.


Susan Nasirumbi Ipsen, University of Copenhagen
Inge Hviid Jensen, University of Copenhagen
Jyrki Katajainen, University of Copenhagen


For further information, please send an e-mail to

Related Resources

MathSJ 2021   Applied Mathematics and Sciences: An International Journal
SEA 2021   19th Symposium on Experimental Algorithms
ICCES 2022   The 28th International Conference on Computational & Experimental Engineering and Sciences
IOP-EECT 2022   2022 2nd International Conference on Electrical, Electronics and Computing Technology (EECT 2022)
ACM-EI/Scopus-ACAI 2021   2021 4th International Conference on Algorithms, Computing and Artificial Intelligence (ACAI 2021)
ICACS--ACM, EI Compendex, SCOPUS 2021   ACM--2021 5th International Conference on Algorithms, Computing and Systems (ICACS 2021)--EI Compendex, SCOPUS
ACM-AMLSP 2021   2021 3rd International Conference on Algorithms, Machine Learning and Signal Processing (AMLSP 2021)
Bioinspired Intelligent Algorithms 2021   Special Issue Bioinspired Intelligent Algorithms for Optimization, Modeling and Control: Theory and Applications
CoNeCo 2022   14th International Conference on Computer Networks & Communications
DL in Hardware 2021   Circuits and Systems of Dictionary Learning Algorithms and Applications Special Issue