| 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 | 2022-12-06 09:30 |
Ehime | Ehime Univ. Media Hall (Ehime) | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.)  COMP2022-21 |
We consider the reconfiguration and enumeration problems of optimal cyclic ladder lotteries. First, we investigate the t... [more] | COMP2022-21 pp.1-8 |
| COMP | 2022-10-26 14:00 |
Fukuoka | Kyusyu Univ. Nishijin Plaza (Fukuoka) | Enumeration of Transversal Edge-Partitions Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.) COMP2022-16 |
In this paper, we consider the problem of enumerating transversal edge-partition of an irreducible triangulation. We pro... [more] | COMP2022-16 pp.14-20 |
| COMP | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University (Okayama) | Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10 |
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] | COMP2019-10 pp.1-5 |
| COMP | 2018-12-12 16:40 |
Miyagi | Tohoku University (Miyagi) | Enumerating Floorplans with Columns Katsuhisa Yamanaka (Iwate Univ.), Md.Saidur Rahman (BUET), Shin-ichi Nakano (Gunma Univ.) COMP2018-40 |
[more] | COMP2018-40 pp.55-59 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 10:55 |
Hyogo | Kobe Institute of Computing (Hyogo) | [Invited Talk]
Introduction to Token Swapping Problem
-- An generalization of Amidakuji -- Katsuhisa Yamanaka (Iwate Univ.) CAS2016-72 MSS2016-52 |
[more] | CAS2016-72 MSS2016-52 p.97 |
| COMP, IPSJ-AL | 2016-06-25 15:05 |
Ishikawa | (Ishikawa) | Computational Complexity of Sequential Token Swapping Problem Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13 |
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] | COMP2016-13 pp.115-121 |
| COMP | 2014-04-24 10:55 |
Miyagi | Tohoku University (Miyagi) | Swapping Labeled Tokens on Graphs Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2 |
[more] | COMP2014-2 pp.5-12 |
| COMP | 2014-03-10 16:30 |
Tokyo | (Tokyo) | Constant-time Delay Generation of Based Plane Triangulations Jun-ichi Koide, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani (Iwate Univ.) COMP2013-73 |
[more] | COMP2013-73 pp.91-98 |
| COMP | 2009-09-14 15:05 |
Tottori | Tottori University of Environmental Studies (Tottori) | 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 |
| COMP | 2009-03-02 10:35 |
Tokyo | Tokyo Institute of Technology (Tokyo) | Efficient Enumeration of All Ladder Lotteries Katsuhisa Yamanaka (Univ. of Electro-Comm.), Shin-ichi Nakano (Gunma Univ.), Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Kento Nakada (Kyoto Univ.) COMP2008-56 |
A ladder lottery, known as the "Amidakuji" in Japan, is a common way to choose a random permutation. Given a permutation... [more] | COMP2008-56 pp.17-23 |
| COMP | 2008-12-03 11:30 |
Gunma | Gunma Univ. (Gunma) | A Simple Generation of Multi-dimensional Partitions Yosuke Kikuchi (Tsuyama National Coll. Tech.), Katsuhisa Yamanaka (The University of Electro-Communications), Shin-ichi Nakano (Gunma Univ.) COMP2008-49 |
This paper gives a simple algorithm to generate all multi-dimensional partitions of a positive integer N. The problem is... [more] | COMP2008-49 pp.23-29 |
[Return to Top Page]