Conference Information

CALDAM 2027: International Conference on Algorithms and Discrete Applied Mathematics

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
CALDAM
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-21 Due in 2 days
Notification Date:
2026-11-13
Conference Date:
2027-02-11
Location:
Jaipur, Rajasthan, India
Years:
Viewed: 18611   Tracked: 1   Attend: 0

Conference Partner Index (CP-I)

60.7 / 100
Ranked #586 of 5,682 conferences · Top 11%

#3 of 69 in Mathematics & Physical Sciences #40 of 142 in Theory & Algorithms

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

Inputs used: Acceptance rate: 34.8% (mean of 5 editions on file) · Editions on record: 13 · Researchers following it here: 1 · Researchers who opened this page in the past 24 months: 3

Missing from the public record: 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 65% - 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-18

Call For Papers

CALDAM 2027 (International Conference on Algorithms and Discrete Applied Mathematics) is an academic conference held in Jaipur, Rajasthan, India on 2027-02-11. The paper submission deadline is 2026-09-21. Acceptance notifications are sent on 2026-11-13.

CALDAM 2027 Topics but not limited to Approximation Algorithms Combinatorial Algorithms Combinatorial Optimization Combinatorics Combinatorial Geometry Computational Complexity Computational Geometry Computational Learning Theory Data Structures Discrete Geometry Experimental Algorithm Methodologies Graph Algorithms Graph Drawing Graph Theory Network Optimization Online Algorithms Parallel and Distributed Algorithms Parameterized Complexity Randomized Algorithms Theoretical Aspects of Machine Learning
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 35.4% over 8 years (2015–2022).

YearSubmittedAcceptedAccepted(%)
2022802430%
2021823947.6%
20201023837.3%
2019862225.6%
2018682333.8%
20171033231.1%
2016913033%
2015582644.8%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
Discrete Mathematics0.9Elsevier0012-365X
Journal of Discrete AlgorithmsElsevier1570-8667
Applied Mathematics and Computation3.2Elsevier0096-3003
Journal of Computational and Applied Mathematics2.6Elsevier0377-0427
Applied Mathematics & Optimization1.7Springer0095-4616
Discrete Optimization1.6Elsevier1572-5286
Applied Numerical Mathematics2.4Elsevier0168-9274
CDiscrete Applied Mathematics1.1Elsevier0166-218X
Mathematics2.2MDPI2227-7390
AIEEE Transactions on Multimedia9.7IEEE1520-9210

Comments 0

No comments yet.

Please Login to post a comment