Results 131 to 140 of about 13,814 (224)
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek S.
europepmc +1 more source
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
Infrared: a declarative tree decomposition-powered framework for bioinformatics
, 2023 Yao H +4 more
europepmc +1 more source
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth [PDF]
, 2010 Markus Bläser, Christian Herzog
openalex +1 more source
Reoptimization of parameterized problems. [PDF]
Acta Inform, 2022 Böckenhauer HJ +3 more
europepmc +1 more source
Integer linear programming formulations for treewidth [PDF]
, 2011 Alexander Grigoriev +2 more
openalex +1 more source
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth [PDF]
, 2011 MohammadHossein Bateni +2 more
openalex +1 more source
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
, 2006 Marko Samer, Stefan Szeider
openalex +2 more sources
Exact and parameterized algorithms for choosability. [PDF]
Acta InformBliznets I, Nederlof J.
europepmc +1 more source