Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
SIS 
20191213 11:05 
Okayama 
Okayama University of Science 
Improvement of Grayscale Conversion Method Using Vertex Coloring Algorithm Siwen Zhang, Go Tanaka (Nagoya City Univ.) SIS201934 
Identical gray level is assigned to pixels which have same lightness in usual grayscale conversion and these pixels cann... [more] 
SIS201934 pp.5760 
QIT (2nd) 
20191118 13:50 
Tokyo 
Gakushuin University 
[Poster Presentation]
Localization phenomena in constrained quantum annealing Kazue Kudo (Ochanomizu Univ.) 
Quantum annealing is known as a quantummechanical approach for optimization problems. Constrained quantum annealing is ... [more] 

ICTSSL, IN 
20191017 10:00 
Oita 

Graph coloring considering release of communication channels and the upper bounds of the number of channels Hiroshi Tamura, Hiromu Narita (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL201916 IN201930 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL201916 IN201930 pp.14 
COMP 
20190902 11:25 
Okayama 
Tsushima Campus, Okayama University 
Speedingup of Construction Algorithms for the Graph Coloring Problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP201911 
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] 
COMP201911 pp.714 
ICTSSL 
20190717 10:25 
Aomori 
Aomori Tourist Information Center, ASPAM 
On the realization of Grundy number on minimizing the number of vertices or edges of graphs(Second report) Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL201913 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL201913 pp.2328 
ICTSSL 
20190530 15:50 
Hokkaido 
HOKKAIDO CHUSYO KIGYO KAIKAN 
On the realization of Grundy number on minimizing the number of vertices or edges of graphs Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL20193 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL20193 pp.1116 
QIT (2nd) 
20190521 16:10 
Fukuoka 
Kyushu University, Chikushi Campus 
ExponentialTime Quantum Algorithm for Graph Coloring Problem Kazuya Shimizu, Ryuhei Mori (TiTech) 
In this work, we show an exponentialtime quantum algorithm for the graph kcoloring problem, which is one of the wellk... [more] 

SIS 
20190307 11:55 
Tokyo 
Tokyo Univ. Science, Katsushika Campus 
Expansion of Grayscale Conversion Method Using Vertex Coloring Algorithm Siwen Zhang, Go Tanaka (Nagoya City Univ.) SIS201850 
Identical gray level is assigned to regions which have same lightness in usual grayscale conversion and these regions ca... [more] 
SIS201850 pp.7174 
COMP 
20181212 10:25 
Miyagi 
Tohoku University 
LinearTime Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP201832 
{sc Coloring reconfiguration} is one of the most wellstudied reconfiguration problems. In the problem, we are given two... [more] 
COMP201832 pp.714 
IN, ICTSSL, NWS (Joint) [detail] 
20181019 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.) ICTSSL201829 IN201846 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL201829 IN201846 pp.1923 
ICTSSL 
20180718 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.) ICTSSL201820 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL201820 pp.2327 
AI 
20180702 10:25 
Hokkaido 

Solving Constraint Satisfaction Problems Using Ant Colony Optimization with MultiPheromones Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI20182 
Ant colony optimization, ACO, is one of the metaheuristics. ACO has been effective to solve constraint satisfaction pro... [more] 
AI20182 pp.710 
ICTSSL 
20160615 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.) ICTSSL201615 
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is wellkno... [more] 
ICTSSL201615 pp.8590 
COMP 
20141008 14:45 
Tokyo 
Chuo University 
Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP201429 
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] 
COMP201429 pp.1924 
VLD 
20140304 14:40 
Okinawa 
Okinawa Seinen Kaikan 
SelfAligned Double and Quadruple PatterningAware Grid Routing Chikaaki Kodama (Toshiba), Hirotaka Ichikawa (Toshiba Microelectronics), Fumiharu Nakajima, Koichi Nakayama, Shigeki Nojima, Toshiya Kotani (Toshiba) VLD2013151 
SelfAligned Double and Quadruple Patterning (SADP, SAQP) are leading candidates for sub$20~nm$ and sub$14~nm$ node an... [more] 
VLD2013151 pp.99104 
MSS, CAS, IPSJAL [detail] 
20131107 09:55 
Iwate 

A Note on TwoDirectional Orthogonal Ray Graphs and Related Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS201365 MSS201344 
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (halflines) in the plane. An orthogona... [more] 
CAS201365 MSS201344 pp.99104 
SIS 
20130613 13:55 
Kagoshima 
Houzan Hall (Kagoshima) 
A Proposal of Grayscale Conversion Using Vertex Coloring Algorithm Go Tanaka (Nagoya City Univ.) SIS20135 
Adjacent isolightness regions are converted into identical graylevel by the existing lightnessbased method and it is ... [more] 
SIS20135 pp.2326 
COMP 
20130318 14:10 
Gifu 
Gifu University 
A note on lower bounds of the girth of planar C_7colorable graphs Tatsuo Asano, Akihiro Uejima (Osaka ElectroComm. Univ.) COMP201257 
This report considers the $C_{2k+1}$coloring problem, which is a subproblem for the $n/k$coloring problem,
where $n,... [more] 
COMP201257 pp.3138 
CAS 
20130128 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.) CAS201275 
Ad hoc networks consist of mobile tereminals with personal communication devices. Each terminal can receive a message fr... [more] 
CAS201275 pp.5358 
COMP 
20120316 13:35 
Tokyo 
Univ. of Tokyo 
Parameterized complexity of coloring comparabilityke graphs Atsuhsi Saito, Yasuhiko Takenaga (UEC) COMP201151 
$\mathcal{F}ke$ graphs is a class of graphs obtained by deleting at most $k$ edges from a graph in graph class $\mathca... [more] 
COMP201151 pp.3138 