| 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 | 2009-09-14 15:05 |
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] |
COMP2009-30 pp.35-42 |
| CAS, CS, SIP | 2009-03-03 13:10 |
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 pp.183-184 |
| COMP | 2008-09-11 09:30 |
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] |
COMP2008-24 pp.9-16 |
| COMP | 2007-09-20 13:50 |
Aichi | Bandwidth of Bipartite Permutation Graphs Ryuhei Uehara (JAIST) COMP2007-36 |
The bandwidth problem is to find a linear layout of vertices in a graph in such way that minimizes the maximum distance... [more] |
COMP2007-36 pp.29-34 |
|
| CAS | 2007-01-30 09:55 |
Ehime | Ehime Univ. | Improvement of track layout of bipartite graph subdivisions Miki Miyauchi (NTT) |
This paper studies the problem of track layout of bipartite graph subdivisions. Recently Dujmovic and Wood showed that e... [more] | CAS2006-71 pp.7-12 |
| COMP | 2006-06-23 10:00 |
Saitama | Saitama Univ. | Track layout of bipartite graph subdivisions Miki Miyauchi (NTT) |
This paper studies the problem of track layout of bipartite graph subdivisions. Recently Dujmovic and Wood showed that e... [more] | COMP2006-17 pp.1-5 |
| COMP | 2006-04-26 09:20 |
Kyoto | Kyoto University | Optimality of Balanced Semi-Matchings Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
We consider the problem of finding a semi-matching for a bipartite graph $G = (U \cup V,E)$. A semi-matching is defined ... [more] | COMP2006-1 pp.1-8 |
| MSS, CAS | 2005-11-10 10:30 |
Yamaguchi | Yamaguchi University | Max-Flow Scheduling in High Level Synthesis Liangwei Ge, Kouhei Isoda, Takeshi Yoshimura (Waseda Univ.) |
Scheduling in essence is a process of finding a matching between operations and control steps in the bipartite graph. In... [more] | CAS2005-49 CST2005-18 pp.1-6 |
| COMP | 2005-10-18 09:00 |
Miyagi | Tohoku Univ. | Queue layout of bipartite graph subdivisions Miki Miyauchi (NTT) |
This paper studies the problem of queue layout of bipartite graph subdivisions. A k-queue layout of a graph consists of ... [more] | COMP2005-36 pp.1-5 |
| COMP | 2004-12-10 16:00 |
Chiba | Toho University | Constructions of Cluttered Orderings for the Complete Bipartite Graph to speed up RAID Tomoko Adachi (Toho Univ.) |
The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks (R... [more] | COMP2004-59 pp.37-44 |
| COMP | 2004-06-25 15:20 |
Kanagawa | NTT CSLab Atsugi | Embedding bipartite graphs into book space Miki Miyauchi (NTT) |
This paper studies the problem of book-embeddings of bipartite graphs. When each edge is allowed to appear in one or mor... [more] | COMP2004-24 pp.41-45 |
[Return to Top Page]