Takashi Horiyama

According to our database, Takashi Horiyama authored at least 80 papers between 1997 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Properties of Euclidean minimum weight (k,ℓ)-tight graphs.

Hitomi Hayashi, Yuya Higashikawa, Takashi Horiyama, Naoki Katoh, Yuki Kawakami

Discret. Appl. Math., 2026

2025

The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs.

Takashi Horiyama, Kazuhisa Seto, Ryu Suzuki

Theory Comput. Syst., December, 2025

Maximal α-Gapped Repeats in a Fibonacci String.

Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.

Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas.

Takashi Horiyama, Yuto Okura, Kazuhisa Seto, Junichi Teruyama

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

Realizing 4-input Functions with the Minimum Toffoli Gate Count.

Shigeru Yamashita, Takashi Horiyama, Norihito Yasuda, Tatsuya Nakao

Proceedings of the 55th IEEE International Symposium on Multiple-Valued Logic, 2025

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

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

Shortest Cover After Edit.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

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

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Efficient Folding Algorithms for Convex Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Discret. Comput. Geom., December, 2023

Finding top-<i>k</i> longest palindromes in substrings.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Theor. Comput. Sci., November, 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., September, 2023

Internal Longest Palindrome Queries in Optimal Time.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Proceedings of the WALCOM: Algorithms and Computation, 2023

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

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

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

CoRR, 2022

Efficient segment folding is hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Comput. Geom., 2022

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words.

Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Optimal reconfiguration of optimal ladder lotteries.

Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa

Theor. Comput. Sci., 2021

Longest common subsequence in sublinear space.

Masashi Kiyomi, Takashi Horiyama, Yota Otachi

Inf. Process. Lett., 2021

Algorithmic enumeration of surrounding polygons.

Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi

Discret. Appl. Math., 2021

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

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

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

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.

Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Efficient Folding Algorithms for Regular Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Geodesic Folding of Tetrahedron.

Seri Nishimoto, Takashi Horiyama, Tomohiro Tachi

CoRR, 2019

Decomposing a Graph into Unigraphs.

Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata

CoRR, 2019

Efficient Algorithm for Box Folding.

Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Max-Min 3-Dispersion Problems.

Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Ecient Segment Folding is Hard.

Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

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

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

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

Enumerating Cryptarithms Using Deterministic Finite Automata.

Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Takashi Horiyama, Ayumi Shinohara

CoRR, 2018

Computational Complexity of Robot Arm Simulation Problems.

Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 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

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Ladder-Lottery Realization.

Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams.

Takashi Horiyama, Masahiro Miyasaka, Riku Sasaki

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

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

Complexity of Tiling a Polygon with Trominoes or Bars.

Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

Discret. Comput. Geom., 2017

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

Proceedings of the WALCOM: Algorithms and Computation, 2017

Generating All Patterns of Graph Partitions Within a Disparity Bound.

Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato

Proceedings of the WALCOM: Algorithms and Computation, 2017

Rep-cubes: Unfolding and Dissection of Cubes.

Dawei Xu, Takashi Horiyama, Ryuhei Uehara

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Convex Configurations on Nana-kin-san Puzzle.

Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.

Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Common Developments of Three Incongruent Boxes of Area 30.

Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara

Proceedings of the Theory and Applications of Models of Computation, 2015

Continuous Folding of Regular Dodecahedra.

Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

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

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Base-object location problems for base-monotone regions.

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

Theor. Comput. Sci., 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

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

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Foreword.

Takashi Horiyama

IEICE Trans. Inf. Syst., 2013

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

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

The Number of Different Unfoldings of Polyhedra.

Takashi Horiyama, Wataru Shoji

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation.

Xin Man, Takashi Horiyama, Shinji Kimura

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

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.

Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Edge Unfoldings of Platonic Solids Never Overlap.

Takashi Horiyama, Wataru Shoji

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

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

Generation of Polyiamonds for p6 Tiling by the Reverse Search.

Takashi Horiyama, Shogo Yamane

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

Enumeration of Polyominoes for p4 Tiling.

Takashi Horiyama, Masato Samejima

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

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

Fine-Grained Power Gating Based on the Controlling Value of Logic Elements.

Lei Chen, Takashi Horiyama, Yuichi Nakamura, Shinji Kimura

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

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

How to collect balls moving in the Euclidean plane.

Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita

Discret. Appl. Math., 2006

Finite-State Online Algorithms and Their Automated Competitive Analysis.

Takashi Horiyama, Kazuo Iwama, Jun Kawahara

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2004

Minimization of fractional wordlength on fixed-point conversion for high-level synthesis.

Nobuhiro Doi, Takashi Horiyama, Masaki Nakanishi, Shinji Kimura

Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004

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

Finding Essential Attributes from Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Ann. Math. Artif. Intell., 2003

Density Condensation of Boolean Formulas.

Youichi Hanatani, Takashi Horiyama, Kazuo Iwama

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

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

Folding of logic functions and its application to look up table compaction.

Shinji Kimura, Takashi Horiyama, Masaki Nakanishi, Hirotsugu Kajihara

Proceedings of the 2002 IEEE/ACM International Conference on Computer-aided Design, 2002

2001

Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.

Takashi Horiyama, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Speech recognition chip for monosyllables.

Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe

Proceedings of ASP-DAC 2001, 2001

A real-time 64-monosyllable recognition LSI with learning mechanism.

Kazuhiro Nakamura, Qiang Zhu, Shinji Maruoka, Takashi Horiyama, Shinji Kimura, Katsumasa Watanabe

Proceedings of ASP-DAC 2001, 2001

2000

Reasoning with Ordered Binary Decision Diagrams.

Takashi Horiyama, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Finding Essential Attributes in Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

1999

A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival.

Naofumi Takagi, Takashi Horiyama

IEEE Trans. Computers, 1999

Ordered Binary Decision Diagrams as Knowledge-Bases.

Takashi Horiyama, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1997

Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion.

Takashi Horiyama, Shuzo Yajima

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997