001437920 000__ 06210cam\a2200685\i\4500
001437920 001__ 1437920
001437920 003__ OCoLC
001437920 005__ 20230309004239.0
001437920 006__ m\\\\\o\\d\\\\\\\\
001437920 007__ cr\cn\nnnunnun
001437920 008__ 210708s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001437920 019__ $$a1258664877$$a1266811242
001437920 020__ $$a9783030799878$$q(electronic bk.)
001437920 020__ $$a3030799875$$q(electronic bk.)
001437920 020__ $$z9783030799861$$q(print)
001437920 020__ $$z3030799867
001437920 0247_ $$a10.1007/978-3-030-79987-8$$2doi
001437920 035__ $$aSP(OCoLC)1259439156
001437920 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dOCLCO$$dEBLCP$$dOCLCF$$dDCT$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001437920 049__ $$aISEA
001437920 050_4 $$aQA164$$b.I58 2021eb
001437920 08204 $$a004.01/51$$223
001437920 1112_ $$aInternational Workshop on Combinatorial Algorithms$$n(32nd :$$d2021 :$$cOttawa, Ont.)
001437920 24510 $$aCombinatorial algorithms :$$b32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings /$$cPaola Flocchini, Lucia Moura (eds.).
001437920 2463_ $$aIWOCA 2021
001437920 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2021]
001437920 300__ $$a1 online resource (xx, 588 pages) :$$billustrations (some color)
001437920 336__ $$atext$$btxt$$2rdacontent
001437920 337__ $$acomputer$$bc$$2rdamedia
001437920 338__ $$aonline resource$$bcr$$2rdacarrier
001437920 347__ $$atext file
001437920 347__ $$bPDF
001437920 4901_ $$aLecture notes in computer science ;$$v12757
001437920 4901_ $$aAdvanced research in computing and software science
001437920 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001437920 500__ $$aIncludes author index.
001437920 5050_ $$aInvited Papers -- Relaxed and Approximate Graph Realizations -- Search for combinatorial objects using lattice algorithms - revisited -- Contributed Papers -- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs -- Combinatorics and algorithms for quasi-chain graphs -- Composed Degree-Distance Realizations of Graphs -- All Subgraphs of a Wheel are 5-Coupled-Choosable -- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs -- Edge exploration of temporal graphs -- Optimal monomial quadratization for ODE systems -- A Hamilton Cycle in the k-Sided Pancake Network -- Algorithms and Complexity of s-Club Cluster Vertex Deletion -- Covering Convex Polygons by Two Congruent Disks -- The Tandem Duplication Distance Problem is hard over bounded alphabets -- On the oriented coloring of the disjoint union of graphs -- The Pony Express Communication Problem -- Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups -- Vertex Cover at Distance on H-free Graphs -- On an Ordering Problem in Weighted Hypergraphs -- An Efficient Noisy Binary Search in Graphs via Median Approximation -- A study on the existence of null labelling for 3-hypergraphs -- Piercing All Translates of a Set of Axis-Parallel Rectangles -- A triangle process on regular graphs -- Complexity and Algorithms for MUL-Tree Pruning -- Makespan Trade-offs for Visiting Triangle Edges -- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k -- Approximation algorithms for hitting subgraphs -- Isomorphic unordered labeled trees up to substitution ciphering -- Intersecting Disks using Two Congruent Disks -- Disjoint Paths and Connected Subgraphs for H-Free Graphs -- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property -- Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters -- Non-preemptive tree packing -- Card-based Cryptographic Protocols for Three-input Functions Using Private Operations -- Königsberg Sightseeing: Eulerian Walks in Temporal Graphs -- Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs -- New Approximations and Hardness Results for Submodular Partitioning Problems -- An FPT Algorithm for Matching Cut and d-Cut -- Backtrack search for parallelisms of projective spaces -- Approximating Multistage Matching Problems -- Heuristically enhanced IPO Algorithms for Covering Array Generation.
001437920 506__ $$aAccess limited to authorized users.
001437920 520__ $$aThis book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter "Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com
001437920 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed July 8, 2021).
001437920 650_0 $$aCombinatorial analysis$$vCongresses.
001437920 650_0 $$aAlgorithms$$vCongresses.
001437920 650_6 $$aAnalyse combinatoire$$vCongrès.
001437920 650_6 $$aAlgorithmes$$vCongrès.
001437920 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001437920 655_7 $$aConference papers and proceedings.$$2lcgft
001437920 655_7 $$aActes de congrès.$$2rvmgf
001437920 655_0 $$aElectronic books.
001437920 7001_ $$aFlocchini, Paola,$$eeditor$$1https://orcid.org/0000-0003-3584-5727
001437920 7001_ $$aMoura, Lucia,$$eeditor$$0(orcid)0000-0003-1763-2584$$1https://orcid.org/0000-0003-1763-2584
001437920 77608 $$iPrint version:$$aInternational Workshop on Combinatorial Algorithms (32nd : 2021 : Ottawa, Ont.).$$tCombinatorial algorithms.$$dCham, Switzerland : Springer, [2021]$$z3030799867$$z9783030799861$$w(OCoLC)1253474201
001437920 830_0 $$aLecture notes in computer science ;$$v12757.
001437920 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001437920 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001437920 852__ $$bebk
001437920 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-79987-8$$zOnline Access$$91397441.1
001437920 909CO $$ooai:library.usi.edu:1437920$$pGLOBAL_SET
001437920 980__ $$aBIB
001437920 980__ $$aEBOOK
001437920 982__ $$aEbook
001437920 983__ $$aOnline
001437920 994__ $$a92$$bISE