Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |