- Jan Arne Telle. Complexity of
domination-type problems in graphs. Nordic Journal of
Computing, 1(1):157-171, Spring 1994.
Abstract,
References,
Citations,
etc.
- Pinar Heggernes and Jan Arne Telle. Partitioning
Graphs into Generalized Dominating Sets. Nordic Journal of
Computing, 5(2):128-142, Summer 1998.
Abstract,
References,
etc.
- Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. On the
Complexity of Graph Covering Problems. Nordic Journal of
Computing, 5(3):173-195, Fall 1998.
Abstract,
References,
etc.
Shortcuts: