LEADER 04125nam 22005655 450 001 9910800113303321 005 20251225195107.0 010 $a3-031-52213-3 024 7 $a10.1007/978-3-031-52213-0 035 $a(MiAaPQ)EBC31067578 035 $a(Au-PeEL)EBL31067578 035 $a(DE-He213)978-3-031-52213-0 035 $a(CKB)29755970000041 035 $a(EXLCZ)9929755970000041 100 $a20240113d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics $e10th International Conference, CALDAM 2024, Bhilai, India, February 15?17, 2024, Proceedings /$fedited by Subrahmanyam Kalyanasundaram, Anil Maheshwari 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (338 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14508 311 08$aPrint version: Kalyanasundaram, Subrahmanyam Algorithms and Discrete Applied Mathematics Cham : Springer,c2024 9783031522123 320 $aIncludes bibliographical references and index. 327 $aAlgorithms and Complexity -- Consecutive Occurrences with Distance Constraints -- Parameterized Aspects of Distinct Kemeny Rank Aggregation -- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity -- Distance-2-Dispersion with Termination by a Strong Team -- On Query Complexity Measures and their Relations for Symmetric Functions -- Computational Geometry -- Growth Rate of the Number of Empty Triangles in the Plane -- Geometric Covering Number: Covering Points with Curves -- Improved Algorithms for Minimum-Membership Geometric Set Cover -- Semi-total Domination in Unit Disk Graphs -- Discrete Applied Mathematics -- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method -- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs -- The Frobenius Problem for the Proth Numbers -- Graph Algorithms -- Eternal Connected VertexCover Problem in Graphs: Complexity and Algorithms -- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination -- On Star Partition of Split Graphs -- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs -- Open Packing in H-free Graphs and Subclasses of Split Graphs -- Graph Theory -- Location-domination Type Problems Under the Mycielski Construction -- On Total Chromatic Number of Complete Multipartite Graphs -- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability -- Total Coloring of Some Graph Operations -- Star Colouring of Regular Graphs Meets Weaving and Line Graphs. 330 $aThis book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15?17, 2024. The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14508 606 $aComputer science$xMathematics 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aMathematics of Computing 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 615 0$aComputer science$xMathematics. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 14$aMathematics of Computing. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 676 $a005.1 702 $aKalyanasundaram$b Subrahmanyam 702 $aMaheshwari$b Anil 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910800113303321 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNINA