( en | de | ru )

 

Disambiguation of "Ito, Takehiro"

Author of the publication

copydeleteadd this publication to your clipboard
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

, , , , , , , , and . SODA, page 1342-1355. SIAM, (2022)

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

Hisao Ito

 

Other publications of authors with the same name

Minimum-Cost b-Edge Dominating Sets on Trees., , , , and . Algorithmica, 81 (1): 343-366 (2019)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)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)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)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 313-324. Springer, (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)Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints., , , , , , and . Algorithmica, 85 (9): 2779-2816 (September 2023)Generalized rainbow connectivity of graphs., , , and . Theor. Comput. Sci., (2014)