Recent trends in Graph Drawing and Network Visualization

September 24-25, 2018
Barcelona, Spain

Submission deadline: August 28, 2018
Registration deadline: August 28, 2018


The school will feature four lecturers:
– Patrizio Angelini (U. Tübingen): Beyond clustered planarity. – David Auber (U. Bordeaux I): Node link diagram of large graphs: bridging the gap between theory and practice.
– Anna Lubiw (U. Waterloo): The size of graph drawings and representations. – Hans-Jörg Schulz (Aarhus U.): Design considerations for graph visualization.

More details about the lecturers, contents, and program, can be found at

Foundations of Software Science and Computation Structures

April 8-11, 2019
Prague, Czech Republic

Submission deadline: November 15, 2018

FoSSaCS seeks original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems

Workshop on Theoretical Computer Science and Algebraic Geometry

January 14-18, 2019
Saarbrücken, Germany

Registration deadline: December 14, 2018

This workshop brings together experts from theoretical computer science and algebraic geometry to discuss the relations between the fields from different perspectives. The goal is to lay the foundations for new interdisciplinary collaborations.

Theory and Practice of Differential Privacy Workshop

October 15, 2018
Toronto, Canad

Submission deadline: July 20, 2018

TPDP is a workshop on differential privacy which will be collocated with CCS 18 in Toronto. Differential privacy is a promising approach to privacy-preserving data analysis providing strong worst-case guarantees about the harm that a user could suffer from participating in a the data analysis. Researchers in differential privacy span many distinct research communities, and this workshop will bring researchers from these communities together to discuss recent developments in both the theory and practice of differential privacy. Authors are invited to submit a short abstract (2-4 pages maximum) of their work. Submission should describe novel works or works that have already appeared elsewhere but that can stimulate discussions. Accepted abstracts will be presented at the workshop either in technical sessions or as posters. The workshop will not have formal proceedings and is not intended to preclude later publication at another venue.

Symposium on Simplicity in Algorithms

January 6-9, 2019
San Diego, CA

Submission deadline: August 16, 2018

The Symposium on Simplicity in Algorithms (SOSA) welcomes papers that advance simplicity and elegance in both the design and analysis of algorithms.

The 2nd Symposium on Simplicity in Algorithms (SOSA 2019) will be co-located with SODA 2019, January 6–9, 2019, in San Diego California.

Quarterly Theory Workshop: Algorithmic Fairness

June 8, 2018
Northwestern University

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.

19th Max-Planck Advanced Course on the Foundations of Computer Science

August 13-17, 2018
Saarbrücken, Germany

ADFOCS is an international summer school with the purpose of introducing young researchers to topics which are the focus of current research in theoretical computer science. This year’s topic is *Fine-Grained Complexity and Algorithms*. The lecturers are Amir Abboud (IBM Almaden), Danupon Nanongkai (KTH), and Ramamohan Paturi (UC San Diego).