LEADER 05551nam 22007095 450 001 996464511003316 005 20230515181052.0 010 $a3-030-79987-5 024 7 $a10.1007/978-3-030-79987-8 035 $a(CKB)5590000000518424 035 $a(MiAaPQ)EBC6676213 035 $a(Au-PeEL)EBL6676213 035 $a(OCoLC)1259439156 035 $a(DE-He213)978-3-030-79987-8 035 $a(PPN)257358838 035 $a(EXLCZ)995590000000518424 100 $a20210629d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Algorithms$b[electronic resource] $e32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5?7, 2021, Proceedings /$fedited by Paola Flocchini, Lucia Moura 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (605 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12757 300 $aIncludes index. 311 $a3-030-79986-7 327 $aInvited 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12757 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer graphics 606 $aDiscrete Mathematics in Computer Science 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aComputer Graphics 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer graphics. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aComputer Graphics. 676 $a511.8 702 $aFlocchini$b Paola 702 $aMoura$b Lucia 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464511003316 996 $aCombinatorial Algorithms$92868813 997 $aUNISA