| 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, IPSJ-AL | 2024-05-09 11:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.)  COMP2024-5 |
Given an instance of combinatorial optimization problem $mathcal{A}$ with multiple optimal solutions, how can we efficie... [more] | COMP2024-5 pp.10-13 |
| COMP | 2023-12-22 14:10 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Efficient Enumeration of Quantum Circuits Realizing Boolean Functions by Toffoli Gate Count Shigeru Yamashita (Ritsumeikan Univ.), Takashi Horiyama (Hokkaido Univ.), Norihito Yasuda (NTT) COMP2023-22 |
Quantum Boolean circuits, which compute Boolean functions necessary for quantum computation, are commonly designed using... [more] | COMP2023-22 pp.37-44 |
| COMP | 2022-12-06 16:55 |
Ehime | Ehime Univ. Media Hall | Isomorphism Elimination by Repetitive Representative-Extraction with Fragments of Automorphisms Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido Univ.) COMP2022-32 |
[more] | COMP2022-32 pp.51-58 |
| COMP | 2021-10-23 11:10 |
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-12-04 10:00 |
Online | Online | A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19 |
[more] | COMP2020-19 pp.8-15 |
| COMP | 2020-12-04 10:40 |
Online | Online | Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20 |
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] | COMP2020-20 pp.16-23 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University | Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| COMP | 2018-12-12 10:00 |
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 pp.1-6 |
| COMP | 2018-09-18 15:20 |
Fukuoka | Kyusyu Institute of Technology | Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST) COMP2018-17 |
A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) ... [more] | COMP2018-17 pp.55-62 |
| COMP, IPSJ-AL | 2016-06-25 15:05 |
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-12-05 16:10 |
Kumamoto | Sojo University | Optimally Bracing Frameworks of Union of Space-filling Convex Polyhedra Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jin-ichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.) COMP2014-39 |
(To be available after the conference date) [more] | COMP2014-39 pp.45-51 |
| COMP, IPSJ-AL | 2014-06-14 13:55 |
Ehime | Matsuyama, Ehime | Enumeration of Polyominoes for pmg Tiling Jun Nishioka, Takashi Horiyama (Saitama Univ.) COMP2014-14 |
Polyominoes are the two dimensional shapes made by connecting n equal-sized squares, joined along their edges. In this p... [more] | COMP2014-14 pp.107-114 |
| COMP | 2012-10-31 15:35 |
Miyagi | Tohoku University | On the Complexity of Packing Trominoes Takashi Horiyama (Saitama Univ.), Takehiro Ito (Tohoku Univ.), Keita Nakatsuka (Saitama Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2012-40 |
[more] | COMP2012-40 pp.37-43 |
| COMP | 2012-04-27 14:45 |
Osaka | Osaka Prefecture University | On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2012-6 |
[more] | COMP2012-6 pp.37-43 |
| COMP, IPSJ-AL | 2011-09-06 16:45 |
Hokkaido | Hakodate City Central Library | Unfoldings of Platonic Solids with Minimum/Maximum Diameter, Width, and Enclosing-Rectangle Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-27 |
A tetrahedron has 2 edge unfoldings. A cube and an octahedron have 11 unfoldings, respectively. A dodecahedron and an ... [more] |
COMP2011-27 pp.83-89 |
| COMP | 2011-05-11 14:30 |
Nagano | Shinshu Univ. | Edge-Unfoldings of Platonic Solids Never Overlap Takashi Horiyama, Wataru Shoji (Saitama Univ.) COMP2011-14 |
We solve an open problem for hundreds of years: Is every edge-unfolding of Platonic solids nonoverlapping? The answer ... [more] |
COMP2011-14 pp.17-23 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2010-12-01 15:30 |
Fukuoka | Kyushu University | Sharing of Clock Gating Modules under Multi-Stage Clock Gating Control Xin Man (Waseda Univ.), Takashi Horiyama (Saitama Univ.), Tomoo Kimura, Koji Kai (Panasonic), Shinji Kimura (Waseda Univ.) VLD2010-83 DC2010-50 |
Clock gating is an effective technique to reduce dynamic power consumption for sequential circuits. This paper shows a s... [more] | VLD2010-83 DC2010-50 pp.185-190 |
| COMP | 2010-10-15 13:20 |
Miyagi | Tohoku Univ. | Secure Vickrey Auction Based on Secret Sharing Takuma Sugimoto, Takashi Horiyama (Saitama Univ.) COMP2010-34 |
Vickrey auction, in which the highest bidder wins at the second highest price, is a well-known incentive compatible auct... [more] | COMP2010-34 pp.19-25 |
| COMP | 2009-06-29 11:10 |
Hokkaido | Hokkaido University | The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas Takashi Horiyama, Kosuke Higuchi (Saitama Univ.) COMP2009-20 |
[more] | COMP2009-20 pp.17-21 |
| COMP | 2009-05-26 16:15 |
Saitama | Saitama Univ. | Enumeration of Polyominoes for p4 Tiling Takashi Horiyama, Masato Samejima (Saitama Univ.) COMP2009-17 |
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper,... [more] |
COMP2009-17 pp.51-55 |
[Return to Top Page]