Algorithms and Discrete Applied Mathematics: 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Algorithms and Discrete Applied Mathematics

8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings

  • Conference proceedings
  • © 2022

Overview

Editors:
  1. Niranjan Balachandran

    1. Indian Institute of Technology Bombay, Mumbai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. R. Inkulu

    1. Indian Institute of Technology Guwahati, Guwahati, 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 13179)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CALDAM 2022.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 8579
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 10724
Price includes VAT (Japan)
  • 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 proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022.

The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.

Similar content being viewed by others

Keywords

Table of contents (24 papers)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Graph Theory

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. A Proof of the Multiplicative 1-2-3 Conjecture

      • Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
      Pages 3-14

    3. Chromatic Bounds for Some Subclasses of \((P_3\cup P_2)\)-free graphs

      • Athmakoori Prashant, P. Francis, S. Francis Raj
      Pages 15-21

    4. List Homomorphisms to Separable Signed Graphs

      • Jan Bok, Richard Brewster, Tomás Feder, Pavol Hell, Nikola Jedličková
      Pages 22-35

    5. Some Position Problems for Graphs

      • James Tuite, Elias John Thomas, Ullas Chandran S. V.
      Pages 36-47

    6. Comparability Graphs Among Cover-Incomparability Graphs

      • Arun Anil, Manoj Changat
      Pages 48-61

  3. Graph Algorithms

    1. Front Matter

      Pages 63-63
      Download chapter PDF

    2. Complexity of Paired Domination in AT-free and Planar Graphs

      • Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
      Pages 65-77

    3. The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs

      • M. A. Shalu, Cyriac Antony
      Pages 78-90

    4. On Conflict-Free Spanning Tree: Algorithms and Complexity

      • Bruno José S. Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza
      Pages 91-102

    5. \(B_0\)-VPG Representation of AT-free Outerplanar Graphs

      • Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad
      Pages 103-114

    6. P Versus NPC: Minimum Steiner Trees in Convex Split Graphs

      • A. Mohanapriya, P. Renjith, N. Sadagopan
      Pages 115-126

    7. On cd-Coloring of \(\{P_5,K_4\}\)-free Chordal Graphs

      • M. A. Shalu, V. K. Kirubakaran
      Pages 127-139

    8. An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs

      • Andrzej Lingas, Mia Persson, Dzmitry Sledneu
      Pages 140-151

    9. Covering a Graph with Densest Subgraphs

      • Riccardo Dondi, Alexandru Popa
      Pages 152-163

  4. Computational Geometry

    1. Front Matter

      Pages 165-165
      Download chapter PDF

    2. Coresets for \((k, \ell )\)-Median Clustering Under the Fréchet Distance

      • Maike Buchin, Dennis Rohde
      Pages 167-180

    3. Bounds and Algorithms for Geodetic Hulls

      • Sabine Storandt
      Pages 181-194

    4. Voronoi Games Using Geodesics

      • Arun Kumar Das, Sandip Das, Anil Maheshwari, Sarvottamananda
      Pages 195-207
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Editors and Affiliations

  • Indian Institute of Technology Bombay, Mumbai, India

    Niranjan Balachandran

  • Indian Institute of Technology Guwahati, Guwahati, India

    R. Inkulu

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation