| Publication | Date of Publication | Type |
|---|
Efficient \((j, k)\)-dominating functions
Discussiones Mathematicae Graph Theory | 2022-12-02 | Paper |
ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
Advances and Applications in Discrete Mathematics | 2022-05-16 | Paper |
A Taxonomy of Perfect Domination
Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
A Dynamic Domination Problem
Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
Eternal and Secure Domination in Graphs
Topics in Domination in Graphs | 2021-12-15 | Paper |
Perfect Roman domination in regular graphs
Applicable Analysis and Discrete Mathematics | 2021-10-08 | Paper |
On eternal domination and Vizing-type inequalities
AKCE International Journal of Graphs and Combinatorics | 2021-09-01 | Paper |
The eternal game chromatic number of a graph
| 2021-06-23 | Paper |
Dominating vertex covers: the vertex-edge domination problem
Discussiones Mathematicae Graph Theory | 2020-12-08 | Paper |
A dynamic domination problem in trees
| 2020-11-16 | Paper |
Roman, Italian, and 2-domination
| 2019-11-19 | Paper |
Eternal Independent Sets in Graphs
Theory and Applications of Graphs | 2019-07-22 | Paper |
An Eternal Domination Problem in Grids
Theory and Application of Graphs | 2019-07-22 | Paper |
Packing in regular graphs
Quaestiones Mathematicae | 2018-09-17 | Paper |
On total vertex covers and edge domination in graphs
| 2018-02-23 | Paper |
Perfect Roman domination in trees
Discrete Applied Mathematics | 2018-01-11 | Paper |
Bounds for the \(m\)-eternal domination number of a graph
| 2017-12-20 | Paper |
Disjoint dominating sets with a perfect matching
Discrete Mathematics, Algorithms and Applications | 2017-11-29 | Paper |
Protecting a graph with mobile guards
Applicable Analysis and Discrete Mathematics | 2017-07-19 | Paper |
Italian domination in trees
Discrete Applied Mathematics | 2017-03-15 | Paper |
Eternal domination: criticality and reachability
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
Trees with large \(m\)-eternal domination number
Discrete Applied Mathematics | 2016-11-02 | Paper |
Dynamic dominating sets: the eviction model for eternal domination
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-10-27 | Paper |
Edge domination in grids
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Domination, eternal domination, and clique covering
Discussiones Mathematicae Graph Theory | 2015-05-11 | Paper |
Eternal domination in trees
| 2015-01-26 | Paper |
Eternal coloring of a graph
| 2014-09-09 | Paper |
Eternal total domination in graphs.
Ars Combinatoria | 2013-12-06 | Paper |
Eternal protection in grid graphs
Utilitas Mathematica | 2013-11-11 | Paper |
Edge dominating sets and vertex covers
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
An eternal vertex cover problem
| 2013-06-25 | Paper |
Foolproof eternal domination in the all-guards move model
Mathematica Slovaca | 2012-08-27 | Paper |
Vertex covers and eternal dominating sets
Discrete Applied Mathematics | 2012-05-30 | Paper |
Graphs with equal eternal vertex cover and eternal domination numbers
Discrete Mathematics | 2011-08-08 | Paper |
Edge protection in graphs
| 2010-12-08 | Paper |
Eternal dominating sets in Kneser graphs
| 2010-01-06 | Paper |
Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
Graphs and Combinatorics | 2009-12-09 | Paper |
scientific article; zbMATH DE number 5575574 (Why is no real title available?)
| 2009-07-06 | Paper |
Odd and even dominating sets with open neighborhoods.
| 2009-05-06 | Paper |
Secure domination and secure total domination in graphs
Discussiones Mathematicae Graph Theory | 2009-02-26 | Paper |
scientific article; zbMATH DE number 5376430 (Why is no real title available?)
| 2008-12-02 | Paper |
scientific article; zbMATH DE number 5363556 (Why is no real title available?)
| 2008-11-10 | Paper |
Tight bounds for eternal dominating sets in graphs
Discrete Mathematics | 2008-05-13 | Paper |
Complexity of eternal security
| 2008-02-22 | Paper |
Eternal security in graphs of fixed independence number
| 2008-02-07 | Paper |
Connected odd dominating sets in graphs
Discussiones Mathematicae Graph Theory | 2006-10-16 | Paper |
Total perfect codes in grid graphs
| 2006-08-03 | Paper |
Eternally secure sets, independence sets and cliques
AKCE International Journal of Graphs and Combinatorics | 2006-05-09 | Paper |
Parity dominating sets in grid graphs
| 2006-03-30 | Paper |
Analogues of cliques for oriented coloring
Discussiones Mathematicae Graph Theory | 2005-04-19 | Paper |
scientific article; zbMATH DE number 2100550 (Why is no real title available?)
| 2004-09-14 | Paper |
scientific article; zbMATH DE number 2059943 (Why is no real title available?)
| 2004-03-17 | Paper |
Homomorphisms and oriented colorings of equivalence classes of oriented graphs
Discrete Mathematics | 2004-01-26 | Paper |
scientific article; zbMATH DE number 1933261 (Why is no real title available?)
| 2003-10-26 | Paper |
scientific article; zbMATH DE number 1934394 (Why is no real title available?)
| 2003-09-30 | Paper |
Planar domination graphs
Discrete Mathematics | 2003-07-29 | Paper |
scientific article; zbMATH DE number 1833073 (Why is no real title available?)
| 2003-04-28 | Paper |
scientific article; zbMATH DE number 1845548 (Why is no real title available?)
| 2002-12-15 | Paper |
scientific article; zbMATH DE number 1744077 (Why is no real title available?)
| 2002-10-27 | Paper |
Fibonacci polynomials and parity domination in grid graphs
Graphs and Combinatorics | 2002-07-29 | Paper |
\(n\)-tuple coloring of planar graphs with large odd girth
Graphs and Combinatorics | 2002-05-14 | Paper |
Odd and residue domination numbers of a graph
Discussiones Mathematicae. Graph Theory | 2002-03-24 | Paper |
Perfect codes and independent dominating sets
Congressus Numerantium | 2002-01-02 | Paper |
Pushing vertices and orienting edges
Ars Combinatoria | 2001-12-17 | Paper |
scientific article; zbMATH DE number 1496421 (Why is no real title available?)
| 2001-02-12 | Paper |
An extremal connectivity parameter of tournaments
Discrete Mathematics | 2000-12-03 | Paper |
scientific article; zbMATH DE number 1295363 (Why is no real title available?)
| 2000-10-17 | Paper |
(2 + ?)-Coloring of planar graphs with large odd-girth
| 2000-09-24 | Paper |
scientific article; zbMATH DE number 1472181 (Why is no real title available?)
| 2000-07-09 | Paper |
scientific article; zbMATH DE number 1389216 (Why is no real title available?)
| 2000-06-04 | Paper |
scientific article; zbMATH DE number 1407504 (Why is no real title available?)
| 2000-04-06 | Paper |
The density of ones in Pascal's rhombus
Discrete Mathematics | 2000-03-23 | Paper |
scientific article; zbMATH DE number 1286742 (Why is no real title available?)
| 2000-03-13 | Paper |
Hamiltonicity and reversing arcs in digraphs
| 1999-08-31 | Paper |
scientific article; zbMATH DE number 1161323 (Why is no real title available?)
| 1998-10-05 | Paper |
scientific article; zbMATH DE number 1175383 (Why is no real title available?)
| 1998-07-14 | Paper |
Characterizing switch-setting problems∗
Linear and Multilinear Algebra | 1998-06-29 | Paper |
scientific article; zbMATH DE number 1029225 (Why is no real title available?)
| 1997-10-13 | Paper |
scientific article; zbMATH DE number 1052832 (Why is no real title available?)
| 1997-09-30 | Paper |
SCHEDULING TWO SALESMEN IN A NETWORK
International Journal of Foundations of Computer Science | 1997-08-07 | Paper |
scientific article; zbMATH DE number 969167 (Why is no real title available?)
| 1997-05-19 | Paper |
On-line Scheduling with Optimal Worst-Case Response Time
Journal of Information and Optimization Sciences | 1996-12-08 | Paper |
On the Complexity of Scheduling to Optimize Average Response Time
Journal of Information and Optimization Sciences | 1993-12-06 | Paper |
scientific article; zbMATH DE number 139938 (Why is no real title available?)
| 1993-03-28 | Paper |
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
Information Processing Letters | 1992-06-26 | Paper |
