Ryuhei Uehara

According to our database1, Ryuhei Uehara authored at least 141 papers between 1995 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Efficient Algorithm for Box Folding.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

First Course in Algorithms Through Puzzles
Springer, ISBN: 978-981-13-3187-9, 2019

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

Rep-Cubes: Dissection of a Cube into Nets.
IEICE Transactions, 2018

Report from EATCS Japan Chapter.
Bulletin of the EATCS, 2018

Special Issue on Reconfiguration Problems.
Algorithms, 2018

Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 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

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

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

Report from EATCS Japan Chapter.
Bulletin of the EATCS, 2017

Complexity of Tiling a Polygon with Trominoes or Bars.
Discrete & Computational Geometry, 2017

Ferrers dimension of grid intersection graphs.
Discrete Applied Mathematics, 2017

Sequentially Swapping Colored Tokens on Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Sliding Tokens on Block Graphs.
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
The Convex Configurations of "Sei Shonagon Chie no Ita, " Tangram, and Other Silhouette Puzzles with Seven Pieces.
IEICE Transactions, 2016

Report from the Japanese Chapter.
Bulletin of the EATCS, 2016

Shortest Reconfiguration of Sliding Tokens on a Caterpillar.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Sliding Tokens on a Cactus.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

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

2015
Linear-time algorithm for sliding tokens on trees.
Theor. Comput. Sci., 2015

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.
IEICE Transactions, 2015

The Japanese Chapter.
Bulletin of the EATCS, 2015

Folding a Paper Strip to Minimize Thickness.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

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

Competitive Diffusion on Weighted Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Common Developments of Three Incongruent Boxes of Area 30.
Proceedings of the Theory and Applications of Models of Computation, 2015

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
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

Sliding Token on Bipartite Permutation Graphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
UNO is hard, even for a single player.
Theor. Comput. Sci., 2014

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

The height of random k-trees and related branching processes.
Random Struct. Algorithms, 2014

Computational Complexity of Piano-Hinged Dissections.
IEICE Transactions, 2014

Report from the Japanese Chapter.
Bulletin of the EATCS, 2014

The graph isomorphism problem on geometric graphs.
Discrete Mathematics & Theoretical Computer Science, 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discrete Mathematics & Theoretical Computer Science, 2014

Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2014

On the Parameterized Complexity for Token Jumping on Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2014

Intersection Dimension of Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Depth-First Search Using O(n) Bits.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

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

The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Bumpy Pyramid Folding.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
The complexity of the stamp folding problem.
Theor. Comput. Sci., 2013

Efficient algorithms for a simple network design problem.
Networks, 2013

Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

Common Developments of Three Incongruent Orthogonal Boxes.
Int. J. Comput. Geometry Appl., 2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.
IEICE Transactions, 2013

The Japanese Chapter.
Bulletin of the EATCS, 2013

Tractabilities and Intractabilities on Geometric Intersection Graphs.
Algorithms, 2013

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

Computational complexity and an integer programming model of Shakashaka.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Zipper Unfoldability of Domes and Prismoids.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Variations on Instant Insanity.
Proceedings of the Space-Efficient Data Structures, 2013

2012
NP-completeness of generalized Kaboozle.
JIP, 2012

Report from the Japanese Chapter.
Bulletin of the EATCS, 2012

On bipartite powers of bigraphs.
Discrete Mathematics & Theoretical Computer Science, 2012

Any Monotone Function Is Realized by Interlocked Polygons.
Algorithms, 2012

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

On Complexity of Flooding Games on Graphs with Interval Representations.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Common Developments of Three Different Orthogonal Boxes.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

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

Covering Points with Disjoint Unit Disks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
The Voronoi game on graphs and its complexity.
J. Graph Algorithms Appl., 2011

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2011

Voronoi Game on a Path.
IEICE Transactions, 2011

Algorithmic Folding Complexity.
Graphs and Combinatorics, 2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.
Proceedings of the Theory and Applications of Models of Computation, 2011

Complexity of the Stamp Folding Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

On covering of any point configuration by disjoint unit disks.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Common Developments of Several Different Orthogonal Boxes.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Efficient enumeration of all ladder lotteries and its application.
Theor. Comput. Sci., 2010

Enumeration of the perfect sequences of a chordal graph.
Theor. Comput. Sci., 2010

Scale Free Properties of Random k-Trees.
Mathematics in Computer Science, 2010

Reconstruction Algorithm for Permutation Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

UNO Is Hard, Even for a Single Player.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Kaboozle Is NP-complete, Even in a Strip.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Bipartite Permutation Graphs Are Reconstructible.
Proceedings of the Combinatorial Optimization and Applications, 2010

Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

On stretch minimization problem on unit strip paper.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Any monotone boolean function can be realized by interlocked polygons.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

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

2009
Laminar structure of ptolemaic graphs with applications.
Discrete Applied Mathematics, 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Random Generation and Enumeration of Proper Interval Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Random Generation and Enumeration of Bipartite Permutation Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Route-Enabling Graph Orientation Problems.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Algorithmic Folding Complexity.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Reconstruction of Interval Graphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

How to make a picturesque maze.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Counting the number of independent sets in chordal graphs.
J. Discrete Algorithms, 2008

Special Section on Discrete Mathematics and Its Applications.
IEICE Transactions, 2008

Longest Path Problems on Ptolemaic Graphs.
IEICE Transactions, 2008

Simple Geometrical Intersection Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Bandwidth of Bipartite Permutation Graphs.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Enumeration of Perfect Sequences of Chordal Graph.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

On the Complexity of Reconfiguration Problems.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Polygons Folding to Plural Incongruent Orthogonal Boxes.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Inverting Linkages with Stretch.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Scale Free Interval Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Linear structure of bipartite permutation graphs and the longest path problem.
Inf. Process. Lett., 2007

On Computing Longest Paths in Small Graph Classes.
Int. J. Found. Comput. Sci., 2007

Efficient Algorithms for Airline Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Voronoi game on graphs and its complexity.
Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games (CIG06), 2006

The Complexity of a Pop-Up Book.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
Discrete Applied Mathematics, 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Laminar Structure of Ptolemaic Graphs and Its Applications.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
A double classification tree search algorithm for index SNP selection.
BMC Bioinformatics, 2004

Efficient Algorithms for the Longest Path Problem.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Canonical Data Structure for Interval Probe Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
Tree Spanners for Bipartite Graphs and Probe Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2000
Identification of Partial Disjunction, Parity, and Threshold Functions.
Theor. Comput. Sci., 2000

Parallel approximation algorithms for maximum weighted matching in general graphs.
Inf. Process. Lett., 2000

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.
Proceedings of the Theoretical Computer Science, 2000

1999
Fast RNC and NC Algorithms for Maximal Path Sets.
Theor. Comput. Sci., 1999

A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits.
Int. J. Found. Comput. Sci., 1999

Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997
Collapse of PP with a Semi-Random Source to BPP.
Inf. Process. Lett., 1997

A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
Electronic Colloquium on Computational Complexity (ECCC), 1996

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Efficient Simulations by a Biased Coin.
Inf. Process. Lett., 1995


  Loading...