default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuma Tamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Jirô Akahori, Norio Konno, Iwao Sato, Yuma Tamura:
Absolute Zeta functions and periodicity of quantum walks on cycles. Quantum Inf. Comput. 24(11&12): 901-916 (2024)- [c12]Yuma Tamura
, Akira Suzuki, Takaaki Mizuki:
Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping Problem. APKC@AsiaCCS 2024 - [c11]Yota Otachi, Akira Suzuki, Yuma Tamura:
Finding Induced Subgraphs from Graphs with Small Mim-Width. SWAT 2024: 38:1-38:16 - [c10]Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Weighted Target Set Selection. TAMC 2024: 320-331 - [c9]Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou:
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. WALCOM 2024: 227-241 - [c8]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 - [i2]Yota Otachi, Akira Suzuki, Yuma Tamura:
Finding Induced Subgraphs from Graphs with Small Mim-Width. CoRR abs/2405.15492 (2024) - 2023
- [j4]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85(11): 3327-3347 (2023) - [j3]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Decremental optimization of vertex-colouring under the reconfiguration framework. Int. J. Comput. Math. Comput. Syst. Theory 8(1): 80-92 (2023) - [c7]Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Routing Problems in Graphs with Ordered Forbidden Transitions. COCOON (1) 2023: 359-370 - [c6]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. WALCOM 2023: 279-290 - [i1]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
- [c5]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM 2022: 149-160 - 2021
- [j2]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the independent feedback vertex set problem for bipartite graphs. Theor. Comput. Sci. 849: 227-236 (2021) - [c4]Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. COCOON 2021: 355-366 - 2020
- [c3]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ISAAC 2020: 40:1-40:13 - [c2]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. WALCOM 2020: 286-295
2010 – 2019
- 2015
- [j1]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Algorithms for the Independent Feedback Vertex Set Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1179-1188 (2015) - 2014
- [c1]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Deterministic Algorithms for the Independent Feedback Vertex Set Problem. IWOCA 2014: 351-363
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-30 20:31 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:
