| 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 | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.)  COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| 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 | 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 |
| 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 |
| 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-04-18 11:10 |
Osaka | Osaka Prefecture University | Enumeration of Perfect Sequences of Chordal Graph Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2008-3 |
A graph is chordal if and only if it has no chordless cycle of length more than three. The set of maximal cliques in a ... [more] |
COMP2008-3 pp.15-22 |
| COMP | 2005-06-24 15:00 |
Toyama | Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are Of Small Size Seinosuke Toda (Nihon Univ.) |
It is known that any chordal graph can be uniquely decomposed into simplicial components. Based on this fact, it is sho... [more] |
COMP2005-24 pp.37-42 |
|
[Return to Top Page]