MonadicNLIN and Quantifier-Free Reductions
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Local Problems, Planar Local Problems and Linear Time
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The cardinality constrained covering traveling salesman problem
Computers and Operations Research
On unique graph 3-colorability and parsimonious reductions in the plane
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Argumentation frameworks as constraint satisfaction problems
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Finding kernels or solving SAT
Journal of Discrete Algorithms
Argumentation frameworks as constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 5.23 |