Skip to main content
Springer Nature Link
Log in

Algorithms and Discrete Applied Mathematics

11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings

  • Conference proceedings
  • © 2025

Overview

Editors:
  1. Daya Gaur

    1. University of Lethbridge, Lethbridge, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rogers Mathew

    1. Indian Institute of Technology Hyderabad, Sangareddy, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: CALDAM 2025.

  • 583 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

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 11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025, held in Coimbatore, India, during February 13–15, 2025.

The 30 full papers included in this book were carefully reviewed and selected from 89 submissions.The conference had papers in algorithms and complexity, discrete applied mathematics, computational geometry, graph theory, graph colouring, graph partition, and domination in graphs.

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages i-xxi
    Download chapter PDF

  2. Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set

    • Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra, Geevarghese Philip
    Pages 1-12

  3. Graceful Coloring is Computationally Hard

    • Cyriac Antony, Jacob Antony, D. Laavanya, S. Devi Yamini
    Pages 13-24

  4. Parameterized Complexity of Coupon Coloring of Graphs

    • Pradeesha Ashok, Pradyun Devarakonda, Shiven Phogat, Swaroop A. Ram Rayala, J. A. Sherin
    Pages 25-37

  5. Spectra of Eccentricity Matrices of Product of Graphs

    • S. Balamoorthy, T. Kavaskar
    Pages 38-49

  6. Almost Empty Monochromatic Polygons in Planar Point Sets

    • Bhaswar B. Bhattacharya, Sandip Das, Sk. Samim Islam, Saumya Sen
    Pages 50-59

  7. On the Parameterized Complexity of Odd Coloring

    • Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
    Pages 60-72

  8. On Full-Separating Sets in Graphs

    • Dipayan Chakraborty, Annegret K. Wagler
    Pages 73-84

  9. Polynomial Time Algorithms for Hop Domination

    • D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Pritesh Kumar
    Pages 85-96

  10. Charging Station Placement for Limited Energy Robots

    • Arun Kumar Das
    Pages 97-108

  11. Multipacking in the Euclidean Metric Space

    • Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam Manna Mitra, Bodhayan Roy
    Pages 109-120

  12. Partial Domination in Some Geometric Intersection Graphs

    • Madhura Dutta, Anil Maheshwari, Subhas C. Nandy
    Pages 121-133

  13. Generalized Lettericity of Graphs

    • Zhidan Feng, Henning Fernau, Kevin Mann, Indhumathi Raman, Silas Cato Sacher
    Pages 134-146

  14. Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth

    • Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
    Pages 147-159

  15. Fast FPT Algorithms for Grundy Number on Dense Graphs

    • Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan
    Pages 160-172

  16. On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis

    • Anni Hakanen, Ville Junnila, Tero Laihonen, Havu Miikonen, Ismael G. Yero
    Pages 173-184

  17. Algorithms and Hardness Results for the (3, 1)-Cover Problem

    • Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy
    Pages 185-196

  18. Extension Perfect Roman Domination

    • Kevin Mann, Henning Fernau
    Pages 197-209

  19. A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks

    • Jannatul Maowa, Robert Benkoczi
    Pages 210-221

  20. Two Step Graph Protection Game

    • Aakash Ghosh, Saraswati Girish Nanoti
    Pages 222-233
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Editors and Affiliations

  • University of Lethbridge, Lethbridge, Canada

    Daya Gaur

  • Indian Institute of Technology Hyderabad, Sangareddy, India

    Rogers Mathew

Bibliographic Information

  • Book Title: Algorithms and Discrete Applied Mathematics

  • Book Subtitle: 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings

  • Editors: Daya Gaur, Rogers Mathew

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-031-83438-7

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2025

  • Softcover ISBN: 978-3-031-83437-0Published: 05 February 2025

  • eBook ISBN: 978-3-031-83438-7Published: 04 February 2025

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XXI, 370

  • Number of Illustrations: 54 b/w illustrations, 16 illustrations in colour

  • Topics: Mathematics of Computing, Computer Imaging, Vision, Pattern Recognition and Graphics

Publish with us

Policies and ethics

Back to top