Masashi Kiyomi

发表

Reconstruction of Interval Graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2009, COCOON.

LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining

Hiroki Arimura, Takeaki Uno, Masashi Kiyomi, 2005 .

Integer Programming Based Algorithms for Peg Solitaire Problems

Tomomi Matsui, Masashi Kiyomi, Masashi Kiyomi, 2000, Computers and Games.

Depth-First Search Using O(n) Bits

Yota Otachi, Ryuhei Uehara, Masashi Kiyomi, 2014, ISAAC.

Complexity of pleat folding (Theoretical Computer Science and Its Applications)

Ryuhei Uehara, Tsuyoshi Ito, Masashi Kiyomi, 2009 .

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data pdf

Yoshio Okamoto, Toshiki Saitoh, Masashi Kiyomi, 2012, SEA.

Random Generation and Enumeration of Proper Interval Graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2009, WALCOM.

How Bad is the Freedom to Flood-It?

Yota Otachi, Masashi Kiyomi, Michael Lampis, 2019, J. Graph Algorithms Appl..

How Bad is the Freedom to Flood-It?

Yota Otachi, Masashi Kiyomi, Michael Lampis, 2018, FUN.

Bipartite Permutation Graphs are reconstructible

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2012, Discret. Math. Algorithms Appl..

Computer Based Educational Seismology System for Regional Elementary School Students

Masashi Kiyomi, Sui Iwamoto, Ahyi Kim, 2014 .

Efficient Algorithms for the Electric Power Transaction Problem

Takeaki Uno, Tomomi Matsui, Masashi Kiyomi, 2005, WINE.

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets

Csaba D. Tóth, Yoshio Okamoto, Ondrej Bílka, 2010, Electron. J. Comb..

Reconstruction of interval graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2010, Theor. Comput. Sci..

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

Yota Otachi, Masashi Kiyomi, Yasuaki Kobayashi, 2021 .

On structural parameterizations of firefighting

Yota Otachi, Masashi Kiyomi, Bireswar Das, 2019, Theor. Comput. Sci..

Reverse Search; Enumeration Algorithms

Masashi Kiyomi, 2016, Encyclopedia of Algorithms.

Swapping labeled tokens on graphs

Takehiro Ito, Erik D. Demaine, Yoshio Okamoto, 2015, Theor. Comput. Sci..

Longest Common Subsequence in Sublinear Space pdf

Yota Otachi, Takashi Horiyama, Masashi Kiyomi, 2020, Inf. Process. Lett..

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set

Yukiko Yamauchi, Takashi Horiyama, Yoshio Okamoto, 2014, FUN.

Swapping labeled tokens on graphs

Takehiro Ito, Erik D. Demaine, Yoshio Okamoto, 2014, Theor. Comput. Sci..

Listing Chordal Graphs and Interval Graphs

Takeaki Uno, Masashi Kiyomi, Shuji Kijima, 2006, WG.

Alliances in graphs of bounded clique-width

Yota Otachi, Masashi Kiyomi, Masashi Kiyomi, 2017, Discret. Appl. Math..

Parameterized Complexity of (A, ℓ )-Path Packing pdf

Yota Otachi, Masashi Kiyomi, Michael Lampis, 2020, IWOCA.

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2018, STACS.

Finding a chain graph in a bipartite permutation graph

Yota Otachi, Masashi Kiyomi, 2016, Inf. Process. Lett..

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion pdf

Yota Otachi, Masashi Kiyomi, Yusuke Kobayashi, 2020, ArXiv.

Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2018, WALCOM.

Algorithmic Folding Complexity

Jean Cardinal, Erik D. Demaine, Ryuhei Uehara, 2011, Graphs Comb..

On the treewidth of toroidal grids

Yota Otachi, Yoshio Okamoto, Masashi Kiyomi, 2016, Discret. Appl. Math..

On covering of any point configuration by disjoint unit disks

Ryuhei Uehara, Masashi Kiyomi, Yosuke Okayama, 2011, CCCG.

Reconstruction Algorithm for Permutation Graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2010, WALCOM.

Hitori Numbers

Yota Otachi, Takeaki Uno, Masashi Kiyomi, 2017, J. Inf. Process..

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2017, Theory of Computing Systems.

Generalized Amazons is PSPACE-Complete

Takeaki Uno, Masashi Kiyomi, Michael Buro, 2005, IJCAI.

On listing, sampling, and counting the chordal graphs with edge constraints

Yoshio Okamoto, Takeaki Uno, Masashi Kiyomi, 2008, Theor. Comput. Sci..

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set

Yukiko Yamauchi, Takashi Horiyama, Yoshio Okamoto, 2017, J. Inf. Process..

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2013, IEICE Trans. Inf. Syst..

Voronoi Game on a Path

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2011, IEICE Trans. Inf. Syst..

Bipartite Permutation Graphs Are Reconstructible

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2010, COCOA.

Generating Chordal Graphs Included in Given Graphs

Takeaki Uno, Masashi Kiyomi, T. Uno, 2006, IEICE Trans. Inf. Syst..

On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints

Yoshio Okamoto, Takeaki Uno, Masashi Kiyomi, 2008, COCOON.

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

Hiroki Arimura, Takeaki Uno, Masashi Kiyomi, 2004, FIMI.

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs

Toshiki Saitoh, Ryuhei Uehara, Masashi Kiyomi, 2020, Theor. Comput. Sci..

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems

Yota Otachi, Masashi Kiyomi, Yusuke Kobayashi, 2022 .

Parameterized Complexity of $$(A,\ell )$$-Path Packing

Yota Otachi, Masashi Kiyomi, Michael Lampis, 2021, Algorithmica.

Studies on Subgraph and Supergraph Enumeration Algorithms

Masashi Kiyomi, Masashi Kiyomi, 2006 .

Complexity of pleat folding

Ryuhei Uehara, Tsuyoshi Ito, Masashi Kiyomi, 2009 .