Hardness of Metric Dimension in Graphs of Constant Treewidth [PDF]
, 2021 Shaohua Li, Marcin Pilipczuk
openalex +1 more source
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth [PDF]
, 2023 Isja Mannens, Jesper Nederlof
openalex +1 more source
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
europepmc +1 more source
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth [PDF]
Cabello, Sergio +4 more
openalex +1 more source
Treewidth versus clique number. II. Tree-independence number
, 2023 Clément Dallard +2 more
openalex +1 more source
Approximation metatheorem for fractionally treewidth-fragile graphs. [PDF]
, 2021 Zdenĕk Dvořák
openalex
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. [PDF]
Theory Comput Syst, 2021 Mengel S, Skritek 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
Graph Treewidth and Geometric Thickness Parameters
, 2005 Vida Dujmović, David R. Wood
openalex +1 more source