| 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 # | |
| NLP, MSS (Joint) |
2021-03-16 13:50 |
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 pp.51-56 |
| MSS, SS | 2019-01-16 11:15 |
Okinawa | Simpler proof of topological queue layout of graphs Miki Miyauchi (NTT) MSS2018-71 SS2018-42 |
(To be available after the conference date) [more] | MSS2018-71 SS2018-42 pp.91-96 |
|
| COMP | 2018-09-18 14:30 |
Fukuoka | Kyusyu Institute of Technology | Miki Miyauchi (NTT) COMP2018-15 |
This paper shows that for every integer s, q >0, every graph G has an s-stack q-queue subdivision layout with 2 log_{s+q... [more] | COMP2018-15 pp.41-48 |
| MSS, NLP (Joint) |
2018-03-14 09:40 |
Osaka | Topological stack-queue mixed layout of graphs using queue number Miki Miyauchi (NTT) MSS2017-89 |
This paper improves previous results by showing that every graph G has an s-stack q-queue subdivision layout with 2 log_... [more] | MSS2017-89 pp.61-66 |
|
| SS, MSS | 2018-01-18 13:35 |
Hiroshima | Stack queue mixed layout of graphs using stack number Miki Miyauchi (NTT) MSS2017-53 SS2017-40 |
As for stack-queue mixed layouts of graph subdivisions, this paper improves previous results by showing that for every i... [more] | MSS2017-53 SS2017-40 pp.35-40 |
|
| COMP, ISEC | 2016-12-21 14:30 |
Hiroshima | Hiroshima University | Miki Miyauchi (NTT) ISEC2016-76 COMP2016-37 |
(To be available after the conference date) [more] | ISEC2016-76 COMP2016-37 pp.29-35 |
| MSS | 2015-03-05 13:00 |
Ishikawa | IT Business Plaza Musashi | An improvement of topological queue layouts of complete graphs Miki Miyauchi (NTT) MSS2014-91 |
(To be available after the conference date) [more] | MSS2014-91 pp.1-6 |
| COMP | 2014-12-05 16:40 |
Kumamoto | Sojo University | A Fast Algorithm for Sphere Packings and its Applications Shuji Yamada (Kyoto Sangyo Univ.), Jinko Kanno (LaTech), Miki Miyauchi (NTT) COMP2014-40 |
[more] | COMP2014-40 pp.53-58 |
| COMP, IPSJ-AL | 2014-06-13 15:00 |
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 pp.27-32 |
| SIP, CAS, CS | 2013-03-14 14:40 |
Yamagata | Keio Univ. Tsuruoka Campus (Yamagata) | Stack Queue Mixed layout of graph subdivisions Hikoe Enomoto (Waseda Univ.), Miki Miyauchi (NTT) CAS2012-118 SIP2012-149 CS2012-124 |
This paper studies the problem of stack queue mixed layout of graph subdivisions. Dujmovi\'{c} and Wood showed that for ... [more] | CAS2012-118 SIP2012-149 CS2012-124 pp.125-130 |
| CAS, MSS | 2011-11-18 09:50 |
Yamaguchi | Univ. of Yamaguchi | An Improvement of stack queue mixed layouts of graphs Hikoe Enomoto (Waseda Univ.), Miki Miyauchi (NTT) CAS2011-75 MSS2011-44 |
Dujmovic and Wood showed that for every integers s, q > 0, every graph G has an s-stack q-queue mixed subdivision layou... [more] |
CAS2011-75 MSS2011-44 pp.65-70 |
| MSS, CAS, VLD, SIP | 2011-07-01 15:00 |
Okinawa | Okinawa-Ken-Seinen-Kaikan | Simpler construction of queue layout of graphs Miki Miyauchi (NTT) CAS2011-27 VLD2011-34 SIP2011-56 MSS2011-27 |
[more] | CAS2011-27 VLD2011-34 SIP2011-56 MSS2011-27 pp.153-155 |
| CS, SIP, CAS | 2011-03-04 09:20 |
Okinawa | Ohhamanobumoto memorial hall (Ishigaki)( | Construction of Stack Queue Mixed Layout of Bipartite Graph Subdivisions Miki Miyauchi (NTT Corp.), Hikoe Enomoto (Waseda Univ.) CAS2010-156 SIP2010-172 CS2010-126 |
[more] | CAS2010-156 SIP2010-172 CS2010-126 pp.317-321 |
| SIP, CAS, CS | 2010-03-01 12:10 |
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 pp.75-80 |
| 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 |
| CAS, MSS | 2006-11-20 14:45 |
Nagasaki | Nagasaki Univ. | Stack Queue Mixed Layout of Bipartite Graph Subdivisions Miki Miyauchi (NTT), Gisaku Nakamura (Tokai Univ.) |
[more] | CAS2006-49 CST2006-25 pp.43-48 |
| 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 | 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-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]