Masashi Kiyomi

(清見礼)

Profile Information

Affiliation: Professor, Faculty of Science and Technology Department of Science and Technology , Seikei University

Degree: 博士(情報学)(総合研究大学院大学)

J-GLOBAL ID: 201201001276504150
researchmap Member ID: 7000002258

- 2006年情報処理学会コンピュータサイエンス領域奨励賞
- IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004, Best Implementation Award

Research Interests

Research Areas

Informatics / Information theory /

Research History

Apr, 2021 - Present

Professor, Faculty of Science and Technology Department of Computer and Information Science, Seikei University
Apr, 2012 - Mar, 2021

Yokohama City University
Oct, 2006 - Mar, 2012

Japan Advanced Institute of Science and Technology
Apr, 2002 - Jun, 2003

システム開発研究所, 株式会社日立製作所

Education

Oct, 2003 - Sep, 2006

Department of Informatics, School of Multidisciplinary Sciences, The Graduate University for Advanced Studies
Apr, 2000 - Mar, 2002

東京大学大学院工学系研究科情報工学専攻
Apr, 1998 - Mar, 2000

Department of Mathematical Engineering and Information Physics, The Faculty of Engineering, The University of Tokyo
Apr, 1996 - Mar, 1998

College of Arts and Sciences, The University of Tokyo

Papers

Finding a Reconfiguration Sequence between Longest Increasing Subsequences.

Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

IEICE Trans. Inf. Syst., 107(4) 559-563, 2024 Peer-reviewed
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

AAAI, 3968-3976, 2023 Peer-reviewed
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., 66(2) 502-515, 2022 Peer-reviewed
Exploring the gap between treedepth and vertex cover through vertex integrity.

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

Theor. Comput. Sci., 918 60-76, 2022 Peer-reviewed
Parameterized Complexity of (A, ℓ )-Path Packing.

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

Algorithmica, 84(4) 871-895, 2022 Peer-reviewed
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

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

Lecture Notes in Computer Science, 12701 271-285, 2021 Peer-reviewed
Longest common subsequence in sublinear space.

Masashi Kiyomi, Takashi Horiyama, Yota Otachi

Inf. Process. Lett., 168 106084-106084, 2021 Peer-reviewed
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Theoretical Computer Science, 806 310-322, Feb, 2020 Peer-reviewed
Space-Efficient Algorithms for Longest Increasing Subsequence.

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

Theory Comput. Syst., 64(3) 522-541, 2020 Peer-reviewed
Parameterized Complexity of $$(A,\ell )$$-Path Packing

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

Lecture Notes in Computer Science, 12126 43-55, 2020 Peer-reviewed
On structural parameterizations of firefighting.

Bireswar Das,Murali, Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura

Theor. Comput. Sci., 782 79-90, 2019 Peer-reviewed
How Bad is the Freedom to Flood-It?

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

J. Graph Algorithms Appl., 23(2) 111-134, 2019 Peer-reviewed
How Bad is the Freedom to Flood-It?

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

Leibniz International Proceedings in Informatics, LIPIcs, 100 51-513, Jun 1, 2018 Peer-reviewed
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10755 8-19, 2018 Peer-reviewed
Space-Efficient Algorithms for Longest Increasing Subsequence.

Masashi Kiyomi, Hirotaka Ono,Array, Pascal Schweitzer, Jun Tarui

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, 44:1-44:15, 2018 Peer-reviewed
Alliances in graphs of bounded clique-width

Masashi Kiyomi, Yota Otachi

DISCRETE APPLIED MATHEMATICS, 223 91-97, May, 2017 Peer-reviewed
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

Journal of Information Processing, 25(8) 708-715, 2017 Peer-reviewed
Hitori numbers

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

Journal of Information Processing, 25(8) 695-707, 2017 Peer-reviewed
Finding a chain graph in a bipartite permutation graph

Masashi Kiyomi, Yota Otachi

INFORMATION PROCESSING LETTERS, 116(9) 569-573, Sep, 2016 Peer-reviewed
Logging with Maximum Length Constraint

Ei Ando, Akitoshi Kawamura, Masashi Kiyomi, Eiji Miyano, Hirotaka Ono

Proceedings of 19th Japan-Korean Joint Workshop on Algorithms and Computation (WAAC2016), 71-1-71-4, Aug 30, 2016
Reverse Search; Enumeration Algorithms.

Masashi Kiyomi

Encyclopedia of Algorithms 2016, 1840-1842, 2016 Invited
On the treewidth of toroidal grids

Masashi Kiyomi, Yoshio Okamoto, Yota Otachi

DISCRETE APPLIED MATHEMATICS, 198 303-306, Jan, 2016 Peer-reviewed
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

THEORETICAL COMPUTER SCIENCE, 586 81-94, Jun, 2015 Peer-reviewed
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

ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889 553-564, 2014 Peer-reviewed
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

