the G2OAT research group at the Czech Technical University in Prague (CTU),
Czech Republic with a preferred starting date of July 2023 (slightly
negotiable). The research interests of the group range from graph algorithms,
through classical and parameterized complexity and integer linear programming
to combinatorial games.
The prospective mentors for the position is Tomáš Valla and Dušan Knop. The
main topic for the project is in the algorithmic and combinatorial game theory,
with extension to related fields like approximation algorithms or parameterized
complexity.
The research group Graphs, Games, Optimization, Algorithms, and Theoretical
Computer Science (G2OAT) https://ggoat.fit.cvut.cz/index.html is a part
of the Department of Theoretical Computer Science at the Faculty of
Information Technology at CTU. The department also includes Stringology
and Arborology research groups. The G2OAT research group is rather
small, comprising 2 associate professors, 4 assistant professors,
2 postdocs, and 3 Ph.D. students. A successful candidate will work at CTU's
main campus which features a range of amenities such as the National Technical
Library, and a laid-back atmosphere with cafes and other social hangout places.
The successful candidate will get a monthly salary of 65 thousand CZK (about
2750 EUR) (the Czech Republic's cost of living is at 66% of the US price level
according to the OECD statistics). There are no teaching duties associated with this
position. The position is institutionally funded, i.e., funded by the Czech
Technical University in Prague.
We are seeking highly motivated individuals holding a Ph.D. in computer
science, discrete mathematics, or related areas.
The applicants are expected to have a strong background in combinatorics, graph
theory, foundations of algorithmic game theory or combinatorial game theory.
Additionally, specialization in the following areas is a bonus: graph
algorithms, cops-and-robber-type problems, computational complexity or
approximation algorithms, Ramsey theory and positional games. The candidate's
high scientific potential should be witnessed by publications in the area of
algorithms or discrete math in impacted journals and in proceedings of highly
ranked international conferences.
The successful candidate must:
* Be a researcher who has received a Ph.D. or its equivalent within the last 7 years
* have a strong publication record (with at least 3 publications in a journal
with IF), and
* be fluent in English (both written and spoken), prior knowledge of Czech is
not required.
The closing date is June 15, 2023.
The preliminary communication and informal inquiries should be sent to tomas.valla@fit.cvut.cz.
The final submission should be done according to the instructions at
https://international.cvut.cz/jobs-at-ctu/postdoc/
(here look at the PDF document page #51) and then submitted via
the email address research@fit.cvut.cz.
However, it is strongly recommended that the applicant sends at least the CV
and motivation letter in advance before the deadline to the address tomas.valla@fit.cvut.cz,
where the interested candidate is also encouraged to make informal inquiries.
**********************************************************
*
* 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
