Results 71 to 80 of about 2,459 (116)
Computing the Pathwidth and Bandwidth of Solid, Convex Grids ∗
John Ellis
openalex +1 more source
Bandwidth and pathwidth of three-dimensional grids [PDF]
Yota Otachi, Ryohei Suda
openalex +1 more source
Grundy Distinguishes Treewidth from Pathwidth [PDF]
Rémy Belmonte +4 more
openalex +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded [PDF]
Paz Carmi, Vida Dujmović, Pat Morin
openalex +1 more source
$b$-Coloring Parameterized by Pathwidth is XNLP-complete [PDF]
Lars Jaffke +2 more
openalex +1 more source
A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
A. G. Klyuchikov, M. Vyalyi
openalex +2 more sources
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth [PDF]
Uffe Flarup, Laurent Lyaudet
openalex +1 more source

