001443829 000__ 04646cam\a2200673Ii\4500
001443829 001__ 1443829
001443829 003__ OCoLC
001443829 005__ 20230310003604.0
001443829 006__ m\\\\\o\\d\\\\\\\\
001443829 007__ cr\un\nnnunnun
001443829 008__ 220126s2022\\\\sz\a\\\\o\\\\\101\0\eng\d
001443829 019__ $$a1293848601$$a1293895213$$a1293934617$$a1294136492$$a1296666070
001443829 020__ $$a9783030950187$$q(electronic bk.)
001443829 020__ $$a3030950182$$q(electronic bk.)
001443829 020__ $$z9783030950170
001443829 020__ $$z3030950174
001443829 0247_ $$a10.1007/978-3-030-95018-7$$2doi
001443829 035__ $$aSP(OCoLC)1293766909
001443829 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCO$$dEBLCP$$dDKU$$dOCLCO$$dOCLCF$$dOCLCQ
001443829 049__ $$aISEA
001443829 050_4 $$aQA76.9.M35$$bC35 2022
001443829 08204 $$a004.01/51$$223
001443829 1112_ $$aCALDAM (Conference)$$n(8th :$$d2022 :$$cPuducherry, India)
001443829 24510 $$aAlgorithms and discrete applied mathematics :$$b8th international conference, CALDAM 2022, Puducherry, India, February 10-12, 2022 : proceedings /$$cNiranjan Balachandran, R. Inkulu (eds.).
001443829 24630 $$aCALDAM 2022
001443829 264_1 $$aCham :$$bSpringer,$$c[2022]
001443829 264_4 $$c©2022
001443829 300__ $$a1 online resource :$$billustrations.
001443829 336__ $$atext$$btxt$$2rdacontent
001443829 337__ $$acomputer$$bc$$2rdamedia
001443829 338__ $$aonline resource$$bcr$$2rdacarrier
001443829 347__ $$atext file$$bPDF$$2rda
001443829 4901_ $$aLecture notes in computer science ;$$v13179
001443829 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
001443829 500__ $$aInternational conference proceedings.
001443829 500__ $$aIncludes author index.
001443829 5050_ $$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.
001443829 506__ $$aAccess limited to authorized users.
001443829 520__ $$aThis book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Rupnagar, India, during February 10-12, 2022. The 39 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.
001443829 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 28, 2022).
001443829 650_0 $$aComputer science$$xMathematics$$vCongresses.
001443829 650_0 $$aAlgorithms$$vCongresses.
001443829 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001443829 650_6 $$aAlgorithmes$$vCongrès.
001443829 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001443829 655_7 $$aConference papers and proceedings.$$2lcgft
001443829 655_7 $$aActes de congrès.$$2rvmgf
001443829 655_0 $$aElectronic books.
001443829 7001_ $$aBalachandran, Niranjan,$$d1977-$$eeditor.
001443829 7001_ $$aInkulu, R.,$$eeditor.
001443829 77608 $$iPrint version: $$z3030950174$$z9783030950170$$w(OCoLC)1289364698
001443829 830_0 $$aLecture notes in computer science ;$$v13179.
001443829 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001443829 852__ $$bebk
001443829 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-95018-7$$zOnline Access$$91397441.1
001443829 909CO $$ooai:library.usi.edu:1443829$$pGLOBAL_SET
001443829 980__ $$aBIB
001443829 980__ $$aEBOOK
001443829 982__ $$aEbook
001443829 983__ $$aOnline
001443829 994__ $$a92$$bISE