Integer Programming Based Algorithms for Peg Solitaire Problems. - Masashi Kiyomi; Tomomi Matsui (Computers and Games, 2000)

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets - Takeaki Uno; Masashi Kiyomi; Hiroki Arimura (FIMI, 2004)

Generalized Amazons is PSPACE-Complete. - Timothy Furtak; Masashi Kiyomi; Takeaki Uno; Michael Buro (IJCAI, 2005)

Efficient Algorithms for the Electric Power Transaction Problem. - Masashi Kiyomi; Takeaki Uno; Tomomi Matsui (WINE, 2005)

Listing Chordal Graphs and Interval Graphs. - Masashi Kiyomi; Shuji Kijima; Takeaki Uno (WG, 2006)

Generating Chordal Graphs Included in Given Graphs. - Masashi Kiyomi; Takeaki Uno (IEICE Trans. Inf. Syst., 2006)

Reconstruction Algorithm for Permutation Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (WALCOM, 2010)

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. - Ondrej Bílka; Kevin Buchin; Radoslav Fulek; Masashi Kiyomi; Yoshio Okamoto; Shin-ichi Tanigawa; Csaba D. Tóth (Electron. J. Comb., 2010)

Random Generation and Enumeration of Proper Interval Graphs. - Toshiki Saitoh; Katsuhisa Yamanaka; Masashi Kiyomi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2010)

On listing, sampling, and counting the chordal graphs with edge constraints. - Shuji Kijima; Masashi Kiyomi; Yoshio Okamoto; Takeaki Uno (Theor. Comput. Sci., 2010)

Reconstruction of interval graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Theor. Comput. Sci., 2010)

On covering of any point configuration by disjoint unit disks. - Yosuke Okayama; Masashi Kiyomi; Ryuhei Uehara (CCCG, 2011)

Algorithmic Folding Complexity. - Jean Cardinal; Erik D. Demaine; Martin L. Demaine; Shinji Imahori; Tsuyoshi Ito; Masashi Kiyomi; Stefan Langerman; Ryuhei Uehara; Takeaki Uno (Graphs Comb., 2011)

Voronoi Game on a Path. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2011)

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. - Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh (SEA, 2012)

Bipartite Permutation Graphs are reconstructible. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Discret. Math. Algorithms Appl., 2012)

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2013)

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (FUN, 2014)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

On the treewidth of toroidal grids. - Masashi Kiyomi; Yoshio Okamoto; Yota Otachi (Discret. Appl. Math., 2016)

Finding a chain graph in a bipartite permutation graph. - Masashi Kiyomi; Yota Otachi (Inf. Process. Lett., 2016)

Reverse Search; Enumeration Algorithms. - Masashi Kiyomi (Encyclopedia of Algorithms, 2016)

Alliances in graphs of bounded clique-width. - Masashi Kiyomi; Yota Otachi (Discret. Appl. Math., 2017)

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Takashi Iizuka; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (J. Inf. Process., 2017)

Hitori Numbers. - Akira Suzuki 001; Masashi Kiyomi; Yota Otachi; Kei Uchizawa; Takeaki Uno (J. Inf. Process., 2017)

How Bad is the Freedom to Flood-It? - Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi (J. Graph Algorithms Appl., 2019)

On structural parameterizations of firefighting. - Bireswar Das; Murali Krishna Enduri; Masashi Kiyomi; Neeldhara Misra; Yota Otachi; I. Vinod Reddy; Shunya Yoshimura (Theor. Comput. Sci., 2019)

Space-Efficient Algorithms for Longest Increasing Subsequence. - Masashi Kiyomi; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui (Theory Comput. Syst., 2020)

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. - Kazuaki Yamazaki; Toshiki Saitoh; Masashi Kiyomi; Ryuhei Uehara (Theor. Comput. Sci., 2020)

Longest common subsequence in sublinear space. - Masashi Kiyomi; Takashi Horiyama; Yota Otachi (Inf. Process. Lett., 2021)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Foreword. - Masashi Kiyomi (IEICE Trans. Inf. Syst., 2022)

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. - Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (Theory Comput. Syst., 2022)

Exploring the gap between treedepth and vertex cover through vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi (Theor. Comput. Sci., 2022)

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. - Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (AAAI, 2023)

Finding a Reconfiguration Sequence between Longest Increasing Subsequences. - Yuuki Aoike; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Space-Efficient FPT Algorithms for Degeneracy. - Naohito Matsumoto; Kazuhiro Kurita; Masashi Kiyomi (IEICE Trans. Inf. Syst., 2025)

Interval Graphs are Reconstructible. - Irene Heinrich; Masashi Kiyomi; Yota Otachi; Pascal Schweitzer (CoRR, 2025)