Author of the publication

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs.

, , , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 122-135. Springer, (2019)

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

Exact approaches for scaffolding., , and . BMC Bioinform., 16 (S14): S2 (December 2015)Genome Assembly Using Reinforcement Learning., , , and . BSB, volume 11347 of Lecture Notes in Computer Science, page 16-28. Springer, (2019)Weighted Minimum-Length Rearrangement Scenarios., , and . WABI, volume 143 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Involving repetitive regions in scaffolding improvement., , , , and . J. Bioinform. Comput. Biol., 19 (6): 2140016:1-2140016:15 (2021)Complexity and lowers bounds for Power Edge Set Problem., , , , and . J. Discrete Algorithms, (2018)Efficient assembly consensus algorithms for divergent contig sets., , and . Comput. Biol. Chem., (2021)New Polynomial-Time Algorithm Around the Scaffolding Problem., , , and . AlCoB, volume 11488 of Lecture Notes in Computer Science, page 25-38. Springer, (2019)Linearizing Genomes: Exact Methods and Local Search., , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 505-518. Springer, (2020)Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs., , , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 122-135. Springer, (2019)New Results About the Linearization of Scaffolds Sharing Repeated Contigs., , , , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 94-107. Springer, (2018)