NONBLOCKER : Parameterized algorithmics for MINIMUM DOMINATING SETDEHNE, Frank; FELLOWS, Michael; FEMAU, Henning et al.Lecture notes in computer science. 2006, pp 237-245, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 9 p.Conference Paper

Bounding the number of minimal dominating sets : A measure and conquer approachFOMIN, Fedor V; GRANDONI, Fabrizio; PYATKIN, Artem V et al.Lecture notes in computer science. 2005, pp 573-582, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

On miniaturized problems in parameterized complexity theoryYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2004, pp 108-120, issn 0302-9743, isbn 3-540-23071-8, 13 p.Conference Paper

Linear time algorithms for generalized edge dominating set problemsBERGER, André; PAREKH, Ojas.Lecture notes in computer science. 2005, pp 233-243, issn 0302-9743, isbn 3-540-28101-0, 11 p.Conference Paper

The parameterized complexity of maximality and minimality problemsYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

A synchronous self-stabilizing minimal domination protocol in an arbitrary network graphXU, Z; HEDETNIEMI, S. T; GODDARD, W et al.Lecture notes in computer science. 2003, pp 26-32, issn 0302-9743, isbn 3-540-20745-7, 7 p.Conference Paper

Remarks about disjoint dominating setsHENNING, Michael A; LÖWENSTEIN, Christian; RAUTENBACH, Dieter et al.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6451-6458, issn 0012-365X, 8 p.Article

Domination in the families of Frank and Hamacher t-normsSARKOCI, Peter.Kybernetika. 2005, Vol 41, Num 3, pp 349-360, issn 0023-5954, 12 p.Article

Vertices contained in all or in no minimum paired-dominating set of a treeHENNING, Michael A; PLUMMER, Michael D.Journal of combinatorial optimization. 2005, Vol 10, Num 3, pp 283-294, issn 1382-6905, 12 p.Article

Which trees have a differentiating-paired dominating set?HENNING, Michael A; MCCOY, John.Journal of combinatorial optimization. 2011, Vol 22, Num 1, pp 1-18, issn 1382-6905, 18 p.Article

Small step-dominating sets in treesMAFFRAY, Frederic; RAUTENBACH, Dieter.Discrete mathematics. 2007, Vol 307, Num 9-10, pp 1212-1215, issn 0012-365X, 4 p.Article

The possible cardinalities of global secure sets in cographsJESSE-JOZEFCZYK, Katarzyna.Theoretical computer science. 2012, Vol 414, Num 1, pp 38-46, issn 0304-3975, 9 p.Article

Distributed almost exact approximations for minor-closed familiesCZYGRINOW, Andrzej; HANCKOWIAK, Michal.Lecture notes in computer science. 2006, pp 244-255, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Total restrained domination in claw-free graphsHONGXING JIANG; LIYING KANG.Journal of combinatorial optimization. 2010, Vol 19, Num 1, pp 60-68, issn 1382-6905, 9 p.Article

A survey of selected recent results on total domination in graphsHENNING, Michael A.Discrete mathematics. 2009, Vol 309, Num 1, pp 32-63, issn 0012-365X, 32 p.Article

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

On weakly connected domination in graphs IIDOMKE, Gayla S; HANINGH, Johannes H; MARKUS, Lisa R et al.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 112-122, issn 0012-365X, 11 p.Article

On the domination number of generalized Petersen graphs P(n, 2)FU XUELIANG; YANG YUANSHENG; JIANG BAOQI et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 2445-2451, issn 0012-365X, 7 p.Article

A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problemWEI REN; QING ZHAO.Theoretical computer science. 2011, Vol 412, Num 45, pp 6451-6454, issn 0304-3975, 4 p.Article

Upper paired-domination in claw-free graphsDORBEC, Paul; HENNING, Michael A.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 235-251, issn 1382-6905, 17 p.Article

Dominating sets in plane triangulationsKING, Erika L. C; PELSMAJER, Michael J.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2221-2230, issn 0012-365X, 10 p.Article

Well paired-dominated graphsFITZPATRICK, S. L; HARTNELL, B. L.Journal of combinatorial optimization. 2010, Vol 20, Num 2, pp 194-204, issn 1382-6905, 11 p.Article

Global defensive k-alliances in graphsRODRIGUEZ-VELAZQUEZ, J. A; SIGARRETA, J. M.Discrete applied mathematics. 2009, Vol 157, Num 2, pp 211-218, issn 0166-218X, 8 p.Article

The k-tuple twin domination in de Bruijn and Kautz digraphsARAKI, Toru.Discrete mathematics. 2008, Vol 308, Num 24, pp 6406-6413, issn 0012-365X, 8 p.Article

Cooperative Covering Problems on NetworksAVERBAKH, Igor; BERMAN, Oded; KRASS, Dmitry et al.Networks (New York, NY). 2014, Vol 63, Num 4, pp 334-349, issn 0028-3045, 16 p.Article