Yoichi Iwata

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
0/1/all CSPs, half-integral A-path packing, and linear-time FPT algorithms	2025-08-12	Paper
Finding a shortest non-zero path in group-labeled graphs Combinatorica	2025-06-19	Paper
scientific article; zbMATH DE number 7650230 (Why is no real title available?)	2023-02-03	Paper
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (available as arXiv preprint)	2022-05-11	Paper
Improved analysis of highest-degree branching for feedback vertex set Algorithmica	2021-07-26	Paper
Improved analysis of highest-degree branching for feedback vertex set Algorithmica	2021-07-26	Paper
On the power of tree-depth for fully polynomial FPT algorithms (available as arXiv preprint)	2020-08-05	Paper
Linear-time kernelization for feedback vertex set (available as arXiv preprint)	2020-05-27	Paper
Fast shortest-path distance queries on road networks by pruned highway labeling 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
Linear-time FPT algorithms via network flow Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-06-20	Paper
Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra	2017-01-30	Paper
Half-integrality, LP-branching, and FPT algorithms SIAM Journal on Computing	2016-08-26	Paper
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover Theoretical Computer Science	2015-12-08	Paper
On the equivalence among problems of bounded width Algorithms - ESA 2015	2015-11-19	Paper
Fast dynamic graph algorithms for parameterized problems Algorithm Theory – SWAT 2014	2014-09-02	Paper
A faster algorithm for dominating set analyzed by the potential method Parameterized and Exact Computation	2012-06-15	Paper

Research outcomes over time

This page was built for person: Yoichi Iwata