{"product_id":"9783030950170","title":"Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings (Lecture Notes in Computer Science 13179) (1st ed. 2022. 2022. xix, 317 S. 55 SW-Abb. 235 mm)","description":"\u003cp\u003e§16§§This 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.§ §04§§A proof of the Multiplicative 1-2-3 Conjecture.- The geodesic transversal problem on some networks.- Chromatic Bounds for Some Subclasses of $(P_3cup 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 f §04§or 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.§\u003c\/p\u003e","brand":"SPRINGER, BERLIN; SPRINGER INTERNATIONAL PUBLISHING;","offers":[{"title":"Default Title","offer_id":42634296033355,"sku":"00000_00000_00000_00000","price":3030.17,"currency_code":"THB","in_stock":true}],"url":"https:\/\/kinokuniya.co.th\/products\/9783030950170","provider":"Books Kinokuniya Thailand","version":"1.0","type":"link"}