On bounds for a board covering problem
Information Processing Letters
A simplified solution of the n queens` problem
Information Processing Letters
Easy problems for tree-decomposable graphs
Journal of Algorithms
Chessboard domination problems
Discrete Mathematics - Topics on domination
A dynamic programming solution to the n-queens problem
Information Processing Letters
The vertex separation number of a graph equals its path-width
Information Processing Letters
Mixed searching and proper-path-width
Theoretical Computer Science
Domination by queens on a square beehive
Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
An upper bound for the minimum number of queens covering the n × n chessboard
Discrete Applied Mathematics
An improved upper bound for queens domination numbers
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
| Hi-index | 0.04 |
minimum dominating set of queens is one of the typical programming exercises of a first year's computer science course. However, little work has been published on the complexity of this problem. We analyse here several algorithms and show that advanced algorithmic techniques may dramatically speed up solving this problem.