The structure of obstructions to treewidth and pathwidth
Electronic Notes in Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
STAR Protoc, 2023 Bitzer G +3 more
europepmc +1 more source
Computing the Pathwidth and Bandwidth of Solid, Convex Grids ∗
, 2023 John Ellis
openalex +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation
, 2022 Louis Dublois +2 more
openalex +1 more source
$2$-Layer $k$-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth [PDF]
, 2020 Patrizio Angelini +3 more
openalex +1 more source
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Algorithms Mol Biol, 2022 Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded [PDF]
, 2018 Paz Carmi, Vida Dujmović, Pat Morin
openalex +1 more source
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
, 2022 Mamadou Moustapha Kanté +2 more
openalex +2 more sources
On the Pathwidth of Planar Graphs
, 2006 Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by Coudert, Huc and Sereni in [4]). By the results of Boedlander and Fomin [2] this holds for every outerplanar graph and actually is tight by Coudert, Huc and
Amini, Omid +2 more
openaire +1 more source