Skip to main content
  • Conference proceedings
  • © 2022

Algorithms and Discrete Applied Mathematics

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

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)

Conference series link(s): CALDAM: Conference on Algorithms and Discrete Applied Mathematics

Conference proceedings info: CALDAM 2022.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-95018-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

    Pages i-xix
  2. Graph Theory

    1. Front Matter

      Pages 1-1
    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
    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. 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
    4. \(B_0\) -VPG Representation of AT-free Outerplanar Graphs

      • Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad
      Pages 103-114
    5. P Versus NPC: Minimum Steiner Trees in Convex Split Graphs

      • A. Mohanapriya, P. Renjith, N. Sadagopan
      Pages 115-126
    6. On cd-Coloring of \(\{P_5,K_4\}\) -free Chordal Graphs

      • M. A. Shalu, V. K. Kirubakaran
      Pages 127-139
    7. An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs

      • Andrzej Lingas, Mia Persson, Dzmitry Sledneu
      Pages 140-151
    8. Covering a Graph with Densest Subgraphs

      • Riccardo Dondi, Alexandru Popa
      Pages 152-163
  4. Computational Geometry

    1. Front Matter

      Pages 165-165
    2. Bounds and Algorithms for Geodetic Hulls

      • Sabine Storandt
      Pages 181-194
    3. Voronoi Games Using Geodesics

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

Other Volumes

  1. Algorithms and Discrete Applied Mathematics

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

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.

Keywords

  • algorithm analysis and problem complexity
  • approximation algorithms
  • approximation theory
  • bipartite graphs
  • combinatorial optimization
  • computer systems
  • data structures
  • directed graphs
  • graph algorithms
  • graph theory
  • graphic methods
  • network protocols
  • planar graph
  • polynomial approximation
  • signal processing
  • theoretical computer science
  • vertex set
  • weighted graph

Editors and Affiliations

  • Indian Institute of Technology Bombay, Mumbai, India

    Niranjan Balachandran

  • Indian Institute of Technology Guwahati, Guwahati, India

    R. Inkulu

Bibliographic Information

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-95018-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)