scientific article; zbMATH DE number 7471715
From MaRDI portal
Publication:5028484
Mikołaj Bojańczyk, Michał Pilipczuk
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1701.06937
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing tree-depth faster than \(2^n\)
- The vertex separation number of a graph equals its path-width
- Upper bounds on the size of obstructions and intertwines
- Algorithmic graph theory and perfect graphs
- A Menger-like property of tree-cut width
- Exploring the Subexponential Complexity of Completion Problems
- Enumeration of monadic second-order queries on trees
- Query evaluation via tree-decompositions
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Constructive algorithm for path-width of matroids
- Definability equals recognizability for graphs of bounded treewidth
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Finding branch-decompositions of matroids, hypergraphs, and more
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication:
