On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Information and Computation
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Mind change optimal learning of Bayes net structure from dependency and independency data
Information and Computation
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Complexity of social welfare optimization in multiagent resource allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Bribery in path-disruption games
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Complexity and approximability of social welfare optimization in multiagent resource allocation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Autonomous Agents and Multi-Agent Systems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |