Masashi Kiyomi

According to our database, Masashi Kiyomi authored at least 39 papers between 2000 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Interval Graphs are Reconstructible.

Irene Heinrich, Masashi Kiyomi, Yota Otachi, Pascal Schweitzer

CoRR, April, 2025

Space-Efficient FPT Algorithms for Degeneracy.

Naohito Matsumoto, Kazuhiro Kurita, Masashi Kiyomi

IEICE Trans. Inf. Syst., 2025

2024

Finding a Reconfiguration Sequence between Longest Increasing Subsequences.

Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

IEICE Trans. Inf. Syst., 2024

2023

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

Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Theory Comput. Syst., 2022

Foreword.

Masashi Kiyomi

IEICE Trans. Inf. Syst., 2022

2021

Longest common subsequence in sublinear space.

Masashi Kiyomi, Takashi Horiyama, Yota Otachi

Inf. Process. Lett., 2021

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

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

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

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

2018

Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Space-Efficient Algorithms for Longest Increasing Subsequence.

Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

How Bad is the Freedom to Flood-It?.

Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Hitori Numbers.

Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno

J. Inf. Process., 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

Alliances in graphs of bounded clique-width.

Masashi Kiyomi, Yota Otachi

Discret. Appl. Math., 2017

2016

Reverse Search; Enumeration Algorithms.

Masashi Kiyomi

Encyclopedia of Algorithms, 2016

Finding a chain graph in a bipartite permutation graph.

Masashi Kiyomi, Yota Otachi

Inf. Process. Lett., 2016

On the treewidth of toroidal grids.

Masashi Kiyomi, Yoshio Okamoto, Yota Otachi

Discret. Appl. Math., 2016

2014

Depth-First Search Using O(n) Bits.

Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Swapping Labeled Tokens on Graphs.

Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

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

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2013

2012

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

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Voronoi Game on a Path.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 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

On covering of any point configuration by disjoint unit disks.

Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

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

Reconstruction Algorithm for Permutation Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Bipartite Permutation Graphs Are Reconstructible.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Random Generation and Enumeration of Proper Interval Graphs.

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Reconstruction of Interval Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

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

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2006

Generating Chordal Graphs Included in Given Graphs.

Masashi Kiyomi, Takeaki Uno

IEICE Trans. Inf. Syst., 2006

Listing Chordal Graphs and Interval Graphs.

Masashi Kiyomi, Shuji Kijima, Takeaki Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

Efficient Algorithms for the Electric Power Transaction Problem.

Masashi Kiyomi, Takeaki Uno, Tomomi Matsui

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Generalized Amazons is PSPACE-Complete.

Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro

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

Takeaki Uno, Masashi Kiyomi, Hiroki Arimura

Proceedings of the FIMI '04, 2004

2000

Integer Programming Based Algorithms for Peg Solitaire Problems.

Masashi Kiyomi, Tomomi Matsui

Proceedings of the Computers and Games, Second International Conference, 2000