Skip to main content
Springer Nature Link
Account

Algorithms and Discrete Applied Mathematics

12th International Conference, CALDAM 2026, Dharwad, India, February 12–14, 2026, Proceedings

  • Conference proceedings
  • © 2026

Overview

Editors:
  1. Neeldhara Misra

    1. Indian Institute of Technology Gandhinagar, Gandhinagar, India

  2. Arti Pandey

    1. Indian Institute of Technology Ropar, Rupnagar, India

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 16445)

Included in the following conference series:

Conference proceedings info: CALDAM 2026.

  • 2967 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2026, held in Dharwad, India, during February 12–14, 2026.

The 35 full papers included in this book were carefully reviewed and selected from 75 submissions. They focus on algorithms and complexity, discrete applied mathematics, computational geometry, graph theory, network optimization, and machine learning.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (35 papers)

  1. Front Matter

    Pages i-xxii
    Download chapter PDF

  2. Localization: A Framework to Generalize Extremal Graph Problems

    • Rajat Adak, L. Sunil Chandran
    Pages 1-15

  3. Complexity Results on Paired Domination in Cubic Graphs

    • Deepak M. Bakal, Y. M. Borse
    Pages 16-28

  4. Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents

    • Rajashree Bar, Daibik Barik, Adri Bhattacharya, Partha Sarathi Mandal
    Pages 29-42

  5. New Lower Bounds for Permutation Codes in the Ulam Metric

    • Sergey Bereg, Md Sanaullah Miah, Md Saiful Islam
    Pages 43-56

  6. Constructing Permutation Codes Under the Generalized Kendall- \(\tau \) Metric

    • Sergey Bereg, Jack N. Truong
    Pages 57-70

  7. On Optimal Achromatic Coloring of 3-Uniform Tight Cycles

    • Srimanta Bhattacharya, Pawan Kumar, Deepak Rajendraprasad, Jishnu Sen
    Pages 71-83

  8. A Resonance Neural Network for the K-Median Problem

    • Andrew Bloch-Hansen, Cody Rossiter, Roberto Solis-Oba
    Pages 84-95

  9. Prime Factorization of Hierarchical Products of Infinite Graphs

    • Clemens Brand, Wilfried Imrich
    Pages 96-105

  10. Cycle Transit Function, Interval Function and Betweenness

    • Manoj Changat, Lekshmi Kamal K. Sheela, Athulyakrishna Kuruppankandy, T. V. Ramakrishnan
    Pages 106-119

  11. A New Characterization of  \(\textsf {VNP}\) via Colored Determinant

    • Prasad Chaugule
    Pages 120-134

  12. Lower Bounds of Location Numbers

    • Rahul Das, Soumen Nandi, Ushnish Sarkar
    Pages 135-146

  13. An Update on Pushable Homomorphisms

    • Tapas Das, Pavan P. D, Sagnik Sen, S. Taruni
    Pages 147-164

  14. Semi-online Scheduling with Look-Ahead

    • Debasis Dwibedy, Rakesh Mohanty
    Pages 165-178

  15. Algorithms and Hardness for Geodetic Set on Tree-Like Digraphs

    • Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad-Noori, Rasa Parvini Oskuei, Prafullkumar Tale
    Pages 179-193

  16. On the Word-Representability of 5-Regular Circulant Graphs

    • Suchanda Roy, Ramesh Hariharasubramanian
    Pages 194-208

  17. Matrix Multiplication in the MPC Model

    • Lakshya Joshi, Arya Deshmukh, Atharv Chhabra, Chetan Gupta
    Pages 209-220

  18. Complexity and Approximation Algorithm of 3-Component Domination in Graphs

    • Subhasmita Joshi, Bhawani Sankar Panda
    Pages 221-235

  19. Directed Weakly Modular Graphs and Their Directed Interval Functions

    • Lekshmi Kamal K. Sheela, Manoj Changat, M. R. Chithra, Peter F. Stadler
    Pages 236-249

  20. On Word-Representability of Minimal Non-comparability Graphs

    • Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan
    Pages 250-263
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Editors and Affiliations

  • Indian Institute of Technology Gandhinagar, Gandhinagar, India

    Neeldhara Misra

  • Indian Institute of Technology Ropar, Rupnagar, India

    Arti Pandey

Accessibility Information

PDF accessibility summary

This PDF has been created in accordance with the PDF/UA-1 standard to enhance accessibility, including screen reader support, described non-text content (images, graphs), bookmarks for easy navigation, keyboard-friendly links and forms and searchable, selectable text. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. Please note that a more accessible version of this eBook is available as ePub.

EPUB accessibility summary

This ebook is designed with accessibility in mind, aiming to meet the ePub Accessibility 1.0 AA and WCAG 2.2 Level AA standards. It features a navigable table of contents, structured headings, and alternative text for images, ensuring smooth, intuitive navigation and comprehension. The text is reflowable and resizable, with sufficient contrast. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top