Locating and total dominating sets in treesHAYNES, Teresa W; HENNING, Michael A; HOWARD, Jamie et al.Discrete applied mathematics. 2006, Vol 154, Num 8, pp 1293-1300, issn 0166-218X, 8 p.Article

Tight bounds for eternal dominating sets in graphsGOLDWASSER, John L; KLOSTERMEYER, William F.Discrete mathematics. 2008, Vol 308, Num 12, pp 2589-2593, issn 0012-365X, 5 p.Article

Locating and paired-dominating sets in graphsMCCOY, John; HENNING, Michael A.Discrete applied mathematics. 2009, Vol 157, Num 15, pp 3268-3280, issn 0166-218X, 13 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

Domatically critical and domatically full graphsRALL, D. F.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 81-87, issn 0012-365X, 7 p.Article

On the queen domination problemGRINSTEAD, C. M; HAHNE, B; VAN STONE, D et al.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 21-26, issn 0012-365X, 6 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

Acyclic domination on bipartite permutation graphsGUANGJUN XU; LIYING KANG; ERFANG SHAN et al.Information processing letters. 2006, Vol 99, Num 4, pp 139-144, issn 0020-0190, 6 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

Infinite versus finite graph dominationBACSO, Gábor; JUNG, Heinz A; TUZA, Zsolt et al.Discrete mathematics. 2010, Vol 310, Num 9, pp 1495-1500, issn 0012-365X, 6 p.Conference Paper

Hereditarily dominated graphsMICHALAK, Danuta.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 952-957, issn 0012-365X, 6 p.Conference Paper

On positive influence dominating sets in social networksFENG WANG; HONGWEI DU; CAMACHO, Erika et al.Theoretical computer science. 2011, Vol 412, Num 3, pp 265-269, issn 0304-3975, 5 p.Article

A (2 + ε)-approximation scheme for minimum domination on circle graphsDAMIAN-IORDACHE, Mirela; PEMMARAJU, Sriram V.Journal of algorithms (Print). 2002, Vol 42, Num 2, pp 255-276, issn 0196-6774Article

Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphsCHUNMEI LIU; YINGLEI SONG.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 684-698, issn 1382-6905, 15 p.Article

A note on balancedness of dominating set gamesQIZHI FANG; HYE KYUNG KIM.Journal of combinatorial optimization. 2005, Vol 10, Num 4, pp 303-310, issn 1382-6905, 8 p.Article

Global secure sets of grid-like graphsYIU YU HO; DUTTON, Ronald.Discrete applied mathematics. 2011, Vol 159, Num 6, pp 490-496, issn 0166-218X, 7 p.Article

Efficient dominating sets in labeled rooted oriented treesSCHWENK, Allen J; YUE, Bill Q.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 276-298, issn 0012-365X, 23 p.Article

Improved pebbling boundsCHAN, Melody; GODBOLE, Anant P.Discrete mathematics. 2008, Vol 308, Num 11, pp 2301-2306, issn 0012-365X, 6 p.Article

An optimal algorithm for finding the minimum cardinality dominating set on permutation graphsCHAO, H. S; HSU, F. R; LEE, R. C. T et al.Discrete applied mathematics. 2000, Vol 102, Num 3, pp 159-173, issn 0166-218XArticle

Domination and total domination on asteroidal triple-free graphsKRATSCH, D.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 111-123, issn 0166-218XConference Paper

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

Dominating set is fixed parameter tractable in claw-free graphsCYGAN, Marek; PHILIP, Geevarghese; PILIPCZUK, Marcin et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 6982-7000, issn 0304-3975, 19 p.Article

Fault-tolerant locating-dominating setsSLATER, Peter J.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 179-189, issn 0012-365XConference Paper