Yoichi Iwata

38 papers A* 7A 8B 3Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering.
CoRR
Yuki Imajuku, Kohki Horie, Yoichi Iwata, Kensho Aoki, Naohiro Takahashi, Takuya Akiba
2022 J jnl
Finding a Shortest Non-Zero Path in Group-Labeled Graphs.
Comb.
Yoichi Iwata, Yutaro Yamaguchi
2021 J jnl
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set.
Algorithmica
Yoichi Iwata, Yusuke Kobayashi
2019 A conf
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
ESA
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019 J jnl
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
CoRR
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
2019 B conf
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set.
IPEC
Yoichi Iwata, Yusuke Kobayashi
2019 J jnl
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set.
CoRR
Yoichi Iwata, Yusuke Kobayashi
2019 A* conf
Separator-Based Pruned Dynamic Programming for Steiner Tree.
AAAI
Yoichi Iwata, Takuto Shigemura
2018 A* conf
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.
FOCS
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
2018 A conf
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.
STACS
Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka
2018 J jnl
Parameterized Algorithms to Compute Ising Partition Function.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin
2017 J jnl
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing.
CoRR
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
2017 A* conf
Linear-Time Kernelization for Feedback Vertex Set.
ICALP
Yoichi Iwata
2017 J jnl
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.
CoRR
Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka
2016 J jnl
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover.
Theor. Comput. Sci.
Takuya Akiba, Yoichi Iwata
2016 A* conf
Cut Tree Construction from Massive Graphs.
ICDM
Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano
2016 J jnl
Cut Tree Construction from Massive Graphs.
CoRR
Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano
2016 J jnl
Half-integrality, LP-branching, and FPT Algorithms.
SIAM J. Comput.
Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
2016 J jnl
Linear-time Kernelization for Feedback Vertex Set.
CoRR
Yoichi Iwata
2015 B conf
An Exact Algorithm for Diameters of Large Real Directed Graphs.
SEA
Takuya Akiba, Yoichi Iwata, Yuki Kawata
2015 A conf
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover.
ALENEX
Takuya Akiba, Yoichi Iwata
2015 A* conf
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.
AAAI
Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida
2015 A conf
On the Equivalence among Problems of Bounded Width.
ESA
Yoichi Iwata, Yuichi Yoshida
2015 J jnl
On the Equivalence among Problems of Bounded Width.
CoRR
Yoichi Iwata, Yuichi Yoshida
2014 J jnl
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover.
CoRR
Takuya Akiba, Yoichi Iwata
2014 J jnl
Computing Personalized PageRank Quickly by Exploiting Graph Structures.
Proc. VLDB Endow.
Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi
2014 A* conf
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling.
WWW
Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2014 — conf
Fast Dynamic Graph Algorithms for Parameterized Problems.
SWAT
Yoichi Iwata, Keigo Oka
2014 J jnl
Fast Dynamic Graph Algorithms for Parameterized Problems.
CoRR
Yoichi Iwata, Keigo Oka
2014 A conf
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling.
ALENEX
Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata
2014 A* conf
Linear-Time FPT Algorithms via Network Flow.
SODA
Yoichi Iwata, Keigo Oka, Yuichi Yoshida
2013 A conf
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.
STACS
Yoichi Iwata, Yuichi Yoshida
2013 J jnl
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
CoRR
Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 A conf
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.
CIKM
Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 — conf
Fast exact shortest-path distance queries on large networks by pruned landmark labeling.
SIGMOD Conference
Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 J jnl
Linear-Time FPT Algorithms via Network Flow.
CoRR
Yoichi Iwata, Keigo Oka, Yuichi Yoshida
2013 A conf
Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.
CIKM
Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2011 B conf
A Faster Algorithm for Dominating Set Analyzed by the Potential Method.
IPEC
Yoichi Iwata