Skip to main content
SpringerLink
Log in

Algorithms and Discrete Applied Mathematics

10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings

  • Conference proceedings
  • © 2024

Overview

Editors:
  1. Subrahmanyam Kalyanasundaram

    1. Indian Institute of Technology Hyderabad, Sangareddy, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Anil Maheshwari

    1. Carleton University, Ottawa, Canada

    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 14508)

Included in the following conference series:

Conference proceedings info: CALDAM 2024.

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

Table of contents (22 papers)

  1. Front Matter

    Pages i-xxi
    Download chapter PDF

  2. Algorithms and Complexity

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Consecutive Occurrences with Distance Constraints

      • Waseem Akram, Sanjeev Saxena
      Pages 3-13

    3. Parameterized Aspects of Distinct Kemeny Rank Aggregation

      • Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
      Pages 14-28

    4. Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity

      • Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
      Pages 29-43

    5. Distance-2-Dispersion with Termination by a Strong Team

      • Barun Gorain, Tanvir Kaur, Kaushik Mondal
      Pages 44-58

    6. On Query Complexity Measures and Their Relations for Symmetric Functions

      • Rajat Mittal, Sanjay S. Nair, Sunayana Patro
      Pages 59-73

  3. Computational Geometry

    1. Front Matter

      Pages 75-75
      Download chapter PDF

    2. Growth Rate of the Number of Empty Triangles in the Plane

      • Bhaswar B. Bhattacharya, Sandip Das, Sk. Samim Islam, Saumya Sen
      Pages 77-87

    3. Geometric Covering Number: Covering Points with Curves

      • Arijit Bishnu, Mathew Francis, Pritam Majumder
      Pages 88-102

    4. Improved Algorithms for Minimum-Membership Geometric Set Cover

      • Sathish Govindarajan, Siddhartha Sarkar
      Pages 103-116

    5. Semi-total Domination in Unit Disk Graphs

      • Sasmita Rout, Gautam Kumar Das
      Pages 117-129

  4. Discrete Applied Mathematics

    1. Front Matter

      Pages 131-131
      Download chapter PDF

    2. An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method

      • Sajad Fathi Hafshejani, Daya Gaur, Robert Benkoczi
      Pages 133-147

    3. Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs

      • Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler
      Pages 148-161

    4. The Frobenius Problem for the Proth Numbers

      • Pranjal Srivastava, Dhara Thakkar
      Pages 162-175

  5. Graph Algorithms

    1. Front Matter

      Pages 177-177
      Download chapter PDF

    2. Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms

      • Kaustav Paul, Arti Pandey
      Pages 179-193

    3. Impact of Diameter and Convex Ordering for Hamiltonicity and Domination

      • R. Mahendra Kumar, N. Sadagopan
      Pages 194-208

    4. On Star Partition of Split Graphs

      • D. Divya, S. Vijayakumar
      Pages 209-223
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15–17, 2024.

The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.




Editors and Affiliations

  • Indian Institute of Technology Hyderabad, Sangareddy, India

    Subrahmanyam Kalyanasundaram

  • Carleton University, Ottawa, Canada

    Anil Maheshwari

Bibliographic Information

  • Book Title: Algorithms and Discrete Applied Mathematics

  • Book Subtitle: 10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings

  • Editors: Subrahmanyam Kalyanasundaram, Anil Maheshwari

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-031-52213-0

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

  • Softcover ISBN: 978-3-031-52212-3Published: 26 January 2024

  • eBook ISBN: 978-3-031-52213-0Published: 13 January 2024

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XXI, 330

  • Number of Illustrations: 49 b/w illustrations, 20 illustrations in colour

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

Publish with us

Policies and ethics

Back to top

Search

Navigation