Author of the publication

Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs.

, , and . ICPP (3), page 126-129. Pennsylvania State University Press, (1989)0-271-00686-2.

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.

 

Other publications of authors with the same name

The Full Steiner Tree Problem in Phylogeny., , and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 107-116. Springer, (2002)The approximability of the weighted Hamiltonian path completion problem on a tree., , and . Theor. Comput. Sci., 341 (1-3): 385-397 (2005)Bit-Parallel Algorithms for Exact Circular String Matching., , and . Comput. J., 57 (5): 731-743 (2014)Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs., , and . ICPP (3), page 126-129. Pennsylvania State University Press, (1989)0-271-00686-2.A near pattern-matching scheme based upon principal component analysis., , and . Pattern Recognit. Lett., 16 (4): 339-345 (1995)A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile., , and . Comput. Oper. Res., 16 (3): 257-269 (1989)The exact multiple pattern matching problem solved by a reference tree approach., , , and . Theor. Comput. Sci., (2021)The full Steiner tree problem., , and . Theor. Comput. Sci., 306 (1-3): 55-67 (2003)