The position is open from 1 June 2019 or as soon as possible thereafter.
The project focuses on computational geometry such as visibility problems
in the plane (e.g. art gallery problems) and discrete geometric
optimization problems in low-dimensional spaces (e.g. clustering problems).
Furthermore, problems in discrete geometry can be considered such as
questions about geometric intersection graphs.
The Algorithms and Complexity Section at DIKU is headed by Professor Mikkel
Thorup. The group is prolific at the topmost conferences like STOC, FOCS,
SODA, and SoCG (we had 10 papers accepted for SODA'18 and Thorup is PC
chair for FOCS'18). Adding to the excitement, we have the center Basic
Algorithms Research Copenhagen (BARC) which also involves the IT-University
of Copenhagen. The aim is to attract top talent from around the world to an
ambitious, creative, collaborative, and fun environment. Using the power of
mathematics, we strive to create fundamental breakthroughs in algorithmic
thinking. While the focus of BARC is algorithms theory, we do have a track
record of surprising algorithmic discoveries leading to major industrial
applications.
Read more about the Department at
http://www.science.ku.dk/english/about-the-faculty/organisation/ and the
center Basic Algorithms Research Copenhagen at https://barc.ku.dk/.
Please find the full job advertisement at
https://jobportal.ku.dk/videnskabelige-stillinger/?show=148331.
**********************************************************
*
* 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
