Algorithms and discrete applied mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 1113, 2021, proceedings
 Responsibility
 Apurva Mudgal, C.R. Subramanian (eds.).
 Digital
 text file
 Publication
 Cham, Switzerland : Springer, [2021]
 Physical description
 1 online resource (xviii, 514 pages) : illustrations (some color)
 Series
 Lecture notes in computer science ; 12601.
 LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Online
More options
Description
Creators/Contributors
 Meeting
 CALDAM (Conference) (7th : 2021 : Online)
 Contributor
 Mudgal, Apurva, editor.
 Subramanian, C. R. (Mathematician), editor.
Contents/Summary
 Bibliography
 Includes bibliographical references and index.
 Contents

 Approximation Algorithms. Online bin packing with overload cost. Scheduling Trains with Small Stretch on a Unidirectional Line. Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs. Approximation Algorithms for Orthogonal Line Centers. Semitotal Domination on ATfree Graphs and Circle Graphs. Burning Grids and Intervals. Parameterized Algorithms. On Parameterized Complexity of Liquid Democracy. Acyclic coloring parameterized by directed cliquewidth.  On Structural Parameterizations of Load Coloring. OneSided Discrete Terrain Guarding and Chordal Graphs. Parameterized Complexity of Locally Minimal Defensive Alliances. Computational Geometry. New variants of Perfect Noncrossing Matchings. Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data. A Worstcase Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. On the Intersections of Nonhomotopic Loops. Graph Theory. On cdcoloring of trees and cobipartite graphs. Cut Vertex Transit Functions of Hypergraphs. Lexicographic Product of Digraphs and Related BoundaryType Sets. The Connected Domination Number of Grids. On degree sequences and eccentricities in pseudoline arrangement graphs.  Cops and Robber on Butterflies and Solid Grids. bColoring of Some Powers of Hypercubes. Chromatic Bounds for the Subclasses of $pK_2$ Free Graphs. Axiomatic characterization of the median function of a block graph. On Coupon Coloring of Cartesian Product of Some Graphs. On the Connectivity and the Diameter of BetweennessUniform Graphs. Combinatorics and Algorithms. On algorithms to find pordering. Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. Algorithmic analysis of prioritybased bin packing. Recursive methods for some problems in coding and random permutations. Achieving positive rates with predetermined dictionaries. Characterization of Dense Patterns Having Distinct Squares. Graph Algorithms. Failure and communication in a synchronized multidrone system. Memory Optimal Dispersion by Anonymous Mobile Robots. Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. Templatedriven Rainbow Coloring of Proper Interval Graphs. Minimum Consistent Subset of Simple Graph Classes.  Computational Complexity. Balanced Connected Graph Partition. Hardness Results of Global Roman Domination in Graphs. .
 (source: Nielsen Book Data)
 Publisher's summary

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 1113, 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. .
(source: Nielsen Book Data)
Subjects
Bibliographic information
 Publication date
 2021
 Title variation
 CALDAM 2021
 Series
 Lecture notes in computer science ; 12601
 LNCS sublibrary. SL 1  Theoretical computer science and general issues
 ISBN
 9783030678999 (electronic book)
 3030678997 (electronic book)
 3030678989
 9783030678982
 DOI
 10.1007/9783030678999