Call for Papers

The ACM-SIAM Symposium on Discrete Algorithms (SODA25), the 25th in the series, will be held in-person from January 12–15, 2025, in New Orleans, Louisiana, U.S. at the Astor Crowne Plaza.

SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory. This symposium focuses on research topics related to the design and analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, as well as experimental validation, of discrete algorithms, 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.

SODA will be held jointly with:

• SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)
• SIAM Symposium on Simplicity in Algorithms (SOSA)

Topics of Interest

Aspects of combinatorics and discrete mathematics:

• Combinatorial structures
• Discrete optimization
• Graph theory
• Random structures

Core topics in discrete algorithms:

• Algorithm analysis
• Data structures
• Experimental algorithmics
• Lower bounds
• Mathematical programming

Algorithmic aspects of other areas of computer science:

• 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

Important Dates

• Submissions Due: July 5, 2024 (Deadline Passed)
• Early Registration Deadline: December 9, 2024
• Hotel Reservation Deadline Extended!: December 13, 2024

Submission Information

Submissions are managed through the conference website: /conferences-events/past-event-archive/soda25/submissions/

Papers should focus on research topics related to the design and analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, experimental validation, and mathematical problems related to their development or limitations. Papers that raise important algorithmic problems that can benefit from theoretical investigation and analysis are encouraged.

Program Committee

Co-chairs:

• Yossi Azar (Tel-Aviv University, Israel)
• Debmalya Panigrahi (Duke University, U.S.)

Program Committee:

• Amir Abboud (Weizmann Institute of Science, Israel)
• Alexandr Andoni (Columbia University, U.S.)
• Soheil Behnezad (Northeastern University, U.S.)
• Sayan Bhattacharya (University of Warwick, United Kingdom)
• Arnab Bhattacharyya (National University of Singapore, Singapore)
• Luca Becchetti (University of Rome, Italy)
• Petra Berenbrink (University of Hamburg, Germany)
• Niv Buchbinder (Tel Aviv University, Israel)
• Harry Buhrman (Quantinuum (UK), QuSoft and University of Amsterdam, The Netherlands)
• Sergio Cabello (University of Ljubljana, Slovenia)
• Yang Cai (Yale University, U.S.)
• Parinya Chalermsook (Aalto University, Finland)
• Eshan Chattopadhyay (Cornell University, U.S.)
• Chandra Chekuri (University of Illinois, Urbana-Champaign, U.S.)
• Keerti Choudhary (IIT Delhi, India)
• Maria Chudnovsky (Princeton University, U.S.)
• Ilan Cohen (Bar-Ilan University, Israel)
• Vincent Cohen-Addad (Google Research, Switzerland)
• Andrea Coladangelo (University of Washington, Seattle, U.S.)
• Jose Correa (University of Chile, Chile)
• Rachel Cummings (Columbia University, U.S.)
• Jelena Diakonikolas (University of Wisconsin, Madison, U.S.)
• Shahar Dobzinski (Weizmann Institute of Science, Israel)
• Anne Driemel (University of Bonn, Germany)
• Esther Ezra (Bar-Ilan University, Israel)
• Emily Fox (University of Texas, Dallas, U.S.)
• Nick Gravin (Shanghai University of Finance and Economics, China)
• Kasper Green Larsen (Aarhus University, Denmark)
• Anupam Gupta (New York University, U.S.)
• Tom Gur (University of Cambridge, United Kingdom)
• Sungjin Im (University of California, Merced, U.S.)
• Michael Kapralov (EPFL, Switzerland)
• Telikepalli Kavitha (Tata Institute of Fundamental Research, India)
• Dominik Kempa (Stony Brook University, U.S.)
• Arindam Khan (Indian Institute of Science, India)
• Samir Khuller (Northwestern University, U.S.)
• Ravi Kumar (Google Research, U.S.)
• O-joung Kwon (Hanyang University, South Korea)
• Bundit Lakhenukit (Shanghai University of Finance and Economics, China)
• Hung Le (University of Massachusetts, Amherst, U.S.)
• Jian Li (Tsinghua University, China)
• Yang Liu (Institute for Advanced Studies, U.S.)
• William Kuszmaul (Harvard University, U.S.)
• Shachar Lovett (University of California, San Diego, U.S.)
• Sepideh Mahabadi (Microsoft Research, U.S.)
• Nicole Megow (University of Bremen, Germany)
• Raghu Meka (University of California, Los Angeles, U.S.)
• Divyarthi Mohan (Tel Aviv University, Israel)
• Ankur Moitra (Massachusetts Institute of Technology, U.S.)
• Shay Mozes (Reichman University, Israel)
• Bento Natura (Columbia University, U.S.)
• Neil Olver (London School of Economics, United Kingdom)
• Krzysztof Onak (Boston University, U.S.)
• Seth Pettie (University of Michigan, Ann Arbor, U.S.)
• Michał Pilipczuk (University of Warsaw, Poland)
• Max Probst Gutenberg (ETH Zurich, Switzerland)
• Rajmohan Rajaraman (Northeastern University, U.S.)
• Aviad Rubinstein (Aviad Rubinstein,)
• Barna Saha (University of California, San Diego, U.S.)
• Laura Sanita (Bocconi University, Italy)
• Piotr Sankowski (IDEAS NCBR and University of Warsaw, Poland)
• Aravind Srinivasan (University of Maryland, College Park, U.S.)
• Vera Traub (University of Bonn, Germany)
• Madhur Tulsiani (Toyota Technological Institute at Chicago, U.S.)
• Seeun William Umboh (The University of Melbourne, Australia)
• Sergei Vassilvitskii (Google Research, U.S.)
• Magnus Wahlstrom (Royal Holloway, University of London, United Kingdom)
• Kangning Wang (Stanford University, U.S.)
• Fan Wei (Duke University, U.S.)
• Nicole Wein (University of Michigan, Ann Arbor, U.S.)
• Mary Wootters (Stanford University, U.S.)

Sponsors

Thank you to our sponsors, with special thanks to Microsoft Research for their support. The U.S. National Science Foundation also provided support.