G2OAT research group at the Czech Technical University in Prague
(CTU), The Czech Republic with a preferred starting date of October
2022 (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 mentor for
the position is DuĊĦan Knop. The main topic for the project is in the
intersection of parameterized complexity and computational social
choice.
The research group Graphs, Games, Optimization, Algorithms, and
Theoretical Computer Science (G2OAT) 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, 2 assistant professors, 2 postdocs, and 4
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 2500 EUR) (the Czech Republic's cost of living is at 68% of the
US price level to the OECD statistics). There are no teaching duties
associated with this position. These positions are 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 ideal
candidate is familiar with several of the following areas:
Parameterized complexity, integer linear programming, structural graph
theory, game
theory, and computational social choice. Experience in optimization
and in particular approximation algorithms or hardness of
approximation is appreciated but not required. 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 or is close to receiving one,
* have a strong publication record (with at least two 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, 2022.
The candidate should send a CV and a recommendation letter, which can
be either attached to the application or sent directly by the
recommender to dusan.knop@fit.cvut.cz.
Interested candidates are encouraged to make informal inquiries to the
above address.
.
**********************************************************
*
* 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
