| 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 | 2023-10-24 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.)  COMP2023-11 |
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] | COMP2023-11 pp.1-8 |
| COMP | 2023-03-02 14:45 |
Tokyo | Ochanomizu University | Correcting the algorithm for a minimum secure dominating set of proper interval graphs Toru Araki, Ryuya Saito (Gunma Univ.) COMP2022-36 |
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293... [more] | COMP2022-36 pp.16-20 |
| COMP, IPSJ-AL | 2021-05-07 17:10 |
Online | Online | A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-4 |
We consider the 1-minimal independent dominating set (1-MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] | COMP2021-4 pp.23-30 |
| COMP | 2020-03-01 11:30 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga (Chuo Univ.) COMP2019-48 |
The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] | COMP2019-48 p.23 |
| COMP | 2018-12-12 17:25 |
Miyagi | Tohoku University | Distance 2-domination number of Hypercubes Nana Kawamura, Yosuke Kikuchi (NIT, Tsuyama College) COMP2018-42 |
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] | COMP2018-42 pp.69-72 |
| ISEC, COMP | 2017-12-22 14:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43 |
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] | ISEC2017-89 COMP2017-43 pp.111-117 |
| COMP | 2017-08-18 15:55 |
Aomori | Secure Domination in Proper Interval Graphs Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP2017-18 |
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] | COMP2017-18 pp.41-46 |
|
| NS, IN (Joint) |
2017-03-02 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.) NS2016-170 |
In server migration service (SMS), computers called work places (WPs) are deployed at various locations in a network, an... [more] | NS2016-170 pp.77-82 |
| IT, SIP, RCS | 2017-01-20 10:00 |
Osaka | Osaka City Univ. | A Group Theoretic Approach to Rank-Modulation Rewriting Codes with Multi-cell Ranking and its Applications Takeru Sudo, Tomoharu Shibuya (Sophia Univ) IT2016-86 SIP2016-124 RCS2016-276 |
In this paper, we propose a group theoretic representation suitable for the rank-modulation rewriting codes for flash me... [more] | IT2016-86 SIP2016-124 RCS2016-276 pp.231-236 |
| RCS, IT, SIP | 2016-01-18 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) IT2015-65 SIP2015-79 RCS2015-297 |
In this paper, we propose contents distribution protocols for wireless ad hoc networks. In our scenario, a base statio... [more] |
IT2015-65 SIP2015-79 RCS2015-297 pp.101-106 |
| COMP | 2015-04-23 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) COMP2015-1 |
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] |
COMP2015-1 pp.1-7 |
|
| IPSJ-AVM, CS, IE, ITE-BCT [detail] | 2014-12-05 10:30 |
Osaka | Osaka University Nakanoshima Center | Virtual Backbone Construction with Directional Anntennas Kazuya Sakai (TMU) CS2014-80 IE2014-66 |
Connected dominating set (CDS) is widely used as a virtual backbone in ad hoc networks. Constructing a CDS in a network ... [more] | CS2014-80 IE2014-66 pp.57-60 |
| IN | 2014-10-17 13:25 |
Osaka | Osaka Univ. | Short Survey on Virtual Backbone Construction in Mobile Ad Hoc Networks Kazuya Sakai (TMU) IN2014-79 |
The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad hoc networks. In the past, many CDS... [more] | IN2014-79 pp.31-34 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 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.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 |
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] | CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 pp.45-48 |
| COMP | 2014-04-24 14:20 |
Miyagi | Tohoku University | Reconfiguration of Dominating Sets Akira Suzuki (Tohoku Univ.), Amer Mouawad, Naomi Nishimura (Univ. of Waterloo) COMP2014-5 |
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S... [more] |
COMP2014-5 pp.29-35 |
| COMP | 2013-12-20 11:25 |
Okinawa | Okinawa Industry Support Center | An empirical study for independent distance dominating sets in large-scale graphs Hiroshi Kadowaki, Liang Zhao (Kyoto Univ.), Dorothea Wagner (Karlsruhe Inst. of Tech.) COMP2013-42 |
This paper studies the scaling behavior of the size of a minimum independent distance dominating set (MIDDS) in large-sc... [more] | COMP2013-42 pp.27-31 |
| 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 |
|
| IT, ISEC, WBS | 2013-03-07 15:05 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Construction of Minimal dominating set for the Rank Modulation based on the Compressed Encoding Yuya Kanbayashi, Tomoharu Shibuya (Sophia Univ.) IT2012-79 ISEC2012-97 WBS2012-65 |
Rank Modulation code is a recoding code expressing information by using the mutual relation between the level of electri... [more] | IT2012-79 ISEC2012-97 WBS2012-65 pp.113-118 |
| COMP | 2011-04-22 14:30 |
Kyoto | Kyoto University | Reconstructing sets from distances given by graphs Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.) COMP2011-7 |
Given $n$ points in some Euclidean space, $\binom{n}{2}$ pairwise distances among the points can be easily calculated. ... [more] |
COMP2011-7 pp.49-54 |
| COMP | 2010-12-03 16:35 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Maximum Domination Problem Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2010-46 |
We consider new variants of the vertex/edge domination problems on graphs. A vertex is said to {\em dominate} itself an... [more] |
COMP2010-46 pp.53-60 |
[Return to Top Page]