04018nam a22004935i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001500172072001700187072002300204072001600227245022900243250001800472264006900490300006500559336002600624337002600650338003600676347002400712490005900736505156100795520046602356650004202822650004902864650002102913650003702934650007102971700009903042700008603141710003403227773002603261776003603287776003603323830005903359856004603418912001403464912001503478912001403493999001703507978-3-031-52213-0DE-He21320251030110921.0cr nn 008mamaa240113s2024    sz |    s    |||| 0|eng d  a97830315221309978-3-031-52213-07 a10.1007/978-3-031-52213-02doi 4aQA76.9.M35 7aUYAM2bicssc 7aCOM0140002bisacsh 7aUYAM2thema10aAlgorithms and Discrete Applied Mathematicsh[electronic resource] :b10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings /cedited by Subrahmanyam Kalyanasundaram, Anil Maheshwari.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXXI, 330 p. 69 illus., 20 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aLecture Notes in Computer Science,x1611-3349 ;v145080 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.  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. 0aComputer sciencexMathematics.964041 0aImage processingxDigital techniques.964228 0aComputer vision.14aMathematics of Computing.96650124aComputer Imaging, Vision, Pattern Recognition and Graphics.9655501 aKalyanasundaram, Subrahmanyam.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9695441 aMaheshwari, Anil.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9695452 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303152212308iPrinted edition:z9783031522147 0aLecture Notes in Computer Science,x1611-3349 ;v1450840uhttps://doi.org/10.1007/978-3-031-52213-0  aZDB-2-SCS  aZDB-2-SXCS  aZDB-2-LNC  c57191d57191