Margaret-Ellen Messinger

Orcid: 0000-0002-1153-0926

According to our database1, Margaret-Ellen Messinger authored at least 27 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A note on hyperopic cops and robber.
Discret. Math. Algorithms Appl., July, 2023

The damage number of the Cartesian product of graphs.
CoRR, 2023

2022
Hamilton Paths in Dominating Graphs of Trees and Cycles.
Graphs Comb., 2022

2021
Dominating vertex covers: the vertex-edge domination problem.
Discuss. Math. Graph Theory, 2021

The Pyro game: a slow intelligent fire.
CoRR, 2021

Eternal k-domination on graphs.
CoRR, 2021

2020
Limited visibility Cops and Robber.
Discret. Appl. Math., 2020

2019
Hyperopic Cops and Robbers.
Theor. Comput. Sci., 2019

2018
A note on the eternal dominating set problem.
Int. J. Game Theory, 2018

A Variation on Chip-Firing: the diffusion game.
Discret. Math. Theor. Comput. Sci., 2018

2017
Disjoint dominating sets with a perfect matching.
Discret. Math. Algorithms Appl., 2017

Limited Visibility Cops and Robbers.
CoRR, 2017

Closing the Gap: Eternal Domination on 3 x n Grids.
Contributions Discret. Math., 2017

2016
A deterministic version of the game of zombies and survivors on graphs.
Discret. Appl. Math., 2016

A note on the Grundy number and graph products.
Discret. Appl. Math., 2016

2015
Eternal domination on 3 × n grid graphs.
Australas. J Comb., 2015

2014
Elimination schemes and lattices.
Discret. Math., 2014

A note on bounds for the cop number using tree decompositions.
Contributions Discret. Math., 2014

2012
Fighting constrained fires in graphs.
Theor. Comput. Sci., 2012

2011
Cleaning with Brooms.
Graphs Comb., 2011

2010
Parallel cleaning of a network with brushes.
Discret. Appl. Math., 2010

2009
The robot cleans up.
J. Comb. Optim., 2009

Clean the graph before you draw it!
Inf. Process. Lett., 2009

Seepage in directed acyclic graphs.
Australas. J Comb., 2009

2008
Cleaning a network with brushes.
Theor. Comput. Sci., 2008

Average firefighting on infinite grids.
Australas. J Comb., 2008

2007
Cleaning Random <i>d</i>-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007


  Loading...