Katsuhisa Yamanaka

According to our database1, Katsuhisa Yamanaka authored at least 42 papers between 2006 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Enumerating Floorplans with Columns.
IEICE Transactions, 2018

Swapping Colored Tokens on Graphs.
CoRR, 2018

More Routes for Evacuation.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Enumeration, Counting, and Random Generation of Ladder Lotteries.
IEICE Transactions, 2017

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

Floorplans with Columns.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Permutation Enumeration.
Encyclopedia of Algorithms, 2016

Uniformly Random Generation of Floorplans.
IEICE Transactions, 2016

The Complexity of Induced Tree Reconfiguration Problems.
Proceedings of the Language and Automata Theory and Applications, 2016

New Two-Qubit Gate Library with Entanglement.
Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

2015
Swapping labeled tokens on graphs.
Theor. Comput. Sci., 2015

Another Optimal Binary Representation of Mosaic Floorplans.
IEICE Transactions, 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

Enumeration, Counting, and Random Generation of Ladder Lotteries.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014
Efficient Enumeration of All Ladder Lotteries with k Bars.
IEICE Transactions, 2014

A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Transactions, 2014

Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discrete Applied Mathematics, 2014

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

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

Swapping Labeled Tokens on Graphs.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
A Compact Encoding of Rectangular Drawings with Edge Lengths.
IEICE Transactions, 2013

2012
Efficient enumeration of ordered trees with k leaves.
Theor. Comput. Sci., 2012

Random generation and enumeration of bipartite permutation graphs.
J. Discrete Algorithms, 2012

Enumerating All Rooted Trees Including k Leaves.
IEICE Transactions, 2012

2011
Approximability of the Path-Distance-Width for AT-free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

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

A compact encoding of plane triangulations with efficient query supports.
Inf. Process. Lett., 2010

Random Generation and Enumeration of Proper Interval Graphs.
IEICE Transactions, 2010

2009
Listing All Plane Graphs.
J. Graph Algorithms Appl., 2009

Computational Complexities of University Interview Timetabling.
IEICE Transactions, 2009

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 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

2008
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
IEICE Transactions, 2008

Listing All Plane Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

A Compact Encoding of Plane Triangulations with Efficient Query Supports.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007
Constant Time Generation of Integer Partitions.
IEICE Transactions, 2007

A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Constant Time Generation of Rectangular Drawings with Exactly n Faces.
IEICE Transactions, 2006

Coding Floorplans with Fewer Bits.
IEICE Transactions, 2006


  Loading...