Awards

Benjamin Rossman (A02) received Best Paper Award.

Computational Complexity Conference 2015, Best Paper Award

– For his paper “Correlation bounds against monotone NC_1.”

A. Kawamura received LA/EATCS Best Presentation Award.

European Association for Theoretical Computer Science (EATCS) Japan Chapter, LA/EATCS Best Presentation Award
– Akitoshi Kawamura (A02)
– For his presentation “Weight Balancing on Boundaries and Skeletons.”

Francois Le Gall received Distinguished Paper Award.

The 39th International Symposium on Symbolic and Algebraic Computation (ISSAC2014) Distinguished Paper Award
– Francois Le Gall (C02)
– For his paper “Powers of Tensors and Fast Matrix Multiplication.”

A. Kawachi et al. received Yadex Best Paper Award.

The 9th International Computer Science Symposium in Russia (CSR2014), Yadex Best Paper Award
– Akinori Kawachi (C02), Benjamin Rossman (A01), Osamu Watanabe (C01)
– For their paper “The Query Complexity of Witness Finding.”

A. Kawamura received FFIT Young Researcher Award

Funai Foundation for Information Technology, the 13th FFIT Young Researcher Award
– Akitoshi Kawamura (A02)

T. Uno et al. received Best Performance Award.

Joint Association Study Group of Management Science, Data Analysis Competition, Scan Panel Section, Best Performance Award
– Takanobu Nakahara, Takeaki Uno (B03), Satoshi Kitajima, Yukinobu Hamuro

T. Akiba et al. received DEIM Bast Paper Award.

The 6th Forum on Data Engineering and Information Management, Best Paper Award
– Takuya Akiba, Yoichi Yoshida, Yuichi Yoshida (A02)

N. Ohsaka et al. received DEIM Excellent Paper Award.

The 6th Forum on Data Engineering and Information Management, Excellent Paper Award
– Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida (A02), Ken-ichi Kawarabayashi (A02)

Y. Yoshida received Inoue Research Award for Young Scientists.

Inoue Foundation for Science, Inoue Research Award for Young Scientists 2013
– Yuichi Yoshida (A02)
– For his research “Studies on Constant-Time Algorithms for Bounded-Degree Graphs and Constraint Satisfaction Problems.”

T. Ito received RIEC Tohoku University Researcher Award.

Research Institute of Electrical Communication Tohoku University, RIEC Tohoku University Researcher Award 
– Takehiro Ito (B03)

N. Katoh received JSST Outstanding Presentation Award.

International Conference on Simulation Technology (JSST 2013), Outstanding Presentation Award
– Naoki Katoh (B01)
– For his presentation “An Emergency Evacuation Planning Model Based on the Universally Quickest Flow”

Y. Okamoto received IIAI AAI Best Paper Award.

IIAI International Conference Advanced Applied Information(IIAI AAI2013), The Best Paper Award
– Yoshio Okamoto (B01)
– For his paper “Hardness of Learning Unordered Tree Contraction Patterns.”

Y. Yoshida received FFIT Young Researcher Award.

Funai Foundation for Information Technology, the 12th FFIT Young Researcher Award
– Yuichi Yoshida (A02))

K. Kawarabayashi received Japan Academy Medal.

The Japan Academy, Japan Academy Medal
– Ken-ichi Kawarabayashi (A02)
– For his research “Application of Advanced Graph Theory to Discrete Mathematics and Theoretical Computer Science.”

K. Kawarabayashi received SODA Best Paper Award.

ACM-SIAM Symposium on Discrete Algorithms Technology(SODA13), Best Paper Award
– Ken-ichi Kawarabayashi (A02)
– For his paper “A Simple Algorithm for the Graph Minor Decomposition – Logic meets Structural Graph Theory.”

K. Kawarabayashi received JSPS Prize.

Japan Society for the Promotion of Science, JSPS Prize
– Ken-ichi Kawarabayashi (A02)
– For his research “Application of Advanced Graph Theory to Discrete Mathematics and Theoretical Computer Science.”

T. Tokuyama became a fellow of IEICE.

The Institute of Electronics, Information and Communication Engineers, Fellow (Information and Systems Society)
– Takeshi Tokuyama (B03)
– For his research “Innovation of Algorithm Theory by Exploring Geometric Structures.”

Y. Okamoto received OR Research Encourage Award.

The Operations Research Society of Japan, Research Encourage Award
– Yoshio Okamoto (B01)
– For his research “The Geodesic Diameter of Polygonal Domains,” “A Polynomial-time-delay Polynomial-space Algorithm for Enumeration Problems in Multi-criteria Optimization” and “Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.”

Y. Kobayashi received OR Research Encourage Award.

The Operations Research Society of Japan, Research Encourage Award
– Yusuke Kobayashi (A01)
– For his papers “On Shortest Disjoint Paths in Planar Graphs,” “An Improved Algorithm for the Half-disjoint Paths Problem ” and “Breaking O(n1/2)-approximation Algorithms for the Edge-disjoint Paths Problem with Congestion Two.”

To the page top