國立虎尾科技大學 |

Algorithms and Complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Complexity/ edited by Pinar Heggernes.
其他題名:	11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings /
其他作者:	Heggernes, Pinar.
面頁冊數:	XIII, 378 p. 274 illus., 33 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-17402-6
ISBN:	9783030174026

Algorithms and Complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings /
Algorithms and Complexity11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings /[electronic resource] :edited by Pinar Heggernes. - 1st ed. 2019. - XIII, 378 p. 274 illus., 33 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11485. - Theoretical Computer Science and General Issues ;9163.

Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.

This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

ISBN: 9783030174026

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Complexity = 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings /
LDR:03768nam a22004095i 4500 001 1005178
003 DE-He213
005 20200703134805.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030174026 $9 978-3-030-17402-6
024 7 $a 10.1007/978-3-030-17402-6 $2 doi
035 $a 978-3-030-17402-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Algorithms and Complexity $h [electronic resource] : $b 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings / $c edited by Pinar Heggernes.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIII, 378 p. 274 illus., 33 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 11485
505 0 $a Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs.
520 $a This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Arithmetic and Logic Structures. $3 672631
700 1 $a Heggernes, Pinar. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1113555
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030174019
776 0 8 $i Printed edition: $z 9783030174033
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-17402-6
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)