Takashi Horiyama
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
34
Venues
17
Active years
1997–2026
Best venue rank
A*
Where they publish
Papers
34 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | FUN | Computational Complexity of Swish Is Solved. | Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi |
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2025 | FCT | Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3. | Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki |
| 2025 | SOFSEM | Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. | Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama |
| 2025 | SOFSEM | Maximal α-Gapped Repeats in a Fibonacci String. | Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama |
| 2024 | AAAI | Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. | Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki |
| 2024 | CPM | Shortest Cover After Edit. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2023 | WALCOM | Internal Longest Palindrome Queries in Optimal Time. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2022 | CPM | {RePair} Grammars Are the Smallest Grammars for Fibonacci Words. | Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama |
| 2020 | WALCOM | Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. | Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | WALCOM | Efficient Algorithm for Box Folding. | Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara |
| 2018 | FAW | Exact Algorithms for the Max-Min Dispersion Problem. | Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2017 | WALCOM | Generating All Patterns of Graph Partitions Within a Disparity Bound. | Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato |
| 2017 | WALCOM | Sequentially Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno |
| 2016 | FUN | Convex Configurations on Nana-kin-san Puzzle. | Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya |
| 2015 | TAMC | Common Developments of Three Incongruent Boxes of Area 30. | Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara |
| 2015 | WADS | Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno |
| 2015 | WALCOM | Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. | Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara |
| 2014 | FUN | Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. | Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi |
| 2013 | ISAAC | The Number of Different Unfoldings of Polyhedra. | Takashi Horiyama, Wataru Shoji |
| 2013 | WALCOM | Base Location Problems for Base-Monotone Regions. | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno |
| 2006 | ISAAC | Finite-State Online Algorithms and Their Automated Competitive Analysis. | Takashi Horiyama, Kazuo Iwama, Jun Kawahara |
| 2004 | ASPDAC | Minimization of fractional wordlength on fixed-point conversion for high-level synthesis. | Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura |
| 2003 | SAT | Density Condensation of Boolean Formulas. | Youichi Hanatani, Takashi Horiyama, Kazuo Iwama |
| 2002 | ICCAD | Folding of logic functions and its application to look up table compaction. | Shinji Kimura, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara |
| 2001 | ASPDAC | A real-time 64-monosyllable recognition LSI with learning mechanism. | Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe |
| 2001 | ASPDAC | Speech recognition chip for monosyllables. | Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe |
| 2001 | ISAAC | Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. | Takashi Horiyama, Toshihide Ibaraki |
| 2000 | ISAAC | Reasoning with Ordered Binary Decision Diagrams. | Takashi Horiyama, Toshihide Ibaraki |
| 2000 | IDEAL | Finding Essential Attributes in Binary Data. | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
| 1999 | ISAAC | Ordered Binary Decision Diagrams as Knowledge-Bases. | Takashi Horiyama, Toshihide Ibaraki |
| 1997 | ISAAC | Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. | Takashi Horiyama, Shuzo Yajima |