000			05816nam a22004335i 4500
988			_aSpringer_Computer_2022
999			_c382965 _d382965 _x1
001			382965
003			ES-MaUEC
005			20230102122030.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			221008s2022 sz | s |1|| 0|eng d
020			_a9783031066788
024	7		_a10.1007/978-3-031-06678-8 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA164 _b2022 EB
245	0	0	_aCombinatorial Algorithms : _b33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings _cedited by Cristina Bazgan, Henning Fernau
250			_aFirst edition 2022
264		1	_aCham _bSpringer International Publising _c2022
300			_a1 recurso en línea (XVIII, 524 páginas) _b112 ilustraciones, 48 ilustraciones a color
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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 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.
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.
650		7	_2embne _9138441 _aAnálisis combinatorio _vCongresos y asambleas
650		7	_2embne _9141162 _aAlgoritmos _vCongresos y asambleas
700	1		_aBazgan, Cristina _eeditor literario _0(orcid)0000-0002-5460-6222 _1https://orcid.org/0000-0002-5460-6222 _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aFernau, Henning _eeditor literario _0(orcid)0000-0002-4444-3220 _1https://orcid.org/0000-0002-4444-3220 _4edt _4http://id.loc.gov/vocabulary/relators/edt
776	0	8	_iPrinted edition: _z9783031066771
776	0	8	_iPrinted edition: _z9783031066795
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-06678-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b10/2022 _dz _eIG _zSI