| 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 | 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 |
| 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 |
| 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 |
| 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 |
|
| 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 |
| 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 |
[Return to Top Page]