| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: Recent 10 Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2025-03-07 15:10 |
Tokyo | Ochanomizu University (Tokyo) | Construction of a common unfolding by fixed point propagation method Taiga Goto, Tonan Kamata, Ryuhei Uehara (JAIST)  COMP2024-31 |
An unfolding of a polyhedron is a polygon obtained by cutting and unfolding its surface onto a plane. A common unfolding... [more] | COMP2024-31 pp.37-42 |
| COMP | 2022-12-06 09:55 |
Ehime | Ehime Univ. Media Hall (Ehime) | COMP2022-22 |
組合せ遷移，グラフアルゴリズム，点素パス [more] | COMP2022-22 pp.9-13 |
| COMP | 2021-10-23 11:10 |
Online | Online (Online) | Multifold tiles of polyominoes and convex lattice polygons Kota Chida (UEC), Erik Demaine, Martin Demaine (MIT), David Eppstein (UCI), Adam Hesterberg (Harvard Univ.), Takashi Horiyama (Hokkaido Univ.), John Iacono (ULB), Hiro Ito (UEC), Stefan Langerman (ULB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) COMP2021-15 |
A family of plane shapes $¥mathcal{T}$ is called a tiling if they (rotating and reflecting are allowed) cover the whole ... [more] | COMP2021-15 pp.11-18 |
| COMP | 2020-10-23 14:30 |
Osaka | Osaka Univ. (Osaka, Online) (Primary: On-site, Secondary: Online) |
Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.) COMP2020-13 |
For a given set of pieces, an anti-slide puzzle asks us to arrange the pieces so that none of the pieces can slide. In t... [more] | COMP2020-13 pp.10-17 |
| COMP | 2020-10-23 16:30 |
Osaka | Osaka Univ. (Osaka, Online) (Primary: On-site, Secondary: Online) |
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs Kazuaki Yamazaki, Qian Mengze, Ryuhei Uehara (JAIST) COMP2020-16 |
[more] | COMP2020-16 pp.33-38 |
| COMP, IPSJ-AL | 2020-09-01 14:40 |
Online | Online (Online) | Complexity of Colored Token Shifting on Graphs Sai Kwon Kham, Ryuhei Uehara (JAIST) COMP2020-6 |
Variations of reconfiguration problems are much of interest and important problems in theoretical computer science. The ... [more] | COMP2020-6 pp.1-8 |
| COMP | 2020-03-01 15:15 |
Tokyo | The University of Electro-Communications (Tokyo) (Cancelled but technical report was issued) |
Efficient algorithm for simulating an unbiased coin tossing with a baiased coin Koji Ueno, Ryuhei Uehara (JAIST) COMP2019-52 |
(To be available after the conference date) [more] | COMP2019-52 pp.43-49 |
| COMP | 2019-10-25 10:50 |
Hokkaido | Sapporo Campus, Hokkaido University (Hokkaido) | Simple Fold and Cut Problem for Line Segments Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2019-20 |
We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and n line segments draw... [more] | COMP2019-20 pp.19-25 |
| 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, IPSJ-AL | 2019-05-10 15:15 |
Kumamoto | Kumamoto University (Kumamoto) | Research on Similar Hole Puzzle: Hardness and Efficient Algorithm Takashi Himoto, Ryuhei Uehara (JAIST) COMP2019-1 |
[more] | COMP2019-1 pp.9-13 |
| COMP, IPSJ-AL | 2019-05-10 15:40 |
Kumamoto | Kumamoto University (Kumamoto) | On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. ... [more] |
COMP2019-2 pp.15-22 |
| COMP | 2019-03-18 09:55 |
Tokyo | The University of Tokyo (Tokyo) | * Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP2018-44 |
(To be available after the conference date) [more] | COMP2018-44 pp.9-16 |
| COMP | 2019-03-18 10:15 |
Tokyo | The University of Tokyo (Tokyo) | Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs Shinichi Ikeda, Ryuhei Uehara (JAIST) COMP2018-45 |
[more] | COMP2018-45 pp.17-23 |
| COMP | 2018-12-12 10:00 |
Miyagi | Tohoku University (Miyagi) | Max-Min Dispersion Problems Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII) COMP2018-31 |
[more] | COMP2018-31 pp.1-6 |
| COMP | 2018-09-18 16:25 |
Fukuoka | Kyusyu Institute of Technology (Fukuoka) | Triangulation with Many/Few Triangles Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Eiji Miyano, Ayumi Nishijima (Kyutech), Hirotaka Ono (Nagoya Univ), Yota Otachi (Kumamoto Univ), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht Univ) COMP2018-19 |
[more] | COMP2018-19 pp.69-76 |
| ISEC, COMP | 2017-12-21 11:00 |
Kochi | Eikokuji Campus, Kochi University of Technology (Kochi) | Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs Shohei Urakawa (Kobe Univ.), Tom C. van der Zanden (Utrecht Univ.), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST) ISEC2017-74 COMP2017-28 |
Recently，due to increase of the capacity of storages，we require space efficient algorithms with a limited workspace for ... [more] | ISEC2017-74 COMP2017-28 pp.11-18 |
| ISEC, COMP | 2017-12-21 11:50 |
Kochi | Eikokuji Campus, Kochi University of Technology (Kochi) | Maximum k-path Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30 |
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] | ISEC2017-76 COMP2017-30 pp.25-31 |
| COMP, IPSJ-AL | 2017-05-13 13:30 |
Nagasaki | (Nagasaki) | Practical Linear-Time Algorithm for Estimation of Silhouette after Folding Crease Pattern Koji Ouchi, Kazuaki Yamazaki, Ryuhei Uehara (JAIST) COMP2017-8 |
In the recent years, a variety of software to simulate origami have been developed to investigate the possibility of app... [more] | COMP2017-8 pp.55-60 |
| COMP | 2017-03-07 10:30 |
Aichi | Nanzan University (Aichi) | Development of Peg Solitaire Font Taishi Oikawa (Ichinoseki National College of Tech.), Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara (JAIST) COMP2016-50 |
[more] | COMP2016-50 pp.1-4 |
| COMP | 2016-10-21 15:20 |
Miyagi | Tohoku University (Miyagi) | A Research of the Number of the Convex Configurations of Silhouette Puzzles Hitoshi Iwai, Jungo Shibuya, Ryuhei Uehara (JAIST) COMP2016-29 |
(To be available after the conference date) [more] | COMP2016-29 pp.39-45 |
[Return to Top Page]