( en | de | ru )

 

Disambiguation of "de Figueiredo, Celina M. H."

Author of the publication

copydeleteadd this publication to your clipboard
Clique Graph Recognition Is NP-Complete.

, , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 269-277. Springer, (2006)

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.

Giovanna Negrão de Figueiredo

Flávia Figueiredo de Rezende Felipe

Celina Schätze

Celina Cziepluch

Celina Kress

 

Other publications of authors with the same name

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time., , , and . BSB, volume 8213 of Lecture Notes in Computer Science, page 126-135. Springer, (2013)The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube., , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 249-260. Springer, (2013)A class of ?-perfect graphs., and . Discret. Math., 216 (1-3): 169-193 (2000)Non loop graphs with induced cycles., , , , and . Electron. Notes Discret. Math., (2005)Loop Graphs and Asteroidal Sets., , , , and . Electron. Notes Discret. Math., (2005)Hamiltonian Cycles in Kneser Graphs for n=2k+2., , , , and . Electron. Notes Discret. Math., (2011)The total chromatic number of split-indifference graphs., , , and . Discret. Math., 312 (17): 2690-2693 (2012)A characterization of P4-comparability graphs., , and . Discret. Math., 306 (19-20): 2461-2472 (2006)The cost of perfection for matchings in graphs., , , and . Discret. Appl. Math., (2016)On the computational difficulty of the terminal connection problem., , and . RAIRO Theor. Informatics Appl., (2023)