LEADER 00948nam--2200337---450- 001 990002189880203316 005 20090317100420.0 035 $a000218988 035 $aUSA01000218988 035 $a(ALEPH)000218988USA01 035 $a000218988 100 $a20041119d1965----km-y0itay0103----ba 101 $aeng 102 $aUS 105 $a||||||||001yy 200 1 $aDifferential and integral calcolus$fEdmund Landau 210 $aChelsea$cNew York Publishing Company$d1965 215 $a372 p.$d24 cm 410 0$12001 454 1$12001 461 1$1001-------$12001 700 1$aLANDAU,$bEdmund$028694 801 0$aIT$bsalbc$gISBD 912 $a990002189880203316 951 $a515 LAN 1 (IS I 8)$b28533 E.C.$cIS I$d00201523 959 $aBK 969 $aECO 979 $aSIAV1$b10$c20041119$lUSA01$h1005 979 $aRSIAV5$b90$c20090317$lUSA01$h1004 996 $aDifferential and integral calcolus$91033123 997 $aUNISA LEADER 05425nam 22007095 450 001 9910647395603321 005 20251225203512.0 010 $a3-031-25211-X 024 7 $a10.1007/978-3-031-25211-2 035 $a(MiAaPQ)EBC7187108 035 $a(Au-PeEL)EBL7187108 035 $a(CKB)26068928400041 035 $a(DE-He213)978-3-031-25211-2 035 $a(PPN)26780718X 035 $a(EXLCZ)9926068928400041 100 $a20230112d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics $e9th International Conference, CALDAM 2023, Gandhinagar, India, February 9?11, 2023, Proceedings /$fedited by Amitabha Bagchi, Rahul Muthu 205 $a1st ed. 2023. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2023. 215 $a1 online resource (464 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13947 311 08$aPrint version: Bagchi, Amitabha Algorithms and Discrete Applied Mathematics Cham : Springer International Publishing AG,c2023 9783031252105 320 $aIncludes bibliographical references and index. 327 $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 Knödel 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. 330 $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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13947 606 $aComputer science$xMathematics 606 $aAlgorithms 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aMathematics of Computing 606 $aDesign and Analysis of Algorithms 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 615 0$aComputer science$xMathematics. 615 0$aAlgorithms. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 14$aMathematics of Computing. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 676 $a929.605 676 $a005.1 702 $aBagchi$b Amitabha 702 $aMuthu$b Rahul 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910647395603321 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNINA