June 8, 2018
Northwestern University
https://theory.eecs.northwestern.edu/events/algorithmic-fairness/

Registration deadline: June 8, 2018

As algorithmic systems have increasingly been deployed to make consequential decisions, it is becoming urgent that we grapple with the problem of (un)fairness and discrimination. These are delicate issues — to think rigorously about them, we first need to figure out how to formally define what we want, and then reason about how we might go about achieving our goals algorithmically — and what tradeoffs we will have to manage. This workshop focuses on recent advances in the theory of algorithmic fairness: both on foundational definitional questions, and on algorithmic techniques. The speakers are Nicole Immorlica (MSR), Jon Kleinberg (Cornell), Omer Reingold (Stanford), and Aaron Roth (U. of Pennsylvania).
The technical program of this workshop is organized by Aaron Roth and Jason Hartline.

July 9, 2018
Prague, Czechia
https://sites.google.com/site/aefeldmann/workshop

Submission deadline: April 20, 2018
Registration deadline: May 31, 2018

Two standard approaches to handle hard (typically NP-hard) optimization problems are to develop approximation and parameterized algorithms. For the former, the runtime should be polynomial in the input size, but the computed solution may deviate from the optimum. For the latter, the optimum solution should be computed, but any super-polynomial runtime should be isolated to some parameter of the input. Some problems however are hard to approximate on one hand, and on the other it is also hard to obtain parameterized algorithms for some given parameter. In this case one may still hope to obtain parameterized approximation algorithms, which combine the two paradigms, i.e. the computed solution may deviate from the optimum and the runtime should have super-polynomial dependence only in some given parameter. Recently there has been a great deal of development in proving the existence or non-existence of parameterized approximation algorithms, and the aim of this workshop is to bring together active researchers of this emerging field, so that they may share their results and insights.

April 22-26, 2018
Jerusalem
https://iiashdc.wordpress.com/april-conference-iias-huji/

Registration deadline: April 13, 2018

Combinatorics in general, and the theory of expander graphs in particular, have been fruitful areas of interaction between pure and applied mathematics. In recent years, a “high dimensional” combinatorial theory has emerged. Aside from its intellectual appeal, this theory has a great potential for various applications in mathematics and computer science. This theory calls for a cooperation of experts in these different fields. The conference will bring leading experts in these topics.

May 14-17, 2018
Athens, GA, USA
http://research.franklin.uga.edu/additive-combinatorics/georgia-discrete-analysis

The purpose of the conference is to exchange ideas related to the latest developments in discrete analysis with a focus on those in arithmetic combinatorics.

June 4-8, 2018
Institute for Advanced Study, Princeton
https://www.math.ias.edu/ocit2018

Registration deadline: April 15, 2018

This workshop aims to explore connections between complexity and optimization with algebra and analysis, which have emerged from the works on operator scaling. The hope is to inform participants from different communities of both basic tools and new developments, and set out new challenges and directions for this exciting interdisciplinary research.

The workshop will be streamed live at
http://www.math.ias.edu/ocit2018_live-feed

June 19-22, 2018
Harvard University, Cambridge, MA
https://womenintheory.wordpress.com/

Registration deadline: January 16, 2018

This is a workshop for female graduate students and exceptional undergraduates (fourth year) in theoretical computer science. The workshop will have first-rate technical content and will be a great opportunity for students to meet their peers from around the world.
We will supply dorm rooms, breakfast and lunch, and will probably also be able to cover at least part if not all of the travel expenses.
More detailed information including how to apply can be found on the workshop website.

June 18-20, 2018
Paris, France
http://ctw18.lipn.univ-paris13.fr/

Submission deadline: February 2, 2018
Registration deadline: May 2, 2018

The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2018 welcomes contributions on theory and applications of discrete algorithms, graphs and combinatorial optimization in the wide sense (4-page “long abstract” submissions invited).

October 14, 2017
FOCS 2017, Berkeley
https://raghumeka.github.io/workshop.html

The topic of this workshop is ‘hardness escalation’, a growing research area whereby lower bounds and separations in communication complexity are obtained by developing “simulation theorems”. The basic idea of a simulation theorem is to start with a simple ‘one-party’ function and “lift it” to a multi-party setting via function composition. These simulation theorems have introduced new tools into complexity theory, and have led to the resolution of many longstanding open problems including in graph theory, combinatorial optimization, circuit complexity and cryptography, proof complexity, game theory, and communication complexity. Moreover the field has led to a revival of query complexity, with new techniques leading to the resolution of some longstanding open problems. The goal of the workshop is to present a broad introduction to the area as well as highlight the recent developments.

October 20, 2017
Northwestern University, Evanston, IL, USA
https://theory.eecs.northwestern.edu/qtw-analytic/

November 22-23, 2017
Tel-Aviv University, Israel
https://www.irif.fr/~filofocs/FILOFOCS2017/

This is the 6th edition of this series of workshops
and is part of the activities of FILOFOCS (French-Israeli Laboratory on Foundations of Computer Science), a LEA (Laboratoire Européen Associé) of the CNRS and Tel-Aviv University. See
http://www.liafa.univ-paris-diderot.fr/~adiro/filofocs//filofocs_lab/filofocs_lab.html for more details on the previous workshops and other activities of FILOFOCS.