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 
NC, IBISML, IPSJBIO, IPSJMPS [detail] 
20210628 15:20 
Online 
Online 
Predictive Graph Mining using Graphs with Interval Attributes Hinata Asahi, Masayuki Karasuyama (NIT) NC20216 IBISML20216 
Graphs have been widely used to represent structured data such as molecular data and traffic networks. In this paper, we... [more] 
NC20216 IBISML20216 pp.3946 
SP, EA, SIP 
20200303 09:00 
Okinawa 
Okinawa Industry Support Center (Cancelled but technical report was issued) 
[Poster Presentation]
Comparison of Neural Network Models for Detection of Spatiotemporal Abnormal Intervals in Epileptic EEG Kosuke Fukumori (TUAT), Noboru Yoshida (Juntendo Univ.), Toshihisa Tanaka (TUAT) EA2019156 SIP2019158 SP2019105 
Epilepsy is a chronic brain disease, and the detection of abnormal waveforms by scalp electroencephalography (EEG) is an... [more] 
EA2019156 SIP2019158 SP2019105 pp.319323 
COMP 
20190902 16:00 
Okayama 
Tsushima Campus, Okayama University 
Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP201916 
This research proposes algorithms that construct compressed data
structures, called zerosuppressed binary decision dia... [more] 
COMP201916 p.33 
COMP 
20190318 09:55 
Tokyo 
The University of Tokyo 
* Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP201844 
(To be available after the conference date) [more] 
COMP201844 pp.916 
MBE, NC (Joint) 
20180313 10:25 
Tokyo 
KikaiShinkoKaikan Bldg. 
Estimation of sleep position change and sleep stages using sheettype vibration sensors Megumi Nakamura, Shion Yamagata, Takamasa Yoshida, Nobuyuki Terada (Toyo Univ.) MBE201790 
To easily estimate sleep position change and sleep stages on the bed, we measured physical vibrations using sheettype v... [more] 
MBE201790 pp.5760 
COMP 
20171027 15:50 
Tokyo 

Exploration of dynamic tori by mobile agents Tsuyoshi Gotoh, Yuichi Sudo (Osaka Univ), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP201725 
Mobile agents (agents) are entities which can move autonomously in a networked system and execute actions at nodes they ... [more] 
COMP201725 pp.3744 
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 
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 
COMP 
20140424 10:20 
Miyagi 
Tohoku University 
Thin strip graphs Yota Otachi (JAIST), Akitoshi Kawamura (Univ. of Tokyo), Hidehiro Shinohara (Tohoku Univ.), Takashi Hayashi, Koichi Yamazaki (Gunma Univ.) COMP20141 
A unit disk graph is a emph{$c$strip graph} if it has a unit disk representation in which all centers of the unit disks... [more] 
COMP20141 pp.14 
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 
COMP 
20101015 14:40 
Miyagi 
Tohoku Univ. 
Bipartite powers of interval bigraphs Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP201036 
The notion of graph powers is a wellstudied topic in graph theory and its applications. In this paper, we investigate a... [more] 
COMP201036 pp.3539 
COMP 
20070920 13:50 
Aichi 

Bandwidth of Bipartite Permutation Graphs Ryuhei Uehara (JAIST) COMP200736 
The bandwidth problem is to find a linear layout of vertices in a graph
in such way that minimizes the maximum distance... [more] 
COMP200736 pp.2934 
COMP 
20070629 14:15 
Hokkaido 
Hokkaido University 
Simple efficient algorithm for MPQtree of an interval graph Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST) COMP200724 
An MPQtree is an informative data structure for an interval graph. We propose a simple algorithm that constructs an MPQ... [more] 
COMP200724 pp.4954 
IT, WBS, ISEC 
20050318 15:55 
Kyoto 
Kyoto Univ. 
Variable Datalength Encryption Using Arithmetic Operations Takeshi Tounai, Hisashi Suzuki (Chuo Univ) 
This article proposes an algorithm which adaptive arithmetic coding is applied to for an encryption, which converts any ... [more] 
IT200487 ISEC2004143 WBS2004202 pp.8994 
COMP 
20041210 14:30 
Chiba 
Toho University 
Interval bigraphs are unit grid intersection graphs Yota Otachi, Koichi Yamazaki (Gunma Univ.) 
An interval bigraph is the intersection graph of two families of intervals on the real line such that vertices are adjac... [more] 
COMP200456 pp.2123 