001454283 000__ 04983cam\a2200553\i\4500
001454283 001__ 1454283
001454283 003__ OCoLC
001454283 005__ 20230314003511.0
001454283 006__ m\\\\\o\\d\\\\\\\\
001454283 007__ cr\cn\nnnunnun
001454283 008__ 230201s2023\\\\sz\\\\\\o\\\\\101\0\eng\d
001454283 019__ $$a1366653099
001454283 020__ $$a9783031252112$$q(electronic bk.)
001454283 020__ $$a303125211X$$q(electronic bk.)
001454283 020__ $$z9783031252105
001454283 020__ $$z3031252101
001454283 0247_ $$a10.1007/978-3-031-25211-2$$2doi
001454283 035__ $$aSP(OCoLC)1367844684
001454283 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP
001454283 049__ $$aISEA
001454283 050_4 $$aQA76.9.A43
001454283 08204 $$a005.1$$223/eng/20230201
001454283 1112_ $$aCALDAM (Conference)$$n(9th :$$d2023 :$$cGāndhīnagar, India)
001454283 24510 $$aAlgorithms and discrete applied mathematics :$$b9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, proceedings /$$cAmitabha Bagchi, Rahul Muthu (eds.).
001454283 2463_ $$aCALDAM 2023
001454283 264_1 $$aCham :$$bSpringer,$$c2023.
001454283 300__ $$a1 online resource (460 pages).
001454283 336__ $$atext$$btxt$$2rdacontent
001454283 337__ $$acomputer$$bc$$2rdamedia
001454283 338__ $$aonline resource$$bcr$$2rdacarrier
001454283 4901_ $$aLecture notes in computer science ;$$v13947
001454283 500__ $$aIncludes index.
001454283 5050_ $$aStable Approximation Schemes -- A whirlwind tour of intersection graph enumeration -- Graph modification problems with forbidden minors -- Algorithms & Optimization Efficient reductions and algorithms for Subset Product -- Optimal length cutting plane refutations of integer programs -- Fault-Tolerant Dispersion Resource management in device-to-device communications -- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane -- Arbitrary oriented color spanning region for line segments -- Games with a Simple Rectilinear Obstacle in Plane -- Diverse Fair Allocations: Complexity and Algorithms -- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs -- D K 5-list coloring toroidal 6-regular triangulations in linear time -- On Locally Identifying Coloring of Graphs -- On Structural Parameterizations of Star Coloring -- Reddy Perfectness of G-generalized join of graphs -- Coloring of a superclass of 2K2-free graphs -- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures -- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs -- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs -- Monitoring edge-geodetic sets in graphs -- Cyclability, Connectivity and Circumference -- Graph Domination On three domination-based identification problems in block graphs -- Graph modification problems with forbidden minors -- Computational Aspects of Double Dominating Sequences in Graph -- Relation between broadcast domination and multipacking numbers on chordal graphs -- Pushing Cops and Robber on Oriented Graphs -- Mind the Gap: Edge Facility Location Problems in Theory and Practice -- Complexity Results on Cosecure Domination in Graphs -- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures -- Minimum Maximal Acyclic Matching in Proper Interval Graphs -- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs -- Maximum subgraph problem for 3-regular Knodel graphs and its wirelength -- Covering using Bounded Size Subgraphs -- Axiomatic characterization of the the toll walk function of some graph classes -- Structural Parameterization of Alliance Problems.
001454283 506__ $$aAccess limited to authorized users.
001454283 520__ $$aThis book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.
001454283 588__ $$aDescription based on print version record.
001454283 650_0 $$aComputer algorithms$$vCongresses.
001454283 650_0 $$aComputer science$$xMathematics$$vCongresses.
001454283 655_0 $$aElectronic books.
001454283 7001_ $$aBagchi, Amitabha,$$eeditor.$$1https://isni.org/isni/0000000035860757
001454283 7001_ $$aMuthu, Rahul,$$eeditor.
001454283 77608 $$iPrint version:$$aCALDAM (Conference) (9th : 2023 : Gāndhīnagar, India), creator.$$tAlgorithms and discrete applied mathematics.$$dCham : Springer, 2023$$z9783031252105$$w(OCoLC)1363814027
001454283 830_0 $$aLecture notes in computer science ;$$v13947.
001454283 852__ $$bebk
001454283 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-25211-2$$zOnline Access$$91397441.1
001454283 909CO $$ooai:library.usi.edu:1454283$$pGLOBAL_SET
001454283 980__ $$aBIB
001454283 980__ $$aEBOOK
001454283 982__ $$aEbook
001454283 983__ $$aOnline
001454283 994__ $$a92$$bISE