Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 18)

H-INDEX

(FIVE YEARS 1)

Published By Springer International Publishing

9783030420703, 9783030420710

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Games, Puzzles and Treewidth

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_17 ◽

2020 ◽

pp. 247-261

Author(s):

Tom C. van der Zanden

Download Full-text

Surprising Applications of Treewidth Bounds for Planar Graphs

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_13 ◽

2020 ◽

pp. 173-188

Author(s):

Marcin Pilipczuk

Keyword(s):

Planar Graphs

Download Full-text

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_9 ◽

2020 ◽

pp. 112-128

Author(s):

Daniel Lokshtanov ◽

Saket Saurabh ◽

Meirav Zehavi

Keyword(s):

Disjoint Paths ◽

Parameterized Algorithms ◽

Graph Minors

Download Full-text

Fast Algorithms for Join Operations on Tree Decompositions

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_18 ◽

2020 ◽

pp. 262-297

Author(s):

Johan M. M. van Rooij

Keyword(s):

Fast Algorithms ◽

Tree Decompositions

Download Full-text

Algorithms, Complexity, and Hans

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_4 ◽

2020 ◽

pp. 22-27

Author(s):

Jan van Leeuwen

Download Full-text

Computing Tree Decompositions

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_14 ◽

2020 ◽

pp. 189-213

Author(s):

Michał Pilipczuk

Keyword(s):

Tree Decompositions

Download Full-text

A Survey on Spanning Tree Congestion

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_12 ◽

2020 ◽

pp. 165-172

Author(s):

Yota Otachi

Keyword(s):

Spanning Tree

Download Full-text

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_11 ◽

2020 ◽

pp. 145-164

Author(s):

Jesper Nederlof

Keyword(s):

Np Hard ◽

Hard Problems ◽

Np Hard Problems

Download Full-text

Seeing Arboretum for the (partial k-) Trees

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_1 ◽

2020 ◽

pp. 3-6

Author(s):

Stefan Arnborg ◽

Andrzej Proskurowski

Download Full-text

Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-42071-0_8 ◽

2020 ◽

pp. 89-111

Author(s):

Bart M. P. Jansen

Keyword(s):

Lower Bounds ◽

Personal View

Download Full-text

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Games, Puzzles and Treewidth

Surprising Applications of Treewidth Bounds for Planar Graphs

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths

Fast Algorithms for Join Operations on Tree Decompositions

Algorithms, Complexity, and Hans

Computing Tree Decompositions

A Survey on Spanning Tree Congestion

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices

Seeing Arboretum for the (partial k-) Trees

Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds

Treewidth, Kernels, and Algorithms - Lecture Notes in Computer Science
Latest Publications