Hiroki Yanagisawa

Hiroki YanagisawaI am a researcher in IBM Research - Tokyo. My interests are theory of algorithms, operations research, and analytics.
E-mail: yanagis at jp ibm com

• 2006-2007 Kyoto University, Ph.D. in Informatics (go to my page in Kyoto University)
• 2001-2003 Kyoto University, M.S. in Informatics
• 1997-2001 Kyoto University, B.S. in Engineering (Computer Science)

• 2003-(present) IBM Research - Tokyo
• 2001 NTT Musashino R&D Center (summer intern)

• K. Iwama, S. Miyazaki, and H. Yanagisawa, "Improved approximation bounds for the Student-Project Allocation Problem with Preferences over Projects," Journal of Discrete Algorithms, available online, 2012.
• K. Iwama, S. Miyazaki, and H. Yanagisawa, "Improved approximation bounds for the Student-Project Allocation Problem with Preferences over Projects," Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011), LNCS 6648, pp. 440-451, 2011.
• K. Iwama, S. Miyazaki, and H. Yanagisawa, "A 25/17-approximation algorithm for the stable marriage problem with one-sided ties," Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), LNCS 6347, pp. 135-146, 2010. [technical report version]
• H. Yanagisawa, "An offline map matching via integer programming," Proceedings of the 20th International Conference on Pattern Recognition (ICPR 2010), pp. 4206-4209, 2010. [technical report version]
• H. Yanagisawa, "A multi-source label-correcting algorithm for the all-pairs shortest paths problem," IEEE International Symposium on Parallel & Distributed Processing (IPDPS 2010), 2010
• K. Iwama, S. Miyazaki, and H. Yanagisawa, "Approximation algorithms for the sex-equal stable marriage problem," ACM Transactions on Algorithms, Vol. 7, No. 1, Article No. 2, 2010.
• K. Iwama, S. Miyazaki, and H. Yanagisawa, "Approximation algorithms for the sex-equal stable marriage problem," Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007), LNCS 4619, pp. 201-213, 2007.
• M.M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Improved Approximation Results for the Stable Marriage Problem," ACM Transactions on Algorithms, Vol. 3, Issue 3, Article No. 30, 2007.
• H. Yanagisawa, "The Material Allocation Problem in the Steel Industry," IBM Journal of Research and Development, Vol. 51, No. 3/4, pp. 363--374, 2007.
• M.M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Randomized Approximation of the Stable Marriage Problem," Theoretical Computer Science, Vol. 325, No. 3, pp. 439-465, 2004.
• M.M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Improved Approximation of the Stable Marriage Problem," Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), LNCS 2832, pp. 266-277, 2003.
• M.M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Randomized Approximation of the Stable Marriage Problem," Proceedings of the ninth Annual International Computing and Combinatorics Conference (COCOON 2003), LNCS 2697, pp. 339-350, 2003.

See also DBLP: Hiroki Yanagisawa.

• H. Yanagisawa, "Faster Funny Matrix Multiplication for the All-Pairs Shortest Paths Problem," Technical Report RT0932, Tokyo Research Laboratory, IBM Japan, Ltd., 2011.
• H. Yanagisawa, "Fast Shortest Path Computation for Solving the Multicommodity Flow Problem," Technical Report RT0688, Tokyo Research Laboratory, IBM Japan, Ltd., 2006.
• H. Yanagisawa, "A Simple Algorithm for Lattice Point Counting in Rational Polygons," Technical Report RT0622, Tokyo Research Laboratory, IBM Japan, Ltd., 2005.