( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints.

, , , , , , и . Algorithmica, 85 (9): 2779-2816 (сентября 2023)

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

 

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

Parameterizing Cut Sets in a Graph by the Number of Their Components., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 605-615. Springer, (2009)Algorithms for Finding Distance-Edge-Colorings of Graphs., , , и . COCOON, том 3595 из Lecture Notes in Computer Science, стр. 798-807. Springer, (2005)Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size., , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 365-376. Springer, (2004)Tight Approximability of the Server Allocation Problem for Real-Time Applications., , , , , и . ALGOCLOUD, том 10739 из Lecture Notes in Computer Science, стр. 41-55. Springer, (2017)Minimum-Cost b-Edge Dominating Sets on Trees., , , , и . Algorithmica, 81 (1): 343-366 (2019)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 313-324. Springer, (2019)Shortest Reconfiguration of Perfect Matchings via Alternating Cycles., , , , и . ESA, том 144 из LIPIcs, стр. 61:1-61:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints., , , , , , и . Algorithmica, 85 (9): 2779-2816 (сентября 2023)Generalized rainbow connectivity of graphs., , , и . Theor. Comput. Sci., (2014)Core Challenge 2022: Solver and Graph Descriptions., , и . CoRR, (2022)