Letter graphs and well-quasi-order by induced subgraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Note: A decidability result for the dominating set problem
Theoretical Computer Science
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Hi-index | 0.00 |