Hypergraph languages of bounded degree
Journal of Computer and System Sciences
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
Pursuing a fast robber on a graph
Theoretical Computer Science
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |