|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 17 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou |
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Kazuto Kawamura, Xiao Zhou |
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. |
IEICE Transactions |
2012 |
DBLP BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Parameterizing cut sets in a graph by the number of their components. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno |
On the complexity of reconfiguration problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki |
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
On disconnected cuts and separators. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Erik D. Demaine |
Approximability of the Subset Sum Reconfiguration Problem. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Kazuto Kawamura, Xiao Zhou |
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou |
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki |
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki |
Minimum Cost Partitions of Trees with Supply and Demand. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, W. Sean Kennedy, Bruce A. Reed |
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning graphs of supply and demand. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Erik D. Demaine |
Reconfiguration of List Edge-Colorings in a Graph. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
Route-Enabling Graph Orientation Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Parameterizing Cut Sets in a Graph by the Number of Their Components. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki |
Approximability of partitioning graphs with supply and demand. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno |
On the Complexity of Reconfiguration Problems. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki |
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki |
Algorithms for finding distance-edge-colorings of graphs. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito |
Partitioning Graphs of Supply and Demand. |
WALCOM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki |
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki |
Approximability of Partitioning Graphs with Supply and Demand. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning trees of supply and demand. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning graphs of supply and demand. |
ISCAS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki |
Algorithms for Finding Distance-Edge-Colorings of Graphs. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri |
Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA. |
FPL |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Takao Nishizeki, Xiao Zhou |
Algorithms for the Multicolorings of Partial k-Trees. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
Partitioning Trees of Supply and Demand. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS |
| 1 | Takehiro Ito, Itsuo Takanami |
On fault injection approaches for fault tolerance of feedforward neural networks. |
Asian Test Symposium |
1997 |
DBLP DOI BibTeX RDF |
snapping faults, learning cycle, ditribution of correlations, output neuron, fault tolerance, reliabilities, fault injection, stuck-at faults, computer simulation, learning algorithm, feedforward neural networks, feedforward neural nets, recognition rate, learning methods, internal structure |
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")