[DMANET] Fully Funded Ph.D. or PostDoc position in structural graph theory at Technical University Berlin — deadline approaching

We invite applications for a research position in the area of structural or algorithmic graph theory at the research group of Prof. Stephan Kreutzer at the Technical University Berlin. Application deadline is 21 October 2017 but late applications or partial applications augmented later may be accepted if they are completed no later than 5 November 2017.


The position is open to a Post Doctoral Researcher or a Ph.D. student. Is is funded through the ERC Consolidator Grant "DISTRUCT - Structure Theory for Directed Graphs", see https://erc.europa.eu/projects-and-results/erc-funded-projects/distruct for project details. The salary grade is according to TV-L 13.


The overall goal of the project is to develop a structure theory for directed graphs and corresponding algorithmic consequences in the spirit of the graph minor project by Robertson and Seymour for undirected graphs. Substantial progress especially on the structural part has been made already and we are looking for a candidate who can get involved in the project, especially developing the algorithmic applications for digraphs with excluded clique minors.


Applicants should therefore have a solid background in theoretical

computer science/discrete mathematics and graph theory, preferably structural and algorithmic graph theory. Knowledge of graphs embedded on a surface, algorithms on bounded genus graph classes especially for disjoint paths are especially useful. Applications also should have a deep interested in structure theory and directed graphs. But we also invite applications for candidates working in related areas such as parameterized graph algorithms etc.


The PI of the project is Prof. Stephan Kreutzer, the head of the Logic and Semantics Research Group at the Computer Science Department of the Technical University Berlin.


The main research focus of the group is algorithmic graph structure

theory and research combining logical techniques and graph theory.

In total the group currently consist of nine full time researchers and will shortly grow to between 10 to 12.



Successful candidates will therefore be embedded into a larger group

working on related topics which provides a lively and active

research environment. In addition, the TU Berlin hosts several other groups in related areas, for instance the group of Prof. Niedermeier working mostly on

parameterized algorithms as well as several related groups in the

mathematics department. Furthermore, the research group actively

participates in the Berlin Mathematical School and the Berlin Graduate

School "Methods for Discrete Structures" which add to the lively

research environment at the TU Berlin.



The successful candidate will receive a salary according to

TV-L 13, the standard rate for research assistants at German

universities. The project has sufficient travel money available

to support conference and workshop attendance as well as research

visits to other groups internationally.



Applications containing at least a cover letter should be submitted by 21 October 2017. The application should be augmented by a cv including a publication list and a research statement. Missing pieces can be submitted later upon request. Late applications will be considered in exceptional circumstances.


Applications should be submitted electronically to

stephan.kreutzer@tu-berlin.de<mailto:stephan.kreutzer@tu-berlin.de>. For further information see http://logic.las.tu-berlin.de/static/IV-347-17_eng_Wdh.pdf or contact


Stephan Kreutzer

Technische Universität Berlin

Ernst-Reuter Platz 7

10587 Berlin

Germany


Tel: +49 30 314 29088

EMail: stephan.kreutzer@tu-berlin.de





**********************************************************
*
* 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/
*
**********************************************************