國立虎尾科技大學 |

Combinatorial Algorithms = 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Algorithms/ edited by Paola Flocchini, Lucia Moura.
Reminder of title:	32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings /
other author:	Flocchini, Paola.
Description:	XX, 588 p. 134 illus., 59 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-79987-8
ISBN:	9783030799878

Combinatorial Algorithms = 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings /
Combinatorial Algorithms32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings /[electronic resource] :edited by Paola Flocchini, Lucia Moura. - 1st ed. 2021. - XX, 588 p. 134 illus., 59 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12757. - Theoretical Computer Science and General Issues ;9163.

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

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

ISBN: 9783030799878

Standard No.: 10.1007/978-3-030-79987-8doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Combinatorial Algorithms = 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings /
LDR:04688nam a22004215i 4500 001 1056408
003 DE-He213
005 20210826172202.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030799878 $9 978-3-030-79987-8
024 7 $a 10.1007/978-3-030-79987-8 $2 doi
035 $a 978-3-030-79987-8
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Combinatorial Algorithms $h [electronic resource] : $b 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings / $c edited by Paola Flocchini, Lucia Moura.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XX, 588 p. 134 illus., 59 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12757
505 0 $a Invited 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.
520 $a This 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.
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer graphics. $3 561602
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Flocchini, Paola. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 882529
700 1 $a Moura, Lucia. $e editor. $1 https://orcid.org/0000-0003-1763-2584 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361731
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030799861
776 0 8 $i Printed edition: $z 9783030799885
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-79987-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)