| 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 | 2018-12-12 10:25 |
Miyagi | Tohoku University | Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.)  COMP2018-32 |
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] | COMP2018-32 pp.7-14 |
| COMP | 2014-10-08 11:20 |
Tokyo | Chuo University | Algorithms for the Minimum Vulnerability Problem Yusuke Aoki (Tohoku Univ.), Bjarni V. Halldorsson, Magnus M. Halldorsson (Reykjavik Univ.), Takehiro Ito (Tohoku Univ.), Christian Konrad (Reykjavik Univ.), Xiao Zhou (Tohoku Univ.) COMP2014-27 |
[more] | COMP2014-27 pp.9-15 |
| COMP | 2014-10-08 14:45 |
Tokyo | Chuo University | Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29 |
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] | COMP2014-29 pp.19-24 |
| COMP, IPSJ-AL | 2014-06-13 13:55 |
Ehime | Matsuyama, Ehime | The Independent Feedback Vertex Set Problem Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-8 |
[more] | COMP2014-8 pp.13-18 |
| COMP, IPSJ-AL | 2013-05-18 09:55 |
Hokkaido | Otaru University of Commerce | Complexity of Counting Output Patterns of Logic Circuits Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.) COMP2013-14 |
Let $C$ be a logic circuit consisting of $s$ gates $g_1, g_2, dots , g_s$, then the output pattern of $C$ for an input... [more] |
COMP2013-14 pp.97-102 |
| 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-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 10:45 |
Aichi | Nagoya Univ. | Algorithms for Bandwidth Consecutive Multicolorings of Graphs Kazuhide Nishikawa, Takao Nishizeki (Kwansei Gakuin Univ.), Xiao Zhou (Tohoku Univ.) COMP2011-38 |
[more] | COMP2011-38 pp.17-24 |
| 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 | 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 11:05 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Energy-Efficient Threshold Circuits Computing Mod Functions Akira Suzuki, Kei Uchizawa, Xiao Zhou (Tohoku Univ.) COMP2010-40 |
We prove that the modulus function MOD$_m$ of $n$ variables can be computed by a threshold circuit $C$ of energy $e$ a... [more] |
COMP2010-40 pp.7-13 |
| 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-10-16 10:35 |
Miyagi | Tohoku University | Small Grid Drawings of Planar Graphs with Balanced Bipartition Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33 |
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] | COMP2009-33 pp.9-15 |
| 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 |
| COMP | 2005-10-18 09:35 |
Miyagi | Tohoku Univ. | Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends Xiao Zhou, Takao Nishizeki (Touhoku Univ.) |
[more] | COMP2005-37 pp.7-14 |
| 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]