| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-12-10 15:50 |
Fukuoka | Kyushu University | Reconfiguration of List L(2,1)-Labelings in a Graph Takehiro Ito, Kazuto Kawamura (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Xiao Zhou (Tohoku Univ.)  COMP2012-49 |
For an integer $k \ge 0$, suppose that each vertex $v$ of a graph $G$ has a set $C(v) \subseteq \{0,1, \ldots, k\}$ of l... [more] | COMP2012-49 pp.33-40 |
| COMP | 2012-10-31 15:35 |
Miyagi | Tohoku University | On the Complexity of Packing Trominoes Takashi Horiyama (Saitama Univ.), Takehiro Ito (Tohoku Univ.), Keita Nakatsuka (Saitama Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2012-40 |
[more] | COMP2012-40 pp.37-43 |
| COMP | 2012-06-21 16:45 |
Hokkaido | Hokkaido University | Approximation for the Geometric Unique Coverage Problem on Unit Squares Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.) COMP2012-24 |
[more] | COMP2012-24 pp.95-101 |
| COMP | 2012-04-27 14:45 |
Osaka | Osaka Prefecture University | On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2012-6 |
[more] | COMP2012-6 pp.37-43 |
| COMP | 2012-03-16 10:55 |
Tokyo | Univ. of Tokyo | Computational Complexity of Competitive Diffusion on Graphs Hisayuki Satoh, Kei Uchizawa, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-49 |
[more] | COMP2011-49 pp.17-22 |
| COMP | 2011-12-16 11:15 |
Aichi | Nagoya Univ. | Reconfiguration of Vertex Covers in Trees and Cacti Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-39 |
We study the problem of reconfiguring a vertex cover of a graph $G$ into another vertex cover via vertex covers of $G$, ... [more] |
COMP2011-39 pp.25-32 |
| COMP, IPSJ-AL | 2011-09-06 10:25 |
Hokkaido | Hakodate City Central Library | A PTAS for the Subset Sum Reconfiguration Problem Takehiro Ito (Tohoku Univ.), Erik D. Demaine (MIT) COMP2011-22 |
[more] | COMP2011-22 pp.7-14 |
| COMP | 2011-03-09 16:05 |
Tokyo | Chuo Univ. | Reconfiguration of List Edge-Colorings in a Tree Kazuto Kawamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2010-54 |
[more] | COMP2010-54 pp.53-60 |
| COMP | 2010-12-03 15:05 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Minimum Cost Partitions of Trees with Supply and Demand Takehiro Ito, Takuya Hara, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-44 |
[more] | COMP2010-44 pp.37-44 |
| COMP | 2010-09-29 10:35 |
Niigata | Nagaoka Univ. of Tech. | Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings Takehiro Ito, Naoki Sakamoto, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-25 |
[more] | COMP2010-25 pp.9-15 |
| COMP | 2009-06-29 10:35 |
Hokkaido | Hokkaido University | Reconfiguration of List Edge-Colorings in a Graph Takehiro Ito (Tohoku Univ.), Marcin Kaminski (Univ. Libre de Bruxelles), Erik D. Demaine (MIT) COMP2009-19 |
[more] | COMP2009-19 pp.9-16 |
| COMP | 2008-10-10 10:00 |
Miyagi | Tohoku Univ. | On the Complexity of Reconfiguration Problems Takehiro Ito (Tohoku Univ.), Erik D. Demaine, Nicholas J. A. Harvey (MIT), Christos H. Papadimitriou (UC Berkeley), Martha Sideri (AUEB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2008-36 |
Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a pr... [more] | COMP2008-36 pp.17-24 |
| COMP | 2008-10-10 14:30 |
Miyagi | Tohoku Univ. | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41 |
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] | COMP2008-41 pp.55-61 |
| COMP | 2006-10-17 10:25 |
Miyagi | Tohoku University | Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] | COMP2006-33 pp.17-23 |
| RECONF | 2005-09-16 14:30 |
Hiroshima | Discussion on FPGA Implementation of the Extended Euclidean Algorithm over GF(2^m) Takehiro Ito, Yuichiro Shibata, Ryuichi Harasawa, Kiyoshi Oguri (Nagasaki Univ) |
[more] | RECONF2005-50 pp.55-60 |
|
| COMP | 2005-03-18 14:10 |
Tokyo | Tokyo Institute of Technology | Algorithms for Finding Distance-Edge-Colorings of Graphs Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
For a given bounded nonnegative integer $\ell$, we wish to color all edges of a graph $G$ so that any two edges within d... [more] | COMP2004-79 pp.49-55 |
| COMP | 2005-01-28 13:30 |
Aichi | Nagoya University | Partitioning Graphs of Supply and Demand Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Assume that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive integer, ... [more] | COMP2004-66 pp.47-56 |
[Return to Top Page]