Jaroslav Nešetřil

Jaroslav " Jarik " Nešetřil ( born March 13, 1946 in Brno ) is a Czech mathematician who deals with combinatorics.

Life and work

Nesetril studied 1964-1969 at the Charles University in Prague (and a semester in Vienna, two semesters of 1969 at McMaster University in Hamilton, Ontario, where he received his master's degree ). In 1975 he received his doctorate in Prague at Ales Pultr (partitions of set systems). In 1988 he qualified as a professor ( Ph.D. ) (partitions of structures). Since 1970 he is a professor in Prague, he has since 1993 in Prague a full professorship. From 1981, he led the group for Operations Research, from 1986 he was Head of the Department of Applied Mathematics at Charles University. Since 1996, he was there, the head of the DIMATIA (Center for Discrete Mathematics, computer science and its applications ). 2000 to 2009 he was director of the Institute for Theoretical computer science at Charles University.

He has been a visiting professor at McMaster University, the University of Waterloo, at the University of Bonn (repeatedly, as a Humboldt Fellow and John von Neumann Professor ), University of Barcelona, ​​the École Normale Supérieure, the University of Chicago, at LAbri in Bordeaux, at the Academia Sinica in Taiwan and the Mittag-Leffler Institute in Stockholm. He was also a consultant at Microsoft Research and at Bell Laboratories.

In 1977, he received the Silver Medal of the Union of Czechoslovak Mathematicians and Physicists. With Vojtech Rödl he received in 1985 the Czech National Award. Since 2006 he has been Chairman of the Czech part of the International Mathematical Union. He holds honorary doctorates from the University of Alaska Fairbanks and the University of Bordeaux. He became a corresponding member of the German Academy of Sciences in Dusseldorf in 1996. In 2004 he was member of the Learned Society of the Czech Republic in Prague. In 2008, he was an Invited Speaker at the European Congress of Mathematicians in Amsterdam (From sparse to nowhere dense structures: Dualities and first order properties ). In 2010 he was invited speaker at the International Congress of Mathematicians in Hyderabad ( Sparse combinatorial structures: classification and applications, with P. Ossona de Mendez ).

Nesetril dealt among other things with coloring problem of graphs, Ramsey theory, algebra, partially ordered sets, Complexity Theory and NP- completeness in computer science. He has published over 300 articles and nine books (until 2009).

His PhD is one of Robin Thomas.

Writings

• Graphs and homomorphisms. Oxford University Press, 2004
• Jiří Matoušek With: Discrete Mathematics - a journey of discovery. Springer 2002 ( English original: Invitation to discrete mathematics Oxford University Press, 1998. )
• With Vojtěch Rödl: Mathematics of Ramsey Theory. Springer 1991 ( Algorithms and Combinatorics, Vol 5)
• Jaroslav Nešetřil, Patrice de Mendez Ossona: sparsity - Graphs, Structures and Algorithms ( Algorithms and Combinatorics, Vol 28). Springer, 2012, ISBN 978-3-642-27874-7.