Author of the publication

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.

, and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 724-737. Springer, (2005)

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

Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , and . Theor. Comput. Sci., (2021)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 724-737. Springer, (2005)Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph., , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 150-161. Springer, (2017)Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 483-494. Springer, (2011)Single versus Multiple Sorting in All Pairs Similarity Search., , , and . ACML, volume 13 of JMLR Proceedings, page 145-160. JMLR.org, (2010)Counting the number of independent sets in chordal graphs., , and . J. Discrete Algorithms, 6 (2): 229-242 (2008)Enumeration of Perfect Sequences of Chordal Graph., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 859-870. Springer, (2008)Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 435-447. Springer, (2017)