( en | de | ru )

 

Disambiguation of "Dobson, Maria Patricia"

Author of the publication

copydeleteadd this publication to your clipboard
NP-completeness of the k-packing function problem in graphs.

, , and . Electron. Notes Discret. Math., (2015)

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.

Brian Dobson

Patricia Maria Daisenberger

Patricia Maria Haberl

Patricia Maria Sagmeister

Patricia Maria Rogosch

 

Other publications of authors with the same name

On transitive orientations with restricted covering graphs., , , and . Inf. Process. Lett., 101 (3): 119-125 (2007)Recognizing Edge-Perfect Graphs: some Polynomial Instances., , and . CTW, page 153-156. (2009)Towards a Polynomial Equivalence Between k -Packing Functions and k-Limited Packings in Graphs., and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 160-165. Springer, (2016)Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs., , and . Electron. Notes Discret. Math., (2011)Tuple Domination on Graphs with the Consecutive-zeros Property., , and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 401-411. Elsevier, (2019)The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems., , and . Electron. Notes Discret. Math., (2010)Treelike Comparability Graphs., , and . Electron. Notes Discret. Math., (2004)The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs., , and . Electron. Notes Discret. Math., (2010)The multiple domination and limited packing problems in graphs., , and . Inf. Process. Lett., 111 (23-24): 1108-1113 (2011)NP-completeness of the k-packing function problem in graphs., , and . Electron. Notes Discret. Math., (2015)