( en | de | ru )

 

Disambiguation of "Bazgan, Cristina"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Dynamic Variants of Red-Blue Dominating Set.

, , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 236-247. Springer, (2020)

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.

Cristina Sattarhoff

Cristina Häring

Cristina Cozzini

Cristina Voss

Cristina Gomes

 

Other publications of authors with the same name

Critical edges for the assignment problem: Complexity and exact resolution., , and . Oper. Res. Lett., 41 (6): 685-689 (2013)Finding a potential community in networks., , and . Theor. Comput. Sci., (2019)Approximating Min-Max (Regret) Versions of Some Polynomial Problems., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 428-438. Springer, (2006)Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem., , and . COCOA, volume 6831 of Lecture Notes in Computer Science, page 126-140. Springer, (2011)Parameterized Dynamic Variants of Red-Blue Dominating Set., , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 236-247. Springer, (2020)Aspects of upper defensive alliances., , and . Discret. Appl. Math., (2019)Completeness in differential approximation classes., , , and . Int. J. Found. Comput. Sci., 16 (6): 1267-1295 (2005)Complexity of the min-max and min-max regret assignment problems., , and . Oper. Res. Lett., 33 (6): 634-640 (2005)Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness., , and . Theor. Comput. Sci., 339 (2-3): 272-292 (2005)Approximation of satisfactory bisection problems., , and . J. Comput. Syst. Sci., 74 (5): 875-883 (2008)