Results 111 to 120 of about 3,161 (171)

Clifford Algebras Meet Tree Decompositions. [PDF]

Algorithmica, 2019
Włodarczyk M.
europepmc   +1 more source

2-Connecting outerplanar graphs without blowing up the pathwidth

, 2014
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad   +3 more
openalex   +1 more source

On Compiling Structured CNFs to OBDDs. [PDF]

Theory Comput Syst, 2017
Bova S, Slivovsky F.
europepmc   +1 more source

Triangulating planar graphs while keeping the pathwidth small

, 2015
Thérèse Biedl
openalex   +2 more sources

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP [PDF]

, 2015
A Golovnev, AD Scott, AD Scott, Eric McDermid, F Della Croce, FV Fomin, FV Fomin, FV Fomin, GJ Woeginger, HL Bodlaender, J Gramm, J Kneis, Keith Edwards, KJ Edwards, KJ Edwards, P Haxell, R Niedermeier, S Arnborg, S Gaspers   +18 more
core   +2 more sources

Counting Linear Extensions: Parameterizations by Treewidth. [PDF]

Algorithmica, 2019
Eiben E, Ganian R, Kangas K, Ordyniak S.
europepmc   +1 more source

Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]

Front Bioinform
Brejová B, Gagie T, Herencsárová E, Vinař T.   +3 more
europepmc   +1 more source

Smart Accessibility: Design Process of Integrated Geospatial Data Models to Present User-Customized Universal Design Information. [PDF]

Front Psychol, 2019
Han SR, Yoon S, Cho S.
europepmc   +1 more source

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 [PDF]

, 2019
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma   +4 more
openalex   +1 more source

Exact and parameterized algorithms for choosability. [PDF]

Acta Inform
Bliznets I, Nederlof J.
europepmc   +1 more source