Associate professor position in Combinatorial Optimisation

Teaching: Computer Science department – Institut Galilée
Research: AOC team

Website for applying:
https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/cand_recrutement_enseignants_chercheurs.htm

Description

Teaching

Department:
Département informatique – Institut Galilée

Address:
Campus de Villetaneuse – Université Sorbonne Paris Nord

Job description:
The Computer Science department of Institut Galilée contributes in different curricula of the institute: Bachelor, Master, graduate school, Sup’Galilée engineering school. The recruited person will be part of the Computer Science Department. S/he will give lectures in different areas of computer science at all levels and curricula, in particular in the basic courses.

The department seeks lecturers in many domains, more specifically in software engineering, object-oriented programming, machine learning, databases and operating systems. The ability to deliver courses in several of these specific areas will be strongly appreciated. The recruited person is expected to get involved in the department duties through pedagogic responsibilities such as course responsibility, year of studies management, or students’ tutoring.

Website:
https://galilee.univ-paris13.fr/

Contacts:
First and last name : Kais Klai
Position : Président du département
Email: departement.informatique.galilee@univ-paris13.fr

First and last name : Nathalie Pernelle
Position : Vice-Présidente du département
Email: Nathalie.Pernelle@univ-paris13.fr

Research

Research Unit:
Laboratoire d’Informatique de Paris Nord (UMR CNRS 7030)

Description:
The Laboratoire d’Informatique de Paris-Nord (LIPN – CNRS UMR 7030) is strengthening its research in Combinatorial Optimization and Mathematical Programming within the Algorithms and Combinatorial Optimization (AOC) team by recruiting an associate professor.

LIPN’s AOC team addresses a wide variety of issues, ranging from the theoretical to the practical aspects of combinatorial optimization and operations research. It studies combinatorial problems’ structures and designs algorithms based on polyhedral and graph theory, as well as mathematical programming. The AOC team is also interested in the implementation of these algorithms for practical applications, arising in the industry sector. The team has developed not only local collaborations (within the MathSTIC federation), regional collaborations (CERMICS, LIX, CNAM, LAMSADE, LIP6), national collaborations (Bordeaux, Grenoble, Nantes, Nancy), but also international ones (Italy, USA, Mexico, Germany, Canada, Scotland, Spain). It also has numerous industrial connections.

The profile sought may come from any field of combinatorial optimization and operations research related to the research themes of the AOC team. A profile with a background in linear and non-linear optimization, polyhedra or decomposition methods is particularly welcome. Complementary expertise in other themes is also welcome, for example in optimization under uncertainty, problem complexity, learning for optimization, decision theory or graph theory.

Website:
https://lipn.univ-paris13.fr/aoc/

Contacts:
Frédérique Bassino
LIPN Director
frederique.bassino@univ-paris13.fr

Roberto Wolfler Calvo
Leader of the AOC research team
wolfler@univ-paris13.fr