| 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 # | |
| IE, ITS, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2021-02-18 15:15 |
Online | Online | A study on avoiding phase-retrieval stagnation for ptychography Ryo Ozawa (Muroran IT), Yosuke Maehara (DOWELL), Asahi Takaoka, Hiroyuki Shioya (Muroran IT)  ITS2020-31 IE2020-45 |
Diffractive imaging is a method of reconstructing an image from an observed diffraction pattern, in which a computer sub... [more] | ITS2020-31 IE2020-45 pp.25-30 |
| 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 |
| COMP | 2017-03-07 11:00 |
Aichi | Nanzan University | Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover Asahi Takaoka (Kanagawa Univ.) COMP2016-51 |
A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point... [more] | COMP2016-51 pp.5-9 |
| COMP | 2015-03-09 10:10 |
Kyoto | Ritsumeikan University | A Note on Irreversible 2-Conversion Sets in Subcubic Graphs Asahi Takaoka, Shuichi Ueno (Tokyo Tech) COMP2014-43 |
Irreversible $k$-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or ... [more] | COMP2014-43 pp.9-11 |
| CAS, MSS, IPSJ-AL [detail] | 2014-11-20 15:00 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki island) | Harmonious Coloring of Caterpillars Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-93 MSS2014-57 |
The harmonious coloring of a simple graph is a vertex coloring such that adjacent vertices are assigned different colors... [more] | CAS2014-93 MSS2014-57 pp.57-62 |
| CAS, MSS, IPSJ-AL [detail] | 2014-11-20 15:20 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki island) | On the Bipartite Dense Subgraph Problem Satoshi Tayu, Asahi Takaoka, Dai Ito, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-94 MSS2014-58 |
[more] | CAS2014-94 MSS2014-58 pp.63-68 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 13:40 |
Hokkaido | Hokkaido University | Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 |
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] | CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 pp.45-48 |
| MSS, CAS, IPSJ-AL [detail] | 2013-11-07 09:55 |
Iwate | A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44 |
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] | CAS2013-65 MSS2013-44 pp.99-104 |
|
| 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 |
[Return to Top Page]