Author of the publication

k-Neighborhood Broadcasting.

, and . SIROCCO, volume 8 of Proceedings in Informatics, page 133-146. Carleton Scientific, (2001)

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

Combinatorics of Genome Rearrangements., , , , and . Computational molecular biology MIT Press, (2009)Towards an Algorithmic Guide to Spiral Galaxies., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 171-182. Springer, (2014)On Finding Small 2-Generating Sets., , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 378-387. Springer, (2009)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)Exemplar Longest Common Subsequence., , , , and . International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 622-629. Springer, (2006)Maximum Motif Problem in Vertex-Colored Graphs., , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 221-235. Springer, (2009)Odd gossiping., , , and . Discret. Appl. Math., (2017)The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph., , and . CoRR, (2017)Algorithms for computing the double cut and join distance on both gene order and intergenic sizes., , and . Algorithms Mol. Biol., 12 (1): 16:1-16:11 (2017)Finding Approximate and Constrained Motifs in Graphs., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 388-401. Springer, (2011)