( en | de | ru )

 

Disambiguation of "Messinger, Margaret-Ellen"

Author of the publication

copydeleteadd this publication to your clipboard
Disjoint dominating sets with a perfect matching.

, , and . Discret. Math. Algorithms Appl., 9 (5): 1750065:1-1750065:20 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jochen Messinger

Alexander Messinger

Markus Messinger

Jens Meßinger

Philipp Messinger

 

Other publications of authors with the same name

Disjoint dominating sets with a perfect matching., , and . Discret. Math. Algorithms Appl., 9 (5): 1750065:1-1750065:20 (2017)Hamilton Paths in Dominating Graphs of Trees and Cycles., , , , , , and . Graphs Comb., 38 (6): 174 (2022)A note on bounds for the cop number using tree decompositions., , , , and . Contributions Discret. Math., (2014)The Robot Cleans Up., and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 309-318. Springer, (2008)Dominating vertex covers: the vertex-edge domination problem., , and . Discuss. Math. Graph Theory, 41 (1): 123-132 (2021)Parallel cleaning of a network with brushes., , , and . Discret. Appl. Math., 158 (5): 467-478 (2010)A note on hyperopic cops and robber., , , and . Discret. Math. Algorithms Appl., 15 (5): 2250127:1-2250127:14 (July 2023)Clean the graph before you draw it!, , , and . Inf. Process. Lett., 109 (10): 463-467 (2009)Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm., , , and . CAAN, volume 4852 of Lecture Notes in Computer Science, page 13-26. Springer, (2007)A note on bounds for the cop number using tree decompositions., , , , and . CoRR, (2013)