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 28  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
WBS, IT, ISEC 2021-03-05
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
MSS, CAS, IPSJ-AL [detail] 2016-11-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
MSS, CAS, IPSJ-AL [detail] 2016-11-25
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
RCS, IT, SIP 2016-01-18
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
RCS, IT, SIP 2016-01-18
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
COMP 2015-10-02
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
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]
COMP, IPSJ-AL 2014-06-13
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
MSS, CAS, IPSJ-AL [detail] 2013-11-06
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
COMP 2013-09-03
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
COMP 2013-03-18
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
MSS 2013-01-23
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
VLD, CAS, MSS, SIP 2012-07-03
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
COMP 2011-12-16
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
COMP 2010-10-15
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
SIP, CAS, CS 2010-03-01
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
COMP 2009-09-14
Tottori Tottori University of Environmental Studies Random Generation and Enumeration of Bipartite Permutation Graphs
Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST) COMP2009-30
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite
... [more]
CAS, CS, SIP 2009-03-03
Gifu Nagaragawa Convention Center [Poster Presentation] A Note on Two Problems of Nano-PLA Design
Anish Man Singh Shrestha, Tomoki Yamada, Satoshi Tayu, Shuichi Ueno (Tokyo Inst of Tech) CAS2008-133 SIP2008-196 CS2008-107
This paper shows that the subgraph isomorphism problem is NP-hard even for bipartite permutation graphs, while the balan... [more] CAS2008-133 SIP2008-196 CS2008-107
COMP 2008-09-11
Aichi Nagoya Inst. of Tech. Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP2008-24
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs
in an $n$-vertex $m$-edge undirected graph $... [more]
 Results 1 - 20 of 28  /  [Next]  
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