Hardness of Metric Dimension in Graphs of Constant Treewidth [PDF]
, 2021 Shaohua Li, Marcin Pilipczuk
openalex +1 more source
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics [PDF]
, 2021 Éric Goles +3 more
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
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Treewidth in non-ground answer set solving and alliance problems in graphs
, 2017 Bernhard Bliem
openalex +2 more sources
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Algorithmica, 2021 Bressan M.
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
A tourist guide through treewidth
Acta Cybernetica, 1992 Summary: A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree- decompositions to solve hard problems efficiently, graph minor theory, and some applications.
openaire +4 more sources
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth [PDF]
Cabello, Sergio +4 more
openalex +1 more source
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. [PDF]
Algorithmica, 2021 Ganian R, Ordyniak S.
europepmc +1 more source