Tuesday, January 10, 2023

[DMANET] SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)--new submission dates

The deadline for registering a submission to SIAM ACDA 23 has been extended to January 16. Correspondingly, the actual paper submission deadline is now January 23.

Note that there are two tracks, and only one has a proceedings publication, whereas the other is just for a talk slot in the conference.
NOTE: in the latter case, the paper may have been submitted – but not yet published – in another venue, either for a journal or a conference with its own archival proceedings, and the submission format
allows for an appendix so that a paper formatted in another way can be adapted easily.

This conference is co-located with the SIAM Optimization Conference (and submissions to ACDA 23 are allowed from individuals presenting there).

The full call for papers is as follows:

Call for Papers

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)
May 31 – June 2, 2023
Seattle, Washington, U.S.

The Sheraton Grand Seattle

(This is the conference of the SIAM Activity Group on Applied & Computational Discrete Algorithms.

This conference is co-located with SIAM Conference on Optimization (OP23).)


Extended Registration and Short Abstract Submission Deadline: January 16, 2023

Extended Paper/Presentation Submission Deadline: January 23, 2023

(see details below)

ACDA brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA expands the area of Combinatorial Scientific Computing to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications.
Included Themes
Topics of interest include but are not limited to discrete or combinatorial problems and algorithms arising in:

Algorithm engineering
Algorithmic differentiation (AD)
Combinatorial optimization and mathematical programming, including scheduling and resource allocation problems
Combinatorial scientific computing (CSC) including models, algorithms, applications, numerical methods, and problems arising in data analysis
Computational biology and bioinformatics
Data management and data science
Design and analysis of application-inspired exact, randomized, streaming, and approximation algorithms
Graph and hypergraph algorithms, including problems arising in network science and complex networks
Interaction between algorithms and modern computing platforms, including challenges arising from memory hierarchies, accelerators, and novel memory technologies
Machine learning and statistical methods for solving combinatorial problems
Numerical linear algebra, including sparse matrix computations and randomized approaches
Parallel and distributed computing, including algorithms, architectures, distributed systems, and all parallelism ranging from instruction-level and multi-core all the way to clouds and exascale
Other applications arising from security, computational finance, computational chemistry/physics, quantum computing, etc.


Types of Contributions

All contributions must be submitted electronically via the EasyChair submission system (https://easychair.org/conferences/?conf=acda23). There are three types of submissions to ACDA, as follows. We strongly encourage making code and data available as well.


1. Archival Proceedings Papers

Submissions may be up to 10 pages in length, excluding references, and must present original research that is not published or concurrently submitted to a journal or a proceedings-based conference. Submissions will be refereed. Accepted papers will be included in the proceedings published by SIAM.

Extended Short Abstract Submission and Registration Deadline: January 16, 2023
Extended Paper Submission for Archival Proceedings Deadline: January 23, 2023



2. Conference Presentations Without Archival Proceedings

Alternatively, authors can elect (at the time of submission) to have an accepted paper be considered for presentation at the conference without appearing in the conference proceedings. Furthermore, in this case, it is allowed for papers to be concurrently submitted to a journal or to another proceedings-based conference; however, these papers

should not yet have been published.

Extended Short Abstract Submission and Registration Deadline: January 16, 2023
Extended Paper Submission for Conference Presentations without Archival Proceedings Deadline: January 23, 2023

Author Notification: March 8, 2023

3. Poster Submissions

A poster submission is in the form of a 2-page (maximum) abstract. Posters are not considered archival, and reviewing of posters will not be double-blind. Poster presentations will not appear in the conference proceedings.

Poster Submission Deadline: March 8, 2023
Author Notification: March 15, 2023

All accepted proceedings papers must use the double-column LaTeX macro at the bottom of the following web page: http://www.siam.org/proceedings/macros.php

Initial submissions need not use this format, but are required to be formatted in at least 11pt font with at least one-inch margins, and be limited to at most 10 pages (not counting cover page and references); if further space is needed to present full details, authors are permitted to include well-marked appendices, but the program committee will not be expected to use this extra material in reviewing the submission. Appendices will not be included in the proceedings.

The main part of the submission should therefore contain a clear technical 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.

At least one author of an accepted proceedings paper, talk or poster presentation is required to register and present at ACDA. A brief abstract of each presentation will appear in the published ACDA program.

Double-Blind Reviewing

ACDA will employ a lightweight double-blind reviewing process for all submissions. Submissions should not reveal the identity of the authors in any way, in particular, authors of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work ..."; but rather "We build on the work of ..."). The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors 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. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs.

We strongly encourage also making code and data available; please keep in mind the double-blind nature of the review process. We recommend including a link to an anonymized version that makes a 'best effort' to avoid revealing the identity of the authors (e.g., using Anonymous Github or an anonymous Dropbox/Google Drive folder).

Prizes

Awards will be given for best paper, best poster, and best student presentation.

Invited Presentations

Jose Correa (Universidad de Chile, Chile )
Jelani Nelson (University of California, Berkeley, U.S.)
Rob Schreiber (Cerebras Systems, U.S.)
Blair Sullivan (University of Utah, U.S.)
Sivan Toledo (Tel Aviv University, Israel)
Andrea Walther (Humboldt-Universität zu Berlin, Germany) Joint Plenary Speaker with SIAM Conference on Optimization (OP23)

Minitutorials

Sergei Vassilvitskii: Beyond Worst-Case Analysis
Martin Buecker: Algorithmic Differentiation


Program Committee Co-chairs
Jonathan Berry, Sandia National Laboratories, U.S.
David Shmoys, Cornell University, U.S.

Program Committee

Martin Bücker, Friedrich-Schiller- Universität Jena, Germany
David Bader, New Jersey Institute of Technology, U.S.
Michael Bender, SUNY Stony Brook, U.S.
Anne Benoit, ENS Lyon, France
Dan Bienstock, Columbia University, U.S.
Sarah Cannon, Claremont McKenna College, U.S.
Lenore Cowen, Tufts University, U.S.
Martin Farach-Colton, Rutgers University, U.S.
Maryam Fazel, University of Washington, U.S.
Sándor Fekete, Technische Universität Braunschweig, Germany
Xin Gao, King Abdullah University of Science and Technology, Saudi Arabia
Assefaw Gebremedhin, Washington State University, U.S.
Phil Gibbons, Carnegie Mellon University, U.S.
John Gilbert, University of California, Santa Barbara, U.S.
Andrew Goldberg, Amazon, U.S.
Giulia Guidi, University of California, Berkeley, U.S.
Swati Gupta, Georgia Institute of Technology, U.S.
Kathrin Hanauer, University of Vienna, Austria
Bruce Hendrickson, Lawrence Livermore National Laboratory, U.S
Dorit Hochbaum. University of California, Berkeley, U.S.
Paul Hovland, Argonne National Laboratory, U.S.
Rob Johnson. VMware Research, U.S.
Jeremy Kepner, Massachusetts Institute of Technology, U.S.
Smita Krishnaswamy, Yale University, U.S.
Kamesh Madduri, Pennsylvania State University, U.S.
Fredrick Manne, University of Bergen, Norway
Samuel McCauley, Williams College, U.S.
Nicole Megow, University of Bremen, Germany
Ben Moseley, Carnegie Mellon University, U.S.
Eisha Nathan, Lawrence Livermore National Laboratory, U.S
Uwe Naumann, RWTH Aachen University, Germany
Richard Peng, Georgia Institute of Technology, U.S.
Cynthia Phillips, Sandia National Laboratories, U.S.
Alex Pothen, Purdue University, U.S.
Emilie Purvine, Pacific Northwest National Laboratory, U.S.
Ted Ralphs, Lehigh University, U.S.
Julian Shun, Massachusetts Institute of Technology, U.S.
Aravind Srinivasan, University of Maryland, College Park, U.S.
Cliff Stein, Columbia University, U.S.
Blair Sullivan, University of Utah, U.S.
Adrian Tate, NAG, United Kingdom
Shang-Hua Teng, University of Southern California, U.S.
Denis Trystam, Grenoble Institute of Technology, France
Fabio Vandin, University of Padova, Italy
Santosh Vempala, Georgia Institute of Technology, U.S.
Rich Vuduc, Georgia Institute of Technology, U.S.
Andrea Walther, Humboldt Universität Berlin, Germany
Jean-Paul Watson, Lawrence Livermore National Laboratory, U.S.
David Woodruff, Carnegie Mellon University, U.S.
Shenghao Yang, University of Waterloo, Canada


Organizing Committee Co-Chairs

Lenore Cowen, Tufts University, U.S.
Uwe Naumann, RWTH Aachen University, Germany


Organizing Committee

Anne Benoit, ENS Lyon, France
Dorit Hochbaum, University of California, Berkeley, U.S.
Fredrik Manne, University of Bergen, Norway
Cynthia Phillips, Sandia National Laboratories, U.S.
Adrian Tate, NAG, United Kingdom
Shang-Hua Teng, University of Southern California, U.S.


Funding Agency
SIAM and the Organizing Committee wish to extend their thanks and appreciation to the U.S. National Science Foundation for its support of this conference.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************