default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasashi Kiyomi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. 107(4): 559-563 (2024)- 2023
- [c21]Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI 2023: 3968-3976 - [i9]Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Finding a reconfiguration sequence between longest increasing subsequences. CoRR abs/2310.01066 (2023) - 2022
- [j24]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi
, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84(4): 871-895 (2022) - [j23]Masashi Kiyomi:
Foreword. IEICE Trans. Inf. Syst. 105-D(3): 450 (2022) - [j22]Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66(2): 502-515 (2022) - [j21]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. 918: 60-76 (2022) - [i8]Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR abs/2201.08940 (2022) - 2021
- [j20]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest common subsequence in sublinear space. Inf. Process. Lett. 168: 106084 (2021) - [c20]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC 2021: 271-285 - [i7]Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi:
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR abs/2101.09414 (2021) - 2020
- [j19]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64(3): 522-541 (2020) - [j18]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806: 310-322 (2020) - [c19]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA 2020: 43-55 - [i6]Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR abs/2008.03448 (2020) - [i5]Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest Common Subsequence in Sublinear Space. CoRR abs/2009.08588 (2020) - [i4]Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi:
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR abs/2012.04910 (2020)
2010 – 2019
- 2019
- [j17]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. 23(2): 111-134 (2019) - [j16]Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura:
On structural parameterizations of firefighting. Theor. Comput. Sci. 782: 79-90 (2019) - 2018
- [c18]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It?. FUN 2018: 5:1-5:13 - [c17]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS 2018: 44:1-44:15 - [c16]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM 2018: 8-19 - [i3]Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It? CoRR abs/1804.08236 (2018) - 2017
- [j15]Masashi Kiyomi, Yota Otachi:
Alliances in graphs of bounded clique-width. Discret. Appl. Math. 223: 91-97 (2017) - [j14]Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno:
Hitori Numbers. J. Inf. Process. 25: 695-707 (2017) - [j13]Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25: 708-715 (2017) - [i2]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR abs/1712.09230 (2017) - 2016
- [j12]Masashi Kiyomi, Yoshio Okamoto, Yota Otachi:
On the treewidth of toroidal grids. Discret. Appl. Math. 198: 303-306 (2016) - [j11]Masashi Kiyomi, Yota Otachi:
Finding a chain graph in a bipartite permutation graph. Inf. Process. Lett. 116(9): 569-573 (2016) - [r1]Masashi Kiyomi:
Reverse Search; Enumeration Algorithms. Encyclopedia of Algorithms 2016: 1840-1842 - 2015
- [j10]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586: 81-94 (2015) - 2014
- [c15]Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi:
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN 2014: 230-239 - [c14]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping Labeled Tokens on Graphs. FUN 2014: 364-375 - [c13]Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara:
Depth-First Search Using O(n) Bits. ISAAC 2014: 553-564 - 2013
- [j9]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Trans. Inf. Syst. 96-D(3): 426-432 (2013) - 2012
- [j8]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs are reconstructible. Discret. Math. Algorithms Appl. 4(3) (2012) - [c12]Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA 2012: 248-259 - [i1]Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. CoRR abs/1203.3284 (2012) - 2011
- [j7]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [j6]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Voronoi Game on a Path. IEICE Trans. Inf. Syst. 94-D(6): 1185-1189 (2011) - [c11]Yosuke Okayama, Masashi Kiyomi, Ryuhei Uehara:
On covering of any point configuration by disjoint unit disks. CCCG 2011 - 2010
- [j5]Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth:
A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. 17(1) (2010) - [j4]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. 93-D(7): 1816-1823 (2010) - [j3]Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno:
On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411(26-28): 2591-2601 (2010) - [j2]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of interval graphs. Theor. Comput. Sci. 411(43): 3859-3866 (2010) - [c10]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373 - [c9]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithm for Permutation Graphs. WALCOM 2010: 125-135
2000 – 2009
- 2009
- [c8]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of Interval Graphs. COCOON 2009: 106-115 - [c7]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. WALCOM 2009: 177-189 - 2008
- [c6]Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno:
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467 - 2006
- [j1]Masashi Kiyomi, Takeaki Uno:
Generating Chordal Graphs Included in Given Graphs. IEICE Trans. Inf. Syst. 89-D(2): 763-770 (2006) - [c5]Masashi Kiyomi, Shuji Kijima, Takeaki Uno:
Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77 - 2005
- [c4]Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro:
Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137 - [c3]Masashi Kiyomi, Takeaki Uno, Tomomi Matsui:
Efficient Algorithms for the Electric Power Transaction Problem. WINE 2005: 602-611 - 2004
- [c2]Takeaki Uno, Masashi Kiyomi, Hiroki Arimura:
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. FIMI 2004 - 2000
- [c1]Masashi Kiyomi, Tomomi Matsui:
Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games 2000: 229-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
