International Journals 
(Title - Authors - Journal - volume/number - pages)

Matching with partially ordered contracts(Farooq R, Fleiner T Fleiner, Akihisa Tamura) Japan Jornal of Industrial and Applied Mathematics, 29, 401-417.

On the approximability and hardness of minimum topic connected overlay and its special instances(Jun osoda,Jurj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinova, Koichi Wada) Theoretical Computer Science, 429, 144-154.

Reconfiguration of List L(2,1)-Labelings in a Graph (Takehiro Ito, Kazuo Kawamura, Hirotaka Ono, Xiao Zhou) Computational Geometry: Theory and Applications, 45, 284-293.

Querying two boundary points for shortest paths in a polygonal domain (Sang Won Bae and Yoshio Okamoto) Computational Geometry: Theory and Applications, 45, 284-293.

Vertex angle and crossing angle resolution of leveled tree drawings (W.Didimo, M. Kaufmann, G.Liotta, Y.Okamoto, and A. Spillner) Information Processing Letters, 112, 630-635.

Minimum and maximum against k lies (M.Hoffmann, J.Matousek, Y.Okamoto, and P.Zumstein) Chicago Journal of Theoretical Computer Science, 2012, 1-10.

Reverse preferential spread in complex networks (Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi, and Yoshio Okamoto) Physical Review E, 86, ?.

On bipartite powers of bigraphs (Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara) Discrete Mathematics & Theoretical Computer Science, 14, 11-20.

The complexity of the stamp folding problem (Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, and Yoshio Okamoto ) Theoretical Computer Science, (to be appeared)

Approximating the path-distance-width for AT-free graphs and graphs in related classes (Y.Otachi,T.Saitoh, K.Yamanaka,S.Kijima,Y.Okamoto, H.Ono, Y.Uno, and K.Yamazaki) Discrete Applied Mathematics, (to be appeared)

Efficient enumeration of the directed binary perfect phylogenies from incomplete data (Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh) Lecture Notes in Computer Science, 7276, 248-259.

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (T.Ito, S.Nakano,Y.Okamoto, Y.Otachi, R.Uehara, T.Uno, and Y.Uno) Lecture Notes in Computer Science, 7357, 24-35.

On problems as hard as CNF-SAT (M.Cygan, H.Dell, D.Lokshtanov, D.Marx, J.Nederlof, Y.Okamoto, R.Paturi, S.Saurabh, and M.Wahlström (Proceedings of 27th IEEE Conference on Computational Complexity (CCC 2012)) 74-78.

A 4.31-approximation for the geometric unique coverage problem on unit disks (T.Ito, S.Nakano, Y.Okamoto, Y.Otachi, R. Uehara, T.Uno,and Y.Uno) Lecture Notes in Computer Science, 7676, 372-381.

Universal point subsets for planar graphs (P.Angelini, C.Binucci, W.Evans, F.Hurtado, G.Liotta Tamara Mchedlidze, H.Meijer, and Y.Okamoto) Lecture Notes in Computer Science, 7676, 423-432.

Area bounds of rectilinear polygons realized by angle sequences (Sang Won Bae, Yoshio Okamoto, and Chan-Su Shin) Lecture Notes in Computer Science,7676, 629-638.

Axiomatizations of second price auctions with a reserve price (Toyotaka Sakai) International Journal of Economic Theory, (to be appeared)

A Coalition Formation Value for Games in Partition Function Form (Grabisch, M. and Yukihiko Funaki) European Journal of Operational Research, 221(1), 175-185.

Reconcidering Marginalism with Egalitarianism: Consistency, Monotonicity, and Implementation of Egalitarian Shapley Values (R. van den Brink, Yukihiko Funaki, and Y. Ju) 40(3), 693-714.

Characterization of the Reverse Talmud bankruptcy rule by Exemption and Exclusion properties (R. van den Brink, Yukihiko Funaki, and Gerard van der Laan) European Journal of Operational Research, 228(2), 413-417.

International Conference

Generalized Partition Mechanism: Framework for Combining Multiple Stratedy-Mechanisms (Yuko Sakurai and Makoto Yokoo) IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-2012),  2012.12.7, Macao．

