Katsuhisa Yamanaka

According to our database1, Katsuhisa Yamanaka authored at least 39 papers between 2006 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


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

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

Enumerating Highly-Edge-Connected Spanning Subgraphs.
IEICE Transactions, 2019

Exact Exponential Algorithm for Distance-3 Independent Set Problem.
IEICE Transactions, 2019

The Complexity of Induced Tree Reconfiguration Problems.
IEICE Transactions, 2019

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

Enumerating Floorplans with Columns.
IEICE Transactions, 2018

Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units.
IEICE Transactions, 2018

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

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

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

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

Permutation Enumeration.
Encyclopedia of Algorithms, 2016

Uniformly Random Generation of Floorplans.
IEICE Transactions, 2016

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

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

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.
Discret. Appl. Math., 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

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

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

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

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

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

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

Constant Time Generation of Integer Partitions.
IEICE Transactions, 2007

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

Coding Floorplans with Fewer Bits.
IEICE Transactions, 2006