001433725 000__ 03348cam\a2200661\i\4500
001433725 001__ 1433725
001433725 003__ OCoLC
001433725 005__ 20230309003650.0
001433725 006__ m\\\\\o\\d\\\\\\\\
001433725 007__ cr\cn\nnnunnun
001433725 008__ 210206s2021\\\\sz\a\\\\ob\\\\101\0\eng\d
001433725 019__ $$a1235761863$$a1241066600$$a1249944919
001433725 020__ $$a9783030678999$$q(electronic book)
001433725 020__ $$a3030678997$$q(electronic book)
001433725 020__ $$z3030678989
001433725 020__ $$z9783030678982
001433725 0247_ $$a10.1007/978-3-030-67899-9$$2doi
001433725 035__ $$aSP(OCoLC)1236265528
001433725 040__ $$aEBLCP$$beng$$erda$$epn$$cEBLCP$$dGW5XE$$dYDX$$dOCLCO$$dOCLCQ$$dDKU$$dOCLCF$$dLEATE$$dNOC$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001433725 049__ $$aISEA
001433725 050_4 $$aQA76.9.M35
001433725 08204 $$a004.0151$$223
001433725 1112_ $$aCALDAM (Conference)$$n(7th :$$d2021 :$$cOnline)
001433725 24510 $$aAlgorithms and discrete applied mathematics :$$b7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, proceedings /$$cApurva Mudgal, C.R. Subramanian (eds.).
001433725 2463_ $$aCALDAM 2021
001433725 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2021]
001433725 300__ $$a1 online resource (xviii, 514 pages) :$$billustrations (some color)
001433725 336__ $$atext$$btxt$$2rdacontent
001433725 337__ $$acomputer$$bc$$2rdamedia
001433725 338__ $$aonline resource$$bcr$$2rdacarrier
001433725 347__ $$atext file
001433725 347__ $$bPDF
001433725 4901_ $$aLecture notes in computer science ;$$v12601
001433725 4901_ $$aLNCS sublibrary. SL 1 - Theoretical computer science and general issues
001433725 504__ $$aIncludes bibliographical references and index.
001433725 5050_ $$aApproximation Algorithms -- Parameterized Algorithms -- Computational Geometry -- Graph Theory -- Combinatorics and Algorithms -- Graph Algorithms -- Computational Complexity.
001433725 506__ $$aAccess limited to authorized users.
001433725 520__ $$aThis book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers presented in this volume were carefully reviewed and selected from 82 submissions. The papers were organized in topical sections named: approximation algorithms; parameterized algorithms; computational geometry; graph theory; combinatorics and algorithms; graph algorithms; and computational complexity.
001433725 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed March 10, 2021).
001433725 650_0 $$aComputer science$$xMathematics$$vCongresses.
001433725 650_0 $$aAlgorithms$$vCongresses.
001433725 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001433725 650_6 $$aAlgorithmes$$vCongrès.
001433725 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001433725 655_7 $$aConference papers and proceedings.$$2lcgft
001433725 655_7 $$aActes de congrès.$$2rvmgf
001433725 655_0 $$aElectronic books.
001433725 7001_ $$aMudgal, Apurva,$$eeditor.
001433725 7001_ $$aSubramanian, C. R.$$c(Mathematician),$$eeditor.
001433725 77608 $$iPrint version:$$z9783030678982
001433725 830_0 $$aLecture notes in computer science ;$$v12601.
001433725 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001433725 852__ $$bebk
001433725 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-67899-9$$zOnline Access$$91397441.1
001433725 909CO $$ooai:library.usi.edu:1433725$$pGLOBAL_SET
001433725 980__ $$aBIB
001433725 980__ $$aEBOOK
001433725 982__ $$aEbook
001433725 983__ $$aOnline
001433725 994__ $$a92$$bISE