000 04214nam a22005895i 4500
001 978-3-030-95018-7
003 DE-He213
005 20240423125525.0
007 cr nn 008mamaa
008 220116s2022 sz | s |||| 0|eng d
020 _a9783030950187
_9978-3-030-95018-7
024 7 _a10.1007/978-3-030-95018-7
_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] :
_b8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings /
_cedited by Niranjan Balachandran, R. Inkulu.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIX, 317 p. 55 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13179
505 0 _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.
520 _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.
650 0 _aComputer science
_xMathematics.
650 0 _aAlgorithms.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aDiscrete mathematics.
650 1 4 _aMathematics of Computing.
650 2 4 _aAlgorithms.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aBalachandran, Niranjan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aInkulu, R.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030950170
776 0 8 _iPrinted edition:
_z9783030950194
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13179
856 4 0 _uhttps://doi.org/10.1007/978-3-030-95018-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c178870
_d178870