( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sequentially Swapping Colored Tokens on Graphs.

, , , , , , , , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 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.

Hiroki Kawamura

Hiroshi Kawamura

Katsutoshi Kawamura

Eisuke Kawamura

Eiko Kawamura

 

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

Morpion Solitaire 5D: a new upper bound 121 on the maximum score., , , , и . CCCG, Carleton University, Ottawa, Canada, (2013)Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs., и . CoRR, (2018)Weight Balancing on Boundaries and Skeletons., , , , , , , , , и 3 other автор(ы). SoCG, стр. 436. ACM, (2014)Proof of the Density Threshold Conjecture for Pinwheel Scheduling.. STOC, стр. 1816-1819. ACM, (2024)A lower bound on opaque sets., , , и . CoRR, (2014)Distance k-Sectors Exist, , , , и . CoRR, (2009)Average-Case Polynomial-Time Computability of Hamiltonian Dynamics., , и . MFCS, том 117 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Computational Complexity of Smooth Differential Equations., , , и . Logical Methods in Computer Science, (2014)Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling., и . CIAC, том 9079 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2015)On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity., и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 348-359. Springer, (2014)