A Differential Game Theoretic Model for Real-Time Spectrum Princing in Cognitive Radio Networks (Don Hao, Atsushi Iwasaki and Makoto Yokoo) 37th Annual IEEE Conference on Local Computer Networks(LCN-2012) Florida．

False-name-proofness in Online Mechanisms (Taiki Todo, Takayuki Mouri,  Atsushi Iwasaki, and Makoto Yokoo) The eleventh International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2012) Valencia．

Handling Negative Value Rules in MC-net-based Coalition Structure Generation (Suguru Ueda,Takato Hasegawa, Naoyuki Hashimoto,Naoki Ohta, Atsushi Iwasaki and Makoto Yokoo) The eleventh International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2012) Valencia．

Automated Equilibrium Analysis of Repeated Games with Private Monitoring: A POMDP Approach (Yongjoon Joe, Atsushi Iwasaki, Michihiro Kandori, Ichiro Obara, and Makoto Yokoo) The eleventh International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2012) Valencia．

Strategy-proof Mechanisms for two-sided Matching with Minimum and Maximum Quotas (Suguru Ueda, Daniel Fragiadakis, AtsushiIwasaki, Peter Troyan, and Makoto Yokoo) The eleventh International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2012) Valencia．

Matching with  partially ordered contracts (R.Farooq,T.Fleiner,Akihisa Tamura) The Second International Workshop on Matching Under Preferences(MATCH-UP 2012) Budapest.

Improved Approximation for Geometric Unique Coverage Problems (Yoshio Okamoto) Dagstuhl Seminar "Computational Geometry", Schloss Dagstuhl（Germany）

Improved Approximation for Geometric Unique Coverage Problems (Yoshio Okamoto) ETH Zurich（Switzerland）

Two (open) problems: simple, fun, and hopefully solvable (Yoshio Okamoto) Fields Workshop on Discrete and Computational Geometry（Invited Talk）, Carleton University（Canada）

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit (T.Ito, S.Nakano, Y.Okamoto, Y.Otachi,R. Uehara, T.Uno and Y.Uno) 23rd International Symposium on Algorithms and Computation (ISAAC 2012),  National Taiwan University.

Universal Point Subsets for Planar Graphs (P.Angelini, C.Binucci, W.Evans, F.Hurtado, G.Liotta, T.Mchedlidze, H.Meijer and Y.Okamoto) 23rd International Symposium on Algorithms and Computation (ISAAC 2012),  National Taiwan University.

Area Bounds of Rectilinear Polygons Realized by Angle Sequences (Sang Won Bae, Yoshio Okamoto and Chan-Su Shin) 23rd International Symposium on Algorithms and Computation (ISAAC 2012),  National Taiwan University.

On problems as hard as CNF-SAT (M.Cygan, H.Dell, D.Lokshtanov, D.Marx, J.Nederlof, Y.Okamoto, R.Paturi, S.Saurabh,and M.Wahlström) 27th IEEE Conference on Computational Complexity (CCC 2012), Universidade do Porto（Portuguese）

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data (Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh) LaBRI（France）

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (T.Ito, S.Nakano, Y.Okamoto, Y.Otachi, R.Uehara, T.Uno and Y.Uno) 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012) University of Helsinki （Finland）

Collusion under Payoff Fluctuations (Yosuke Yasuda)  Fourth World Congress of the Game Theory Society(GAMES2012), Bilgi University（Istanbul）

Understanding Stable Matchings: A Non-Cooperative Approach (Yosuke Yasuda) SAET Conference, University of Queensland (Brisbane)

Contagion and Uninvadability in Social Networks with Bilingual Option (joint with S. Takahashi)  (Daisuke Oyama)  Fourth World Congress of the Game Theory Society(GAMES2012), Istanbul Bilgi University, (Istanbul)

Books

「Complexity and Institutions: Markets, Norms and Corporations」　(Masahiko Aoki, Kenneth Binmore, Simon Deakin, Herbert Gintis, Michihiro Kandori) Palgrave Macmillan.