000 05630nam a22006375i 4500
001 978-3-030-79987-8
003 DE-He213
005 20240730180607.0
007 cr nn 008mamaa
008 210629s2021 sz | s |||| 0|eng d
020 _a9783030799878
_9978-3-030-79987-8
024 7 _a10.1007/978-3-030-79987-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] :
_b32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings /
_cedited by Paola Flocchini, Lucia Moura.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXX, 588 p. 134 illus., 59 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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12757
505 0 _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.
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer graphics.
_94088
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Graphics.
_94088
700 1 _aFlocchini, Paola.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9120942
700 1 _aMoura, Lucia.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9120943
710 2 _aSpringerLink (Online service)
_9120944
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030799861
776 0 8 _iPrinted edition:
_z9783030799885
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12757
_9120945
856 4 0 _uhttps://doi.org/10.1007/978-3-030-79987-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90401
_d90401