Reconfiguring undirected paths
16th Algorithms and Data Structures Symp. (WADS 2019), 2019
Folding and unfolding algorithms on (super)computer
The 5th International Symposium on Computing and Networking (CANDAR 2017), Aomori, Japan, 2017
Development of Peg Solitaire Font
IEICE Technical Report, COMP2016-50, Vol. 116 No. 503, pp. 1-4, Nagoya, 2017
シルエットパズルの凸配置の個数の研究
IEICE Technical Report, COMP2016-29, Vol. 116, No. 262, pp. 39-45, Sendai, 2016
Experimental Enumeration of Solutions for Peg Solitaire
IPSJ SIG Technical Report, 2016-AL-159-3, p. 1, Tokushima, 2016
Counting the Number of Solutions for Peg Solitaire
IEICE Technical Report, COMP2016-14, Vol. 116, No. 211, pp. 1-5, Toyama, 2016
Computational Complexity of Sequential Token Swapping Problem
IEICE Technical Report, COMP2016-13, Vol. 116, No. 116, pp. 115-121, Ishikawa, 2016
直並列グラフの列挙
IPSJ SIG Technical Report, 2015-AL-157-9, pp. 1-7, Tokyo, 2016
Sliding token on unicyclick graphs.
IPSJ SIG Technical Report, 2015-AL-157-5, pp. 1-7, Tokyo, 2016
Shortest Reconfiguration of Sliding Tokens on a Caterpillar.
IPSJ SIG Technical Report, 2015-AL-155-1, pp. 1-8, Kagoshima, 2015
Space Efficient Greedy Algorithms on Intervals.
IPSJ SIG Technical Report, 2015-AL-154-4, pp. 1-7, Fukuoka, 2015
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
IPSJ SIG Technical Report, 2015-AL-154-8, pp. 1-6, Fukuoka, 2015
Ls in L and Sphinxes in Sphinx
IPSJ SIG Technical Report, 2015-AL-154-9, pp. 1-3, Fukuoka, 2015
The Convex Configurations of Dissection Puzzles with Seven Pieces.
IPSJ SIG Technical Report, 2015-AL-152-9, pp. 1-4, Tokyo, 2015
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
IPSJ SIG Technical Report, 2013-AL-147-12, pp. 1-6, Tokyo, 2014
キャタピラグラフの独立点集合遷移問題に対する多項式時間アルゴリズム
IPSJ SIG Technical Report, 2013-AL-147-11, pp. 1-5, Tokyo, 2014
Zipper Unfolding of Simple Convex Polyhedra
IPSJ SIG Technical Report, 2013-AL-146-4, pp. 1-6, 2014
Algorithms for independent set reconfiguration problem on graphs
IEICE Technical Report, COMP2013-39, Vol. 113, No. 371, pp. 7-14, 2013
Bumpy Pyramid Folding Problem
IPSJ SIG Technical Report, 2013-AL-145-9, pp. 1-7, 2013
The Graph Isomorphism Problem on Geometric graphs,
The 2nd Pacific Rim Mathematical Association (PRIMA), Shanghai, China, 2013
On generation of graphs with geometric representations
4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), Canada, 2013
The graph isomorphism problem on graphs with geometric represenations
4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), Canada, 2013
Computational Complexity of Piano-Hinged Dissections
IPSJ SIG Technical Report, 2013-AL-144-6, pp. 1-6, 2013
On the Complexity of Packing Trominoes
IEICE Technical Report, COMP2012-40, Vol. 112, No. 272, pp. 37-43, 2012
Approximation for the Geometric Unique Coverage Problem on Unit Squares
IEICE Technical Report, COMP2012-24, Vol. 112, No. 93, pp. 95-101, 2012
On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
IEICE Technical Report, COMP2012-6, Vol. 112, No. 21, pp. 37-43, 2012
On Computational Complexity and an Integer Programming model of Shakashaka
IEICE Technical Report, COMP2013-8, Vol. 113, No. 14, pp. 43-48, 2012
On the number of reduced tree, cographs, and series-parallel graphs by compression
IPSJ SIG Technical Report, 2011-AL-137-6, pp. 1-8, 2011
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
IPSJ SIG Technical Report, 2011-AL-136-5, pp. 1-8, 2011
Construction of Common Unfolding of a Regular Tetrahedron and a Cube
IPSJ SIG Technical Report, 2010-AL-135-10, pp.1-5, 2011
Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids
IPSJ SIG Technical report, 2010-AL-132-1, pp. 1-4, 2010
Bipartite powers of interval bigraphs
IEICE Technical Report, COMP 2010-36, VOl. 110, No. 232, pp. 35-39, 2010
Undecidability of Origami
IPSJ SIG Tecninical Report, 2010-AL-131-11, pp. 1-3, 2010
折りたたみに関する計算量
日本応用数理学会2010年度年会, 東京都, 2010
折紙のアルゴリズム
情報オリンピック日本委員会、夏季セミナー, 東京, 2010
Voronoi Game on a Path
IEICE Technical Report, COMP2010-10, pp. 1-5, 2010
Random Generation and Enumeration of Bipartite Permutation Graphs
IEICE Technical Report, COMP2009-??, pp. ??-??, 2009
Graph Orientation Problems for Multiple st-Reachability
IPSJ SIG Technical Report, 2009-AL-125, pp. 5:1-5:?, 2009
Counting the Number of Matching in Chordal and Chordal Bipartite Graph Classes
IEICE Technical Report, COMP2009-??, 2009
NP-completeness of generalized Kaboozle
IPSJ SIG Technical Report, 2010-AL-130-3, pp. 15-20, 2009
Stretch Minimization Problem of a Strip Paper
IPSJ SIG Technical Report, 2010-AL-130-2, pp. 7-13, 2009
On Scale free k-trees
IPSJ SIG Technical Report, 2009-AL-124, pp. 2:1-2:8, 東京, 2009
Efficient Enumeration of All Pseudoline Arrangements
IPSJ SIG Technical Report, 2009-AL-124, pp. 1:1-1:6, 東京, 2009
北陸先端科学技術大学院大学における教育の電子化
広島大学特色GP協調演習シンポジウム, 広島大学, 2009
なるべく遠回りしなくてすむように一方通行を決める問題の難しさ
日本応用数理学会 離散システム研究部会, 京都, 2009
Efficient Enumeration of All Ladder Lotteries
IEICE Technical Report, COMP2008-56, pp. 17-23, Tokyo, Japan, 2009
絵画的迷路の作り方
計算機科学の理論とその応用(冬のLAシンポジウム), 京都, 2009
Complexity of Pleats Folding
IPSJ SIG Technical Report, 2008-AL-122-1, pp. 1-8, Kanagawa, Japan, 2009
Efficient Enumeration of All Ladder Lotteries
Workshop on Topological Graph Theory, Yokohama, Japan, 2008
On the Complexity of Reconfiguration Problems
IEICE Technical Report, COMP2008-36, pp. 17-24, 2008
折り紙の計算論的複雑さの研究
社団法人日本機械学会産官学連携センター研究協力事業委員会所属 「RC235 計算力学援用による折紙工学の推進とその応用に関する調査研究分科会」, 東京工業大学, 2008
Reconstruction of Connected Interval Graphs
Acceleration and Visualization of Computation for Enumeration Problems, RIMS, Kyoto, 2008
Enumeration of Perfect Sequences of Chordal Graph
Acceleration and Visualization of Computation for Enumeration Problems, RIMS, Kyoto, 2008
Polygons Folding to Plural Incongruent Orthogonal Boxes
Acceleration and Visualization of Computation for Enumeration Problems, pp. 135-149, 2008
Polygons Folding to Plural Incongruent Orthogonal Boxes
IEICE Technical Report, COMP2008-23, pp. 1-8, 2008
Bandwidth of Bipartite Permutation Graphs
IEICE Technical Report, COMP 2007-36, pp.29-34, 2007
ある投票ゲームに関する戦略のモデル化
計算機科学の理論とその応用（夏のLAシンポジウム）, 2007
Do Interval Graphs Dream of Scale-free Network?
計算機科学の理論とその応用（夏のLAシンポジウム）, 2007
Efficient Algorithms for Airline Problem
IEICE Technical Report, COMP2006-34, pp.25-31, 仙台, 2006
グラフクラスとアルゴリズム
IEICE Technical Report, 石川県, 2006
The complexity of a Pop-up book
IPSJ SIG Technical Report, 2006-AL-107-10, pp.59-64, Sapporo, Japan, 2006
Heuristics for Generating a Simple Polygonalization
IPSJ SIG Technical Report, 2006-AL-106-6, pp.41-48, Gunma, Japan., 2006
Canonical Tree Representation of Distance Hereditary Graphs and Its Applications
IEICE Technical Report, COMP2005-61, pp.31-38, Tokyo, 2006
Voronoi Game on Graphs and Its Complexity
IPSJ SIG Technical Report, 2006-AL-104-2, pp.9-16, Keio University, 2006
Laminar Structure of Ptolemaic Graphs and Its Applications
IEICE Technical Report, COMP2005-30, 2005
Counting the Independent Sets of a Chordal Graph
IPSJ SIG Technical Report, 2004-AL-96, pp.17-24, 2004
Longest Paths in Small Graph Classes
IEICE Technical Report, COMP2004-16, pp.53-60, 2004
Extended MPQ-trees for Probe Interval Graphs
IPSJ SIG Technical Report, 2004-AL-93, pp.97-104, 2004
Canonical MPQ-tree Model for Interval Graphs
Forum on Information Technology (FIT2003), A-037, pp.79-81, 2003
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
IPSJ SIG Technical Report, 2003-AL-90,pp.57-64, 2003
Completeness of Graph Isomorphism Problem for Bipartite Graph Classes
IEICE Technical Report, COMP2001-93,pp.1-5, 2002
Tighter Bounds on the Genus of Nonorthogonal Polyhedra Built from Rectangles(jointly authored)
Canadian Conference on Computational Geometry, 2002
Completeness of Graph Isomorphism Problem for Bipartite Graph Classes(jointly authored)
IEICE Technical Report, 2002
Fast Parallel Approximation Algorithms for Maximum Weight Matching Problem
IPSJ SIG Notes,2000-AL-71,pp.33-40, 2000
Expected Length of Longest Common Subsequences of Two Biased Random Strings and Its Application
LA Symposium, 2000
The Number of Connected Components in Graphs and Its Applications
IEICE Technical Report,COMP99-10,pp.1-8, 1999
Tractable and Intractable Problems on Generalized Chordal Graphs
IEICE Technical Report,COMP98-83,pp.1-8, 1999
Tractable Problems on Small Connected Components in Graphs
KOREA-JAPAN Joint Workshop on Algorithms and Computation, 1999
Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem
IEICE Technical Report,COMP98-54,pp.25-32, 1998
3充足可能性判定問題3SATの単一解を持つ正例題生成手法の解析
IEICE Technical Report,COMP97-117,pp.85-92, 1998
Parallel Complexity of the Lexicographically First Maximal Subgraph Problems on Restricted Graphs
IEICE Technical Report,COMP97-68,pp.65-72, 1997
A Measure of Parallelization for the Lexicographically First Maximal Independent Set Problem
IPSJ SIG Notes,97-AL-56,pp.19-26, 1997
Optimal Attribute-Efficient Learning of Disjunction, Parity, and Threshold Functions (jointly authored)
Lecture Notes in Artificial Intelligence, 1997
Partial Gates and Their Identifications
IEICE Technical Report,COMP96-22,pp.1-10, 1996
極大パス集合に対する効率的な並列アルゴリズムとその応用
IPSJ SIG Notes,96-AL-51,pp.25-32, 1996
RNC and NC Algorithms for Maximal Path Sets and Applications to Superstrings with Flipping
京大数解研講究録 Vol.950,pp.113-119, 1996
Partial Gates and Their Identification (jointly authored)
IEICE Technical Report, 1996
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application (jointly authored)
Lecture Notes in Computer Science, 1996
Complexity Classes Characterized by Many Computation Paths
IEICE Technical Report,COMP95-42,pp.9-15, 1995
Complexity Classes Characterized by Semi-Random Sources
京大数解研講究録 Vol.943,pp.1-14, 1995
Efficient Simulations by a Biased Coin
情報基礎理論ワークショップ,pp.13-16, 1994
確率Turing Machineにおける低いレベルの領域強構成可能性について
情報基礎理論ワークショップ,pp.16-21, 1993
log(k)n の領域強構成可能性について
IEICE Technical Report,COMP93-38,pp.59-67, 1993
Fully Space Constructivelity of log(k)n
IEICE Technical Report, 1993
一般化Hi-QのNP完全性について
IEICE Technical Report,COMP89-31,pp.47-54, 1989
一人ゲームHi-Q:その判定の困難さと発見的探索法
情報基礎理論ワークショップ, 1989
一人ゲームHi-Qについて
情報基礎理論セミナー,pp.19-20, 1989
Reconfiguration of vertex-disjoint shortest paths on graphs
The 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023),
Unsupervised Discovery of Tonality in Bach's Chorales
The 16th International Conference on Knowledge, Information and Creativity Support Systems (KICSS 2021),
Efficient Enumeration of Non-isomorphic Block-Cutpoint Trees
The 5th Workshop on Enumeration Problems and Applications (WEPA 2022),
Discretization to Prove the Nonexistence of Small Common Unfoldings Between Polyhedra
The 34th Canadian Conference on Computational Geometry (CCCG 2022),
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
The 34th Canadian Conference on Computational Geometry (CCCG 2022),
Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature
The 34th Canadian Conference on Computational Geometry (CCCG 2022),
Quasi-Twisting Convex Polyhedra
The 34th Canadian Conference on Computational Geometry (CCCG 2022),
Rep-tile Font
Bridges Aalto 2022,
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022),
Sorting Balls and Water: Equivalence and Computational Complexity
11th International Conference on Fun with Algorithms (FUN 2022),
Rolling Polyhedra on Tessellations
11th International Conference on Fun with Algorithms (FUN 2022),
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
38th European Workshop on Computational Geometry (EuroCG 2022),
Computational Complexity of Jumping Block Puzzles
COCOON 2021,
Token Shifting on Graphs
COCOON 2021,
Logical Matrix Representations in Map Folding
TJCDCGGG 2020+1,
Multilayer tiles
TJCDCGGG 2020+1,
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
The 33rd Canadian Conference on Computational Geometry (CCCG 2021),
Bicolored Path Embedding Problems in Protein Folding Models
The 37th European Workshop on Computational Geometry (EuroCG 2021),
Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021),
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021),
Cyclic Shift Problems on Graphs
The 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021),
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Fourth International Workshop on Enumeration Problems and Applications (WEPA 2020),
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
The 34th International Symposium on Distributed Computing (DISC 2020),
Efficient Folding Algorithms for Regular Polyhedra
CCCG 2020,
Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
The 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020),
On the Complexity of Lattice Puzzles
The 30th International Symposium on Algorithms and Computation (ISAAC 2019),
Rep-cube and related results
Symmetry: Art and Science - 11th Congress and Exhibition,
Introduction to Computational Origami
The 11th International Conference on Knowledge and Systems Engineering (KSE 2019),
Minimal Ununfoldable Polyhedron
JCDCGGG 2019,
Mind The Mind with Synchronous Clocks
JCDCGGG 2019,
Efficient Algorithm for 2xn Map Folding with Diagonal Creases
JCDCGGG 2019,
Simple Fold and Cut Problem for Line Segments
CCCG 2019,
Rectangular Unfoldings of Polycubes
CCCG 2019,
Minimum Forcing Sets for Single-Vertex Crease Pattern
CCCG 2019,
Efficient Segment Folding is Hard
CCCG 2019,
Reconfiguring Undirected Paths
WADS 2019,
Max-Min 3-dispersion Problems
COCOON 2019,
Impossible Folding Font
Bridges 2019,
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
The 11th International Conference on Algorithms and Complexity (CIAC 2019),
Algorithmic Enumeration of Surrounding Polygons
EuroCG 2019,
Efficient Algorithm for Box Folding
The 13th International Conference and Workshop on Algorithms and Computation (WALCOM 2019),