000 06461nam a22006975i 4500
001 978-3-031-06678-8
003 DE-He213
005 20240730173314.0
007 cr nn 008mamaa
008 220518s2022 sz | s |||| 0|eng d
020 _a9783031066788
_9978-3-031-06678-8
024 7 _a10.1007/978-3-031-06678-8
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Algorithms
_h[electronic resource] :
_b33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings /
_cedited by Cristina Bazgan, Henning Fernau.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXVIII, 524 p. 112 illus., 48 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13270
505 0 _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 toReduce 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.
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 drawingand 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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aAlgorithms.
_93390
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer graphics.
_94088
650 0 _aNumerical analysis.
_94603
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Engineering and Networks.
_9107838
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aNumerical Analysis.
_94603
700 1 _aBazgan, Cristina.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9107839
700 1 _aFernau, Henning.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9107840
710 2 _aSpringerLink (Online service)
_9107841
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031066771
776 0 8 _iPrinted edition:
_z9783031066795
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13270
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-06678-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88859
_d88859