Analytic Algorithmics and Combinatorics (ANALCO19), ACM-SIAM Symposium on Discrete Algorithms (SODA19) and Symposium on Simplicity in Algorithms will take place at the same location.
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/1927983104197419/.
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 ALENEX is #ALENEX19, and ANALCO is #ANALCO19. SIAM’s Twitter handle is @TheSIAMNews.
Program Committee Co-chairs
Stephen Kobourov, University of Arizona, USA
Henning Meyerhenke, University of Cologne, Germany
Aaron Archer, Google, USA
Maike Buchin, Ruhr Universität Bochum, Germany
Aydin Buluc, Lawrence Berkeley National Laboratory, USA
Markus Chimani, Osnabrück University, Germany
Pierluigi Crescenzi, Università degli Studi di Firenze, Italy
Yifan Hu, Yahoo!, USA
Yoichi Iwata, The University of Tokyo, Japan
Juha Kärkkäinen, University of Helsinki, Finland
Ken-Ichi Kawarabayashi, National Institute of Informatics, Japan
Stefan Kratsch, Humboldt-Universität zu Berlin, Germany
Fredrik Manne, University of Bergen, Norway
Nicole Megow, Universität Bremen, Germany
Ulrich Meyer, Goethe University Frankfurt, Germany
Matthias Müller-Hannemann, Martin-Luther-University Halle-Wittenberg, Germany
Matthias Petri, The University of Melbourne, Australia
Sergey Pupyrev, Facebook, USA
Barna Saha, University of Massachusetts, Amherst, USA
Renato Werneck, Amazon, USA
Andrew V. Goldberg, Amazon.com, USA (Chair)
Michael Goodrich, University of California, Irvine, USA
Giuseppe F. Italiano, University of Rome “Tor Vergata”, Italy
Rasmus Pagh, IT University of Copenhagen, Denmark
Vijaya Ramachandran, University of Texas, Austin, USA
Cliff Stein, Columbia University, USA
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
The 21st Meeting on Algorithm Engineering and Experiments (ALENEX) will take place in San Diego, CA on January 7-8, 2019. The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures.
Relevant areas of applied algorithmic research include but are not limited to: databases; geometry; graphs and networks, including web applications; operations research; combinatorial aspects of scientific computing; and computational problems in the natural sciences or engineering.
Also encouraged are submissions that address algorithms and data structures for advanced models of computing, including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to high-performance and cloud computing.
ALENEX is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA19), Analytic Algorithmics and Combinatorics (ANALCO19) and Symposium on Simplicity in Algorithms. Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.
Proceedings of ALENEX and ANALCO will be published openly and electronically in January 2019 as SIAM ePubs. A special section of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX19.
ALENEX is supported by SIAM (Society for Industrial and Applied Mathematics).
For detailed information about ALENEX19 submissions, please see the Submissions page.
Funding agency information will be posted here when available.
August 9, 2018, 4:59 PM EDT - Short Abstract Submission and Paper Registration Deadline
August 16, 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
HOTEL RESERVATION DEADLINE
December 3, 2018