LEADER 05050nam 22007815 450 001 9910409665103321 005 20230330044632.0 010 $a3-030-48966-3 024 7 $a10.1007/978-3-030-48966-3 035 $a(CKB)4100000011273688 035 $a(MiAaPQ)EBC6271245 035 $a(DE-He213)978-3-030-48966-3 035 $a(PPN)248394711 035 $a(EXLCZ)994100000011273688 100 $a20200528d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Algorithms $e31st International Workshop, IWOCA 2020, Bordeaux, France, June 8?10, 2020, Proceedings /$fedited by Leszek G?sieniec, Ralf Klasing, Tomasz Radzik 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (438 pages) $cillustrations 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12126 300 $aIncludes index. 311 $a3-030-48965-5 327 $aCoordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. 330 $aThis book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8?10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12126 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aApplication software 606 $aComputer networks 606 $aComputer graphics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aComputer and Information Systems Applications 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aAlgorithms 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 0$aApplication software. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aAlgorithms. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aComputer and Information Systems Applications. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aAlgorithms. 676 $a004.0151 676 $a004.0151 702 $aG?sieniec$b Leszek$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKlasing$b Ralf$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRadzik$b Tomasz$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910409665103321 996 $aCombinatorial Algorithms$92868813 997 $aUNINA