000 04199nam a22005415i 4500
001 978-3-031-52213-0
003 DE-He213
005 20240730170951.0
007 cr nn 008mamaa
008 240113s2024 sz | s |||| 0|eng d
020 _a9783031522130
_9978-3-031-52213-0
024 7 _a10.1007/978-3-031-52213-0
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithms and Discrete Applied Mathematics
_h[electronic resource] :
_b10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings /
_cedited by Subrahmanyam Kalyanasundaram, Anil Maheshwari.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXXI, 330 p. 69 illus., 20 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14508
505 0 _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.
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aImage processing
_xDigital techniques.
_94145
650 0 _aComputer vision.
_996520
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
_931569
700 1 _aKalyanasundaram, Subrahmanyam.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996522
700 1 _aMaheshwari, Anil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_996525
710 2 _aSpringerLink (Online service)
_996527
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031522123
776 0 8 _iPrinted edition:
_z9783031522147
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14508
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-52213-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c87321
_d87321