Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20231024 13:30 
Aichi 
Nagoya Univ. Venture Business Lab. 
An algorithm for the secure total domination problem in proper interval graphs Toru Araki, Yasufumi Aita (Gunma Univ.) COMP202311 
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] 
COMP202311 pp.18 
COMP 
20230302 14:45 
Tokyo 
Ochanomizu University 
Correcting the algorithm for a minimum secure dominating set of proper interval graphs Toru Araki, Ryuya Saito (Gunma Univ.) COMP202236 
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289293... [more] 
COMP202236 pp.1620 
COMP, IPSJAL 
20210507 17:10 
Online 
Online 
A selfstabilizing 1minimal independent dominating set algorithm based on loop composition Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP20214 
We consider the 1minimal independent dominating set (1MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] 
COMP20214 pp.2330 
COMP 
20200301 11:30 
Tokyo 
The University of ElectroCommunications (Cancelled but technical report was issued) 
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga (Chuo Univ.) COMP201948 
The problem of finding a minimumweight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] 
COMP201948 p.23 
COMP 
20181212 17:25 
Miyagi 
Tohoku University 
Distance 2domination number of Hypercubes Nana Kawamura, Yosuke Kikuchi (NIT, Tsuyama College) COMP201842 
A dominating set is a subset of vertices of a graph such that any vertex is adjacent to a vertex in the dominating set o... [more] 
COMP201842 pp.6972 
ISEC, COMP 
20171222 14:40 
Kochi 
Eikokuji Campus, Kochi University of Technology 
Efficient Enumeration of Dominating Sets in KDegenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC201789 COMP201743 
A dominating set is one of the fundamental graph structure, like clique, independent set, st path, and cut. It is known... [more] 
ISEC201789 COMP201743 pp.111117 
COMP 
20170818 15:55 
Aomori 

Secure Domination in Proper Interval Graphs Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP201718 
A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for eac... [more] 
COMP201718 pp.4146 
NS, IN (Joint) 
20170302 11:00 
Okinawa 
OKINAWA ZANPAMISAKI ROYAL HOTEL 
A design method of work place capacity using minimum dominating set in server migration service Itsuho Goda, Yukinobu Fukushima (Okayama Univ.), Tutomu Murase (Nagoya Univ.), Tokumi Yokohira (Okayama Univ.) NS2016170 
In server migration service (SMS), computers called work places (WPs) are deployed at various locations in a network, an... [more] 
NS2016170 pp.7782 
IT, SIP, RCS 
20170120 10:00 
Osaka 
Osaka City Univ. 
A Group Theoretic Approach to RankModulation Rewriting Codes with Multicell Ranking and its Applications Takeru Sudo, Tomoharu Shibuya (Sophia Univ) IT201686 SIP2016124 RCS2016276 
In this paper, we propose a group theoretic representation suitable for the rankmodulation rewriting codes for flash me... [more] 
IT201686 SIP2016124 RCS2016276 pp.231236 
RCS, IT, SIP 
20160118 14:05 
Osaka 
Kwansei Gakuin Univ. Osaka Umeda Campus 
A contents distribution scheme based on domatic partition of ad hoc networks Takahiro Oshima, Tadashi Wadayama (NIT) IT201565 SIP201579 RCS2015297 
In this paper, we propose contents distribution protocols for wireless ad hoc networks.
In our scenario, a base statio... [more] 
IT201565 SIP201579 RCS2015297 pp.101106 
COMP 
20150423 13:10 
Miyagi 

Algorithms for Dominating Set Reconfiguration Problem Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo) COMP20151 
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$
whose cardinalities are at most a given th... [more] 
COMP20151 pp.17 
IPSJAVM, CS, IE, ITEBCT [detail] 
20141205 10:30 
Osaka 
Osaka University Nakanoshima Center 
Virtual Backbone Construction with Directional Anntennas Kazuya Sakai (TMU) CS201480 IE201466 
Connected dominating set (CDS) is widely used as a virtual backbone in ad hoc networks. Constructing a CDS in a network ... [more] 
CS201480 IE201466 pp.5760 
IN 
20141017 13:25 
Osaka 
Osaka Univ. 
Short Survey on Virtual Backbone Construction in Mobile Ad Hoc Networks Kazuya Sakai (TMU) IN201479 
The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad hoc networks. In the past, many CDS... [more] 
IN201479 pp.3134 
CAS, SIP, MSS, VLD, SIS [detail] 
20140709 13:40 
Hokkaido 
Hokkaido University 
Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS201410 VLD201419 SIP201431 MSS201410 SIS201410 
An orthogonal ray graph is an intersection graph of horizontal rays (closed halflines) and vertical rays in the plane. ... [more] 
CAS201410 VLD201419 SIP201431 MSS201410 SIS201410 pp.4548 
COMP 
20140424 14:20 
Miyagi 
Tohoku University 
Reconfiguration of Dominating Sets Akira Suzuki (Tohoku Univ.), Amer Mouawad, Naomi Nishimura (Univ. of Waterloo) COMP20145 
We explore a reconfiguration version of the dominating set problem,
where a dominating set in a graph $G$ is a set $S... [more] 
COMP20145 pp.2935 
COMP 
20131220 11:25 
Okinawa 
Okinawa Industry Support Center 
An empirical study for independent distance dominating sets in largescale graphs Hiroshi Kadowaki, Liang Zhao (Kyoto Univ.), Dorothea Wagner (Karlsruhe Inst. of Tech.) COMP201342 
This paper studies the scaling behavior of the size of a minimum independent distance dominating set (MIDDS) in largesc... [more] 
COMP201342 pp.2731 
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 
IT, ISEC, WBS 
20130307 15:05 
Osaka 
Kwansei Gakuin Univ., OsakaUmeda Campus 
Construction of Minimal dominating set for the Rank Modulation based on the Compressed Encoding Yuya Kanbayashi, Tomoharu Shibuya (Sophia Univ.) IT201279 ISEC201297 WBS201265 
Rank Modulation code is a recoding code expressing information by using the mutual relation between the level of electri... [more] 
IT201279 ISEC201297 WBS201265 pp.113118 
COMP 
20110422 14:30 
Kyoto 
Kyoto University 
Reconstructing sets from distances given by graphs Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.) COMP20117 
Given $n$ points in some Euclidean space, $\binom{n}{2}$ pairwise distances among the points can be easily calculated.
... [more] 
COMP20117 pp.4954 
COMP 
20101203 16:35 
Fukuoka 
Kyutech Plaza, Kyushu Institute of Technology 
Maximum Domination Problem Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP201046 
We consider new variants of the vertex/edge domination
problems on graphs. A vertex is said to {\em dominate} itself an... [more] 
COMP201046 pp.5360 