( en | de | ru )

 

Disambiguation of "Uno, Takeaki"

Author of the publication

copydeleteadd this publication to your clipboard
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.

, , , , and . CoRR, (2014)

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.

Uno Pesonen

Petra Unold

Uno Kaur

Denzo Uno

Heiko Unold

 

Other publications of authors with the same name

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)Ladder-Lottery Realization., , , and . CCCG, page 61-67. (2018)Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)A Linear Time Algorithm for Finding a k-Tree Core., and . J. Algorithms, 23 (2): 281-290 (1997)An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence., and . J. Comb. Optim., 13 (3): 243-262 (2007)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)Single versus Multiple Sorting in All Pairs Similarity Search., , , and . ACML, volume 13 of JMLR Proceedings, page 145-160. JMLR.org, (2010)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)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)