| 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 # | |
| SIS | 2019-03-07 11:55 |
Tokyo | Tokyo Univ. Science, Katsushika Campus | Expansion of Grayscale Conversion Method Using Vertex Coloring Algorithm Siwen Zhang, Go Tanaka (Nagoya City Univ.)  SIS2018-50 |
Identical gray level is assigned to regions which have same lightness in usual grayscale conversion and these regions ca... [more] | SIS2018-50 pp.71-74 |
| 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 |
| IN, ICTSSL, NWS (Joint) [detail] |
2018-10-19 10:35 |
Kagawa | Takamatsu Shoko Kaigisyo Kaikan | On some results on Grundy Coloring of graphs Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2018-29 IN2018-46 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] | ICTSSL2018-29 IN2018-46 pp.19-23 |
| ICTSSL | 2018-07-18 09:00 |
Tokyo | NTT Musashino R&D Center | Relationship between graph coloring and channel assignment in wireless communication Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2018-20 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] | ICTSSL2018-20 pp.23-27 |
| AI | 2018-07-02 10:25 |
Hokkaido | Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2 |
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] | AI2018-2 pp.7-10 |
|
| ICTSSL | 2016-06-15 13:50 |
Miyagi | Tohoku University | On the number of channels in wireless networks from the standpoint of graph colorings Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2016-15 |
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] | ICTSSL2016-15 pp.85-90 |
| 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 |
| VLD | 2014-03-04 14:40 |
Okinawa | Okinawa Seinen Kaikan | Self-Aligned Double and Quadruple Patterning-Aware Grid Routing Chikaaki Kodama (Toshiba), Hirotaka Ichikawa (Toshiba Microelectronics), Fumiharu Nakajima, Koichi Nakayama, Shigeki Nojima, Toshiya Kotani (Toshiba) VLD2013-151 |
Self-Aligned Double and Quadruple Patterning (SADP, SAQP) are leading candidates for sub-$20~nm$ and sub-$14~nm$ node an... [more] | VLD2013-151 pp.99-104 |
| MSS, CAS, IPSJ-AL [detail] | 2013-11-07 09:55 |
Iwate | A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44 |
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] | CAS2013-65 MSS2013-44 pp.99-104 |
|
| SIS | 2013-06-13 13:55 |
Kagoshima | Houzan Hall (Kagoshima) | A Proposal of Grayscale Conversion Using Vertex Coloring Algorithm Go Tanaka (Nagoya City Univ.) SIS2013-5 |
Adjacent iso-lightness regions are converted into identical gray-level by the existing lightness-based method and it is ... [more] | SIS2013-5 pp.23-26 |
| COMP | 2013-03-18 14:10 |
Gifu | Gifu University | A note on lower bounds of the girth of planar C_7-colorable graphs Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-57 |
This report considers the $C_{2k+1}$-coloring problem, which is a subproblem for the $n/k$-coloring problem, where $n,... [more] |
COMP2012-57 pp.31-38 |
| CAS | 2013-01-28 14:30 |
Oita | Beppu International Convention Center | Evaluation of edge coloring for channel assignment in wireless networks Yusuke Ashida, Hiroshi Tamura (Chuo Univ.), Shoji Shinoda (Waseda Univ.) CAS2012-75 |
Ad hoc networks consist of mobile tereminals with personal communication devices. Each terminal can receive a message fr... [more] | CAS2012-75 pp.53-58 |
| COMP | 2012-03-16 13:35 |
Tokyo | Univ. of Tokyo | Parameterized complexity of coloring comparability-ke graphs Atsuhsi Saito, Yasuhiko Takenaga (UEC) COMP2011-51 |
$\mathcal{F}-ke$ graphs is a class of graphs obtained by deleting at most $k$ edges from a graph in graph class $\mathca... [more] | COMP2011-51 pp.31-38 |
| CAS, CS, SIP | 2012-03-09 14:45 |
Niigata | The University of Niigata | Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta Koshin, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-145 SIP2011-165 CS2011-137 |
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] | CAS2011-145 SIP2011-165 CS2011-137 pp.213-218 |
| MSS | 2009-01-30 09:30 |
Kanagawa | Kanagawa Industrial Promotion Center | VNS-based Enhancing of a Distributed Branch-and-Bound Algorithm ParaBSC for the Graph Coloring Problem Yukihiro Dougo, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-52 |
Given an undirected graph $G$, a coloring is an assignment of colors to vertices of $G$ such that any pair of adjacent... [more] |
CST2008-52 pp.61-66 |
| COMP | 2008-05-13 13:55 |
Fukuoka | Kyushu Sangyo University | NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11 |
This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] | COMP2008-11 pp.25-32 |
| COMP | 2008-05-13 15:55 |
Fukuoka | Kyushu Sangyo University | An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14 |
An $L(2,1)$-labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ to the set of nonnegative integers... [more] |
COMP2008-14 pp.43-50 |
| PRMU, IE | 2008-03-11 11:00 |
Ishikawa | * Shinichiro Miyaoka (Tokyo Univ. of Tech.) IE2007-316 PRMU2007-300 |
For coloring point cloud data acquired by a laser mirror scanner, we propose a coloring method using photographic images... [more] | IE2007-316 PRMU2007-300 pp.349-354 |
|
| CAS | 2008-01-31 13:25 |
Okinawa | Enhancing Algorithms for the Graph Coloring Problem Shinji Okada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-85 |
Coloring a given graph $G=(V,E)$ is to assign each vertex $v$ of $V$ a color $c(v)$ such that $c(u)$ is different from $... [more] | CAS2007-85 pp.7-12 |
|
| CAS | 2008-01-31 13:50 |
Okinawa | The constitution method of planar graphs existing between hierarchy structure for n/k-colorings Yuya Iguchi, Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) CAS2007-86 |
The typical vertex n-colorings have trivial inclusion relations of classes of n-colorable graphs for the escalating numb... [more] | CAS2007-86 pp.13-18 |
|
[Return to Top Page]