Researcher List Masashi Kiyomi Masashi Kiyomi (清見 礼) Please select the form format to download from below 「Education and research environment」format 「No. 4, the Ministry of Education document style ①Outline for Vitae」format 「No. 4, the Ministry of Education document style ②Education and research environment」format Profile Information AffiliationAssociate Professor, Faculty of Science and Technology Department of Science and Technology , Seikei UniversityDegree博士(情報学)(総合研究大学院大学)J-GLOBAL ID201201001276504150researchmap Member ID7000002258- 2006年情報処理学会コンピュータサイエンス領域奨励賞 - IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004, Best Implementation Award Research Interests 2 graph algorithm Research Areas 1 Informatics / Information theory / Research History 4 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 4 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 49 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 More Misc. 23 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 More Books and Other Publications 1 数学セミナー2019年4月号 清見 礼 (Role: Contributor, 特集= 大学数学のキーポイント(前篇)アルゴリズム/情報数学の一例として pp.37-41) Mar, 2019 Research Projects 2 固定パラメータ困難問題に対する汎用解法の研究 科学研究費助成事業, 日本学術振興会, 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
Masashi Kiyomi (清見 礼) Please select the form format to download from below 「Education and research environment」format 「No. 4, the Ministry of Education document style ①Outline for Vitae」format 「No. 4, the Ministry of Education document style ②Education and research environment」format Profile Information AffiliationAssociate Professor, Faculty of Science and Technology Department of Science and Technology , Seikei UniversityDegree博士(情報学)(総合研究大学院大学)J-GLOBAL ID201201001276504150researchmap Member ID7000002258- 2006年情報処理学会コンピュータサイエンス領域奨励賞 - IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004, Best Implementation Award Research Interests 2 graph algorithm Research Areas 1 Informatics / Information theory / Research History 4 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 4 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 49 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 More Misc. 23 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 More Books and Other Publications 1 数学セミナー2019年4月号 清見 礼 (Role: Contributor, 特集= 大学数学のキーポイント(前篇)アルゴリズム/情報数学の一例として pp.37-41) Mar, 2019 Research Projects 2 固定パラメータ困難問題に対する汎用解法の研究 科学研究費助成事業, 日本学術振興会, 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
【連絡事項】 成蹊大学専任教員各位 ①ユーザ認証に関わる証明書の更新作業のため、以下のとおりメンテナンスを予定しております。2024年11月1日(金)18:30~19:30(予定)メンテナンス中は、Ufinityに新規でログインできません。上記時間帯に対象システムをご利用予定の方は、検証及び更新作業時間以前にログインを行い、ご利用いただきますようお願いいたします。 ②Ufinityにログイン後、「編集」ボタンを押した際に「権限が不正」というエラーメッセージが生じた際は、総合企画課までご連絡ください。 総合企画課:kikaku@jim.seikei.ac.jp