Masashi Kiyomi

(清見礼)

Profile Information

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

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

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

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

数学セミナー2019年4月号

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

Mar, 2019

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

科学研究費助成事業, 日本学術振興会, 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