東華大學圖書館 |

Combinatorial algorithms = 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial algorithms/ edited by Cristina Bazgan, Henning Fernau.
Reminder of title:	33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /
remainder title:	IWOCA 2022
other author:	Bazgan, Cristina.
corporate name:	International Workshop on Combinatorial Algorithms
Published:	Cham :Springer International Publishing : : 2022.,
Description:	xviii, 524 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Distance 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.
Contained By:	Springer Nature eBook
Subject:	Combinatorial analysis - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-06678-8
ISBN:	9783031066788

Combinatorial algorithms = 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /
Combinatorial algorithms33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /[electronic resource] :IWOCA 2022edited by Cristina Bazgan, Henning Fernau. - Cham :Springer International Publishing :2022. - xviii, 524 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,132700302-9743 ;. - Lecture notes in computer science ;13270..

Distance 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.

This 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.

ISBN: 9783031066788

Standard No.: 10.1007/978-3-031-06678-8doiSubjects--Topical Terms:

607039
Combinatorial analysis
--Congresses.

LC Class. No.: QA164 / .I58 2022

Dewey Class. No.: 004.0151

Combinatorial algorithms = 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /
LDR:05017nmm a2200373 a 4500 001 2299990
003 DE-He213
005 20220518104441.0
006 m d
007 cr nn 008maaau
008 230324s2022 sz s 0 eng d
020 $a 9783031066788 $q (electronic bk.)
020 $a 9783031066771 $q (paper)
024 7 $a 10.1007/978-3-031-06678-8 $2 doi
035 $a 978-3-031-06678-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164 $b .I58 2022
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA164 $b .I61 2022
111 2 $a International Workshop on Combinatorial Algorithms $n (33rd : $d 2022 : $c Trier, Germany) $3 3598003
245 1 0 $a Combinatorial algorithms $h [electronic resource] : $b 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings / $c edited by Cristina Bazgan, Henning Fernau.
246 3 $a IWOCA 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xviii, 524 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13270
505 0 $a Distance 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 $a This 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 0 $a Combinatorial analysis $v Congresses. $3 607039
650 0 $a Algorithms $v Congresses. $3 607038
650 1 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Numerical Analysis. $3 892626
700 1 $a Bazgan, Cristina. $3 3598004
700 1 $a Fernau, Henning. $3 1073018
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13270. $3 3598005
856 4 0 $u https://doi.org/10.1007/978-3-031-06678-8
950 $a Computer Science (SpringerNature-11645)