( en | de | ru )

 

Disambiguation

From post

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

, , , , , , , , , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 364-375. Springer, (2014)

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.

Takehiro Tawara

Nobutaka Ito

Takao Ito

Akio Ito

Hisao Ito

 

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

Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 313-324. Springer, (2019)Fixed-Parameter Tractability of Token Jumping on Planar Graphs., , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 208-219. Springer, (2014)Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs., , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 228-240. Springer, (2017)Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs., , и . WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 286-295. Springer, (2020)Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability., , , , , и . ICTAI, стр. 294-302. IEEE, (2023)Swapping Labeled Tokens on Graphs., , , , , , , , , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 364-375. Springer, (2014)Parameterizing Cut Sets in a Graph by the Number of Their Components., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 605-615. Springer, (2009)Minimum-Cost b-Edge Dominating Sets on Trees., , , , и . Algorithmica, 81 (1): 343-366 (2019)Core Challenge 2022: Solver and Graph Descriptions., , и . CoRR, (2022)Tight Approximability of the Server Allocation Problem for Real-Time Applications., , , , , и . ALGOCLOUD, том 10739 из Lecture Notes in Computer Science, стр. 41-55. Springer, (2017)