LEADER 04325nam 22006975 450 001 9910349437503321 005 20251225202150.0 010 $a9783319741802 010 $a3319741802 024 7 $a10.1007/978-3-319-74180-2 035 $a(CKB)4330000000415008 035 $a(DE-He213)978-3-319-74180-2 035 $a(MiAaPQ)EBC6284789 035 $a(MiAaPQ)EBC5590920 035 $a(Au-PeEL)EBL5590920 035 $a(OCoLC)1027041165 035 $a(PPN)224637681 035 $a(EXLCZ)994330000000415008 100 $a20180115d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Discrete Applied Mathematics $e4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings /$fedited by B.S. Panda, Partha P. Goswami 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XVI, 301 p. 58 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10743 300 $aIncludes index. 311 08$a9783319741796 311 08$a3319741799 327 $aEfficient Domination and Efficient Edge Domination: A Brief Survey -- Mixed Unit Interval Bigraphs.-Hamiltonian Path in K1,t-free split Graphs ? a Dichotomy -- A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems -- Probabilistic Properties of Highly Connected Random Geometric Graphs -- On Indicated Coloring of Some Classes of Graphs -- Line Segment Disk Cover -- Fixed-parameter tractable algorithms for Tracking Set Problems -- Exact computation of the number of accepting paths of an NTM -- Determining Minimal Degree Polynomials of a Cyclic Code of length 2^k over Z8 -- Consistent Subset Problem with two labels -- The Edge Geodetic Number of Product Graphs -- Burning Spiders -- Drawing Graphs on Few Circles and Few Spheres -- On a lower bound for the eccentric connectivity index of graphs -- On the Tractability of (k,i)-Coloring -- Window Queries for Problems on Intersecting Objects and Maximal Points -- Bounded stub resolution for some maximal 1-planar graphs -- On Structural Parameterizations of Firefighting -- On the Simultaneous Minimum Spanning Trees Problem -- Variations of cops and robbers game on grids -- Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -- On oriented L(p; 1)-labeling -- Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. 330 $aThis book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10743 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aArtificial intelligence$xData processing 606 $aComputer graphics 606 $aAlgorithms 606 $aMathematics of Computing 606 $aData Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a511.8 702 $aPanda$b B.S$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGoswami$b Partha P$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349437503321 996 $aAlgorithms and Discrete Applied Mathematics$93004624 997 $aUNINA