LEADER 04358nam 22006615 450 001 996464534503316 005 20230323134652.0 010 $a3-030-95018-2 024 7 $a10.1007/978-3-030-95018-7 035 $a(MiAaPQ)EBC6875187 035 $a(Au-PeEL)EBL6875187 035 $a(CKB)21004438900041 035 $a(DE-He213)978-3-030-95018-7 035 $a(PPN)260832804 035 $a(EXLCZ)9921004438900041 100 $a20220116d2022 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] $e8th International Conference, CALDAM 2022, Puducherry, India, February 10?12, 2022, Proceedings /$fedited by Niranjan Balachandran, R. Inkulu 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (326 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13179 311 08$aPrint version: Balachandran, Niranjan Algorithms and Discrete Applied Mathematics Cham : Springer International Publishing AG,c2022 9783030950170 327 $aA proof of the Multiplicative 1-2-3 Conjecture -- The geodesic transversal problem on some networks -- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs -- List homomorphisms to separable signed graphs -- Some position problems for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms and Complexity -- B0-VPG Representation of AT-free Outerplanar Graphs -- P versus NPC : Steiner tree in convex split graphs -- On cd-coloring of {P_5,K_4}-free chordal graphs -- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs -- Covering a Graph with Densest Subgraphs -- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance -- Bounds and Algorithms for Geodetic Hulls -- Voronoi Games using Geodesics -- Approximation and parameterized algorithms for balanced connected partition problems -- Algorithms for Online Car-sharing Problem -- Algebraic algorithms for variants of Subset Sum -- Hardness and Approximation Results for Some Variants of Stable Marriage Problem -- On Fair Division with Binary Valuations Respecting Social Networks -- Parameterized Intractability of Defensive Alliance Problem -- On the approximability of path and cycle problems in arc-dependent networks} -- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13179 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aDiscrete mathematics 606 $aMathematics of Computing 606 $aAlgorithms 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aDiscrete mathematics. 615 14$aMathematics of Computing. 615 24$aAlgorithms. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aBalachandran$b Niranjan 702 $aInkulu$b R. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464534503316 996 $aAlgorithms and Discrete Applied Mathematics$92587952 997 $aUNISA