|
Search the dblp DataBase
Takehiro Ito:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning Trees of Supply and Demand. [Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:612-623 [Conf]
- Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning graphs of supply and demand. [Citation Graph (0, 0)][DBLP] ISCAS (1), 2005, pp:160-163 [Conf]
- 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]
- Takehiro Ito
Partitioning Graphs of Supply and Demand. [Citation Graph (0, 0)][DBLP] WALCOM, 2007, pp:162-179 [Conf]
- 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]
- 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]
- 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]
Route-Enabling Graph Orientation Problems. [Citation Graph (, )][DBLP]
On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. [Citation Graph (, )][DBLP]
Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]
Reconfiguration of List Edge-Colorings in a Graph. [Citation Graph (, )][DBLP]
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. [Citation Graph (, )][DBLP]
Partitioning graphs of supply and demand. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|