Skip to main content
SpringerLink
Log in

Algorithms and Discrete Applied Mathematics

6th International Conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Manoj Changat

    1. University of Kerala, Thiruvananthapuram, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sandip Das

    1. Indian Statistical Institute, Kolkata, 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 12016)

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

Included in the following conference series:

Conference proceedings info: CALDAM 2020.

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 79.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 (38 papers)

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Graph Algorithms

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Complexity of Restricted Variant of Star Colouring

      • M. A. Shalu, Cyriac Antony
      Pages 3-14

    3. Partitioning Cographs into Two Forests and One Independent Set

      • Pavol Hell, César Hernández-Cruz, Anurag Sanyal
      Pages 15-27

    4. Monitoring the Edges of a Graph Using Distances

      • Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan
      Pages 28-40

    5. The Lexicographic Method for the Threshold Cover Problem

      • Mathew C. Francis, Dalu Jacob
      Pages 41-52

    6. Approximating Modular Decomposition Is Hard

      • Michel Habib, Lalla Mouatadid, Mengchuan Zou
      Pages 53-66

    7. Vertex-Edge Domination in Unit Disk Graphs

      • Sangram K. Jena, Gautam K. Das
      Pages 67-78

    8. Geometric Planar Networks on Bichromatic Points

      • Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
      Pages 79-91

    9. Hardness Results of Global Total k-Domination Problem in Graphs

      • B. S. Panda, Pooja Goyal
      Pages 92-101

    10. Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes

      • Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
      Pages 102-115

    11. Maximum Weighted Edge Biclique Problem on Bipartite Graphs

      • Arti Pandey, Gopika Sharma, Nivedit Jain
      Pages 116-128

  3. Graph Theory

    1. Front Matter

      Pages 129-129
      Download chapter PDF

    2. Determining Number of Generalized and Double Generalized Petersen Graph

      • Angsuman Das
      Pages 131-140

    3. Self-centeredness of Generalized Petersen Graphs

      • Priyanka Singh, Pratima Panigrahi, Aakash Singh
      Pages 141-155

    4. Weak Roman Bondage Number of a Graph

      • P. Roushini Leely Pushpam, N. Srilakshmi
      Pages 156-166

    5. On the Geodetic and Hull Numbers of Shadow Graphs

      • S. V. Ullas Chandran, Mitre C. Dourado, Maya G. S. Thankachy
      Pages 167-177

    6. Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs

      • P. Francis, S. Francis Raj, M. Gokulnath
      Pages 178-183

    7. Smallest \(C_{2l+1}\)-Critical Graphs of Odd-Girth \(2k+1\)

      • Laurent Beaudou, Florent Foucaud, Reza Naserasr
      Pages 184-196

    8. Ramsey Numbers for Line Graphs

      • Huzaifa Abbasi, Manu Basavaraju, Eeshwar Gurushankar, Yash Jivani, Deepak Srikanth
      Pages 197-208
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity.

Editors and Affiliations

  • University of Kerala, Thiruvananthapuram, India

    Manoj Changat

  • Indian Statistical Institute, Kolkata, India

    Sandip Das

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation