67 Midwest Theory Day

April 15-16, 2017
Bloomington, Indiana

Registration deadline: March 25, 2017

The 67th Midwest Theory Day will bring together researchers in theoretical computer science from the Midwest for a weekend of interaction and collaboration.

4th Swedish Summer School in Computer Science

July 16-22, 2017

Submission deadline: April 7, 2017
Registration deadline: May 9, 2017

The 4th Swedish Summer School in Computer Science (http://s3cs.csc.kth.se/) will be held from July 16 to July 22, 2017, in the beautiful Stockholm archipelago at Djuronaset (http://djuronaset.com/en/). It consists of two mini-courses on circuit complexity and applications by Benjamin Rossman and Ryan Williams. The application deadline is April 7, 2017.

Conference on Integer Programming and Combinatorial Optimization (IPCO)

June 26-28, 2017
Waterloo, Canada

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.

IX Latin and American Algorithms, Graphs and Optimization Symposium

September 11-15, 2017
Marseille, France

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.