Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. - Takashi Horiyama; Shuzo Yajima (ISAAC, 1997)

A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival. - Naofumi Takagi; Takashi Horiyama (IEEE Trans. Computers, 1999)

Finding Essential Attributes in Binary Data. - Endre Boros; Takashi Horiyama; Toshihide Ibaraki; Kazuhisa Makino; Mutsunori Yagiura (IDEAL, 2000)

A real-time 64-monosyllable recognition LSI with learning mechanism. - Kazuhiro Nakamura; Qiang Zhu 008; Shinji Maruoka; Takashi Horiyama; Shinji Kimura; Katsumasa Watanabe (ASP-DAC, 2001)

Speech recognition chip for monosyllables. - Kazuhiro Nakamura; Qiang Zhu 008; Shinji Maruoka; Takashi Horiyama; Shinji Kimura; Katsumasa Watanabe (ASP-DAC, 2001)

Folding of logic functions and its application to look up table compaction. - Shinji Kimura; Takashi Horiyama; Masaki Nakanishi; Hirotsugu Kajihara (ICCAD, 2002)

Ordered binary decision diagrams as knowledge-bases. - Takashi Horiyama; Toshihide Ibaraki (Artif. Intell., 2002)

Look Up Table Compaction Based on Folding of Logic Functions. - Shinji Kimura; Atsushi Ishii; Takashi Horiyama; Masaki Nakanishi; Hirotsugu Kajihara; Katsumasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Finding Essential Attributes from Binary Data. - Endre Boros; Takashi Horiyama; Toshihide Ibaraki; Kazuhisa Makino; Mutsunori Yagiura (Ann. Math. Artif. Intell., 2003)

Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis. - Nobuhiro Doi; Takashi Horiyama; Masaki Nakanishi; Shinji Kimura; Katsumasa Watanabe (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Translation among CNFs, characteristic models and ordered binary decision diagrams. - Takashi Horiyama; Toshihide Ibaraki (Inf. Process. Lett., 2003)

Minimization of fractional wordlength on fixed-point conversion for high-level synthesis. - Nobuhiro Doi; Takashi Horiyama; Masaki Nakanishi; Shinji Kimura (ASP-DAC, 2004)

Reasoning with ordered binary decision diagrams. - Takashi Horiyama; Toshihide Ibaraki (Discret. Appl. Math., 2004)

Finite-State Online Algorithms and Their Automated Competitive Analysis. - Takashi Horiyama; Kazuo Iwama; Jun Kawahara (ISAAC, 2006)

How to collect balls moving in the Euclidean plane. - Yuichi Asahiro; Takashi Horiyama; Kazuhisa Makino; Hirotaka Ono 001; Toshinori Sakuma; Masafumi Yamashita (Discret. Appl. Math., 2006)

Density condensation of Boolean formulas. - Youichi Hanatani; Takashi Horiyama; Kazuo Iwama (Discret. Appl. Math., 2006)

Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique. - Nobuhiro Doi; Takashi Horiyama; Masaki Nakanishi; Shinji Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Fine-Grained Power Gating Based on the Controlling Value of Logic Elements. - Lei Chen; Takashi Horiyama; Yuichi Nakamura 002; Shinji Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

New Graph Calculi for Planar Non-3-Colorable Graphs. - Youichi Hanatani; Takashi Horiyama; Kazuo Iwama; Suguru Tamaki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Enumeration of Polyominoes for p4 Tiling. - Takashi Horiyama; Masato Samejima (CCCG, 2009)

Generation of Polyiamonds for p6 Tiling by the Reverse Search. - Takashi Horiyama; Shogo Yamane (CGGA, 2010)

Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating. - Xin Man; Takashi Horiyama; Shinji Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Edge Unfoldings of Platonic Solids Never Overlap. - Takashi Horiyama; Wataru Shoji (CCCG, 2011)

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (CCCG, 2012)

Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation. - Xin Man; Takashi Horiyama; Shinji Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

The Number of Different Unfoldings of Polyhedra. - Takashi Horiyama; Wataru Shoji (ISAAC, 2013)

Base Location Problems for Base-Monotone Regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (WALCOM, 2013)

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 (FUN, 2014)

Computational Complexity of Piano-Hinged Dissections. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Takashi Horiyama; Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2014)

Box Pleating is Hard. - Hugo A. Akitaya; Kenneth C. Cheung; Erik D. Demaine; Takashi Horiyama; Thomas C. Hull; Jason S. Ku; Tomohiro Tachi; Ryuhei Uehara (JCDCGG, 2015)

Continuous Folding of Regular Dodecahedra. - Takashi Horiyama; Jin-ichi Itoh; Naoki Katoh; Yuki Kobayashi; Chie Nara (JCDCGG, 2015)

Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Takashi Horiyama; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (WADS, 2015)

Convex Configurations on Nana-kin-san Puzzle. - Takashi Horiyama; Ryuhei Uehara; Haruo Hosoya (FUN, 2016)

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. - Yoshiaki Araki; Takashi Horiyama; Ryuhei Uehara (J. Graph Algorithms Appl., 2016)

Rep-cubes: Unfolding and Dissection of Cubes. - Dawei Xu; Takashi Horiyama; Ryuhei Uehara (CCCG, 2017)

Generating All Patterns of Graph Partitions Within a Disparity Bound. - Jun Kawahara; Takashi Horiyama; Keisuke Hotta; Shin-ichi Minato (WALCOM, 2017)

