Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2027 - Call for Papers

Rishi Ranjan Singh via dmanet <[email protected]>
Newsgroups gmane.science.mathematics.discrete
Message-ID <CAF43RuOT7e2SA2FUYdgH+pGKKWHOn9Zgo=QeDKmVG=ewZfjUGA@mail.gmail.com>
Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2027 -
Call for Papers

The International Conference on Algorithms and Discrete Applied Mathematics
(CALDAM), held under the aegis of the Association for Computer Science and
Discrete Mathematics (ACSDM), is intended to bring together researchers
working in the areas of algorithms and applied discrete mathematics and
provide a high-quality forum for the dissemination and discussion of
research results in these broad areas. CALDAM has originated from the
ongoing efforts to promote research in Algorithms and Discrete Mathematics.

The 13th Annual  International Conference on Algorithms and Discrete
Applied Mathematics (CALDAM 2027) will be organized by The LNM Institute of
Information Technology, Jaipur, India from 11th to 13th of February 2027.

Conference webpage: https://caldam2027.lnmiit.ac.in/

Submission Link: https://easychair.org/conferences/?conf=caldam2027

Important Dates:
Last date for Paper Submission: September 21, 2026, AoE
Revision of submission: September 23, 2026, AoE
Notification of Acceptance: November 13, 2026, AoE
Camera-ready Version: November 27, 2026, AoE

The detailed CFP can be found here:
 https://caldam2027.lnmiit.ac.in/call-for-papers
<https://caldam2027.lnmiit.ac.in/call-for-papers>

CALDAM 2027 invites papers describing original research in the areas of
design, analysis and experimental evaluation of algorithms and in discrete
applied mathematics. An indicative list of sub-areas are given below.
Papers must be typeset using LaTeX/LaTeX2e and may not exceed 14 pages in
LNCS style, including bibliographic references. Further details may be
included in a clearly marked appendix that will be read at the discretion
of the program committee. Only electronic submission is allowed. Submitted
papers must describe previously unpublished work and may not be submitted
concurrently to another conference with refereed proceedings or to a
refereed journal. Please find the guidelines for authors on the Springer
website.

CALDAM Topics:
Approximation Algorithms | Combinatorial Algorithms | Combinatorics | Data
Structures | Parallel and Distributed Algorithms | Combinatorial Geometry |
Graph Drawing | Graph Theory | Computational Geometry | Online Algorithms |
Network Optimization | | Randomized Algorithms | Parameterized Complexity |
Theoretical Aspects of Machine Learning | Computational Learning Theory

Proceedings:
The proceedings of accepted papers of CALDAM 2027 will be published in the
Lecture Notes in Computer Science (LNCS) by Springer. Also, selected papers
of CALDAM 2027 are likely to be published in a special issue of the
Theoretical Computer Science (TCS) journal of Elsevier and the Acta
Informatica journal of Springer.


With best regards
B.S. Panda <https://web.iitd.ac.in/~bspanda/>
Rishi Ranjan Singh <https://www.iitbhilai.ac.in/index.php?pid=rishi>
PC Co-Chairs, CALDAM 2027

-- 
Dr. Rishi Ranjan Singh
Associate Professor
Dept. of Computer Science and Engineering,
Indian Institute of Technology (IIT) Bhilai,
Kutelabhata, Durg, Chhattisgarh, India, 491001
+91  831 805 1673

**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   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/
*
**********************************************************
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.