Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science
The parameterized complexity of regular subgraph problems and generalizations
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.05 |