Masashi Kiyomi

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 30

Top Topics

Parameterized Complexity

Longest Common Subsequence

Top Venues

Theor. Comput. Sci.

IEICE Trans. Inf. Syst.

Publications

Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. 107 (4) (2024)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI (2023)
Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Finding a reconfiguration sequence between longest increasing subsequences. CoRR (2023)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918 (2022)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66 (2) (2022)
Masashi Kiyomi
Foreword. IEICE Trans. Inf. Syst. (3) (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR (2022)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC (2021)
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
Longest common subsequence in sublinear space. Inf. Process. Lett. 168 (2021)
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR (2021)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806 (2020)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64 (3) (2020)
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
Longest Common Subsequence in Sublinear Space. CoRR (2020)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR (2020)
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
On structural parameterizations of firefighting. Theor. Comput. Sci. 782 (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. 23 (2) (2019)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It? CoRR (2018)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS (2018)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM (2018)
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
How Bad is the Freedom to Flood-It?. FUN (2018)
Masashi Kiyomi, Yota Otachi
Alliances in graphs of bounded clique-width. Discret. Appl. Math. 223 (2017)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR (2017)
Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno
Hitori Numbers. J. Inf. Process. 25 (2017)
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25 (2017)
Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
On the treewidth of toroidal grids. Discret. Appl. Math. 198 (2016)
Masashi Kiyomi, Yota Otachi
Finding a chain graph in a bipartite permutation graph. Inf. Process. Lett. 116 (9) (2016)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586 (2015)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping Labeled Tokens on Graphs. FUN (2014)
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
Depth-First Search Using O(n) Bits. ISAAC (2014)
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN (2014)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Trans. Inf. Syst. (3) (2013)
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA (2012)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Bipartite Permutation Graphs are reconstructible. Discret. Math. Algorithms Appl. 4 (3) (2012)
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data CoRR (2012)
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno
Algorithmic Folding Complexity. Graphs Comb. 27 (3) (2011)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Voronoi Game on a Path. IEICE Trans. Inf. Syst. (6) (2011)
Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara
On covering of any point configuration by disjoint unit disks. CCCG (2011)
Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth
A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. 17 (1) (2010)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) (2010)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction Algorithm for Permutation Graphs. WALCOM (2010)
Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411 (26-28) (2010)
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. (7) (2010)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction of interval graphs. Theor. Comput. Sci. 411 (43) (2010)
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
Random Generation and Enumeration of Proper Interval Graphs. WALCOM (2009)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction of Interval Graphs. COCOON (2009)
Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON (2008)
Masashi Kiyomi, Takeaki Uno
Generating Chordal Graphs Included in Given Graphs. IEICE Trans. Inf. Syst. (2) (2006)
Masashi Kiyomi, Shuji Kijima, Takeaki Uno
Listing Chordal Graphs and Interval Graphs. WG (2006)
Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
Efficient Algorithms for the Electric Power Transaction Problem. WINE (2005)
Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro
Generalized Amazons is PSPACE-Complete. IJCAI (2005)
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets FIMI (2004)
Masashi Kiyomi, Tomomi Matsui
Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games (2000)