Common developments of three incongruent boxes of area 30. - Dawei Xu; Takashi Horiyama; Toshihiro Shirakawa; Ryuhei Uehara (Comput. Geom., 2017)

Complexity of Tiling a Polygon with Trominoes or Bars. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (Discret. Comput. Geom., 2017)

Foreword. - Takashi Horiyama (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Takashi Iizuka; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (J. Inf. Process., 2017)

Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams. - Takashi Horiyama; Masahiro Miyasaka; Riku Sasaki (CCCG, 2018)

Ladder-Lottery Realization. - Katsuhisa Yamanaka; Takashi Horiyama; Takeaki Uno; Kunihiro Wasa (CCCG, 2018)

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 (FAW, 2018)

Computational Complexity of Robot Arm Simulation Problems. - Tianfeng Feng; Takashi Horiyama; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Takeaki Uno; Ryuhei Uehara (IWOCA, 2018)

Enumerating Cryptarithms Using Deterministic Finite Automata. - Yuki Nozaki; Diptarama Hendrian; Ryo Yoshinaka; Takashi Horiyama; Ayumi Shinohara (CoRR, 2018)

Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. - Yu Nakahata; Jun Kawahara; Takashi Horiyama; Shoji Kasahara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Rep-Cubes: Dissection of a Cube into Nets. - Dawei Xu; Jinfeng Huang; Yuta Nakane; Tomoo Yokoyama; Takashi Horiyama; Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Swapping colored tokens on graphs. - Katsuhisa Yamanaka; Takashi Horiyama; J. Mark Keil; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2018)

Ecient Segment Folding is Hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (CCCG, 2019)

Decomposing a Graph into Unigraphs. - Takashi Horiyama; Jun Kawahara; Shin-ichi Minato; Yu Nakahata (CoRR, 2019)

Geodesic Folding of Tetrahedron. - Seri Nishimoto; Takashi Horiyama; Tomohiro Tachi (CoRR, 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Efficient Folding Algorithms for Regular Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (CCCG, 2020)

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. - Yu Nakahata; Jun Kawahara; Takashi Horiyama; Shin-ichi Minato (WALCOM, 2020)

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. - Yu Nakahata; Takashi Horiyama; Shin-ichi Minato; Katsuhisa Yamanaka (CoRR, 2020)

Efficient Algorithm for Box Folding. - Koichi Mizunashi; Takashi Horiyama; Ryuhei Uehara (J. Graph Algorithms Appl., 2020)

Rigid foldability is NP-hard. - Hugo A. Akitaya; Erik D. Demaine; Takashi Horiyama; Thomas C. Hull; Jason S. Ku; Tomohiro Tachi (J. Comput. Geom., 2020)

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. - Mutsunori Banbara; Kenji Hashimoto; Takashi Horiyama; Shin-ichi Minato; Kakeru Nakamura; Masaaki Nishino; Masahiko Sakai; Ryuhei Uehara; Yushi Uno; Norihito Yasuda (CoRR, 2021)

Algorithmic enumeration of surrounding polygons. - Katsuhisa Yamanaka; David Avis; Takashi Horiyama; Yoshio Okamoto; Ryuhei Uehara; Tanami Yamauchi (Discret. Appl. Math., 2021)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Longest common subsequence in sublinear space. - Masashi Kiyomi; Takashi Horiyama; Yota Otachi (Inf. Process. Lett., 2021)

Optimal reconfiguration of optimal ladder lotteries. - Katsuhisa Yamanaka; Takashi Horiyama; Kunihiro Wasa (Theor. Comput. Sci., 2021)

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. - Takuya Mieno; Shunsuke Inenaga; Takashi Horiyama (CPM, 2022)

Efficient segment folding is hard. - Takashi Horiyama; Fabian Klute; Matias Korman; Irene Parada; Ryuhei Uehara; Katsuhisa Yamanaka (Comput. Geom., 2022)

Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. - Shin-ichi Minato; Mutsunori Banbara; Takashi Horiyama; Jun Kawahara; Ichigaku Takigawa; Yutaro Yamaguchi 001 (CoRR, 2022)

Internal Longest Palindrome Queries in Optimal Time. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (WALCOM, 2023)

Enumerating Empty and Surrounding Polygons. - Shunta Terui; Katsuhisa Yamanaka; Takashi Hirayama; Takashi Horiyama; Kazuhiro Kurita; Takeaki Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Finding top-k longest palindromes in substrings. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (Theor. Comput. Sci., 2023)

Efficient Folding Algorithms for Convex Polyhedra. - Tonan Kamata; Akira Kadoguchi; Takashi Horiyama; Ryuhei Uehara (Discret. Comput. Geom., 2023)

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. - Takashi Horiyama; Yasuaki Kobayashi; Hirotaka Ono 001; Kazuhisa Seto; Ryu Suzuki (AAAI, 2024)

Shortest Cover After Edit. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (CPM, 2024)

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. - Yuki Kawakami; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama; Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh (IEICE Trans. Inf. Syst., 2024)

Realizing 4-input Functions with the Minimum Toffoli Gate Count. - Shigeru Yamashita; Takashi Horiyama; Norihito Yasuda; Tatsuya Nakao (ISMVL, 2025)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. - Takuya Mieno; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama (SOFSEM (2), 2025)

Maximal α-Gapped Repeats in a Fibonacci String. - Kazuma Yamane; Yuto Nakashima 001; Kazuhisa Seto; Takashi Horiyama (SOFSEM (2), 2025)