Jaroslav Nešetřil

From Wikipedia, the free encyclopedia
Jaroslav Nešetřil

Jaroslav Nešetřil
Born (1946-03-13) March 13, 1946
Brno, Czechoslovakia
Residence Prague, Czech Republic
Nationality Czech
Fields Mathematician
Institutions Charles University, Prague
Alma mater Charles University, Prague
Doctoral advisor Aleš Pultr
Doctoral students Svatopluk Poljak, Jan Kratochvíl, Vladimír Puš, Ondřej Zýka, Jana Chlebíková, Robin Thomas, Martin Loebl, Igor Kříž, Martin Klazar, Pavel Valtr, Jiří Otta, Petra Špičková (Smolíková), Jana Maxová, Eva Milková, Robert Šámal, Martin Mareš, Jan Hubička, Diana Piquet, Zdeněk Dvořák, Martin Bálek, Veronika Douchová, Tomáš Valla.
Notable awards Silver medal of Union of Czechoslovak Mathematicians and Physicists (1977), State Prize of Czechoslovakia (jointly with V. Rödl) (1985), Doctor Honoris Causa of the University of Alaska (2002), Doctor Honoris Causa of the University of Bordeaux 1 (2009), Medal of Merit of Czech Republic (2010), Gold medal of Faculty of Mathematics and Physics, Charles University (2011), elected to Academia Europaea (2012), honorary member of the Hungarian Academy of Sciences (since 2013).

Jaroslav Nešetřil (Czech pronunciation: [ˈjaroslaf ˈnɛʃɛtr̝̊ɪl]; born March 13, 1946 in Brno) is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics (structural combinatorics, Ramsey theory), graph theory (coloring problems, sparse structures), algebra (representation of structures, categories, homomorphisms), posets (diagram and dimension problems), computer science (complexity, NP-completeness).

Nešetřil received his Ph.D. from Charles University in 1973.[1] He is responsible for more than 300 publications. He was awarded the state prize (1985 jointly with Vojtěch Rödl) for a collection of papers in Ramsey theory. The book Sparsity - Graphs, Structures, and Algorithms he co-authored with Patrice Ossona de Mendez was included in ACM Computing Reviews list of Notable Books and Articles of 2012.[2]

Nešetřil is a corresponding member of the German Academy of Sciences since 1996 and has been declared Doctor Honoris Causa of the University of Alaska (Fairbanks) in 2002. Since 2006, he is chairman of the Committee of Mathematics of Czech Republic (the Czech partner of IMU). He has also been declared Doctor Honoris Causa of the University of Bordeaux 1 in 2009; the speech he made in French at this occasion attracted a great deal of attention.[3] He received in 2010 the Medal of Merit of Czech Republic[4] and the Gold medal of Faculty of Mathematics and Physics, Charles University in 2011. In 2012, he has been elected to the Academia Europaea.[5] Also, he has been elected honorary member of the Hungarian Academy of Sciences in 2013.[6]

He was an invited speaker of the European Congress of Mathematics, in Amsterdam, 2008,[7] and invited speaker (by both the Logic and Foundations and Combinatorics sections) at the Combinatorics session of the International Congress of Mathematicians, in Hyderabad, 2010.[8]

Jaroslav Nešetřil is Editor in Chief of Computer Science Review[9] and INTEGERS: the Electronic Journal of Combinatorial Number Theory.[10] He is also honorary editor of Electronic Journal of Graph Theory and Applications.[11]

He also belongs to the Editorial Board of Commentationes Mathematicae Universitatis Carolinae,[12] Combinatorica,[13] Journal of Graph Theory,[14] Geocombinatorics, European Journal of Combinatorics,[15] Archivum Mathematicum,[16] and AKCE International Journal of Graphs and Combinatorics.[17] He used to belong to the Editorial Board of Journal of Combinatorial Theory Series B (1980–1986) and Random Structures & Algorithms (1988–2008).

Since 2008, Jaroslav Nešetřil belongs to the Advisory Board of the Academia Sinica.[18]

He has an Erdős number of 1.

Books

  • Hell, Pavol; Nešetřil, Jaroslav (2004). Graphs and Homomorphisms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press. ISBN 0-19-852817-5. 
  • Matoušek, Jiří; Nešetřil, Jaroslav (1998). Invitation to Discrete Mathematics. Oxford University Press. ISBN 0-19-850207-9. 
  • Matoušek, Jiří; Nešetřil, Jaroslav; Mielke, H. (translator) (2002). Diskrete Mathematik: Eine Entdeckungsreise (in german). Springer. ISBN 3-540-42386-9. 
  • Matoušek, Jiří; Nešetřil, Jaroslav (2006). Introduction aux mathématiques discrètes (in french). Springer. ISBN 228720010X. 
  • Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012). Sparsity - Graphs, Structures, and Algorithms (Algorithms and Combinatorics, Vol. 28). Springer. ISBN 978-3-642-27874-7. 
  • Nešetřil, Jaroslav; Rödl, Vojtěch (1991). Mathematics of Ramsey Theory (Algorithms and Combinatorics, Vol. 5). Springer. ISBN 0-387-18191-1. 

References

  1. ↑ Jaroslav Nešetřil at the Mathematics Genealogy Project
  2. ↑ ACM Computing Reviews - Notable Computing Books and Articles of 2012, ACM Computing Reviews website. Accessed June 29, 2013
  3. ↑ "Échos de Talence", Sud Ouest. 2009, September 11th
  4. ↑ List of the recipients of the Medal of Merit, Prague Castle Website. Accessed January 29, 2011
  5. ↑ Jaroslav Nešetřil's page on Academia Europaea, Academia Europaea website. Accessed November 12, 2012
  6. ↑ New members of the Hungarian Academy of Sciences, Website of the Hungarian Academy of Sciences. Accessed May 11, 2013
  7. ↑ Program, ECM 2008. Accessed January 29, 2011
  8. ↑ Invited Speakers for ICM2010, ICM 2010 Website. Accessed January 29, 2011
  9. ↑ Editorial Board, Computer Science Review, Elsevier. Accessed January 29, 2011
  10. ↑ Editorial Board, INTEGERS: the Electronic Journal of Combinatorial Number Theory. Accessed January 29, 2011
  11. ↑ Editorial Team, Electronic Journal of Graph Theory and Applications. Accessed June 14, 2013
  12. ↑ Editorial Board, Commentationes Mathematicae Universitatis Carolinae, Faculty of Mathematics and Physics of Charles University, Prague, Czech Republic. Accessed January 29, 2011
  13. ↑ Editorial Board, Combinatorica, Springer-Verlag. Accessed January 29, 2011
  14. ↑ Editorial Board, Journal of Graph Theory, John Wiley & Sons. Accessed January 29, 2011
  15. ↑ Editorial Board, European Journal of Combinatorics, Elsevier. Accessed January 29, 2011
  16. ↑ Editorial Board, Archivum Mathematicum, Faculty of Science of Masaryk University, Brno, Czech Republic. Accessed January 30, 2011
  17. ↑ Editorial Board, AKCE International Journal of Graphs and Combinatorics, Kalasalingam University, Tamil Nadu, India. Accessed January 29, 2011
  18. ↑ Advisory Board, Academia Sinica. Accessed January 29, 2011

External links

Authority control
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.