3 search results - page 1 / 1 » On Digraph Width Measures in Parameterized Algorithmics |
113
Voted
IWPEC
2009
Springer
16 years 11 days ago
2009
Springer
153
click to vote
TCS
2008
15 years 5 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
134
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...