default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatsuya Gima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
:
An improved spectral lower bound of treewidth. Inf. Process. Lett. 188: 106536 (2025)- [j7]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural parameterizations of vertex integrity. Theor. Comput. Sci. 1024: 114954 (2025) - [j6]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for tree minor containment with structural parameters. Theor. Comput. Sci. 1026: 114984 (2025) - 2024
- [j5]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. Algorithmica 86(1): 147-170 (2024) - [j4]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica 86(11): 3395-3424 (2024) - [j3]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
On a Spectral Lower Bound of Treewidth. IEICE Trans. Inf. Syst. 107(3): 328-330 (2024) - [c8]Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. WALCOM 2024: 377-391 - [c7]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM 2024: 392-405 - [c6]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - [c5]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435 - [i12]Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi:
An improved spectral lower bound of treewidth. CoRR abs/2404.08520 (2024) - [i11]Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito:
Computing diverse pair of solutions for tractable SAT. CoRR abs/2412.04016 (2024) - 2023
- [c4]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - [i10]Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi:
Minimum Consistent Subset for Trees Revisited. CoRR abs/2305.07259 (2023) - [i9]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR abs/2309.17204 (2023) - [i8]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR abs/2311.03225 (2023) - [i7]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. CoRR abs/2311.05892 (2023) - [i6]Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. CoRR abs/2311.13132 (2023) - [i5]Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the complexity of list H-packing for sparse graph classes. CoRR abs/2312.08639 (2023) - 2022
- [j2]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) - [j1]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) - [c3]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA 2022: 61:1-61:15 - [c2]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. ISAAC 2022: 20:1-20:15 - [i4]Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. CoRR abs/2202.08445 (2022) - [i3]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR abs/2207.01024 (2022) - 2021
- [c1]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 - [i2]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
- [i1]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)
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 2025-01-15 21:44 CET 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:
