( en | de | ru )

 

Disambiguation of "Uno, Yushi"

Author of the publication

copydeleteadd this publication to your clipboard
Eliminating Crossings in Ordered Graphs

, , , , , , and . Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24), volume of LIPIcs, Schloss Dagstuhl -- Leibniz-Institut für Informatik, (2024)To appear..

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.

Yushi Xu

Yushi Shen

Yushi Jing

Uno Pesonen

Petra Unold

 

Other publications of authors with the same name

Swapping colored tokens on graphs., , , , , , , and . Theor. Comput. Sci., (2018)A tight upper bound on the (2,1)-total labeling number of outerplanar graphs, , , and . CoRR, (2009)Dually conformal hypergraphs., , , and . CoRR, (2023)Approximating the path-distance-width for AT-free graphs and graphs in related classes., , , , , , , and . Discret. Appl. Math., (2014)Laminar structure of ptolemaic graphs with applications., and . Discret. Appl. Math., 157 (7): 1533-1543 (2009)On Computing Longest Paths in Small Graph Classes., and . Int. J. Found. Comput. Sci., 18 (5): 911-930 (2007)Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks., , , and . IEICE Trans. Inf. Syst., 105-D (3): 451-458 (2022)Gourds: A Sliding-Block Puzzle with Turning., , , and . ISAAC, volume 181 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)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 für Informatik, (2016)Computational complexity and an integer programming model of Shakashaka., , , and . CCCG, Carleton University, Ottawa, Canada, (2013)