The 2010 Laureates / Basic Sciences / Mathematical Sciences (including Pure Mathematics)
image

László Lovász

Hungary, U.S.A. / March 9, 1948
Mathematician
Professor, Eötvös Loránd University

"Outstanding Contributions to Mathematical Sciences Based on Discrete Optimization Algorithms"
Through his advanced research on discrete structures, Dr. Lovász has provided a link among various branches of mathematics in terms of algorithms, thereby influencing a broad spectrum of the mathematical sciences - including discrete mathematics, combinational optimization and theoretical computer science. In so doing, Dr. Lovász has made outstanding contributions to the advancement of both the academic and technological possibilities of the mathematical sciences.

Workshop

Download(PDF): Workshop Program and Abstract

Symposium
"Mathematical Development of Algorithm Science"

DATE: Friday, November 12, 2010

PLACE: Kyoto International Conference Center

Coordinator and Moderator
Kazuo Murota [Member, Kyoto Prize Selection Committee; Professor, Graduate School of Information Science and Technology, The University of Tokyo]

13:00
Opening Address
Heisuke Hironaka [Chairman, Kyoto Prize Committee; Professor Emeritus, Kyoto University]
 
Introduction of Laureate
Hiroshi Imai [Member, Kyoto Prize Selection Committee; Professor, Graduate School of Information Science and Technology, The University of Tokyo]
 
Laureate Lecture
László Lovász (Laureate in Basic Sciences)
“The Mathematical Challenge of Very Large Networks”
 
Lecture
Takeshi Tokuyama [Professor, Graduate School of Information Sciences, Tohoku University]
“Combinatorial Geometry: Mathematics for Geometric Data Processing”
 
Lecture
Osamu Watanabe [Professor, Graduate School of Information Science and Technology, Tokyo Institute of Technology]
“CompView and the Lovász Local Lemma”
 
Lecture
Satoru Iwata [Professor, Research Institute for Mathematical Sciences, Kyoto University]
“Convexity in Combinatorial Optimization”
 
Lecture
Ken-ichi Kawarabayashi [Professor, National Institute of Informatics]
“Structure Theorems and Decomposition Theorems in Graph Theory”
17:20
Closing
 
 
Organized by Inamori Foundation
 
Supported by Kyoto Prefectural Government, Kyoto City Government, and NHK
 
With the cooperation of Information Processing Society of Japan, The Institute of Electronics, Information and Communication Engineers, The Japan Society for Industrial and Applied Mathematics, The Mathematical Society of Japan, The Operations Research Society of Japan