Masashi Kiyomi

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