Kiyomi Masashi 清見礼

… Alternative Names

清見礼キヨミマサシ

Less

Researcher Number	30447685
Other IDs
Affiliation (Current)	2025: 成蹊大学, 理工学部, 教授
Affiliation (based on the past Project Information) *help	2025: 成蹊大学, 理工学部, 教授 2021 – 2022: 成蹊大学, 理工学部, 教授 2018 – 2020: 横浜市立大学, データサイエンス学部, 准教授 2016: 横浜市立大学, 国際総合科学部(八景キャンパス), 准教授 2014 – 2016: 横浜市立大学, 総合科学部, 准教授 2013: 横浜市立大学, 国際総合科学部, 准教授 2012: 横浜市立大学, 総合科学部, 准教授
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related Except Principal Investigator Science and Engineering
Keywords	Principal Investigator モジュラ幅 / パス幅 / 固定パラメータ容易性 / 頂点インテグリティ / 固定パラメータ容易アルゴリズム / 木幅 / グラフアルゴリズム / 固定パラメータ困難問題 Except Principal Investigator 下界 / 省メモリ … More / 問題の下界 / 格子グラフ / 最短経路問題 / 作業領域 / グラフアルゴリズム / 計算幾何学 / 計算量 / アルゴリズム Less

空間計算量の小さい動的計画法の設計手法Principal Investigator
- Principal Investigator
  
  清見礼
- Project Period (FY)
  2025 – 2029
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Seikei University
General algorithms for fixed-parameter intractable problemsPrincipal Investigator
- Principal Investigator
  
  Kiyomi Masashi
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Seikei University
  Yokohama City University
Exploring the Limits of Computation in the Scenario of Constrained Work Space
- Principal Investigator
  
  Asano Tetsuo
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Japan Advanced Institute of Science and Technology

All 2023 2022 2021 2020 2019 2016 2015 2013 2012 Other

All Journal Article Presentation Book

[Book] Reverse Search; Enumeration Algorithms2016
- Author(s)
  M. Kiyomi
- Total Pages
  371
- Publisher
  Springer
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity2022
- Author(s)
  Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 918 Pages: 60-76
- DOI
  10.1016/j.tcs.2022.03.021
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742
[Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2022
- Author(s)
  Aoike Yuuki、Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Kurita Kazuhiro、Otachi Yota
- Journal Title
  
  Theory of Computing Systems
  
  Volume: 66 Issue: 2 Pages: 502-515
- DOI
  10.1007/s00224-022-10076-x
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
[Journal Article] Longest common subsequence in sublinear space2021
- Author(s)
  Kiyomi Masashi、Horiyama Takashi、Otachi Yota
- Journal Title
  
  Information Processing Letters
  
  Volume: 168 Pages: 106084-106084
- DOI
  10.1016/j.ipl.2020.106084
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
[Journal Article] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex?Integrity2021
- Author(s)
  Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12701 Pages: 271-285
- DOI
  10.1007/978-3-030-75242-2_19
- ISBN
  9783030752415, 9783030752422
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] Parameterized Complexity of (A,l)-Path Packing2020
- Author(s)
  Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12126 Pages: 43-55
- DOI
  10.1007/978-3-030-48966-3_4
- ISBN
  9783030489656, 9783030489663
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
[Journal Article] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2020
- Author(s)
  Yamazaki Kazuaki、Saitoh Toshiki、Kiyomi Masashi、Uehara Ryuhei
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 806 Pages: 310-322
- DOI
  10.1016/j.tcs.2019.04.017
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K12098, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K20311
[Journal Article] Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs2019
- Author(s)
  Kazuaki Yamazaki、Toshiki Saitoh、Masashi Kiyomi、Ryuhei Uehara
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 印刷中
- NAID
  120006648102
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11169
[Journal Article] On structural parameterizations of firefighting2019
- Author(s)
  Das Bireswar、Enduri Murali Krishna、Kiyomi Masashi、Misra Neeldhara、Otachi Yota、Reddy I. Vinod、Yoshimura Shunya
- Journal Title
  
  Theoretical Computer Science
  
  Volume: - Pages: 79-90
- DOI
  10.1016/j.tcs.2019.02.032
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] How Bad is the Freedom to Flood-It?2019
- Author(s)
  Belmonte Remy、Khosravian Ghadikolaei Mehdi、Kiyomi Masashi、Lampis Michael、Otachi Yota
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 23 Issue: 2 Pages: 111-134
- DOI
  10.7155/jgaa.00486
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] Space-Efficient Algorithms for Longest Increasing Subsequence2019
- Author(s)
  Kiyomi Masashi、Ono Hirotaka、Otachi Yota、Schweitzer Pascal、Tarui Jun
- Journal Title
  
  Theory of Computing Systems
  
  Volume: - Issue: 3 Pages: 522-541
