default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoichi Iwata
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Yoichi Iwata, Yutaro Yamaguchi:
Finding a Shortest Non-Zero Path in Group-Labeled Graphs. Comb. 42(Supplement 2): 1253-1282 (2022)- 2021
- [j5]Yoichi Iwata
, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Algorithmica 83(8): 2503-2520 (2021)
2010 – 2019
- 2019
- [c20]Yoichi Iwata, Takuto Shigemura:
Separator-Based Pruned Dynamic Programming for Steiner Tree. AAAI 2019: 1520-1527 - [c19]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA 2019: 23:1-23:14 - [c18]Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. IPEC 2019: 22:1-22:11 - [i11]Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR abs/1905.12233 (2019) - [i10]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR abs/1908.09325 (2019) - 2018
- [j4]Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin:
Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1398-1403 (2018) - [c17]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. FOCS 2018: 462-473 - [c16]Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka:
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. STACS 2018: 41:1-41:14 - 2017
- [c15]Yoichi Iwata:
Linear-Time Kernelization for Feedback Vertex Set. ICALP 2017: 68:1-68:14 - [i9]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. CoRR abs/1704.02700 (2017) - [i8]Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka:
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. CoRR abs/1710.04376 (2017) - 2016
- [j3]Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida:
Half-integrality, LP-branching, and FPT Algorithms. SIAM J. Comput. 45(4): 1377-1411 (2016) - [j2]Takuya Akiba, Yoichi Iwata:
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. Theor. Comput. Sci. 609: 211-225 (2016) - [c14]Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano:
Cut Tree Construction from Massive Graphs. ICDM 2016: 775-780 - [i7]Yoichi Iwata:
Linear-time Kernelization for Feedback Vertex Set. CoRR abs/1608.01463 (2016) - [i6]Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano:
Cut Tree Construction from Massive Graphs. CoRR abs/1609.08723 (2016) - 2015
- [c13]Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida:
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. AAAI 2015: 2-8 - [c12]Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. ALENEX 2015: 70-81 - [c11]Yoichi Iwata, Yuichi Yoshida:
On the Equivalence among Problems of Bounded Width. ESA 2015: 754-765 - [c10]Takuya Akiba, Yoichi Iwata, Yuki Kawata:
An Exact Algorithm for Diameters of Large Real Directed Graphs. SEA 2015: 56-67 - [i5]Yoichi Iwata, Yuichi Yoshida:
On the Equivalence among Problems of Bounded Width. CoRR abs/1509.01014 (2015) - 2014
- [j1]Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi:
Computing Personalized PageRank Quickly by Exploiting Graph Structures. Proc. VLDB Endow. 7(12): 1023-1034 (2014) - [c9]Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata:
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. ALENEX 2014: 147-154 - [c8]Yoichi Iwata, Keigo Oka, Yuichi Yoshida:
Linear-Time FPT Algorithms via Network Flow. SODA 2014: 1749-1761 - [c7]Yoichi Iwata, Keigo Oka:
Fast Dynamic Graph Algorithms for Parameterized Problems. SWAT 2014: 241-252 - [c6]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. WWW 2014: 237-248 - [i4]Yoichi Iwata, Keigo Oka:
Fast Dynamic Graph Algorithms for Parameterized Problems. CoRR abs/1404.7307 (2014) - [i3]Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. CoRR abs/1411.2680 (2014) - 2013
- [c5]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. CIKM 2013: 909-918 - [c4]Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. CIKM 2013: 1601-1606 - [c3]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast exact shortest-path distance queries on large networks by pruned landmark labeling. SIGMOD Conference 2013: 349-360 - [c2]Yoichi Iwata, Yuichi Yoshida:
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. STACS 2013: 127-138 - [i2]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. CoRR abs/1304.4661 (2013) - [i1]Yoichi Iwata, Keigo Oka, Yuichi Yoshida:
Linear-Time FPT Algorithms via Network Flow. CoRR abs/1307.4927 (2013) - 2011
- [c1]Yoichi Iwata:
A Faster Algorithm for Dominating Set Analyzed by the Potential Method. IPEC 2011: 41-54
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-04-24 23:04 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:
