000 04232nam a22006375i 4500
001 978-3-030-42071-0
003 DE-He213
005 20240423125215.0
007 cr nn 008mamaa
008 200314s2020 sz | s |||| 0|eng d
020 _a9783030420710
_9978-3-030-42071-0
024 7 _a10.1007/978-3-030-42071-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aTreewidth, Kernels, and Algorithms
_h[electronic resource] :
_bEssays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday /
_cedited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aLV, 299 p. 48 illus., 23 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 ;
_v12160
505 0 _aSeeing 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 _aThis 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. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 0 _aAlgorithms.
650 0 _aComputer graphics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aApplication software.
650 0 _aComputer networks .
650 1 4 _aAlgorithms.
650 2 4 _aComputer Graphics.
650 2 4 _aData Science.
650 2 4 _aMathematics of Computing.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aComputer Communication Networks.
700 1 _aFomin, Fedor V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKratsch, Stefan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _avan Leeuwen, Erik Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030420703
776 0 8 _iPrinted edition:
_z9783030420727
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12160
856 4 0 _uhttps://doi.org/10.1007/978-3-030-42071-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175412
_d175412