group
at the Czech Technical University in Prague (CTU), Czech Republic with
preferred starting date September 2020 (negotiable, with possible
extension
for at least one more year). The research interests of the group range
from
graph algorithms, through classical and parameterized complexity and
integer
linear programming to combinatorial games. The research group Graphs,
Games,
Optimization, Algorithms and Theoretical Computer Science (G²OAT) 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 G²OAT group is rather small, comprising 3 assistant
professors and 3 Ph.D. students (two more Ph.D. students joining in
September),
however, the current team members regularly publish at renowned
conferences
and journals. 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 position is supported by the OP VVV MEYS funded project
CZ.02.1.01/0.0/0.0/16_019/0000765 "Research Center for Informatics" (a
recently
awarded EU-funded center of excellence run by internationally renowned
professors with worldwide impact) and offers a generous travel budget.
The G²OAT group is a part of a work-package of RCI focused on
Theoretical
Computer Science. Successful candidates will get a monthly salary in the
range
of 2-3 thousand EUR (the Czech Republic cost of living is at 59% of the
US
price level by OECD statistics). There are no teaching duties associated
with
this position.
We are seeking highly motivated individuals holding a PhD in computer
science,
discrete mathematics, or related areas from a reputed institution. The
ideal
candidate is familiar with several of the following areas: Parameterized
complexity, integer linear programming, structural graph theory, game
theory,
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 proceedings
of
highly ranked international conferences and/or journals.
The successful candidate must:
* be a researcher who has received a PhD or its equivalent within the
last 7
years,
* have a strong publication record, and
* be fluent in English (both written and spoken), prior knowledge of
Czech
is not required.
Please submit your CV and a motivation letter to
ondrej.suchy@fit.cvut.cz.
Furthermore, a letter of recommendation should be sent by the
recommender also
directly to ondrej.suchy@fit.cvut.cz.
Candidates interested in applying are encouraged to make informal
inquiries.
Applications received by May 17 will receive full consideration.
**********************************************************
*
* 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
