Algorithm Engineering and Experiments (ALENEX19), Analytic Algorithmics and Combinatorics (ANALCO19), and Symposium on Simplicity in Algorithms will take place at the same location.

SODA is jointly sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.

Statement on Inclusiveness

As a professional society, SIAM is committed to providing an inclusive climate that encourages the open expression and exchange of ideas, that is free from all forms of discrimination, harassment, and retaliation, and that is welcoming and comfortable to all members and to those who participate in its activities. In pursuit of that commitment, SIAM is dedicated to the philosophy of equality of opportunity and treatment for all participants regardless of gender, gender identity or expression, sexual orientation, race, color, national or ethnic origin, religion or religious belief, age, marital status, disabilities, veteran status, field of expertise, or any other reason not related to scientific merit. This philosophy extends from SIAM conferences, to its publications, and to its governing structures and bodies. We expect all members of SIAM and participants in SIAM activities to work towards this commitment.




To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please visit https://www.facebook.com/events/174438409849967/.

If you are tweeting about the conference, please use the designated hashtag to enable other attendees to keep up with the Twitter conversation and to allow better archiving of our conference discussions. The hashtag for this meeting is #SIAMDA19. SIAM’s Twitter handle is @TheSIAMNews.

Program Committee Chair

Timothy M. Chan, University of Illinois at Urbana-Champaign, USA

Program Committee

Peyman Afshani, Aarhus University, Denmark
Shipra Agrawal, Columbia University, USA
Aditya Bhaskara, University of Utah, USA
Yang Cai, McGill University, Canada
Amit Chakrabarti, Dartmouth College, USA
Deeparnab Chakrabarty, Dartmouth College, USA
Erin Wolf Chambers, Saint Louis University, USA
Siu On Chan, Chinese University of Hong Kong, Hong Kong
Daniel Dadush, CWI, Netherlands
Holger Dell, Saarland University, Germany
Zdenek Dvorak, Charles University, Czech Republic
Friedrich Eisenbrand, EPFL, Switzerland
Michael Elkin, Ben-Gurion University of the Negev, Israel
Jane Gao, Monash University, Australia
Sariel Har-Peled, University of Illinois at Urbana-Champaign, USA
Hamed Hatami, McGill University, Canada
Thomas Hayes, University of New Mexico, USA
Martin Hoefer, Goethe University Frankfurt, Germany
Thore Husfeldt, Lund University, Sweden and IT University of Copenhagen, Denmark
Klaus Jansen, Christian-Albrechts-Universität zu Kiel, Germany
T.S. Jayram, IBM Almaden Research, USA
Daniel Kane, University of California, San Diego, USA
Jonathan Kelner, Massachusetts Institute of Technology, USA
Tsvi Kopelowitz, Bar Ilan University, Israel
Pravesh K. Kothari, Princeton University and the Institute for Advanced Study, USA
Fabian Kuhn, University of Freiburg, Germany
Daniel Lokshtanov, University of Bergen, Norway
Brendan Lucier, Microsoft Research, USA
Bojan Mohar, Simon Fraser University, Canada
Viswanath Nagarajan, University of Michigan, USA
Alantha Newman, CNRS, Grenoble, France
Ilan Newman, University of Haifa, Israel
Vijaya Ramachandran, University of Texas at Austin, USA
Ilya Razenshteyn, Microsoft Research, USA
Liam Roditty, Bar Ilan University, Israel
Atri Rudra, University at Buffalo, SUNY, USA
Laura Sanità, University of Waterloo, Canada
László A. Végh, London School of Economics, United Kingdom
Oren Weimann, University of Haifa, Israel
Udi Wieder, VMware Research, USA

Steering Committee

Pavol Hell, Simon Fraser University, Canada
Daniel Král, University of Warwick, United Kingdom
Dana Randall, Georgia Institute of Technology, USA
Cliff Stein, Columbia University, USA (chair)
Shang-Hua Teng, University of Southern California, USA



This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.


Funding Agencies

Funding agency information will be posted here when available.



Themes and application areas include, but are not limited to, the following topics:

Aspects of combinatorics and discrete mathematics, such as:
• Combinatorial structures
• Discrete optimization
• Discrete probability
• Finite metric spaces
• Graph theory
• Mathematical programming
• Random structures
• Topological problems

Core topics in discrete algorithms, such as:
• Algorithm analysis
• Data structures
• Experimental algorithmics

Algorithmic aspects of other areas of computer science, such as:
• Combinatorial scientific computing
• Communication networks and the Internet
• Computational geometry and topology
• Computer graphics and computer vision
• Computer systems
• Cryptography and security
• Databases and information retrieval
• Data compression
• Data privacy
• Distributed and parallel computing
• Game theory and mechanism design
• Machine learning
• Quantum computing


Important Deadlines

July 5, 2018, 4:59 PM EDT:  Short Abstract Submission and Paper Registration
July 12, 2018, 4:59 PM EDT:  Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in early October 2018.

December 3, 2018: Disconnect time is 11:59 PM EST

December 3, 2018

Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+