Small k-Dominating Sets in Planar Graphs with Applications
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Covering Planar Graphs with a Fixed Number of Balls
Discrete & Computational Geometry
New code upper bounds from the Terwilliger algebra and semidefinite programming
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I added one problem on a similar theme after the meeting. The problems have been arranged so that those with similar themes occur together as far as possible.