Takashi Horiyama

Most-cited papers

Finding Essential Attributes from Binary Data
E. Boros, Takashi Horiyama, T. Ibaraki, K. Makino +1 more
2003Annals of Mathematics and Artificial Intelligence36 citations
Semantic Scholar
Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, Takashi Horiyama, J. Keil, D. Kirkpatrick +4 more
2018Theoretical Computer Science25 citations Open access
Semantic Scholar
An on-chip high speed serial communication method based on independent ring oscillators
S. Kimura, Tomokazu Hayakawa, Takashi Horiyama, Masaki Nakanishi +1 more
20032003 IEEE International Solid-State Circuits Conference, 2003. Digest of Technical Papers. ISSCC.24 citations
Semantic Scholar
Common developments of three incongruent boxes of area 30
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, R. Uehara
2015Computational geometry23 citations Open access
Semantic Scholar
Rigid Foldability is NP-Hard
H. Akitaya, E. Demaine, Takashi Horiyama, Thomas C. Hull +2 more
2018Journal of Computational Geometry21 citations
Semantic Scholar
Exact Algorithms for the Max-Min Dispersion Problem
Toshihiro Akagi, Tetsu Araki, Takashi Horiyama, Shin-Ichi Nakano +6 more
2018Frontiers in Algorithmics20 citations Open access
Semantic Scholar
Edge Unfoldings of Platonic Solids Never Overlap
Takashi Horiyama, Wataru Shoji
2011Canadian Conference on Computational Geometry20 citations
Semantic Scholar
Box Pleating is Hard
H. Akitaya, Kenneth C. Cheung, E. Demaine, Takashi Horiyama +4 more
2015JCDCGG18 citations
Semantic Scholar
Enumeration of region partitioning for evacuation planning based on ZDD
A. Takizawa, Y. Takechi, Akio Ohta, N. Katoh +4 more
201318 citations Open access
Semantic Scholar
Minimization of fractional wordlength on fixed-point conversion for high-level synthesis
Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, S. Kimura
2004Asia and South Pacific Design Automation Conference18 citations
Semantic Scholar
Deciphering Time Scale Hierarchy in Reaction Networks.
Yutaka Nagahata, S. Maeda, H. Teramoto, Takashi Horiyama +2 more
2016Journal of Physical Chemistry B17 citations
Semantic Scholar
Ordered binary decision diagrams as knowledge-bases
Takashi Horiyama, T. Ibaraki
1999Artificial Intelligence17 citations Open access
Semantic Scholar
Generating All Patterns of Graph Partitions Within a Disparity Bound
Jun Kawahara, Takashi Horiyama, Keisuke Hotta, S. Minato
2017Workshop on Algorithms and Computation16 citations
Semantic Scholar
Complexity of Tiling a Polygon with Trominoes or Bars
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki +1 more
2017Discrete & Computational Geometry15 citations
Semantic Scholar
Sequentially Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, E. Demaine, Takashi Horiyama, A. Kawamura +6 more
2017Workshop on Algorithms and Computation15 citations Open access
Semantic Scholar
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival
N. Takagi, Takashi Horiyama
1999IEEE Trans. Computers13 citations
Semantic Scholar
How to Collect Balls Moving in the Euclidean Plane
Yuichi Asahiro, Takashi Horiyama, K. Makino, H. Ono +2 more
2004Computing: The Australasian Theory Symposium12 citations Open access
Semantic Scholar
Longest Common Subsequence in Sublinear Space
M. Kiyomi, Takashi Horiyama, Y. Otachi
2020Information Processing Letters10 citations Open access
Semantic Scholar
Finite-State Online Algorithms and Their Automated Competitive Analysis
Takashi Horiyama, K. Iwama, Jun Kawahara
2006International Symposium on Algorithms and Computation10 citations
Semantic Scholar
RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
2022Annual Symposium on Combinatorial Pattern Matching9 citations
Semantic Scholar
The Number of Different Unfoldings of Polyhedra
Takashi Horiyama, Wataru Shoji
2013International Symposium on Algorithms and Computation9 citations
Semantic Scholar
Folding of logic functions and its application to look up table compaction
S. Kimura, Takashi Horiyama, Masaki Nakanishi, H. Kajihara
2002IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002.9 citations
Semantic Scholar
Max-Min 3-Dispersion Problems
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, K. Suetsugu +4 more
2019International Computing and Combinatorics Conference8 citations
Semantic Scholar
Density condensation of Boolean formulas
Youichi Hanatani, Takashi Horiyama, K. Iwama
2003Discrete Applied Mathematics8 citations Open access
Semantic Scholar
Speech recognition chip for monosyllables
Kazuhiro Nakamura, Qiang Zhu, S. Maruoka, Takashi Horiyama +2 more
2001Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455)8 citations
Semantic Scholar
Fine-Grained Power Gating Based on the Controlling Value of Logic Elements
Lei Chen, Takashi Horiyama, Yuichi Nakamura, S. Kimura
2008IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences7 citations
Semantic Scholar
Efficient Algorithm for Box Folding
Koichi Mizunashi, Takashi Horiyama, R. Uehara
2018Workshop on Algorithms and Computation6 citations Open access
Semantic Scholar
Reasoning with ordered binary decision diagrams
Takashi Horiyama, T. Ibaraki
2000Discrete Applied Mathematics6 citations Open access
Semantic Scholar
Finding top-k longest palindromes in substrings
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2022Theoretical Computer Science5 citations Open access
Semantic Scholar
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, S. Minato +6 more
2021arXiv.org5 citations
Semantic Scholar
Algorithmic enumeration of surrounding polygons
Katsuhisa Yamanaka, D. Avis, Takashi Horiyama, Y. Okamoto +2 more
2020Discrete Applied Mathematics5 citations Open access
Semantic Scholar
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki +1 more
2012Canadian Conference on Computational Geometry5 citations
Semantic Scholar
Enumeration of nonequivalent substitutional structures using advanced data structure of binary decision diagram.
Kohei Shinohara, A. Seko, Takashi Horiyama, Masakazu Ishihata +2 more
2020Journal of Chemical Physics4 citations Open access
Semantic Scholar
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints
Yu Nakahata, Jun Kawahara, Takashi Horiyama, S. Kasahara
2018IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences4 citations
Semantic Scholar
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Y. Araki, Takashi Horiyama, Ryuhei Uehara
2014J. Graph Algorithms Appl.4 citations Open access
Semantic Scholar
Translation among CNFs, characteristic models and ordered binary decision diagrams
Takashi Horiyama, T. Ibaraki
2003Information Processing Letters4 citations
Semantic Scholar
Efficient Folding Algorithms for Regular Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, R. Uehara
2021Canadian Conference on Computational Geometry3 citations
Semantic Scholar
Decomposing a Graph into Unigraphs
Takashi Horiyama, Jun Kawahara, S. Minato, Yu Nakahata
2019arXiv.org3 citations
Semantic Scholar
Ladder-Lottery Realization
Katsuhisa Yamanaka, Takashi Horiyama, T. Uno, Kunihiro Wasa
2018Canadian Conference on Computational Geometry3 citations
Semantic Scholar
Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams
Takashi Horiyama, Masahiro Miyasaka, Riku Sasaki
2018Canadian Conference on Computational Geometry3 citations
Semantic Scholar
Internal Longest Palindrome Queries in Optimal Time
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023Workshop on Algorithms and Computation2 citations Open access
Semantic Scholar
Enumerating Empty and Surrounding Polygons
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama +2 more
2023IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences2 citations Open access
Semantic Scholar
Optimal reconfiguration of optimal ladder lotteries
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
2021Theoretical Computer Science2 citations Open access
Semantic Scholar
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Yu Nakahata, Takashi Horiyama, S. Minato, Katsuhisa Yamanaka
2020arXiv.org2 citations
Semantic Scholar
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Yu Nakahata, Jun Kawahara, Takashi Horiyama, S. Minato
2019Workshop on Algorithms and Computation2 citations Open access
Semantic Scholar
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
Takashi Horiyama, Takashi Iizuka, M. Kiyomi, Y. Okamoto +4 more
2017Fun with Algorithms2 citations Open access
Semantic Scholar
Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation
Xin Man, Takashi Horiyama, S. Kimura
2012IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences2 citations
Semantic Scholar
Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating
Xin Man, Takashi Horiyama, S. Kimura
2010IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences2 citations
Semantic Scholar
Enumeration of Polyominoes for p4 Tiling
Takashi Horiyama, Masato Samejima
2009Canadian Conference on Computational Geometry2 citations
Semantic Scholar
Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis
Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, S. Kimura +1 more
2003IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences2 citations
Semantic Scholar