Takashi Horiyama

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