Postdoctoral position in the scientific project “BOBR: Decomposition methods for discrete problems” financed by the European Commission (grant agreement no 948057) Principal Investigator: Michał Pilipczuk
Offer DescriptionPostdoctoral position in the scientific project “BOBR: Decomposition methods for discrete problems” financed by the European Commission (grant agreement no 948057)Principal Investigator: Michał PilipczukThe ERC project „BOBR: Decomposition methods for discrete problems”, led by dr hab. Michał Pilipczuk, is offering a postdoctoral position in the Institute of Informatics at the Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw.Terms of employment
The selected candidate will be employed as a full-time researcher (pol. adiunkt). The duration of employment is for up to 15 months. Up to an individual agreement between the candidate and the principal investigator, the starting date can be set between January 1st, 2025, and May 1st, 2025, while the ending date should be no later than March 31st, 2026. The offered salary combined (basic salary approx. 9 500 PLN gross/month plus project bonus) is around 12 000 PLN per month pre-tax (around 2 780 EUR), which is more than enough for a comfortable life in Warsaw. The position comes with no teaching obligations and travel budget. Selected candidate will work on one or more research directions studied within the project, described below.Description of the project
Project BOBR focuses on studying graph decompositions and their applications in designing efficient algorithms, in particular for graph problems and problems originating from finite model theory. The work within the project will concentrate on the following four directions: ● Beyond Sparsity. We study the abstract notions of sparsity in graphs (bounded expansion and nowhere denseness) in order to understand the structure implied by these notions and to use this structure for designing efficient algorithms. We also try to build a theory of well-structured dense graphs, based on advances in the theory of sparse graphs and inspired by notions borrowed from model theory. ● Dynamic parameterized data structures. We expand the theory of parameterized complexity by designing data structures for dynamic parameterized problems in graphs. ● Algorithms in planar graphs. Wedesign new parameterized and approximation algorithms for problems in planar graphs, while focusing on combining techniques from both these areas. ● Algorithms in hereditary classes of graphs: We study structural properties in classes of graphs defined by forbidding induced subgraphs, in order to design efficient parameterized, approximation, and exact algorithms working on graphs from such classes.Requirements
We expect that candidate at the moment of employment holds a PhD degree in either mathematics or computer science and has an excellent background in both of these disciplines, in particular in one or more of the following fields:
● structural graph theory;
● algorithm design;
● automata and logic.
Research experience in any of the following areas will be an advantage:
● parameterized algorithms;
● approximation schemes in planar graphs;
● algorithms on graph classes;
● dynamic data structures;
● model-checking algorithms;
● graph minors theory;
● model theory, in particular finite model theory or stability theory;
● structural theory of sparse graphs (notions of bounded expansion and nowhere denseness);
● decompositions of graphs, in particular treewidth and cliquewidth.
The competition may be entered by candidates who meet the conditions set out in art. 113 of the Law on Higher Education and Science of July 20, 2018 (Journal of Laws of 2023, item 742, as amended).Applications
An application should include Curriculum Vitae that:
● presents an overview of the background and scientific achievements of the candidate;
● lists all the candidate’s research works (including not yet published manuscripts);
● gives a list of three experienced researchers that may serve as references for the candidate.
In addition, there should be a signed cover letter addressed to the Dean of the Faculty of Mathematics, Informatics and Mechanics, University of Warsaw together with the personal data clause (attached).
No research statements are required.
On the day of submitting the application, the candidate does not have to hold a PhD degree.
12000 per month
Warszawa, mazowieckie
Sat, 09 Nov 2024 08:50:56 GMT
To help us track our recruitment effort, please indicate in your email/cover letter where (vacanciesineu.com) you saw this job posting.
Job title: Project Contract Manager Senior (phase exécution) Company: Aptitude Experts Job description Ce site…
Location: Enfield (N21) - North London, London, United Kingdom Salary: Up to £41000 per annum…
Job title: Scrum Master Company: Novo Nordisk Job description Are you an experienced Scrum Master…
Job title: Research Analyst: Energy and Environment Policy Company: Rand Europe Job description RAND is…
Job title: CONTABILE FULL TIME A TEMPO INDETERMINATO - STUDIO COMMERCIALISTA CERNUSCO SUL NAVIGLIO (MI)…
Job title: Consultant | Cybersecurity | Forensic & Litigation Consulting Company: FTI Consulting Job description…