 | | |
| |
| | HIRATA TomioLast updated: 11/01/27 00:00 | Name | HIRATA Tomio |
|---|
Affiliation | Nagoya University |
|---|
Section | Graduate School of Information Science, Granduate School of Information Science Computer Science and Mathematical nformatics |
|---|
Job title | Professor |
|---|
|
Academic Background - 1981 Graduate School, Division of Engineering, Tohoku University - 1976 Faculty of Engineering, Tohoku University Prizes 2009 Best Paper Award for Scheduling Practice 2007 LION 2007 Best Paper Award Misc A note on the greedy algorithm for finding independent sets of C_k-free graphs Information Processing Letters 109 485-489 2009 Approximation algorithms for the weighted independent set problem in sparse graphs Discrete Applied Mathematics 157(4) 617-626 2009 An efficient algorithm for the nearly equitable edge coloring problem Journal of Graph Algorithms and Applications 12(4) 383-399 2008 Analysis of an edge coloring algorithm using Chernoff bounds Information Technology Letters 6 13-16 2007 A systolic algorithm for Euclidean distance transform Trans. of IEEE on Pattern Analysis and Machine Intelligence 28(7) 1127-1134 2006 Bibliography Algorithm Design KYORITSU SHUPPAN 2008 |
Combinatorial Optimization
by B. Korte and V. Vygen 2005 |
Algorithms and Data Structures 1990 |
Works Approximation algorithms for graph problems 2009 - 2011 Research Projects (Competitive Research Funds) Study on Approximation Algorithms Study on Computational Geometry Study on graph algorithms Project Year: 2009 - 2011 |
|
|
|
| |
