William F. Klostermeyer

From MaRDI portal
Person:335332

Available identifiers

zbMath Open klostermeyer.william-fMaRDI QIDQ335332

List of research outcomes

PublicationDate of PublicationType
Efficient \((j, k)\)-dominating functions2022-12-02Paper
ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES2022-05-16Paper
A Taxonomy of Perfect Domination2022-04-19Paper
A Dynamic Domination Problem2022-04-19Paper
Eternal and Secure Domination in Graphs2021-12-15Paper
Perfect roman domination in regular graphs2021-10-08Paper
On eternal domination and Vizing-type inequalities2021-09-01Paper
The Eternal Game Chromatic Number of a Graph2021-06-23Paper
Dominating vertex covers: the vertex-edge domination problem2020-12-08Paper
A dynamic domination problem in trees2020-11-16Paper
https://portal.mardi4nfdi.de/entity/Q52439962019-11-19Paper
Eternal Independent Sets in Graphs2019-07-22Paper
An Eternal Domination Problem in Grids2019-07-22Paper
Packing in regular graphs2018-09-17Paper
https://portal.mardi4nfdi.de/entity/Q46043412018-02-23Paper
Perfect Roman domination in trees2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45983702017-12-20Paper
Disjoint dominating sets with a perfect matching2017-11-29Paper
Protecting a graph with mobile guards2017-07-19Paper
Italian domination in trees2017-03-15Paper
Eternal domination: criticality and reachability2017-01-23Paper
Trees with large \(m\)-eternal domination number2016-11-02Paper
https://portal.mardi4nfdi.de/entity/Q28293562016-10-27Paper
https://portal.mardi4nfdi.de/entity/Q28099392016-05-30Paper
Domination, eternal domination, and clique covering2015-05-11Paper
Eternal Domination in Trees2015-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31891852014-09-09Paper
https://portal.mardi4nfdi.de/entity/Q28644752013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28608072013-11-11Paper
Edge dominating sets and vertex covers2013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q52989022013-06-25Paper
Foolproof eternal domination in the all-guards move model2012-08-27Paper
Vertex covers and eternal dominating sets2012-05-30Paper
Graphs with equal eternal vertex cover and eternal domination numbers2011-08-08Paper
https://portal.mardi4nfdi.de/entity/Q30590082010-12-08Paper
https://portal.mardi4nfdi.de/entity/Q36544682010-01-06Paper
Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q36355642009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36249702009-05-06Paper
Secure domination and secure total domination in graphs2009-02-26Paper
https://portal.mardi4nfdi.de/entity/Q35431632008-12-02Paper
https://portal.mardi4nfdi.de/entity/Q35375802008-11-10Paper
Tight bounds for eternal dominating sets in graphs2008-05-13Paper
https://portal.mardi4nfdi.de/entity/Q54425072008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54410542008-02-07Paper
Connected odd dominating sets in graphs2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54806902006-08-03Paper
Eternally secure sets, independence sets and cliques2006-05-09Paper
https://portal.mardi4nfdi.de/entity/Q33782252006-03-30Paper
Analogues of cliques for oriented coloring2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q48170072004-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44582142004-03-17Paper
Homomorphisms and oriented colorings of equivalence classes of oriented graphs2004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44057992003-10-26Paper
https://portal.mardi4nfdi.de/entity/Q44059182003-09-30Paper
Planar domination graphs2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q47805012003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47864222002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q45295002002-10-27Paper
Fibonacci polynomials and parity domination in grid graphs2002-07-29Paper
\(n\)-tuple coloring of planar graphs with large odd girth2002-05-14Paper
Odd and residue domination numbers of a graph2002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27183512002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q27610442001-12-17Paper
https://portal.mardi4nfdi.de/entity/Q45006152001-02-12Paper
An extremal connectivity parameter of tournaments2000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q42481762000-10-17Paper
(2 + ?)-Coloring of planar graphs with large odd-girth2000-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44892362000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49339282000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q49408892000-04-06Paper
The density of ones in Pascal's rhombus2000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q42430492000-03-13Paper
Hamiltonicity and reversing arcs in digraphs1999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q43933181998-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43982381998-07-14Paper
Characterizing switch-setting problems1998-06-29Paper
https://portal.mardi4nfdi.de/entity/Q43430341997-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43510721997-09-30Paper
SCHEDULING TWO SALESMEN IN A NETWORK1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q52846381997-05-19Paper
On-line Scheduling with Optimal Worst-Case Response Time1996-12-08Paper
On the Complexity of Scheduling to Optimize Average Response Time1993-12-06Paper
https://portal.mardi4nfdi.de/entity/Q40282881993-03-28Paper
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs1992-06-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: William F. Klostermeyer