Call for Papers
16th International Symposium on Experimental Algorithms (SEA 2017)
June 21-23, 2017, London, United Kingdom
http://www.dcs.kcl.ac.uk/events/SEA2017/
*******************************************************************************
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.
IMPORTANT DATES
Times AoE (Anywhere on Earth):
Abstract submission: 6 February, 2017.
Full paper submission: 13 February, 2017.
Acceptance notification: 27 March, 2017.
Camera-ready version: 6 April, 2017.
Conference dates: June 21-23, 2017.
TOPICS
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
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
INVITED SPEAKERS
Graham Cormode (University of Warwick)
Martin Farach-Colton (Rutgers University)
Ruth Misener (Imperial College London)
PROGRAM COMMITTEE
Maike Buchin, Ruhr University Bochum, Germany
Christina Burt, University of Melbourne, Australia
Sandor Fekete, TU Braunschweig, Germany
Irene Finocchi, University of Rome - La Sapienza, Italy
Ambros Gleixner, Zuse Institute Berlin, Germany
Dominik Kempa, University of Helsinki, Finland
Nicole Megow, Technical University of Munich, Germany
Ulrich Meyer, Goethe-Universitat Frankfurt am Main, Germany
Shin-Ichi Minato, Hokkaido University, Japan
Petra Mutzel, Technical University of Dortmund, Germany
Gonzalo Navarro, University of Chile, Chile
Giuseppe Ottaviano, Facebook, USA
Panos Pardalos, University of Florida, USA
Solon Pissis, King's College London, UK - co-chair
Simon J. Puglisi, University of Helsinki, Finland - co-chair
Rajeev Raman, University of Leicester, UK - co-chair
Barna Saha, University of Massachusetts Amherst, USA
Alassandra Sala, Nokia Bell Labs, Ireland
Sabine Storandt, University of Wuerzburg, Germany
Rossano Venturini, University of Pisa, Italy
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Renato Werneck, Amazon, USA
Christos Zaroliagis, University of Patras, Greece
SUBMISSIONS
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:
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
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=sea2017
Papers submitted for review should present 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.
FURTHER INFORMATION AND CONTACTS
Web: http://www.dcs.kcl.ac.uk/events/SEA2017/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
