PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Uno, Yushi"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Reconfiguration Problems.

, , , , , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 28-39. Springer, (2008)

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.

No persons found for author name Uno, Yushi
add a person with the name Uno, Yushi
 

Other publications of authors with the same name

Laminar structure of ptolemaic graphs with applications., and . Discrete Applied Mathematics, 157 (7): 1533-1543 (2009)Folding a Paper Strip to Minimize Thickness., , , , , , and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 113-124. Springer, (2015)On Complexity of Flooding Games on Graphs with Interval Representations., , , , and . TJJCCGG, volume 8296 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)., , , , , , , , , and 5 other author(s). JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 60-72. Springer, (2015)A Linear Time Algorithm for L(2, 1)-Labeling of Trees., , , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 35-46. Springer, (2009)The (p, q)-total Labeling Problem for Trees., , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 49-60. Springer, (2010)Web Structure Mining by Isolated Cliques., , and . IEICE Transactions, 90-D (12): 1998-2006 (2007)Computational complexity and an integer programming model of Shakashaka., , , and . CCCG, Carleton University, Ottawa, Canada, (2013)Swapping Colored Tokens on Graphs., , , , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 619-628. Springer, (2015)Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , and . FUN, volume 49 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)