Takashi Horiyama

According to our database1, Takashi Horiyama authored at least 72 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shortest cover after edit.
CoRR, 2024

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Efficient Folding Algorithms for Convex Polyhedra.
Discret. Comput. Geom., December, 2023

Finding top-<i>k</i> longest palindromes in substrings.
Theor. Comput. Sci., November, 2023

Enumerating Empty and Surrounding Polygons.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023

Internal Longest Palindrome Queries in Optimal Time.
Proceedings of the WALCOM: Algorithms and Computation, 2023

2022
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions.
CoRR, 2022

Efficient segment folding is hard.
Comput. Geom., 2022

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Optimal reconfiguration of optimal ladder lotteries.
Theor. Comput. Sci., 2021

Longest common subsequence in sublinear space.
Inf. Process. Lett., 2021

Max-Min 3-Dispersion Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Algorithmic enumeration of surrounding polygons.
Discret. Appl. Math., 2021

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.
CoRR, 2021

2020
Rigid foldability is NP-hard.
J. Comput. Geom., 2020

Efficient Algorithm for Box Folding.
J. Graph Algorithms Appl., 2020

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.
CoRR, 2020

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Efficient Folding Algorithms for Regular Polyhedra.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl., 2019

Geodesic Folding of Tetrahedron.
CoRR, 2019

Decomposing a Graph into Unigraphs.
CoRR, 2019

Ecient Segment Folding is Hard.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Swapping colored tokens on graphs.
Theor. Comput. Sci., 2018

Rep-Cubes: Dissection of a Cube into Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Enumerating Cryptarithms Using Deterministic Finite Automata.
CoRR, 2018

Computational Complexity of Robot Arm Simulation Problems.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Exact Algorithms for the Max-Min Dispersion Problem.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Ladder-Lottery Realization.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.
J. Inf. Process., 2017

Complexity of Tiling a Polygon with Trominoes or Bars.
Discret. Comput. Geom., 2017

Common developments of three incongruent boxes of area 30.
Comput. Geom., 2017

Generating All Patterns of Graph Partitions Within a Disparity Bound.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Rep-cubes: Unfolding and Dissection of Cubes.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.
J. Graph Algorithms Appl., 2016

Convex Configurations on Nana-kin-san Puzzle.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Swapping Colored Tokens on Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Continuous Folding of Regular Dodecahedra.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Box Pleating is Hard.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
Base-object location problems for base-monotone regions.
Theor. Comput. Sci., 2014

Computational Complexity of Piano-Hinged Dissections.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Foreword.
IEICE Trans. Inf. Syst., 2013

Base Location Problems for Base-Monotone Regions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

The Number of Different Unfoldings of Polyhedra.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Edge Unfoldings of Platonic Solids Never Overlap.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Generation of Polyiamonds for p6 Tiling by the Reverse Search.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Enumeration of Polyominoes for p4 Tiling.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Fine-Grained Power Gating Based on the Controlling Value of Logic Elements.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2006
Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Density condensation of Boolean formulas.
Discret. Appl. Math., 2006

Finite-State Online Algorithms and Their Automated Competitive Analysis.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2004
How to Collect Balls Moving in the Euclidean Plane.
Proceedings of Computing: The Australasian Theory Symposium, 2004

Reasoning with ordered binary decision diagrams.
Discret. Appl. Math., 2004

Minimization of fractional wordlength on fixed-point conversion for high-level synthesis.
Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004

2003
Translation among CNFs, characteristic models and ordered binary decision diagrams.
Inf. Process. Lett., 2003

Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell., 2003

2002
Look Up Table Compaction Based on Folding of Logic Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Ordered binary decision diagrams as knowledge-bases.
Artif. Intell., 2002

Folding of logic functions and its application to look up table compaction.
Proceedings of the 2002 IEEE/ACM International Conference on Computer-aided Design, 2002

2001
Speech recognition chip for monosyllables.
Proceedings of ASP-DAC 2001, 2001

A real-time 64-monosyllable recognition LSI with learning mechanism.
Proceedings of ASP-DAC 2001, 2001

2000
Finding Essential Attributes in Binary Data.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

1999
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival.
IEEE Trans. Computers, 1999

1997
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997


  Loading...