by Daniel Kral at Charles University, Prague, are announced. Successful
candidates should have strong background in graph theory, preferrably
in the area of extremal or algorithmic graph theory, the two main areas
of the grant. The postdocs will join a team formed by Zdenek Dvorak,
Daniel Kral, Ondrej Pangrac, Robert Samal and their students as well as
they will have opportunity to collaborate with many faculty members
of Charles University working in the area of discrete mathematics.
Informal inquiries should be addressed to Daniel Kral, kral@kam.mff.cuni.cz, and
formal applications, which include CV with a list of publications and a list of
academic references, should be sent to the secretary of DIMATIA center,
Mrs. Hana Polisenska, poli@kam.mff.cuni.cz . Dates of appointments are flexible.
We also offer a number of scholarships for visiting students, preferrably
for the duration between 3 and 10 monhts.
In addition, with support of the ERC Starting grant CSP-Complexity of
Manuel Bodirsky at LIX Ecole Polytechnique in Paris, we offer one joint
postdoc position. A successful candidate should have a strong background
in logic or algorithmic graph theory and be willing to extend his/her
expertise in the other field. A position is intended as a one-year position
at Charles University in Prague and a one-year position at LIX Ecole
Polytechnique in Paris. Informal inquiries for more details are welcome
by e-mail.
Dan Kral
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
