Ryuhei Uehara

Yukiko Yamauchi

Theor. Comput. Sci., 2025

2024

Computational complexity of jumping block puzzles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2024

Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs.

[BibT_eX]

[DOI]

Kazuaki Yamazaki

Mengze Qian

Discret. Appl. Math., January, 2024

Reconfiguration of vertex-disjoint shortest paths on graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

On the Computational Complexity of Generalized Common Shape Puzzles.

[BibT_eX]

[DOI]

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

Computational Complexity of Matching Match Puzzle.

[BibT_eX]

[DOI]

Yuki Iburi

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Efficient Folding Algorithms for Convex Polyhedra.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Sorting balls and water: Equivalence and computational complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Any platonic solid can transform to another by O(1) refoldings.

[BibT_eX]

[DOI]

Comput. Geom., August, 2023

Mathematical characterizations and computational complexity of anti-slide puzzles.

[BibT_eX]

[DOI]

Ko Minamisawa

Masao Hara

Theor. Comput. Sci., 2023

Developing a tetramonohedron with minimum cut length.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Overlapping of Lattice Unfolding for Cuboids.

[BibT_eX]

Takumi Shiota

Tonan Kamata

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

2022

Token shifting on graphs.

[BibT_eX]

[DOI]

Win Hlaing Hlaing Myint

Int. J. Comput. Math. Comput. Syst. Theory, October, 2022

Logical Matrix Representations in Map Folding.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., October, 2022

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Seok-Hee Hong

Subhas C. Nandy

J. Graph Algorithms Appl., 2022

Cyclic Shift Problems on Graphs.

[BibT_eX]

[DOI]

Kwon Kham Sai

IEICE Trans. Inf. Syst., 2022

Research on Dissections of a Net of a Cube into Nets of Cubes.

[BibT_eX]

[DOI]

Tamami Okada

IEICE Trans. Inf. Syst., 2022

Bicolored Path Embedding Problems Inspired by Protein Folding Models.

[BibT_eX]

[DOI]

Tianfeng Feng

IEICE Trans. Inf. Syst., 2022

Efficient segment folding is hard.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Ununfoldable polyhedra with 6 vertices or 6 faces.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Rolling Polyhedra on Tessellations.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Quasi-Twisting Convex Polyhedra.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Shortest reconfiguration of sliding tokens on subclasses of interval graphs.

[BibT_eX]

[DOI]

Takeshi Yamada

Theor. Comput. Sci., 2021

Research on Map Folding with Boundary Order on Simple Fold.

[BibT_eX]

[DOI]

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

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

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

Algorithmic enumeration of surrounding polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.

[BibT_eX]

[DOI]

Kazuaki Yamazaki

Mengze Qian

Proceedings of the WALCOM: Algorithms and Computation, 2021

Computational Complexity of Jumping Block Puzzles.

[BibT_eX]

[DOI]

Masaaki Kanzaki

Yota Otachi

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Minimum Forcing Sets for Single-vertex Crease Pattern.

[BibT_eX]

[DOI]

Koji Ouchi

J. Inf. Process., 2020

Valid Orderings of Layers When Simple-Folding a Map.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Rectangular Unfoldings of Polycubes.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Efficient Algorithm for Box Folding.

[BibT_eX]

[DOI]

Koichi Mizunashi

J. Graph Algorithms Appl., 2020

Complexity of the Maximum k-Path Vertex Cover Problem.

[BibT_eX]

[DOI]

Tom C. van der Zanden

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

Parameterized complexity of independent set reconfiguration problems.

[BibT_eX]

[DOI]

Takehiro Ito

Marcin Jakub Kaminski

Discret. Appl. Math., 2020

Symmetric assembly puzzles are hard, beyond a few pieces.

[BibT_eX]

[DOI]

Matias Korman

Jason S. Ku

Joseph S. B. Mitchell

Comput. Geom., 2020

Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.

[BibT_eX]

[DOI]

Dat Hoang Tran

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

Efficient Folding Algorithms for Regular Polyhedra.

[BibT_eX]

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

Introduction to Computational Origami - The World of New Computational Geometry

[BibT_eX]

[DOI]

Springer, ISBN: 978-981-15-4469-9, 2020

2019

Sequentially Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Guest Editors' Foreword.

[BibT_eX]

[DOI]

M. Sohel Rahman

Wing-Kin Sung

J. Graph Algorithms Appl., 2019

On Computational Complexity of Pipe Puzzles.

[BibT_eX]

[DOI]

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

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.

[BibT_eX]

[DOI]

Koji Ouchi

IEICE Trans. Inf. Syst., 2019

Reconfiguring Undirected Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On the Complexity of Lattice Puzzles.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.

[BibT_eX]

[DOI]

Duc A. Hoang

Amanj Khorramian

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Simple Fold and Cut Problem for Line Segments.

[BibT_eX]

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

Ecient Segment Folding is Hard.

[BibT_eX]

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

Rectangular Unfoldings of Polycubes.

[BibT_eX]

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

First Course in Algorithms Through Puzzles

[BibT_eX]

[DOI]

Springer, ISBN: 978-981-13-3187-9, 2019

2018

Swapping colored tokens on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Flat foldings of plane graphs with prescribed angles and edge lengths.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Rep-Cubes: Dissection of a Cube into Nets.

[BibT_eX]

[DOI]

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

Bumpy pyramid folding.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Special Issue on Reconfiguration Problems.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Henning Fernau

Algorithms, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

[BibT_eX]

[DOI]

Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Packing Cube Nets into Rectangles with O(1) Holes.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Toward Unfolding Doubly Covered n-Stars.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Computational Complexity of Robot Arm Simulation Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Exact Algorithms for the Max-Min Dispersion Problem.

[BibT_eX]

[DOI]

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

2017

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Report from EATCS Japan Chapter.

[BibT_eX]

[DOI]

Bull. EATCS, 2017

Complexity of Tiling a Polygon with Trominoes or Bars.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Ferrers dimension of grid intersection graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Common developments of three incongruent boxes of area 30.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Sliding Tokens on Block Graphs.

[BibT_eX]

[DOI]

Duc A. Hoang

Eli Fox-Epstein

Proceedings of the WALCOM: Algorithms and Computation, 2017

Rep-cubes: Unfolding and Dissection of Cubes.

[BibT_eX]

Dawei Xu

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

2016

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.

[BibT_eX]

[DOI]

Yoshiaki Araki

J. Graph Algorithms Appl., 2016

Folding a paper strip to minimize thickness.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

The Convex Configurations of "Sei Shonagon Chie no Ita, " Tangram, and Other Silhouette Puzzles with Seven Pieces.

[BibT_eX]

[DOI]

Eli Fox-Epstein

Kazuho Katsumata

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

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.

[BibT_eX]

[DOI]

Matsuo Konagaya

Yota Otachi

Discret. Appl. Math., 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Shortest Reconfiguration of Sliding Tokens on a Caterpillar.

[BibT_eX]

[DOI]

Takeshi Yamada

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Sliding Tokens on a Cactus.

[BibT_eX]

[DOI]

Duc A. Hoang

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Convex Configurations on Nana-kin-san Puzzle.

[BibT_eX]

[DOI]

Haruo Hosoya

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

2015

Linear-time algorithm for sliding tokens on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2015

Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

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

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

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

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

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

Box Pleating is Hard.

[BibT_eX]

[DOI]

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

Sliding Token on Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

A 4.31-approximation for the geometric unique coverage problem on unit disks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

UNO is hard, even for a single player.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

The height of random k-trees and related branching processes.

[BibT_eX]

[DOI]

Colin Cooper

Alan M. Frieze

Random Struct. Algorithms, 2014

Computational Complexity and an Integer Programming Model of Shakashaka.

[BibT_eX]

[DOI]

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

Computational Complexity of Piano-Hinged Dissections.

[BibT_eX]

[DOI]

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

The graph isomorphism problem on geometric graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

On the Parameterized Complexity for Token Jumping on Graphs.

[BibT_eX]

[DOI]

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

Intersection Dimension of Bipartite Graphs.

[BibT_eX]

[DOI]

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

Polynomial-Time Algorithm for Sliding Tokens on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Depth-First Search Using O(n) Bits.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.

[BibT_eX]

[DOI]

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

The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.

[BibT_eX]

[DOI]

Eli Fox-Epstein

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The complexity of the stamp folding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Efficient algorithms for a simple network design problem.

[BibT_eX]

[DOI]

Networks, 2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

J. Comb. Optim., 2013

Common Developments of Three Incongruent Orthogonal Boxes.

[BibT_eX]

[DOI]

Toshihiro Shirakawa

Int. J. Comput. Geom. Appl., 2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2013

The Japanese Chapter.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

Tractabilities and Intractabilities on Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Algorithms, 2013

Route-Enabling Graph Orientation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2013

Base Location Problems for Base-Monotone Regions.

[BibT_eX]

[DOI]

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

Zipper Unfoldability of Domes and Prismoids.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Variations on Instant Insanity.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

NP-completeness of generalized Kaboozle.

[BibT_eX]

[DOI]

J. Inf. Process., 2012

Random generation and enumeration of bipartite permutation graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Faster computation of the Robinson-Foulds distance between phylogenetic networks.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Ghost chimneys.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

Report from the Japanese Chapter.

[BibT_eX]

[DOI]

Bull. EATCS, 2012

On bipartite powers of bigraphs.

[BibT_eX]

[DOI]

Yota Otachi

Discret. Math. Theor. Comput. Sci., 2012

