PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Ito, Takehiro"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterizing cut sets in a graph by the number of their components.

, , , and . Theor. Comput. Sci., 412 (45): 6340-6350 (2011)

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.

No persons found for author name Ito, Takehiro
add a person with the name Ito, Takehiro
 

Other publications of authors with the same name

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range., , , , and . Algorithmica, 62 (3-4): 823-841 (2012)Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete., , , , and . CCCG, page 211-216. (2012)On disconnected cuts and separators., , , and . Discrete Applied Mathematics, 159 (13): 1345-1351 (2011)On the complexity of reconfiguration problems., , , , , , and . Theor. Comput. Sci., 412 (12-14): 1054-1065 (2011)Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size., , , and . IEICE Transactions, 90-D (2): 449-456 (2007)Partitioning Graphs of Supply and Demand.. WALCOM, page 162-179. Bangladesh Academy of Sciences (BAS), (2007)Partitioning graphs of supply and demand., , and . ISCAS (1), page 160-163. IEEE, (2005)The complexity of dominating set reconfiguration., , , , , , and . Theor. Comput. Sci., (2016)Minimum Cost Partitions of Trees with Supply and Demand., , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 351-362. Springer, (2010)Complexity of Coloring Reconfiguration under Recolorability Constraints., , , and . ISAAC, volume 92 of LIPIcs, page 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)