( en | de | ru )

 

Disambiguation of "Uno, Takeaki"

Author of the publication

copydeleteadd this publication to your clipboard
Swapping labeled tokens on graphs.

, , , , , , , , , and . Theor. Comput. Sci., (2015)

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

Wolfram Unold

 

Other publications of authors with the same name

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 Dominating Sets for Sparse Graphs., , , and . ISAAC, volume 123 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Probabilistic Prediction of Student Affect from Hand Gestures., , , and . ARCS, page 58-63. ISRST, (2008)Ladder-Lottery Realization., , , and . CCCG, page 61-67. (2018)Optimization algorithm for k-anonymization of datasets with low information loss., and . Int. J. Inf. Sec., 17 (6): 631-644 (2018)A Linear Time Algorithm for Finding a k-Tree Core., and . J. Algorithms, 23 (2): 281-290 (1997)Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)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)