- DOI
  10.1007/s00224-018-09908-6
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-17H01698
[Journal Article] On the treewidth of toroidal grids2016
- Author(s)
  Yoshio Okamoto, Masashi Kiyomi, and Yota Otachi
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 198 Pages: 303-306
- DOI
  10.1016/j.dam.2015.06.027
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-15K00009, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-25730003
[Journal Article] Finding a chain graph in a bipartite permutation graph2016
- Author(s)
  Masashi Kiyomi, Yota Otachi
- Journal Title
  
  Information Processing Letters
  
  Volume: 印刷中 Issue: 9 Pages: 569-573
- DOI
  10.1016/j.ipl.2016.04.006
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25730003
[Journal Article] Swapping Labeled Tokens on Graphs2015
- Author(s)
  Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
- Journal Title
  
  Theoretical Computer Science
  
  Volume: tbd
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs2013
- Author(s)
  Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E96.D Issue: 3 Pages: 426-432
- DOI
  10.1587/transinf.E96.D.426
- NAID
  10031167427
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] On the Treewidth of Toroidal Graphs2013
- Author(s)
  Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
- Journal Title
  
  Japan Conference on Discrete and Computational Geometry and Graphs
  
  Volume: 16 Pages: 76-77
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Efficient enumeration of the directed binary perfect phylogenies from incomplete data2012
- Author(s)
  Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7276 Pages: 248-259
- DOI
  10.1007/978-3-642-30850-5_22
- NAID
  110009588447
- ISBN
  9783642308499, 9783642308505
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21700009, KAKENHI-PROJECT-22310089, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005
[Journal Article] Bipartite Permutation Graphs are Reconstructible2012
- Author(s)
  Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
- Journal Title
  
  Discrete Mathematics, Algorithms and Applications
  
  Volume: 4(3) Issue: 03 Pages: 1-14
- DOI
  10.1142/s1793830912500395
- NAID
  120005316240
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500013, KAKENHI-PROJECT-24700130, KAKENHI-PLANNED-24106004
[Journal Article] On Covering of Any Point Configuration by Disjoint Unit Disks2012
- Author(s)
  Yosuke Okayama, Masashi Kiyomi, and Ryuhei Uehara
- Journal Title
  
  Geombinatorics
  
  Volume: XXI(1) Pages: 14-23
- NAID
  120006675019
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems2023
- Author(s)
  Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otach
- Organizer
  AAAI2023
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Exploring the gap between treedepth and vertex cover through vertex integrity2021
- Author(s)
  Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
- Organizer
  The 12th International Conference on Algorithms and Complexity (CIAC 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Parameterized complexity of (A, l)‐path packing2020
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Depth-First Search Using O(n) Bits
- Author(s)
  Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Yota Otachi, Hirotaka Ono, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara
- Organizer
  ISAAC2014
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-15 – 2014-12-17
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Swapping Labeled Tokens on Graphs
- Author(s)
  Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
- Organizer
  FUN 2014
- Place of Presentation
  Sicily, Italy
- Year and Date
  2014-07-01 – 2014-07-03
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
- Author(s)
  Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
- Organizer
  FUN 2014
- Place of Presentation
  Sicily, Italy
- Year and Date
  2014-07-01 – 2014-07-03
- Data Source
  KAKENHI-PLANNED-24106004

1. 大舘陽太 (80610196)

# of Collaborated Projects: 2 results

# of Collaborated Products: 10 results
2. Asano Tetsuo (90113133)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
3. 上原隆平 (00256471)

# of Collaborated Projects: 1 results

# of Collaborated Products: 4 results
4. 垂井淳 (00260539)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
5. 小野廣隆 (00346826)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
6. Guenter Rote

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. Wolfgang Mulzer

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. Ovidiu Daescu

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. 岡本吉央

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results
10. 斎藤寿樹

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
11. BELMONTE Remy

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
12. 土中哲秀

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results

Kiyomi Masashi 清見 礼

清見 礼 キヨミ マサシ

Research Projects

Research Products

Co-Researchers

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

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

General algorithms for fixed-parameter intractable problemsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Exploring the Limits of Computation in the Scenario of Constrained Work Space

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

[Book] Reverse Search; Enumeration Algorithms2016

Author(s)

Total Pages

Publisher

Data Source

[Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity2022

Author(s)

Journal Title

DOI

Data Source

[Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2022

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Longest common subsequence in sublinear space2021

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex?Integrity2021

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] Parameterized Complexity of (A,l)-Path Packing2020

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2020

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs2019

Author(s)

Journal Title

NAID

Data Source

[Journal Article] On structural parameterizations of firefighting2019

Author(s)

Journal Title

DOI

Data Source

[Journal Article] How Bad is the Freedom to Flood-It?2019

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Space-Efficient Algorithms for Longest Increasing Subsequence2019

Author(s)

Journal Title

DOI

Data Source

Kiyomi Masashi 清見礼

清見礼キヨミマサシ