| Author |
Title |
Year |
Publication |
Volume |
Pages |
| Carbonnel, C.; Romero, M.; Zivny, S. |
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side |
2022 |
SIAM Journal on Computing |
51 |
19-69 |
| Kosowski, A.; Li, B.; Nisse, N.; Suchan, K. |
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth |
2015 |
Algorithmica |
72 |
758-777 |
| Li, B.; Moataz, F.Z.; Nisse, N.; Suchan, K. |
Minimum size tree-decompositions |
2018 |
Discrete Applied Mathematics |
245 |
109-127 |
| Liedloff, M.; Montealegre, P.; Todinca, I. |
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques |
2019 |
Algorithmica |
81 |
986-1005 |
