Masashi Kiyomi

According to our database1, Masashi Kiyomi authored at least 30 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs.
Theor. Comput. Sci., 2020

2019
On structural parameterizations of firefighting.
Theor. Comput. Sci., 2019

How Bad is the Freedom to Flood-It?
J. Graph Algorithms Appl., 2019

2018
Space-Efficient Algorithms for Longest Increasing Subsequence.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017
Hitori Numbers.
JIP, 2017

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

Alliances in graphs of bounded clique-width.
Discret. Appl. Math., 2017

2016
Reverse Search; Enumeration Algorithms.
Encyclopedia of Algorithms, 2016

Finding a chain graph in a bipartite permutation graph.
Inf. Process. Lett., 2016

On the treewidth of toroidal grids.
Discret. Appl. Math., 2016

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

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

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

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

2012
Bipartite Permutation Graphs are reconstructible.
Discrete Math., Alg. and Appl., 2012

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Voronoi Game on a Path.
IEICE Transactions, 2011

Algorithmic Folding Complexity.
Graphs and Combinatorics, 2011

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

2010
Reconstruction of interval graphs.
Theor. Comput. Sci., 2010

On listing, sampling, and counting the chordal graphs with edge constraints.
Theor. Comput. Sci., 2010

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

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.
Electr. J. Comb., 2010

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

2006
Generating Chordal Graphs Included in Given Graphs.
IEICE Transactions, 2006

Listing Chordal Graphs and Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005
Efficient Algorithms for the Electric Power Transaction Problem.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Generalized Amazons is PSPACE-Complete.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
Proceedings of the FIMI '04, 2004

2000
Integer Programming Based Algorithms for Peg Solitaire Problems.
Proceedings of the Computers and Games, Second International Conference, 2000


  Loading...