12 Sep 2023
University of Warsaw: Faculty of Mathematics, Informatics and Mechanics
- Research Field
Computer science » Other
- Researcher Profile
Recognised Researcher (R2)
- Application Deadline
13 Oct 2023 - 23:59 (Europe/Warsaw)
- Type of Contract
- Job Status
- Hours Per Week
- Offer Starting Date
1 Nov 2023
- Is the job funded through the EU Research Framework Programme?
H2020 / ERC
- Reference Number
- Is the Job related to staff position within a Research Infrastructure?
1 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
The ERC project „BOBR: Decomposition methods for discrete problems”, led by dr hab. Michał
Pilipczuk, is offering one postdoctoral position in the Institute of Informatics at the Faculty of
Mathematics, Informatics and Mechanics of the University of Warsaw.
Terms of employment
Selected candidate will be employed as full-time researcher (pol. adiunkt). The duration of
employment is for one year, with possible extension for another 12 months. The starting date can be
set between 1st of November 2023 and 1st of March 2024, up to an agreement between the candidate
and the principal investigator. The offered salary combined (basic salary approx. 7 500 PLN
gross/month plus project bonus) is around 10 000 PLN per month pre-tax (around 2 225 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 problems in the intersection of the
fields of structural graph theory, algorithm design and logic in computer science.
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 will 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 will also try to build a theory of wellstructured
dense graphs, based on advances in the theory of sparse graphs and inspired by the
theory of stability.
Dynamic parameterized data structures. We will use the idea of parameterization to perform a
systematic exploration of data structures for dynamic parameterized problems in graphs.
Algorithms in planar graphs. We will design 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 will 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.
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;
automata and logic.
Research experience in any of the following areas will be an advantage:
approximation schemes in planar graphs;
algorithms on graph classes;
dynamic data structures;
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).
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
No research statements are required.
On the day of submitting the application, the candidate does not have to hold a PhD degree.
Applications, as well as further questions on both the scientific topic of the project and formal details
of the call procedure should be directed to dr hab. Michał Pilipczuk:
In order to apply for the position, candidates should send an e-mail and submit the documents as
attached .pdf files.
Application deadline: 13 October 2023
Applications which do not satisfy the above requirements or are submitted after the deadline will not
be considered for the position.
The applications will be evaluated by a selection committee appointed by the Dean of the Faculty of
Mathematics, Informatics and Mechanics, University of Warsaw. The committee may invite candidate
to a meeting, which will be conducted remotely. The results of the competition will be sent to
candidates electronically on 23 October 2023 at the latest. The competition is the first stage of the
recruitment process as described in the Statute of the University of Warsaw, the recommendation by
the selection committee being a basis for its subsequent stages.
- Research Field
- Computer science » Other
- Education Level
- PhD or equivalent
Internal Application form(s) needed
(140.56 KB - PDF)
- Number of offers available
- Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw
Where to apply
Krakowskie Przedmieście 26/28
- Postal Code
Research Fellow I, Singapore University of Technology & Design, Singapore, about 11 hours ago
Job Scope: Contribute to the design and implementation of natural language processing algorithms that can perform fundamental research in the field of natural language processing, which can lead t...
Research Assistant, Singapore University of Technology & Design, Singapore, about 11 hours ago
Job Scope: The job scope includes the design and implementation of natural language processing algorithms that can perform fundamental research in the field of natural language processing, which c...
Postdoctoral Researcher For Quantum Algorithms, Forschungszentrum Jülich, Germany, about 17 hours ago
Your Job: You will work in an interdisciplinary project team on application focused quantum algorithms. This includes: the extension, development and analysis of new quantum algorithms for near-te...
Research Fellow (Learning Based Control), NATIONAL UNIVERSITY OF SINGAPORE, United Kingdom, 5 days ago
Job Description Research Fellow position is open in the research group of Assistant Professor Zhao Lin, at the Department of Electrical and Computer Engineering, National University of Singapore (...
Research Associate / Assistant, NATIONAL UNIVERSITY OF SINGAPORE, United Kingdom, 3 days ago
Job Description Research Associate/Assistant in Infectious Disease Modelling and Machine Learning for Public Health Location: Singapore Salary: Commensurate with experience The National University...
Research Fellow (Infectious Disease Modelling And Machine Learning For Public Health), NATIONAL UNIVERSITY OF SINGAPORE, United Kingdom, 5 days ago
Job Description Research Fellow in Infectious Disease Modelling and Machine Learning for Public Health The National University of Singapore's Saw Swee School of Public Health (NUS) seeks a dedicat...