FUN WITH ALGORITHMS, 8496 364-375, 2014 Peer-reviewed
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 WITH ALGORITHMS, 8496 230-239, 2014 Peer-reviewed
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D(3) 426-432, Mar, 2013 Peer-reviewed
Efficient enumeration of the directed binary perfect phylogenies from incomplete data

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7276 248-259, 2012 Peer-reviewed
Bipartite Permutation Graphs are reconstructible.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Discrete Math., Alg. and Appl., 4(3) 1250039-1250039, 2012 Peer-reviewed
Voronoi Game on a Path

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D(6) 1185-1189, Jun, 2011 Peer-reviewed
Algorithmic Folding Complexity

Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno

GRAPHS AND COMBINATORICS, 27(3) 341-351, May, 2011 Peer-reviewed
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, Toronto, Ontario, Canada, August 10-12, 2011, 2011 Peer-reviewed
Reconstruction of interval graphs

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

THEORETICAL COMPUTER SCIENCE, 411(43) 3859-3866, Oct, 2010 Peer-reviewed
Random Generation and Enumeration of Proper Interval Graphs

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E93D(7) 1816-1823, Jul, 2010 Peer-reviewed
On listing, sampling, and counting the chordal graphs with edge constraints

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno

THEORETICAL COMPUTER SCIENCE, 411(26-28) 2591-2601, Jun, 2010 Peer-reviewed
Reconstruction Algorithm for Permutation Graphs

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5942 125-135, 2010 Peer-reviewed
Bipartite Permutation Graphs Are Reconstructible

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509 362-+, 2010 Peer-reviewed
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

Electr. J. Comb., 17(1), 2010 Peer-reviewed
Random Generation and Enumeration of Proper Interval Graphs

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara

WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431 177-+, 2009 Peer-reviewed
Reconstruction of Interval Graphs

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

COMPUTING AND COMBINATORICS, PROCEEDINGS, 5609 106-115, 2009 Peer-reviewed
On listing, sampling, and counting the chordal graphs with edge constraints

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno

COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092 458-+, 2008 Peer-reviewed
Simple Efficient Algorithm for MPQ-tree of an Interval Graph

Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2007), 121-126, 2007
Generating chordal graphs included in given graphs

M Kiyomi, T Uno

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D(2) 763-770, Feb, 2006 Peer-reviewed
Listing chordal graphs and interval graphs

Masashi Kiyomi, Shuji Kijima, Takeaki Uno

GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 4271 68-77, 2006 Peer-reviewed
LCM ver.3: Collaboration of Array, Bitmap and Prefix Tree for Frequent Itemset Mining (available at home page of Open Source Data Mining Workshop on Frequent Pattern Mining Implementations 2005)

Takeaki Uno, Masashi Kiyomi, Hiroki Arimura

Open Source Data Mining Workshop on Frequent Pattern Mining Implementations 2005, Aug, 2005 Peer-reviewed
Efficient algorithms for the electric power transaction problem

Masashi Kiyomi, Takeaki Uno, Tomomi Matsui

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3828 602-611, 2005 Peer-reviewed
Generalized Amazons is PSPACE-Complete

Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro

19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 132-137, 2005 Peer-reviewed
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

Takeaki Uno, Masashi Kiyomi, Hiroki Arimura

FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004, 2004 Peer-reviewed
Integer programming based algorithms for peg solitaire problems

Masashi Kiyomi, Tomomi Matsui

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2063 229-240, 2001 Peer-reviewed

Misc.

Approximation Algorithms for Finding Max-Sum Diverse Collections

JSAI Technical Report, SIG-FPAI, 119 21-26, 2022
区間順序上の最長増加部分列

青池宥希, 清見礼, 小林靖明, 大舘陽太

情報処理学会研究報告(Web), 2021(AL-184), 2021
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

AOIKE Yuuki, GIMA Tatsuya, HANAKA Tesshu, KIYOMI Masashi, KOBAYASHI Yasuaki, KOBAYASHI Yusuke, KURITA Kazuhiro, OTACHI Yota

電子情報通信学会技術研究報告(Web), 120(276(COMP2020 18-27)) 502-515, 2020
Space-Efficient Algorithms for Longest Increasing Subsequence.

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

CoRR, abs/1712.09230, 2017
Counting the number of solutions for peg solitaire (コンピュテーション)

兼本樹, 斎藤寿樹, 清見礼, 上原隆平

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116(211) 1-5, Sep 6, 2016

Books and Other Publications

数学セミナー2019年4月号

清見礼 (Role: Contributor, 特集＝大学数学のキーポイント（前篇）アルゴリズム／情報数学の一例として pp.37-41)

Mar, 2019

Research Projects

空間計算量の小さい動的計画法の設計手法

科学研究費助成事業, 日本学術振興会, Apr, 2025 - Mar, 2030

清見礼
固定パラメータ困難問題に対する汎用解法の研究

科学研究費助成事業, 日本学術振興会, Apr, 2018 - Mar, 2023

清見礼, 大舘陽太
Exploring the Limits of Computation in the Scenario of Constrained Work Space

Grants-in-Aid for Scientific Research, Japan Society for the Promotion of Science, Jun, 2012 - Mar, 2017

Asano Tetsuo, Guenter Rote, Wolfgang Mulzer, Ovidiu Daescu

To the list screen