Two assistant professorships in algorithmic graph theory and logic at TU Darmstadt

The Department of Mathematics at the Technical University of Darmstadt
seeks candidates at the earliest possible date for two

   Professorships for Algorithmic Graph Theory and Logic.

The positions are limited to a period of six years and come without
the option of a tenured professorship. They include an option to fill
one PhD/postdoctoral position (E13 salary grade with no teaching
obligations).

Full text of the call: https://www.career.tu-darmstadt.de/tu-darmstadt/job/56424

=== Your profile ===

We seek two outstanding, independent, early-career applicants in the
fields of structural graph theory, finite model theory, and their
algorithmic aspects. Example research focus areas include, but are not
limited to, the following:
  - graph minors and graphs on surfaces;
  - graph decompositions and width parameters;
  - graph containment relations;
  - coarse graph theory;
  - vertex-minors and structural theory of matroids;
  - structural theory of sparse graphs;
  - graph algorithms, particularly parametrised and approximation algorithms;
  - discrete optimisation;
  - discrete geometry and the theory of VC dimension;
  - descriptive complexity theory;
  - algorithmic and structural aspects of finite model theory.

=== About the Department of Mathematics ===

The Department of Mathematics at TU Darmstadt has eight research
groups covering many areas of mathematics. We are well-connected to
other research groups both nationally and internationally. Locally, we
have various cooperations with other universities in the Rhine-Main
area and offer a wide range of lectures for our students with our
Bachelor’s and Master’s degree programs.

The successful candidates will join the vibrant environment at the
Department of Mathematics as members of a newly constructed group led
by the Alexander-von-Humboldt-Professor Michał Pilipczuk. The planned
composition of the group consists of 10–14 active researchers working
at the forefront of knowledge in the topics described in the profile.
The group is provided access to several sources of ample funding,
including from the European Research Council, the Alexander von
Humboldt Foundation, and the state of Hessen.

Further collaboration opportunities at the Department of Mathematics
of TU Darmstadt include:
 - Yann Disser (combinatorial optimization),
 - Kord Eickmeyer (structural graph theory and finite model theory),
 - Meike Hatzel (structural graph theory, particularly for directed graphs),
 - Pascal Schweitzer (symmetries in discrete structures).

**********************************************************
*
*   Contributions to be spread via DMANET are submitted to
*
*                   [email protected]
*
*   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/
*
**********************************************************