Results 201 to 210 of about 14,736 (264)
Romeo and Juliet Meeting in Forest Like Regions
, 2023 Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc +1 more source
Reoptimization of parameterized problems. [PDF]
Acta Inform, 2022 Böckenhauer HJ +3 more
europepmc +1 more source
Kernelization Rules for Special Treewidth and Spaghetti Treewidth
, 2012 Vincent J. C. Kreuzen
openalex +1 more source
Time and Space Results for Parity Games with Bounded Treewidth
, 2011 John Fearnley, Sven Schewe
openalex +1 more source
Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth
Many classical graph problems - such as Max Cut, Chromatic Number, Edge Dominating Set, and Hamiltonian Cycle - are polynomial-time solvable on cographs, fixed-parameter tractable (FPT) when parameterized by treewidth, but W[1]-hard when parameterized by clique-width.
Blažej, Václav +3 more
openaire +1 more source
The Firefighter problem with dynamic defence costs. [PDF]
PLoS OneHunter E, Enright J.
europepmc +1 more source
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
, 2013 Steven Chaplick +4 more
openalex +2 more sources
Infrared: a declarative tree decomposition-powered framework for bioinformatics. [PDF]
Algorithms Mol BiolYao HT +4 more
europepmc +1 more source