Katsuhisa Yamanaka

Orcid: 0000-0002-4333-8680

According to our database1, Katsuhisa Yamanaka authored at least 55 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Enumerating floorplans with walls.
Discret. Appl. Math., January, 2024

New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Trans. Inf. Syst., 2024

An Improved Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
Proceedings of the 54th IEEE International Symposium on Multiple-Valued Logic, 2024

2023
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci., November, 2023

Enumerating Empty and Surrounding Polygons.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

2022
An <i>O</i>(<i>n</i><sup>2</sup>)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.
IEICE Trans. Inf. Syst., 2022

A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs.
IEICE Trans. Inf. Syst., 2022

Efficient segment folding is hard.
Comput. Geom., 2022

2021
Optimal reconfiguration of optimal ladder lotteries.
Theor. Comput. Sci., 2021

Algorithmic enumeration of surrounding polygons.
Discret. Appl. Math., 2021

2020
Parameterized complexity of independent set reconfiguration problems.
Discret. Appl. Math., 2020

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

Floorplans with Walls.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs.
Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

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

Enumerating Highly-Edge-Connected Spanning Subgraphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Exact Exponential Algorithm for Distance-3 Independent Set Problem.
IEICE Trans. Inf. Syst., 2019

The Complexity of Induced Tree Reconfiguration Problems.
IEICE Trans. Inf. Syst., 2019

Ecient Segment Folding is Hard.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

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

Enumerating Floorplans with Columns.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

2017
Enumeration, Counting, and Random Generation of Ladder Lotteries.
IEICE Trans. Inf. Syst., 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 Trans. Inf. Syst., 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 Trans. Fundam. Electron. Commun. Comput. Sci., 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

2014
Efficient Enumeration of All Ladder Lotteries with <i>k</i> Bars.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Trans. Inf. Syst., 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

2013
A Compact Encoding of Rectangular Drawings with Edge Lengths.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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 <i>k</i> Leaves.
IEICE Trans. Inf. Syst., 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 Trans. Inf. Syst., 2010

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

Computational Complexities of University Interview Timetabling.
IEICE Trans. Inf. Syst., 2009

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2007
Constant Time Generation of Integer Partitions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006
Constant Time Generation of Rectangular Drawings with Exactly <i>n</i> Faces.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Coding Floorplans with Fewer Bits.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006


  Loading...