| 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-12-22 10:00 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Approximation Algorithms for Generalizations of Strong Connectivity Augmentation Problem Ryoma Norose, Yutaro Yamaguchi (Osaka Univ.)  COMP2023-16 |
A directed graph G is said to be strongly connected if there exists a directed path between any pair of vertices in G. S... [more] | COMP2023-16 pp.1-5 |
| COMP | 2023-10-24 16:20 |
Aichi | Nagoya Univ. Venture Business Lab. | Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] | COMP2023-14 pp.13-20 |
| NLP | 2022-11-25 13:50 |
Shiga | (Primary: On-site, Secondary: Online) |
Stability analysis of partial amplitude death in delay-coupled oscillator networks with complete bipartite topologies Ryuya Kawano, Yoshiki Sugitani (Ibaraki Univ) NLP2022-75 |
In this report, we analyze the stability of partial amplitude death in delay-coupled oscillator networks with complete b... [more] | NLP2022-75 pp.82-86 |
| NLP, MSS (Joint) |
2021-03-16 13:50 |
Online | Online | Topological stack queue mixed layouts of bipartite graphs Miki Miyauchi (NTT) MSS2020-54 |
This paper proves that the stack-queue mixed layouts for bipartite graphs previously constructed by the author still imp... [more] | MSS2020-54 pp.51-56 |
| WBS, IT, ISEC | 2021-03-05 09:25 |
Online | Online | Construction of non-malleable codes based on graph theory Shohei Satake (Kumamoto Univ.), Yujie Gu, Kouichi Sakurai (Kyushu Univ.) IT2020-144 ISEC2020-74 WBS2020-63 |
Non-malleable codes protect communications against adversarial tampering of data, which can be seen as a relaxation of e... [more] | IT2020-144 ISEC2020-74 WBS2020-63 pp.195-200 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 09:25 |
Hyogo | Kobe Institute of Computing | A Note on the Spanning Subgraph Isomorphism Problem Satoshi Tayu, Kenji Ichikawa, Shuichi Ueno (Tokyo Tech) CAS2016-69 MSS2016-49 |
We consider the subgraph isomorphism problem of two graphs which is to decide if a pattern graph is isomorphic to a subg... [more] | CAS2016-69 MSS2016-49 pp.83-88 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 10:15 |
Hyogo | Kobe Institute of Computing | A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs Yuta Inaba, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-71 MSS2016-51 |
(To be available after the conference date) [more] | CAS2016-71 MSS2016-51 pp.93-96 |
| RCS, IT, SIP | 2016-01-18 11:00 |
Osaka | Kwansei Gakuin Univ. Osaka Umeda Campus | A Study on Message Passing Algorithm for Counting Short Cycles in Sparse Bipartite Graphs Yuta Nakahara, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2015-50 SIP2015-64 RCS2015-282 |
In this paper, we propose an improvement of message passing algorithm for counting short cycles in sparse bipartite grap... [more] | IT2015-50 SIP2015-64 RCS2015-282 pp.13-18 |
| RCS, IT, SIP | 2016-01-18 15:10 |
Osaka | Kwansei Gakuin Univ. Osaka Umeda Campus | [Invited Lecture]
Wireless Communications on Graphs: Fundamentals and Applications Koji Ishibashi (The Univ. of Electro-Communications) IT2015-74 SIP2015-88 RCS2015-306 |
This paper introduces fundamentals of codes-on-graph approaches and show that wireless systems can be efficiently design... [more] | IT2015-74 SIP2015-88 RCS2015-306 pp.155-160 |
| COMP | 2015-10-02 15:50 |
Tokyo | An Improvement of Crossover in Assembly of Jigsaw Puzzles Using a GA Kazuyuki Takahashi, Koji Obokata (NIT, Ichinoseki College) COMP2015-29 |
We applied a genetic algorithm to assemble the square piece jigsaw puzzle. We used a gray scale image in the puzzle and ... [more] | COMP2015-29 pp.41-46 |
|
| CS, NS, IN (Joint) |
2014-09-12 17:05 |
Miyagi | Tohoku Univ. Research Institute of Electrical Communication 2gokan | On Constraints in Networks with Fixed Degrees of Nodes Pavel Selin, Hitoshi Obara (Akita Univ.) IN2014-73 |
Classes of networks (weighted graphs) with fixed degrees of nodes, the arc weights (capacities) of which do not exceed ... [more] |
IN2014-73 pp.147-152 |
| COMP, IPSJ-AL | 2014-06-13 15:00 |
Ehime | Matsuyama, Ehime | Algorithmic construction of track layouts of graph subdivisions Miki Miyauchi (NTT) COMP2014-9 |
This paper studies the problem of track layout of bipartite graph subdivisions. Previously the author shows that for eve... [more] | COMP2014-9 pp.27-32 |
| MSS, CAS, IPSJ-AL [detail] | 2013-11-06 16:30 |
Iwate | A Matching Problem in Electricity Markets using Network Flows Ryo Hase, Norihiko Shinomiya (Soka Univ.) CAS2013-61 MSS2013-40 |
This paper proposes an optimal many-to-one matching algorithm between sellers and buyers in deregulated electricity mark... [more] | CAS2013-61 MSS2013-40 pp.67-70 |
|
| COMP | 2013-09-03 15:35 |
Tottori | Finding Maximum Regular Induced Subgraphs with Prescribed Degree Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-31 |
We study the problem of finding a maximum vertex-subset $S$ of a given graph $G$ such that the subgraph $G[S]$ induced b... [more] | COMP2013-31 pp.43-50 |
|
| COMP | 2013-03-18 09:55 |
Gifu | Gifu University | On the eternal vertex cover number of trees composed of elementary bipartite graphs Shota Inoue, Hisashi Araki, Toshihiro Fujito (Toyohashi Univ. of Tech) COMP2012-52 |
Suppose, when some number of guards are placed on some vertices in graph $G$, one of its edges is attacked. If a guard i... [more] | COMP2012-52 pp.1-4 |
| MSS | 2013-01-23 15:20 |
Osaka | Osaka Int. Convention Center | A Proposal of Similarity Evaluation for Ordered Trees
-- Application to Similarity Verification of C Language Programs -- Huricha Bao, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ.) MSS2012-56 |
In this paper，we deal with evaluation method of similarity of two given ordered trees. A similarity computation techniqu... [more] | MSS2012-56 pp.61-64 |
| VLD, CAS, MSS, SIP | 2012-07-03 09:50 |
Kyoto | Kyoto Research Park | On Minimum Feedback Vertex Sets in Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16 |
For the minimum feedback vertex set problem, we show a linear time algorithm for bipartite permutation graphs, the NP-ha... [more] | CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16 pp.87-92 |
| COMP | 2011-12-16 14:45 |
Aichi | Nagoya Univ. | Minimizing the Number of Heald Frames under the Constraint of Uniform Tension Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.) COMP2011-43 |
A dobby loom is a weaving machine prevailing in the textile industry. The more heald frames a dobby loom is equipped wit... [more] | COMP2011-43 pp.53-60 |
| COMP | 2010-10-15 14:40 |
Miyagi | Tohoku Univ. | Bipartite powers of interval bigraphs Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2010-36 |
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a... [more] | COMP2010-36 pp.35-39 |
| SIP, CAS, CS | 2010-03-01 12:10 |
Okinawa | Hotel Breeze Bay Marina, Miyakojima | Track layout of bipartite graph with single-color edges Miki Miyauchi (NTT Corp.) CAS2009-91 SIP2009-136 CS2009-86 |
This paper studies the problem of track layout of bipartite graph subdivisions. Dujmovic and Wood showed that every grap... [more] | CAS2009-91 SIP2009-136 CS2009-86 pp.75-80 |
[Return to Top Page]