Conference Information

ACDA 2027: SIAM Conference on Applied and Computational Discrete Algorithms

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
ACDA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2026-09-08
Notification Date:
Conference Date:
2027-02-22
Location:
Pittsburgh, Pennsylvania, USA
Years:
Viewed: 11147   Tracked: 0   Attend: 0

Conference Partner Index (CP-I)

40.5 / 100
Ranked #4,957 of 5,682 conferences · Top 88%

#130 of 142 in Theory & Algorithms

Academic recognition (35%) No data - scored at the neutral baseline of 50
Submission selectivity (20%) No data - scored at the neutral baseline of 50
Editions held (20%)
19
Community attention (10%)
10
Public record completeness (15%)
55

Inputs used: Editions on record: 1 · Researchers who opened this page in the past 24 months: 3

Missing from the public record: Historical acceptance rates (+4.5) · Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 45% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-17

Call For Papers

ACDA 2027 (SIAM Conference on Applied and Computational Discrete Algorithms) is an academic conference held in Pittsburgh, Pennsylvania, USA on 2027-02-22. The paper submission deadline is 2026-09-08.

About the Conference This is the conference of the SIAM Activity Group on Applied & Computational Discrete Algorithms. ACDA27 brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA27 is organized by SIAM under the auspices of its Activity Group on Applied and Computational Discrete Algorithms. ACDA27 includes in its scope all topics where models and algorithms from discrete mathematics are applied to solve problems in computer science, scientific computing, data science, physical sciences, life sciences, engineering, social and information sciences, etc. ACDA27 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. The ACDA27 conference will include refereed proceedings as well as talks without proceedings papers (in the conventional SIAM style of conferences), posters, tutorials, invited talks, and industry sessions. Awards will be given for best paper, best poster, and best student presentation. Proceedings of the first three ACDA conferences organized in 2021, 2023, and 2025 are available here. The following conference will be held jointly: SIAM Activity Group on Computational Science and Engineering (CSE27) The following workshop will be held jointly: SIAM International Meshing Roundtable Workshop 2027 (IMR27) Connect with other attendees on LinkedIn. 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, approximation, randomized, streaming, and learning-augmented 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 computing Other applications arising from security, computational finance, computational chemistry/physics, quantum computing, etc.
Last updated by Admin Agent on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Journal of Discrete AlgorithmsElsevier1570-8667
CSIAM Journal on Discrete MathematicsSIAM0895-4801
Discrete Mathematics0.9Elsevier0012-365X
Discrete Optimization1.6Elsevier1572-5286
ASIAM Journal on ComputingSIAM0097-5397
Journal of Computational and Applied Mathematics2.6Elsevier0377-0427
BSIAM Journal on Imaging SciencesSIAM1936-4954
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366

Comments 0

No comments yet.

Please Login to post a comment