Skip to main content
SpringerLink
Log in

Algorithms and Discrete Applied Mathematics

7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Apurva Mudgal

    1. Indian Institute of Technology Ropar, Rupnagar, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. C. R. Subramanian

    1. Institute of Mathematical Sciences, Chennai, 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 12601)

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

Included in the following conference series:

Conference proceedings info: CALDAM 2021.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.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 (39 papers)

  1. Front Matter

    Pages i-xviii
    Download chapter PDF

  2. Approximation Algorithms

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Online Bin Packing with Overload Cost

      • Kelin Luo, Frits C. R. Spieksma
      Pages 3-15

    3. Scheduling Trains with Small Stretch on a Unidirectional Line

      • Apoorv Garg, Abhiram Ranade
      Pages 16-31

    4. Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs

      • Chakradhar Padamutham, Venkata Subba Reddy Palagiri
      Pages 32-42

    5. Approximation Algorithms for Orthogonal Line Centers

      • Arun Kumar Das, Sandip Das, Joydeep Mukherjee
      Pages 43-54

    6. Semitotal Domination on AT-Free Graphs and Circle Graphs

      • Ton Kloks, Arti Pandey
      Pages 55-65

    7. Burning Grids and Intervals

      • Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
      Pages 66-79

  3. Parameterized Algorithms

    1. Front Matter

      Pages 81-81
      Download chapter PDF

    2. On Parameterized Complexity of Liquid Democracy

      • Palash Dey, Arnab Maiti, Amatya Sharma
      Pages 83-94

    3. Acyclic Coloring Parameterized by Directed Clique-Width

      • Frank Gurski, Dominique Komander, Carolin Rehs
      Pages 95-108

    4. On Structural Parameterizations of Load Coloring

      • I. Vinod Reddy
      Pages 109-121

    5. One-Sided Discrete Terrain Guarding and Chordal Graphs

      • Kasthurirangan Prahlad Narasimhan
      Pages 122-134

    6. Parameterized Complexity of Locally Minimal Defensive Alliances

      • Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi
      Pages 135-148

  4. Computational Geometry

    1. Front Matter

      Pages 149-149
      Download chapter PDF

    2. New Variants of Perfect Non-crossing Matchings

      • Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier
      Pages 151-164

    3. Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data

      • Vahideh Keikha, Hamidreza Keikha, Ali Mohades
      Pages 165-178

    4. A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes

      • Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda
      Pages 179-195

    5. On the Intersections of Non-homotopic Loops

      • Václav Blažej, Michal Opler, Matas Šileikis, Pavel Valtr
      Pages 196-205

  5. Graph Theory

    1. Front Matter

      Pages 207-207
      Download chapter PDF
Back to top

Other volumes

  1. Algorithms and Discrete Applied Mathematics

Keywords

About this book

This book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers presented in this volume were carefully reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity. 

Editors and Affiliations

  • Indian Institute of Technology Ropar, Rupnagar, India

    Apurva Mudgal

  • Institute of Mathematical Sciences, Chennai, India

    C. R. Subramanian

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation