LEADER 05591nam 22007455 450 001 996464385203316 005 20231006193325.0 010 $a3-030-67899-7 024 7 $a10.1007/978-3-030-67899-9 035 $a(CKB)4900000000508860 035 $a(MiAaPQ)EBC6465094 035 $a(DE-He213)978-3-030-67899-9 035 $a(PPN)253253152 035 $a(EXLCZ)994900000000508860 100 $a20210119d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics$b[electronic resource] $e7th International Conference, CALDAM 2021, Rupnagar, India, February 11?13, 2021, Proceedings /$fedited by Apurva Mudgal, C. R. Subramanian 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (519 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12601 311 $a3-030-67898-9 327 $aApproximation 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 AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I?m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring 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 Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based 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 multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven 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. . 330 $aThis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12601 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aMathematics?Data processing 606 $aMathematics of Computing 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aComputational Mathematics and Numerical Analysis 606 $aAlgorismes$2thub 606 $aGeometria$2thub 606 $aTeoria de grafs$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aMathematics?Data processing. 615 14$aMathematics of Computing. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aComputational Mathematics and Numerical Analysis. 615 7$aAlgorismes 615 7$aGeometria 615 7$aTeoria de grafs 676 $a004.0151 702 $aMudgal$b Apurva 702 $aSubramanian$b C. R. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464385203316 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNISA