( en | de | ru )

 

Disambiguation of "Ito, Takehiro"

Author of the publication

copydeleteadd this publication to your clipboard
Diameter of Colorings Under Kempe Changes.

, , , , , , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 52-64. Springer, (2019)

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

Takao Ito

Akio Ito

Takuro Ito

 

Other publications of authors with the same name

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)Algorithms for Finding Distance-Edge-Colorings of Graphs., , , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 798-807. Springer, (2005)Tight Approximability of the Server Allocation Problem for Real-Time Applications., , , , , and . ALGOCLOUD, volume 10739 of Lecture Notes in Computer Science, page 41-55. Springer, (2017)Generalized rainbow connectivity of graphs., , , and . Theor. Comput. Sci., (2014)Core Challenge 2022: Solver and Graph Descriptions., , and . CoRR, (2022)Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints., , , , , , and . Algorithmica, 85 (9): 2779-2816 (September 2023)Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs., , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 228-240. Springer, (2017)Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs., , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 286-295. Springer, (2020)Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability., , , , , and . ICTAI, page 294-302. IEEE, (2023)