( en | de | ru )

 

Disambiguation of "Ito, Takehiro"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial-Time Algorithm for Sliding Tokens on Trees.

, , , , , , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 389-400. 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. You can also use the button next to the name to display some publications already assigned to the person.

Takehiro Tawara

Nobutaka Ito

Akio Ito

Takao Ito

Hisao Ito

 

Other publications of authors with the same name

Algorithms for Finding Distance-Edge-Colorings of Graphs., , , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 798-807. Springer, (2005)Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 365-376. Springer, (2004)Partitioning trees of supply and demand., , and . Int. J. Found. Comput. Sci., 16 (4): 803-827 (2005)Complexity of Reconfiguration Problems for Constraint Satisfaction., , and . CoRR, (2018)Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)Incremental Optimization of Independent Sets under Reachability Constraints., , , and . CoRR, (2018)Parameterizing Cut Sets in a Graph by the Number of Their Components., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2., , and . Electron. Notes Discret. Math., (2009)Shortest Reconfiguration of Perfect Matchings via Alternating Cycles., , , , and . ESA, volume 144 of LIPIcs, page 61:1-61:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 313-324. Springer, (2019)