PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

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

Author of the publication

copydeleteadd this publication to your clipboard
Chromatic index of graphs with no cycle with a unique chord.

, , and . Theor. Comput. Sci., 411 (7-9): 1221-1234 (2010)

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.

Ph. D. Celina Kacperski University of Stuttgart

H. Binz

H. Bungartz

H. Binz

H. Binz

 

Other publications of authors with the same name

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem., , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 243-252. Springer, (2004)Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's., , , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 87-99. Springer, (2004)A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*., , , and . Journal of Computational Biology, 22 (11): 1044-1056 (2015)On Edge-Colouring Indifference Graphs., , and . LATIN, volume 911 of Lecture Notes in Computer Science, page 286-299. Springer, (1995)The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness., , , , , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 1-13. Springer, (2018)Clique-Colouring and Biclique-Colouring Unichord-Free Graphs., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 530-541. Springer, (2012)Transposition Diameter and Lonely Permutations., , , and . BSB, volume 7409 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)Even-power of Cycles With Many Vertices are Type 1 Total Colorable., , , and . Electr. Notes Theor. Comput. Sci., (2019)Kinetic heap-ordered trees: Tight analysis and improved algorithms., and . Inf. Process. Lett., 85 (3): 165-169 (2003)The Pair Completion algorithm for the Homogeneous Set Sandwich Problem., , and . Inf. Process. Lett., 98 (3): 87-91 (2006)