IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 20  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2021-05-07
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
COMP 2020-03-01
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
COMP 2018-12-12
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
ISEC, COMP 2017-12-22
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
COMP 2017-08-18
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
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
IT, SIP, RCS 2017-01-20
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
RCS, IT, SIP 2016-01-18
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
COMP 2015-04-23
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]
IPSJ-AVM, CS, IE, ITE-BCT [detail] 2014-12-05
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
IN 2014-10-17
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
CAS, SIP, MSS, VLD, SIS [detail] 2014-07-09
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
COMP 2014-04-24
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]
COMP 2013-12-20
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
MSS, CAS, IPSJ-AL [detail] 2013-11-07
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
IT, ISEC, WBS 2013-03-07
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
COMP 2011-04-22
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]
COMP 2010-12-03
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]
SIS, IPSJ-AVM 2010-09-02
Nagasaki Nagasakiken-Kinrou-Fukushi-Kaikan Analysis of Affecting Factors for Stock Returns based on Tomography Methods for the Decomposition of Probability Density Functions
Shozo Tokinaga (Kyushu Univ), Kangrong Tan (Kurume Univ) SIS2010-19
This report deals with the analysis of affecting factors for time series by using the decomposition of probability densi... [more] SIS2010-19
MSS, CAS 2005-11-10
Yamaguchi Yamaguchi University A Branch and Bound Algorithm for the Minimum Dominating Set Problem and its Hardware Implementation on FPGAs
Kenji Kikuchi, Shin'ichi Wakabayashi (Hiroshima City Univ.)
A branch and bound algorithm for finding a minimum dominating set of a given graph was proposed,and experimental evaluat... [more] CAS2005-59 CST2005-28
 Results 1 - 20 of 20  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan