國立虎尾科技大學 |

Treewidth, Kernels, and Algorithms = Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Treewidth, Kernels, and Algorithms/ edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
其他題名:	Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /
其他作者:	van Leeuwen, Erik Jan.
面頁冊數:	LV, 299 p. 182 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer Communication Networks. -
電子資源:	https://doi.org/10.1007/978-3-030-42071-0
ISBN:	9783030420710

Treewidth, Kernels, and Algorithms = Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /
Treewidth, Kernels, and AlgorithmsEssays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /[electronic resource] :edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen. - 1st ed. 2020. - LV, 299 p. 182 illus., 24 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12160. - Theoretical Computer Science and General Issues ;9163.

Seeing Arboretum for the (partial k) Trees -- Collaborating With Hans: Some Remaining Wonderments -- Hans Bodlaender and the Theory of Kernelization Lower Bounds -- Algorithms, Complexity, and Hans -- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs -- As Time Goes By: Reflections on Treewidth for Temporal Graphs -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices -- A Survey on Spanning Tree Congestion -- Surprising Applications of Treewidth Bounds for Planar Graphs -- Computing tree decompositions -- Experimental analysis of treewidth -- A Retrospective on (Meta) Kernelization -- Games, Puzzles and Treewidth -- Fast Algorithms for Join Operations on Tree Decompositions.

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.

ISBN: 9783030420710

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

669310
Computer Communication Networks.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Treewidth, Kernels, and Algorithms = Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /
LDR:03042nam a22004095i 4500 001 1028102
003 DE-He213
005 20200703160145.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030420710 $9 978-3-030-42071-0
024 7 $a 10.1007/978-3-030-42071-0 $2 doi
035 $a 978-3-030-42071-0
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 Treewidth, Kernels, and Algorithms $h [electronic resource] : $b Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday / $c edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a LV, 299 p. 182 illus., 24 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 12160
505 0 $a Seeing Arboretum for the (partial k) Trees -- Collaborating With Hans: Some Remaining Wonderments -- Hans Bodlaender and the Theory of Kernelization Lower Bounds -- Algorithms, Complexity, and Hans -- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs -- As Time Goes By: Reflections on Treewidth for Temporal Graphs -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices -- A Survey on Spanning Tree Congestion -- Surprising Applications of Treewidth Bounds for Planar Graphs -- Computing tree decompositions -- Experimental analysis of treewidth -- A Retrospective on (Meta) Kernelization -- Games, Puzzles and Treewidth -- Fast Algorithms for Join Operations on Tree Decompositions.
520 $a This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Graphics. $3 669895
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Computer communication systems. $3 1115394
650 0 $a Application software. $3 528147
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer graphics. $3 561602
650 0 $a Algorithms. $3 527865
700 1 $a van Leeuwen, Erik Jan. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1324615
700 1 $a Kratsch, Stefan. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1324614
700 1 $a Fomin, Fedor V. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 792546
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030420703
776 0 8 $i Printed edition: $z 9783030420727
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-42071-0
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)