Author: shacharlovett

4th Swedish Summer School in Computer Science

~ shacharlovett

July 16-22, 2017
Stockholm
http://s3cs.csc.kth.se/

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)

~ shacharlovett

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.

IX Latin and American Algorithms, Graphs and Optimization Symposium

~ shacharlovett

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.

Highlights of Algorithms (HALG 2017)

~ shacharlovett

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.

Graph Theory, Algorithms And Applications

~ shacharlovett

May 5-13, 2017
Erice, Italy
http://www.graphalgorithms.it/erice2017/index.php

Registration deadline: Tue Feb 28 2017 00:00:00 GMT-0800 (PST)

Graph problems have applications in many fields and typically require multidisciplinary approaches.
The fourth edition of this school aims to bring together leading scientists, junior researchers and PhD students from several areas in order to discuss, possibly in a systematic and organic way, different approaches for solving graph problems.
The school is organized in plenary lectures held by internationally renowned speakers.
The intended audience consists of PhD students and junior researchers interested in graph problems, coming from several areas including (but not limited to) the design, analysis and experimentation of algorithms, operations research, optimization, and discrete mathematics.