Takashi Horiyama

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 54

Top Topics

Trinocular Stereo

Computational Complexity

Convex Polyhedra

Top Venues

IEICE Trans. Fundam. Electron. Commun. Comput. Sci.

Publications

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest Cover After Edit. CPM (2024)
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 107 (6) (2024)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest cover after edit. CoRR (2024)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI (2024)
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (9) (2023)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
longest palindromes in substrings. Theor. Comput. Sci. 979 (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. WALCOM (2023)
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG (2023)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Convex Polyhedra. Discret. Comput. Geom. 70 (4) (2023)
Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR (2022)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. CoRR (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM (2022)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient segment folding is hard. Comput. Geom. 104 (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR (2022)
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303 (2021)
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR (2021)
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
Longest common subsequence in sublinear space. Inf. Process. Lett. 168 (2021)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Regular Polyhedra. CoRR (2021)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
Optimal reconfiguration of optimal ladder lotteries. Theor. Comput. Sci. 859 (2021)
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. CoRR (2020)
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
Efficient Folding Algorithms for Regular Polyhedra. CCCG (2020)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Efficient Segment Folding is Hard. CoRR (2020)
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. WALCOM (2020)
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
Efficient Algorithm for Box Folding. J. Graph Algorithms Appl. 24 (2) (2020)
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
Longest Common Subsequence in Sublinear Space. CoRR (2020)
Hugo Alves Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi
Rigid foldability is NP-hard. J. Comput. Geom. 11 (1) (2020)
Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata
Decomposing a Graph into Unigraphs. CoRR (2019)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23 (1) (2019)
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Ecient Segment Folding is Hard. CCCG (2019)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. COCOON (2019)
Seri Nishimoto, Takashi Horiyama, Tomohiro Tachi
Geodesic Folding of Tetrahedron. CoRR (2019)
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. CoRR (2019)
Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
Efficient Algorithm for Box Folding. WALCOM (2019)
Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Ayumi Shinohara
Enumerating Cryptarithms Using Deterministic Finite Automata. CoRR (2018)
Takashi Horiyama, Masahiro Miyasaka, Riku Sasaki
Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams. CCCG (2018)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem. FAW (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping colored tokens on graphs. Theor. Comput. Sci. 729 (2018)
Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi
Rigid Foldability is NP-Hard. CoRR (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. CoRR (2018)
Dawei Xu, Jinfeng Huang, Yuta Nakane, Tomoo Yokoyama, Takashi Horiyama, Ryuhei Uehara
Rep-Cubes: Dissection of a Cube into Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
Ladder-Lottery Realization. CCCG (2018)
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Computational Complexity of Robot Arm Simulation Problems. IWOCA (2018)
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Dawei Xu, Takashi Horiyama, Ryuhei Uehara
Rep-cubes: Unfolding and Dissection of Cubes. CCCG (2017)
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58 (3) (2017)
Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato
Generating All Patterns of Graph Partitions Within a Disparity Bound. WALCOM (2017)
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
Common developments of three incongruent boxes of area 30. Comput. Geom. 64 (2017)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. WALCOM (2017)
Takashi Horiyama
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2017)
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25 (2017)
Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya
Convex Configurations on Nana-kin-san Puzzle. FUN (2016)
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. J. Graph Algorithms Appl. 20 (1) (2016)
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. WALCOM (2015)
Hugo Alves Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara
Box Pleating is Hard. JCDCGG (2015)
Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. WADS (2015)
Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara
Continuous Folding of Regular Dodecahedra. JCDCGG (2015)
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara
Common Developments of Three Incongruent Boxes of Area 30. TAMC (2015)
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555 (2014)
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN (2014)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, Ryuhei Uehara
Computational Complexity of Piano-Hinged Dissections. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
Base Location Problems for Base-Monotone Regions. WALCOM (2013)
Takashi Horiyama
Foreword. IEICE Trans. Inf. Syst. (3) (2013)
Takashi Horiyama, Wataru Shoji
The Number of Different Unfoldings of Polyhedra. ISAAC (2013)
Xin Man, Takashi Horiyama, Shinji Kimura
Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (8) (2012)
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. CCCG (2012)
Takashi Horiyama, Wataru Shoji
Edge Unfoldings of Platonic Solids Never Overlap. CCCG (2011)
Takashi Horiyama, Shogo Yamane
Generation of Polyiamonds for p6 Tiling by the Reverse Search. CGGA (2010)
Xin Man, Takashi Horiyama, Shinji Kimura
Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2010)
Takashi Horiyama, Masato Samejima
Enumeration of Polyominoes for p4 Tiling. CCCG (2009)
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki
New Graph Calculi for Planar Non-3-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2008)
Lei Chen, Takashi Horiyama, Yuichi Nakamura, Shinji Kimura
Fine-Grained Power Gating Based on the Controlling Value of Logic Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2008)
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
Density condensation of Boolean formulas. Discret. Appl. Math. 154 (16) (2006)
Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura
Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2006)
Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
How to collect balls moving in the Euclidean plane. Discret. Appl. Math. 154 (16) (2006)
Takashi Horiyama, Kazuo Iwama, Jun Kawahara
Finite-State Online Algorithms and Their Automated Competitive Analysis. ISAAC (2006)
Takashi Horiyama, Toshihide Ibaraki
Reasoning with ordered binary decision diagrams. Discret. Appl. Math. 142 (1-3) (2004)
Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
How to Collect Balls Moving in the Euclidean Plane. Electron. Notes Theor. Comput. Sci. 91 (2004)
Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura
Minimization of fractional wordlength on fixed-point conversion for high-level synthesis. ASP-DAC (2004)
Takashi Horiyama, Toshihide Ibaraki
Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85 (4) (2003)
Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura, Katsumasa Watanabe
Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2003)
Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
Density Condensation of Boolean Formulas. SAT (2003)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39 (3) (2003)
Shinji Kimura, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara
Folding of logic functions and its application to look up table compaction. ICCAD (2002)
Takashi Horiyama, Toshihide Ibaraki
Ordered binary decision diagrams as knowledge-bases. Artif. Intell. 136 (2) (2002)
Shinji Kimura, Atsushi Ishii, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara, Katsumasa Watanabe
Look Up Table Compaction Based on Folding of Logic Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2002)
Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe
A real-time 64-monosyllable recognition LSI with learning mechanism. ASP-DAC (2001)
Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe
Speech recognition chip for monosyllables. ASP-DAC (2001)
Takashi Horiyama, Toshihide Ibaraki
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. ISAAC (2001)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes in Binary Data. IDEAL (2000)
Takashi Horiyama, Toshihide Ibaraki
Reasoning with Ordered Binary Decision Diagrams. ISAAC (2000)
Naofumi Takagi, Takashi Horiyama
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival. IEEE Trans. Computers 48 (1) (1999)
Takashi Horiyama, Toshihide Ibaraki
Ordered Binary Decision Diagrams as Knowledge-Bases. ISAAC (1999)
Takashi Horiyama, Shuzo Yajima
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. ISAAC (1997)