| 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:25 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Algorithms for Optimally Shifting Intervals under Intersection Graph Models Honorato Droguett Nicolas, Kazuhiro Kurita (Nagoya Univ.), Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono (Nagoya Univ.)  COMP2023-17 |
We address a general optimisation problem of minimising the moving distance applied to the objects of an intersection gr... [more] | COMP2023-17 pp.6-11 |
| COMP | 2018-03-05 14:50 |
Osaka | Osaka Prefecture Univ. | A recognition algorithm for simple-triangle graphs Asahi Takaoka (Kanagawa Univ.) COMP2017-50 |
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an i... [more] | COMP2017-50 pp.27-34 |
| CAS, MSS, IPSJ-AL [detail] | 2017-11-16 11:20 |
Tokyo | [Invited Talk]
On the Recognition of Unit Grid Intersection Graphs Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2017-44 MSS2017-28 |
We show that the recognition problem for unit grid intersection graphs is NP-complete. [more] | CAS2017-44 MSS2017-28 pp.15-20 |
|
| SIP, CAS, MSS, VLD | 2013-07-12 15:00 |
Kumamoto | Kumamoto Univ. | On Unit Grid Intersection Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31 |
This paper shows that the recognition problem for unit grid intersection graphs is NP-complete. We also show that any gr... [more] | CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31 pp.171-175 |
| 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 |
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
On Orthogonal Ray Graphs with Applications to NanoPLA Design (Extended Abstract) Yohei Kobayashi, Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2007-145 SIP2007-220 CS2007-110 |
Motivated by defect tolerance schemes for nanotechnology circuits, the orthogonal ray graphs, a new class of intersecti... [more] |
CAS2007-145 SIP2007-220 CS2007-110 pp.97-98 |
| COMP | 2005-09-15 10:50 |
Osaka | Osaka Univ., Toyonaka Campus | Laminar Structure of Ptolemaic Graphs and Its Applications Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) |
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with... [more] |
COMP2005-30 pp.17-24 |
| COMP | 2004-12-10 14:30 |
Chiba | Toho University | Interval bigraphs are unit grid intersection graphs Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
An interval bigraph is the intersection graph of two families of intervals on the real line such that vertices are adjac... [more] | COMP2004-56 pp.21-23 |
[Return to Top Page]