國立虎尾科技大學 |

Combinatorial Algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Algorithms/ edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik.
Reminder of title:	31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings /
other author:	Gąsieniec, Leszek.
Description:	XIX, 424 p. 120 illus., 29 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-48966-3
ISBN:	9783030489663

Combinatorial Algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings /
Combinatorial Algorithms31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings /[electronic resource] :edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik. - 1st ed. 2020. - XIX, 424 p. 120 illus., 29 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12126. - Theoretical Computer Science and General Issues ;9163.

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

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

ISBN: 9783030489663

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

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Combinatorial Algorithms = 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings /
LDR:03843nam a22004215i 4500 001 1020024
003 DE-He213
005 20200703151842.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030489663 $9 978-3-030-48966-3
024 7 $a 10.1007/978-3-030-48966-3 $2 doi
035 $a 978-3-030-48966-3
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 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / $c edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XIX, 424 p. 120 illus., 29 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 12126
505 0 $a Coordinating 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.
520 $a This 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.
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Application software. $3 528147
650 0 $a Computer communication systems. $3 1115394
650 0 $a Computer graphics. $3 561602
650 0 $a Algorithms. $3 527865
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
700 1 $a Gąsieniec, Leszek. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1315422
700 1 $a Klasing, Ralf. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 885437
700 1 $a Radzik, Tomasz. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 894506
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030489656
776 0 8 $i Printed edition: $z 9783030489670
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-48966-3
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)