March 26-28, 2018
Royal Holloway, University of London
http://bctcs18.cs.rhul.ac.uk

Submission deadline: February 1, 2018
Registration deadline: March 1, 2018

BCTCS is the UK’s foremost venue bringing together researchers in theoretical computer science to present their research and discuss future directions. In addition to the submitted presentations, there will be five invited talks, given by world-leading researchers in TCS.

June 17-22, 2018
Vail, Colorado
https://www.isit2018.org/

Submission deadline: January 9, 2018

The 2018 IEEE International Symposium on Information Theory will be held from June 17 to 22, 2018 in Vail, Colorado in the USA. The conference welcomes submissions that are broadly under the purview of information theory or which use information-theoretic ideas/measures in its arguments.

The technical program committee this year has a large number of members from the theory CS community and welcomes submissions in theoretical computer science and adjacent areas that fall under the broad scope of ISIT.

There is a 5 page limit on submissions, which means they are either short results, or they are outlines of bigger results which would then have a full version posted somewhere. In particular, small cute results are appreciated. So ISIT could be a good forum for such results in TCS, while also advertising the problems, concepts, and techniques to the broader information theory community.

The call for papers and other details are available at https://www.isit2018.org/
The submission deadline for registering papers is Jan 9, 2018 and submitting the papers is Jan 12.

The conference also seeks half-day tutorial proposals, which should provide clear and focused teaching material covering new and emerging topics within the scope of the conference. Proposals for tutorials are due Dec 15. https://www.isit2018.org/authors/call-for-tutorials/

June 4-6, 2018
Amsterdam
http://2018.highlightsofalgorithms.org/

Submission deadline: December 12, 2017

The HALG 2018 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks:
A. survey (60 minutes): a survey of an algorithmic topic that has seen exciting developments in last couple of years.
B. paper (30 minutes): a significant algorithmic result appearing in a paper in 2017 or later.

To nominate, please email  halg2018.nominations@gmail.com  the following information:
1. Basic details: speaker name + topic (for survey talk) or paper’s title, authors, conference/arxiv + preferable speaker (for paper talk).
2. Brief justification: Focus on the benefits to the audience, e.g., quality of results, importance/relevance of topic, clarity of talk, speaker’s presentation skills. Pay attention to potentially non-obvious information, e.g., the topic might seem out of scope, or the material seems inadequate for one talk.

All nominations will be reviewed by the Program Committee (PC) to select speakers that will be invited to the conference.

Nominations deadline: December 12, 2017 (for full consideration).

Please keep in mind that the conference does not provide financial support for the speakers.

August 7-11, 2017
Liège, Belgium
http://www.cant.ulg.ac.be/dlt/

Submission deadline: March 29, 2017

The annual conference on formal languages, automata theory, and related areas.

September 11-15, 2017
Montréal, Québec, Canada
http://words2017.lacim.uqam.ca/index.php?lan=en

Submission deadline: April 1, 2017

The bi-annual conference on combinatorics and algorithmics on words, related topics, and applications

June 26-28, 2017
Waterloo, Canada
http://www.math.uwaterloo.ca/ipco2017/

Registration deadline: May 1, 2017

The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

September 11-15, 2017
Marseille, France
https://lipn.univ-paris13.fr/Lagos2017/index.html

Submission deadline: March 31, 2017

Themes include, but are not limited to, the following AMS classifications:

Algorithms: analysis of algorithms; approximation algorithms; randomized algorithms; computational geometry.

Operations Research and Mathematical Programming: combinatorial optimization; integer programming; polyhedral combinatorics; operations research and management science.

Graph Theory: cliques, dominating and independent sets; coloring of graphs and hypergraphs; covering and packing, factorization, matching; digraphs, tournaments; graph algorithms; graphs and matrices; hypergraphs; perfect graphs; random graphs; structural characterization of types of graphs.

Applications: mathematical programming, combinatorial optimization, continuous optimization, heuristics, and metaheuristics, applied to real-world problems.

June 9-11, 2017
TU Berlin, Berlin, Germany
highlightsofalgorithms.org

Submission deadline: March 5, 2017
Registration deadline: April 30, 2017

The 2nd Highlights of Algorithms (HALG 2017) conference is designed to be a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks, as well as possibility for all researchers and students to present their recent results through a series of short talks and poster presentations. Attending the Highlights of Algorithms conference will also be an opportunity for networking and meeting leading researchers in algorithms.