( en | de | ru )

 

Disambiguation of "Uno, Takeaki"

Author of the publication

copydeleteadd this publication to your clipboard
Sequentially Swapping Colored Tokens on Graphs.

, , , , , , , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 435-447. Springer, (2017)

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

Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)Optimization algorithm for k-anonymization of datasets with low information loss., and . Int. J. Inf. Sec., 17 (6): 631-644 (2018)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)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)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)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)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)