Yoichi Iwata

Last updated: Jan 29, 2018 at 13:34

Name	Yoichi Iwata
Affiliation	National Institute of Informatics

Awards & Honors

Plain Text

Sep 2016

ICFP 2016 Programming Contest 1st prize

Aug 2016

PACE 2016 Track B 1st prize

Winner: Yoichi Iwata, Kensuke Imanishi

Jun 2016

SIGMOD 2016 Programming Contest 1st prize

Winner: Takuto Ikuta, Takanori Hayashi, Yosuke Yano, Yoichi Iwata

Jul 2014

SWAT 2014 Best Student Paper Award

Winner: Yoichi Iwata, Keigo Oka

Sep 2011

IPEC 2011 Excellent Student Paper Award

Published Papers

Plain Text

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.

Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka

35th International Symposium on Theoretical Aspects of Computer Science, STACS 2018 to appear Mar 2018 [Refereed]

Linear-time Kernelization for Feedback Vertex Set.

Yoichi Iwata

Proceedings of 44th International Colloquium on Automata, Languages, and Programming (ICALP) 68:1-68:14 Jul 2017 [Refereed]

Cut Tree Construction from Massive Graphs.

Takuya Akiba,Yoichi Iwata,Yosuke Sameshima,Naoto Mizuno,Yosuke Yano

IEEE 16th International Conference on Data Mining, ICDM 2016, December 12-15, 2016, Barcelona, Spain 2016(ICDM) 780 2016 [Refereed]

Half-integrality, LP-branching, and FPT Algorithms.

Yoichi Iwata,Magnus Wahlström,Yuichi Yoshida

SIAM J. Comput. 45(4) 1377-1411 2016 [Refereed]

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover.

Takuya Akiba,Yoichi Iwata

Theor. Comput. Sci. 609 211-225 2016 [Refereed]

An Exact Algorithm for Diameters of Large Real Directed Graphs.

Takuya Akiba,Yoichi Iwata,Yuki Kawata

Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings 9125 56-67 2015 [Refereed]

On the Equivalence among Problems of Bounded Width.

Yoichi Iwata,Yuichi Yoshida

Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings 9294 754-765 2015 [Refereed]

Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover.

Takuya Akiba,Yoichi Iwata

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015 70-81 2015 [Refereed]

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.

Takuya Akiba,Takanori Hayashi,Nozomi Nori,Yoichi Iwata,Yuichi Yoshida

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. 2-8 2015 [Refereed]

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling.

Takuya Akiba,Yoichi Iwata,Yuichi Yoshida

23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014 237-247 2014 [Refereed]

Fast Dynamic Graph Algorithms for Parameterized Problems.

Yoichi Iwata,Keigo Oka

Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings 8503 241-252 2014 [Refereed]

Linear-Time FPT Algorithms via Network Flow.

Yoichi Iwata,Keigo Oka,Yuichi Yoshida

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 1749-1761 2014 [Refereed]

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling.

Takuya Akiba,Yoichi Iwata,Ken-ichi Kawarabayashi,Yuki Kawata

2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014 147-154 2014 [Refereed]

Computing Personalized PageRank Quickly by Exploiting Graph Structures.

Takanori Maehara,Takuya Akiba,Yoichi Iwata,Ken-ichi Kawarabayashi

PVLDB 7(12) 1023-1034 2014 [Refereed]

Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.

Yoichi Iwata,Yuichi Yoshida

30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 20 127-138 2013 [Refereed]

Fast exact shortest-path distance queries on large networks by pruned landmark labeling.

Takuya Akiba,Yoichi Iwata,Yuichi Yoshida

Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, June 22-27, 2013 349-360 2013 [Refereed]

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.

Yosuke Yano,Takuya Akiba,Yoichi Iwata,Yuichi Yoshida

22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013 1601-1606 2013 [Refereed]

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.

Takuya Akiba,Yoichi Iwata,Yuichi Yoshida

22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013 909-918 2013 [Refereed]

A Faster Algorithm for Dominating Set Analyzed by the Potential Method.

Yoichi Iwata

Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers 41-54 2011 [Refereed]