SODA23 – Call for Papers


1) About the Conference

This symposium focuses on research topics related to design and  analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, as well as experimental validation, and the mathematical problems related to their development or limitations. The scope also includes aspects of combinatorics and discrete mathematics related to discrete algorithms. Papers that raise important algorithmic problems that can benefit from theoretical investigation and analysis, are encouraged.

The symposium will take place in Florence, Italy from Jan 22 -25, 2023.  


2) Themes

Aspects of combinatorics and discrete mathematics, such as: Combinatorial structures, Discrete optimization, Graph theory, Random structures

 Core topics in discrete algorithms, such as: Algorithm analysis, Data structures, Experimental algorithmics, Lower bounds, Mathematical programming

 Algorithmic aspects of other areas of computer science, such as: Algorithmic fairness, Combinatorial scientific computing, Communication networks and the internet Computational geometry and topology, Computer systems, Cryptography, security and privacy, Databases and information retrieval, Distributed and parallel computing, Game theory and mechanism design, Machine learning, Quantum computing, Scheduling and resource allocation


3) Submissions and Deadlines

Registration deadline: July 10, 2022, anywhere on earth. 

A title, list of authors and abstract is required by this date in order for a full paper to be considered.

 Full paper deadline: July 14, 2022, anywhere on earth. 

Submissions received after this time will not be considered. 

 Reviews sent to authors for rebuttal: September 10, 2022.

Author-response deadline: September 14, 2022. 

Final Notification: Oct 14, 2022.


Submissions authored by program committee members (with the exception of the PC chair and vice chair) are allowed. PC submissions will be subject to a stricter review process; utmost care will be taken to avoid COI, ensuring that such submissions receive no unfair advantage, and that the reviews and the discussion remain confidential from the authors. PC submissions are not eligible for the best paper award.


Anonymous Submissions

The conference will employ a fairly lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should not include obvious references that reveal their own identity, and should ensure that any references to their own related work are in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).

 The purpose of this double-blind process is to help PC members and external reviewers come to an initial judgment about the paper without bias, and not to make it impossible for them to discover who the authors are if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas.

 We note that a similar policy has recently been incorporated in several other major venues in TCS.


Rebuttal Phase

Authors will have an opportunity to respond to initial reviews during a rebuttal phase. Further instructions will be sent to the authors at that time. 


Submission Instructions:

Paper Submission Link

Authors are required to submit their papers electronically, in PDF format (without security restrictions on copying or printing). Submission server link:

 Paper Registration

Submissions must be registered by the paper registration deadline. In order to register a submission, authors should enter the following information on the submission server: (i) title, (ii) list of authors, (iii) one primary topic (and any secondary topics) from the provided list, (iv) an abstract in text format and (v) any PC conflicts.

 Papers eligible for the Best Student Paper award should indicate their eligibility at the time of submission. There is a box provided for this purpose on the submission server. Note that any paper whose authors are all full-time students at the time of submission is eligible for the award.

Full Paper Submission Format

Full submissions should start with a title page consisting of the title of the paper, and an abstract of 1-2 paragraphs summarizing the paper’s contributions. There is no page limit and authors are encouraged to use the “full version” of their paper as the submission. The submission should contain within the initial ten pages following the title page a clear presentation of the merits of the paper, including a discussion of the paper’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. The submission should be addressed to a broad spectrum of theoretical computer science and discrete mathematics researchers. Proofs must be provided which can enable the main mathematical claims of the paper to be fully verified. Although there is no bound on the length of a submission, material other than the abstract, references, and the first ten pages will be read at the committee’s discretion. Authors are encouraged to put the references at the very end of the submission.

 The submission should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around, on letter-size (8 ½ x 11 inch) paper. A submission that deviates from these guidelines risks summary rejection without consideration of its merits. All submissions will be treated as confidential, and will only be disclosed to the committee and selected subreviewers, although the program committee may also interact with program chairs of other (past or future) conferences to learn about closely related submissions.

Simultaneous Submissions

Results previously published in another conference proceedings or journal (or scheduled for publication prior to SODA) will not be accepted at SODA. Simultaneous submission of the results to another conference with published proceedings is not allowed. At the time that the author signs SODA’s copyright transfer agreement, the author must affirm that no copyright transfer agreement permitting the publication of a similar paper in a journal or elsewhere has been signed. 

The authors should consult the PC chair in the case of any doubt regarding this policy.

 Paper Presenters

The Program Committee expects every speaker of a scheduled presentation to register and attend the symposium. Each speaker will be allotted 20 minutes for presentation.


Best Student Paper Award

Papers eligible for the Best Student Paper award should indicate their eligibility at the time of submission. There is a box provided for this purpose on the submission server. Note that any paper whose authors are all full-time students at the time of submission is eligible for the award.


Best Paper Award

The Program Committee may designate up to three papers accepted to the conference as SODA Best Papers. Submissions authored by PC members are not eligible for this award. Every other submission is automatically eligible for this award.


4) Program Committee:

Alexandr Andoni (Columbia University)
Simon Apers (CNRS)
Sepehr Assadi (Rutgers University)
Nikhil Bansal (University of Michigan (chair))
Antonio Blanca (Pennsylvania State University)
Greg Bodwin (University of Michigan)
Jan van den Brand (UC Berkeley and Georgia Tech)
Simina Brânzei (Purdue University)
Clément Canonne (University of Sydney)
Yi-Jun Chang (National University of Singapore)
Flavio Chierichetti (Sapienza University of Rome)
Amin Coja-Oghlan (Technical University of Dortmund)
Rachel Cummings (Columbia University)
Shahar Dobzinski (Weizmann Institute)
Michael Elkin (Ben-Gurion University of the Negev)
Jugal Garg (UIUC)
Naveen Garg (IIT Delhi)
Shayan Oveis Gharan (University of Washington)
Kira Goldner (Boston University)
Gramoz Goranci (University of Glasgow)
Sam Hopkins (MIT)
Zhiyi Huang (University of Hong Kong)
Sungjin Im (UC Merced)
Ross Kang (Radboud University Nijmegen)
David Kempe (University of Southern California)
Thomas Kesselheim (University of Bonn)
Eun Jung Kim (CNRS, Paris-Dauphine University)
Swastik Kopparty  (University of Toronto)
Ravishankar Krishnaswamy (Microsoft Research)
Janardhan Kulkarni (Microsoft Research)
Rasmus Kyng (ETH Zurich)
Lap Chi Lau (Waterloo)
Shi Li (SUNY Buffalo)
Jason Li (Simons Institute, UC Berkeley)
Frédéric Magniez (CNRS)
Pasin Manurangsi (Google Research)
Andrew McGregor (University of Massachusetts Amherst)
Arnaud de Mesmay (CNRS, Université Gustave Eiffel)
Tillmann Miltzow (Utrecht University)
Marco Molinaro (PUC-Rio)
Cameron Musco (University of Massachusetts Amherst)
Viswanath Nagarajan (University of Michigan (vice-chair))
Amir Nayyeri (Oregon State University)
Jesper Nederlof (Utrecht University)
Huy Nguyen (Northeastern University)
Zuzana Patáková (Charles University)
Richard Peng (University of Waterloo)
Will Perkins (University of Illinois at Chicago)
Michał Pilipczuk (University of Warsaw)
Aaron Potechin (University of Chicago)
Kent Quanrud (Purdue University)
Harald Raecke (Technical University of Munich)
Liam Roditty (Bar-Ilan University)
Lars Rohwedder (Maastricht University)
Mohammad Salavatipour (University of Alberta)
Roy Schwartz (Technion)
Anastasios Sidiropoulos (University of Illinois at Chicago)
Sahil Singla (Georgia Tech)
Zhao Song (Adobe Research)
Jukka Suomela (Aalto University)
Kavitha Telikepalli (TIFR, Mumbai)
Vera Traub (ETH Zurich)
Kasturi Varadarajan (University of Iowa)
Laszlo Vegh (London School of Economics)
Erik Waingarten (Stanford University)
Nicole Wein (DIMACS)
Andreas Wiese  (Technical University of Munich)
Ronald de Wolf  (CWI Amsterdam)
Rico Zenklusen  (ETH Zurich)