The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Takehiro Ito: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takehiro Ito, Itsuo Takanami
    On fault injection approaches for fault tolerance of feedforward neural networks. [Citation Graph (0, 0)][DBLP]
    Asian Test Symposium, 1997, pp:88-93 [Conf]
  2. Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:63-72 [Conf]
  3. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for Finding Distance-Edge-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:798-807 [Conf]
  4. Takehiro Ito, Takao Nishizeki, Xiao Zhou
    Algorithms for the Multicolorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:430-439 [Conf]
  5. Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri
    Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA. [Citation Graph (0, 0)][DBLP]
    FPL, 2004, pp:911-916 [Conf]
  6. Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    Approximability of Partitioning Graphs with Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:121-130 [Conf]
  7. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning Trees of Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:612-623 [Conf]
  8. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning graphs of supply and demand. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:160-163 [Conf]
  9. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:365-376 [Conf]
  10. Takehiro Ito
    Partitioning Graphs of Supply and Demand. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:162-179 [Conf]
  11. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning trees of supply and demand. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:803-827 [Journal]
  12. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:304-322 [Journal]
  13. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:142-154 [Journal]

  14. Route-Enabling Graph Orientation Problems. [Citation Graph (, )][DBLP]


  15. On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]


  16. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. [Citation Graph (, )][DBLP]


  17. Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]


  18. Reconfiguration of List Edge-Colorings in a Graph. [Citation Graph (, )][DBLP]


  19. Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. [Citation Graph (, )][DBLP]


  20. Partitioning graphs of supply and demand. [Citation Graph (, )][DBLP]


Search in 0.028secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002