001447153 000__ 06275cam\a2200589Ii\4500
001447153 001__ 1447153
001447153 003__ OCoLC
001447153 005__ 20230310004104.0
001447153 006__ m\\\\\o\\d\\\\\\\\
001447153 007__ cr\un\nnnunnun
001447153 008__ 220602s2022\\\\sz\a\\\\o\\\\\101\0\eng\d
001447153 019__ $$a1322365875
001447153 020__ $$a9783031066788$$q(electronic bk.)
001447153 020__ $$a3031066782$$q(electronic bk.)
001447153 020__ $$z9783031066771
001447153 020__ $$z3031066774
001447153 0247_ $$a10.1007/978-3-031-06678-8$$2doi
001447153 035__ $$aSP(OCoLC)1322473271
001447153 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCF$$dUKAHL$$dOCLCQ
001447153 049__ $$aISEA
001447153 050_4 $$aQA164$$b.I58 2022eb
001447153 08204 $$a004.01/51$$223/eng/20220602
001447153 1112_ $$aInternational Workshop on Combinatorial Algorithms$$n(33rd :$$d2022 :$$cTrier, Germany)
001447153 24510 $$aCombinatorial algorithms :$$b33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings /$$cCristina Bazgan, Henning Fernau (eds.).
001447153 2463_ $$aIWOCA 2022
001447153 264_1 $$aCham, Switzerland :$$bSpringer,$$c2022.
001447153 300__ $$a1 online resource (xviii, 524 pages) :$$billustrations (some color)
001447153 336__ $$atext$$btxt$$2rdacontent
001447153 337__ $$acomputer$$bc$$2rdamedia
001447153 338__ $$aonline resource$$bcr$$2rdacarrier
001447153 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13270
001447153 4901_ $$aAdvanced research in computing and software science
001447153 500__ $$aIncludes author index.
001447153 5050_ $$aDistance from Triviality 2.0: Hybrid Parameterizations -- Graphs as Algorithms: Characterizing Motion-Planning Gadgets through Simulation and Complexity -- On the Existence of EFX Allocations -- Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model -- Perfect Matchings with Crossings -- Graph parameters, implicit representations and factorial properties -- Approximating Subset Sum Ratio via Subset Sum Computations -- Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings -- Lower bounds on the performance of online algorithms for relaxed packing problems -- An Adjacency Labeling Scheme Based On A Decomposition Of Trees Into Caterpillars -- Computing Longest (Common) Lyndon Subsequence -- Structure-aware combinatorial group testing: a new method for pandemic screening -- Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution -- 1-Extendability of independent sets -- Tukey Depth Histograms -- An Efficient Algorithm for the Proximity Connected Two Center Problem -- A New Temporal Interpretation of Cluster Editing -- List covering of regular multigraphs -- The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs -- Perfect matching cuts partitioning a graph into complementary subgraphs -- On the Intractability Landscape of Digraph Intersection Representations -- The Red-Blue Separation problem on graphs -- Harmless Sets in Sparse Classes -- The Parameterized Complexity of s-Club with Triangle and Seed Constraints -- Space-Efficient B Trees via Load-Balancing -- An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations -- Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota -- Practical Space-Efficient Index for Structural Pattern Matching -- A Shift Gray Code for Fixed-Content Lukasiewicz Words -- Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms -- Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number -- Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings -- On relative clique number of triangle-free planar colored mixed graphs. -- Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks -- Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage -- Linear Time Construction of Indexable Elastic Founder Graphs -- On Critical Node Problems with Vulnerable Vertices -- Winner Determination Algorithms for Graph Games with Matching Structures.
001447153 506__ $$aAccess limited to authorized users.
001447153 520__ $$aThis book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022. The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.
001447153 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 2, 2022).
001447153 650_0 $$aCombinatorial analysis$$vCongresses.
001447153 650_0 $$aAlgorithms$$vCongresses.
001447153 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001447153 655_0 $$aElectronic books.
001447153 7001_ $$aBazgan, Cristina,$$eeditor.$$0(orcid)0000-0002-5460-6222$$1https://orcid.org/0000-0002-5460-6222
001447153 7001_ $$aFernau, Henning,$$d1965-$$eeditor.$$1https://orcid.org/0000-0002-4444-3220
001447153 77608 $$iPrint version: $$z3031066774$$z9783031066771$$w(OCoLC)1312149495
001447153 830_0 $$aLecture notes in computer science ;$$v13270.$$x1611-3349
001447153 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001447153 852__ $$bebk
001447153 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-06678-8$$zOnline Access$$91397441.1
001447153 909CO $$ooai:library.usi.edu:1447153$$pGLOBAL_SET
001447153 980__ $$aBIB
001447153 980__ $$aEBOOK
001447153 982__ $$aEbook
001447153 983__ $$aOnline
001447153 994__ $$a92$$bISE