Results 131 to 140 of about 1,532 (205)
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
Beating Treewidth for Average-Case Subgraph Isomorphism [PDF]
, 2019 Gregory Rosenthal
openalex +1 more source
Non-Pool-Based Line Planning on Graphs of Bounded Treewidth
, 2023 Berenike Masing +2 more
openalex +2 more sources
Infrared: a declarative tree decomposition-powered framework for bioinformatics
, 2023 Yao H +4 more
europepmc +1 more source
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
, 2012 Reinhard Pichler +3 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
Fine-grained complexity of the graph homomorphism problem for\n bounded-treewidth graphs [PDF]
, 2019 Karolina Okrasa, Paweł Rzążewski
openalex +1 more source
Welfare optimization for resource allocation with peer effects. [PDF]
PNAS NexusQiu Z +6 more
europepmc +1 more source
Reoptimization of parameterized problems. [PDF]
Acta Inform, 2022 Böckenhauer HJ +3 more
europepmc +1 more source