IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 40  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-12-06
Ehime Ehime Univ. Media Hall COMP2022-22 組合せ遷移,グラフアルゴリズム,点素パス [more] COMP2022-22
COMP 2021-10-23
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
COMP 2020-10-23
Osaka Osaka Univ.
(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
COMP 2020-10-23
Osaka Osaka Univ.
(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
COMP, IPSJ-AL 2020-09-01
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
COMP 2020-03-01
Tokyo The University of Electro-Communications
(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
COMP 2019-10-25
Hokkaido Sapporo Campus, Hokkaido University 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
COMP 2019-09-02
Okayama Tsushima Campus, Okayama University 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
COMP, IPSJ-AL 2019-05-10
Kumamoto Kumamoto University Research on Similar Hole Puzzle: Hardness and Efficient Algorithm
Takashi Himoto, Ryuhei Uehara (JAIST) COMP2019-1
 [more] COMP2019-1
COMP, IPSJ-AL 2019-05-10
Kumamoto Kumamoto University 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]
COMP 2019-03-18
Tokyo The University of Tokyo *
Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP2018-44
(To be available after the conference date) [more] COMP2018-44
COMP 2019-03-18
Tokyo The University of Tokyo Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs
Shinichi Ikeda, Ryuhei Uehara (JAIST) COMP2018-45
 [more] COMP2018-45
COMP 2018-12-12
Miyagi Tohoku University 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
COMP 2018-09-18
Fukuoka Kyusyu Institute of Technology 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
ISEC, COMP 2017-12-21
Kochi Eikokuji Campus, Kochi University of Technology 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
ISEC, COMP 2017-12-21
Kochi Eikokuji Campus, Kochi University of Technology 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
COMP, IPSJ-AL 2017-05-13
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
COMP 2017-03-07
Aichi Nanzan University Development of Peg Solitaire Font
Taishi Oikawa (Ichinoseki National College of Tech.), Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara (JAIST) COMP2016-50
 [more] COMP2016-50
COMP 2016-10-21
Miyagi Tohoku University 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
COMP 2016-09-06
Toyama Toyama Prefectural University Counting the number of solutions for peg solitaire
Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST) COMP2016-14
Peg solitaire is one of the most popular classic puzzles around the world. The problem is NP-complete in general, which ... [more] COMP2016-14
 Results 1 - 20 of 40  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan