( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Gourds: A Sliding-Block Puzzle with Turning.

, , , и . ISAAC, том 181 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Yushi Xu

Yushi Shen

Yushi Jing

Uno Pesonen

Petra Unold

 

Другие публикации лиц с тем же именем

Twenty Years of Progress of $JCDCG^3$., , , и . Graphs Comb., 36 (2): 181-203 (2020)On Minimum Edge Ranking Spanning Trees., , и . J. Algorithms, 38 (2): 411-437 (2001)Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , и . FUN, том 49 из LIPIcs, стр. 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Computational complexity and an integer programming model of Shakashaka., , , и . CCCG, Carleton University, Ottawa, Canada, (2013)Web Structure Mining by Isolated Cliques., , и . IEICE Trans. Inf. Syst., 90-D (12): 1998-2006 (2007)Swapping colored tokens on graphs., , , , , , , и . Theor. Comput. Sci., (2018)A tight upper bound on the (2,1)-total labeling number of outerplanar graphs, , , и . CoRR, (2009)Dually conformal hypergraphs., , , и . CoRR, (2023)Approximating the path-distance-width for AT-free graphs and graphs in related classes., , , , , , , и . Discret. Appl. Math., (2014)Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks., , , и . IEICE Trans. Inf. Syst., 105-D (3): 451-458 (2022)