Bipartite Permutation Graphs are reconstructible.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

On Complexity of Flooding Games on Graphs with Interval Representations

[BibT_eX]

[DOI]

CoRR, 2012

Any Monotone Function Is Realized by Interlocked Polygons.

[BibT_eX]

[DOI]

Algorithms, 2012

On Complexity of Flooding Games on Graphs with Interval Representations.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Common Developments of Three Different Orthogonal Boxes.

[BibT_eX]

[DOI]

Toshihiro Shirakawa

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

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

[BibT_eX]

[DOI]

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

Covering Points with Disjoint Unit Disks.

[BibT_eX]

[DOI]

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

2011

On the complexity of reconfiguration problems.

[BibT_eX]

[DOI]

Takehiro Ito

Christos H. Papadimitriou

Nicholas J. A. Harvey

Martha Sideri

Theor. Comput. Sci., 2011

The Voronoi game on graphs and its complexity.

[BibT_eX]

[DOI]

Sachio Teramoto

J. Graph Algorithms Appl., 2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Sandip Das

J. Graph Algorithms Appl., 2011

Voronoi Game on a Path.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2011

Algorithmic Folding Complexity.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Complexity of the Stamp Folding Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

On covering of any point configuration by disjoint unit disks.

[BibT_eX]

[DOI]

Yosuke Okayama

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

Common Developments of Several Different Orthogonal Boxes.

[BibT_eX]

[DOI]

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

2010

Efficient enumeration of all ladder lotteries and its application.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Enumeration of the perfect sequences of a chordal graph.

[BibT_eX]

[DOI]

Yasuko Matsui

Theor. Comput. Sci., 2010

Reconstruction of interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Scale Free Properties of Random k-Trees.

[BibT_eX]

[DOI]

Colin Cooper

Math. Comput. Sci., 2010

Random Generation and Enumeration of Proper Interval Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

The complexity of UNO

[BibT_eX]

[DOI]

CoRR, 2010

Reconstruction Algorithm for Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

UNO Is Hard, Even for a Single Player.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Kaboozle Is NP-complete, Even in a Strip.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Coverage with k-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Proceedings of the Combinatorial Optimization and Applications, 2010

On stretch minimization problem on unit strip paper.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Any monotone boolean function can be realized by interlocked polygons.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Scale free interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2009

Laminar structure of ptolemaic graphs with applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Algorithmic Folding Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

How to make a picturesque maze.

[BibT_eX]

[DOI]

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

2008

Counting the number of independent sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Special Section on Discrete Mathematics and Its Applications.

[BibT_eX]

[DOI]

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

Longest Path Problems on Ptolemaic Graphs.

[BibT_eX]

[DOI]

Yoshihiro Takahara

Sachio Teramoto

IEICE Trans. Inf. Syst., 2008

Simple Geometrical Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Bandwidth of Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Polygons Folding to Plural Incongruent Orthogonal Boxes.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Inverting Linkages with Stretch.

[BibT_eX]

Youichi Fujimoto

Mitsuo Motoki

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Linear structure of bipartite permutation graphs and the longest path problem.

[BibT_eX]

[DOI]

Gabriel Valiente

Inf. Process. Lett., 2007

On Computing Longest Paths in Small Graph Classes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Tree Spanners for Bipartite Graphs and Probe Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

Efficient Algorithms for Airline Problem.

[BibT_eX]

[DOI]

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

2006

The Complexity of a Pop-Up Book.

[BibT_eX]

[DOI]

Sachio Teramoto

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.

[BibT_eX]

[DOI]

Seinosuke Toda

Takayuki Nagoya

Discret. Appl. Math., 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Laminar Structure of Ptolemaic Graphs and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A double classification tree search algorithm for index SNP selection.

[BibT_eX]

[DOI]

Peisen Zhang

Huitao Sheng

BMC Bioinform., 2004

Efficient Algorithms for the Longest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Canonical Data Structure for Interval Probe Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2002

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2000

Identification of Partial Disjunction, Parity, and Threshold Functions.

[BibT_eX]

[DOI]

Kensei Tsuchida

Ingo Wegener

Theor. Comput. Sci., 2000

Parallel approximation algorithms for maximum weighted matching in general graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

1999

Fast RNC and NC Algorithms for Maximal Path Sets.

[BibT_eX]

[DOI]

Xin He

Theor. Comput. Sci., 1999

A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997

Collapse of PP with a Semi-Random Source to BPP.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Optimal attribute-efficient learning of disjunction, parity, and threshold functions

[BibT_eX]

[DOI]

Kensei Tsuchida

Ingo Wegener

Electron. Colloquium Comput. Complex., 1996

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.

[BibT_eX]

[DOI]

Xin He

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Efficient Simulations by a Biased Coin.

[BibT_eX]

[DOI]