JOBS: Positions Available and People Looking

POSITIONS AVAILABLE: Please put your contact details here if you have a position available.


Postdoc and PhD positions in TCS and/or combinatorial optimization (deadline June 29, 2022)

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc and PhD positions in theoretical computer science and/or combinatorial optimization.

We are looking for outstanding candidates with an innovative mind-set and intellectual curiosity to strengthen and complement the research profile of the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge.

The application deadline is June 29, 2022. Please see http://www.jakobnordstrom.se/openings/Postdoc-UCPH-220629.html and http://www.jakobnordstrom.se/openings/PhD-UCPH-220629.html, respectively, for the full announcements with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to kd.uk.id|nj#kd.uk.id|nj.


deadline is 25 May 2022. A postdoc in computational social choice in my group at the ILLC in Amsterdam. The job would suit a wide variety of different people. Full details here:

https://vacatures.uva.nl/UvA/job/Postdoc-COMSOC/745372502/

Contact me: Ulle Endriss
ILLC, University of Amsterdam
http://www.illc.uva.nl/~ulle/


In order to be considered, applications must be received by June 1,
2022 (Wednesday). The University of Warwick invites applications for a Professor in the
area of Discrete Mathematics, in Algorithms and Complexity, in
Theoretical Computer Science,
or in relevant areas on the interface of
Computer Science and Mathematics.

This is a permanent position based in two world leading departments,
the Department of Computer Science and the Warwick Mathematics
Institute, and the position is thought to enhance the collaboration
between these two departments, and to contribute to and lead the
activities in the DIMAP center. The successful applicant is expected
to teach courses in computer science or mathematics, conduct research
in her/his field of expertise and actively participate in other
Computer Science and Mathematics Departments, DIMAP, and university
activities. Relevant areas of interest include, but are not limited
to, discrete mathematics, combinatorics, graph theory, theoretical
computer science, design and analysis of algorithms and data
structures, computational complexity.


Two lecturer positions in Theoretical Computer Science at the University of Auckland, New Zealand

The School of Computer Science at the University of Auckland invites excellent early-career researchers to apply for one of two lecturer positions in Theoretical Computer Science (broadly interpreted). A lecturer position in New Zealand is roughly equivalent to an assistant professor position in the US, and a successful candidate is expected to do research and teaching.

For more information, please see: https://smrtr.io/8sZv8


PhD studentship on Algorithmic Graph Theory at Newcastle University, UK

Application deadline: 30th March 2022 6th April 2022
Start Date: September 2022
Award Duration: 3.5 years
Award Summary: 100% of home tuition fees paid, a £1,000 annual research budget and annual stipend of £15,609.

Project description: This project studies classes of graphs both from a structural and an algorithmic point of view. From a structural perspective, the aim is to classify which classes have certain desirable properties, such as having bounded clique-width or being well-quasi-ordered. From an algorithmic perspective, the aim is to study computationally hard problems to systematically pinpoint exactly what type of structure makes such problems easy or hard (both from a classical complexity and a parameterized point of view).

The project tries to do this for many problems simultaneously by using the underlying structure rather than trying to solve problems in an ad hoc way.

As an extreme example, if we consider graphs that have bounded clique and independence number, Ramsey’s Theorem tells us that such graphs have bounded size, so computational problems can be solved on them in polynomial (even constant) time. How far can we relax such a condition and maintain the property that large classes of problems are still polynomial-time solvable?

There is scope in the project to study discrete structures more from the perspective of fundamental computer science or more from a mathematical perspective, depending on the candidate’s interests.

Eligibility Criteria: You must have, or expect to achieve, at least a 2:1 Honours degree in an appropriate subject e.g. Mathematics or Computer Science and are expected to have excellent mathematical skills as well as an interest in discrete mathematics and/or algorithms. The award is available to applicants with a UK Home fee status only (this normally includes UK students and EU students with settled/pre-settled status, and other students only under certain conditions; see https://www.ukcisa.org.uk/Information--Advice/Fees-and-Money/England-fee-status#layer-6082 for eligibility criteria).

How To Apply: Please contact Dr Konrad Dabrowski at konrad.dabrowski@newcastle.ac.uk before making an application. You should include all application documents and write “PhD Studentship in Algorithmic Graph Theory” in the subject line. Suitable candidates will be invited to make an official application in the online portal.

Further details: https://www.ncl.ac.uk/postgraduate/fees-funding/search-funding/?code=comp2115


Utrecht University, The Netherlands. Postdoc position in fine-grained complexity of NP-hard problems, funded by ERC Starting grant "Finding Cracks in the Wall of NP-completeness” of Jesper Nederlof.

https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs/postdoc-position-in-algorithmic-theory-10-fte


University of Bergen, Norway. Two postdoctoral positions in Algorithmic foundations of data science (in a very broad sense), funded by ERC Consolidator grant of Saket Saurabh.

https://www.jobbnorge.no/en/available-jobs/job/218932/researcher-in-informatics-algorithmic-foundations-of-data-science


A full-time postdoc position is available in the "Big Data Algorithms" research group led by Assistant Professor Sebastian Forster at University of Salzburg, Austria. The position is within the ERC-funded project "Dynamic Algorithms Against Strong Adversaries" (DynASoAr). The main goal of this project is to design new dynamic algorithms with theoretical guarantees for fundamental graph problems.

  • Requirements: PhD in computer science or mathematics with research experience in graph algorithms
  • Start date: Fall 2022, negotiable
  • Application deadline: February 20, 2022. Late applications will be considered until the position is filled.

If you are interested in this position, then please send your CV including a list of publications, a short letter of motivation, and the names of two references to ta.ca.gbs.sc|retsrof#ta.ca.gbs.sc|retsrof. Please include the words "application" or "postdoc" in the subject line. Inquiries about the position, the goals of the project, and the research environment are welcome as well.


Linköping University has announced a new assistant professor position in computer science
that focuses on the borderland between theoretical computer science, mathematics, and artificial intelligence.
The position is tenure-track. The position is part of a strategic research initiative within IT and mobile communications
known as ELLIIT. The position will be strongly research-oriented and the idea is that the assistant professor should
build experience to be able to create and lead an externally funded research program. More information, including
pointers to contact persons, can be found here:

https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=18113&rmlang=UK

The application deadline is March 1, 2022. Informal enquiries can be made to
Peter Jonsson (es.uil|nossnoj.retep#es.uil|nossnoj.retep).


A postdoctoral position is available in the Algorithms Group at the Department of Computer Science at the University of Bonn, Germany. The group consists currently of three faculty members (Anne Driemel, Thomas Kesselheim, Heiko Röglin), several postdocs and PhD students.

The position will be for two years initially with the possibility of extension. The postdoc may pursue his/her own line of research but a focus related to the existing research areas of the group is very welcome.

Applications will be reviewed starting from February 21, 2022 until the position is filled. The envisioned starting date is fall 2022, but other starting dates may be negotiable.

Please send your application (including a cover letter, a curriculum vitae, a list of publications, and the names and contact information of at least two references) to the address below. Electronic submissions are highly encouraged (please attach relevant documents as pdf).
Heiko Röglin, Universität Bonn
http://www.roeglin.org


The Computer Science Institute (CSI) of Charles University, Prague, Czech Republic, invites applications for a faculty position at the rank of an assistant professor in the area of theoretical computer science. The expected starting date is September 1, 2022, and it is negotiable.

We are looking for candidates that would complement and/or strengthen existing research areas in our institute (which currently include computational complexity, cryptography, approximation algorithms, integer programming, structural graph theory, combinatorics and discrete mathematics). Strong candidates from all areas of theoretical computer science will be considered. For further information about our research see http://iuuk.mff.cuni.cz/. Informal inquiries are welcome and may be sent to Michal Koucky <zc.inuc.ffm.kuui|ykcuok#zc.inuc.ffm.kuui|ykcuok>.

A successful candidate is expected to pursue an active research program, teach advanced and introductory classes and possibly supervise undergraduate and graduate students. Candidates are expected to have a proven international research record and postdoctoral experience. A PhD in computer science or a closely related field is required.

The contract duration is three years. Potentially, the position is renewable; also a habilitation (associate professor promotion) and a permanent position is a standard possibility (subject to a separate review process).

The application deadline is: January 31, 2022.
Official announcement: https://www.mff.cuni.cz/en/faculty/job-opportunities/open-competition/academic-positions-application-deadline-january-31-2022
Code: 202201-AP2-IUUK


At the University of Amsterdam, we plan to invest significantly into Theoretical Computer Science in the near future. We currently have three openings for new faculty members, including opportunities at Full Professor, Associate Professor, and Assistant Professor level.

We hope that at least some of the appointees will be women. The deadline is on the 7th of February and the job ads are linked from here:

https://theory.amsterdam/


The Faculty of Computer Science of HSE University (Moscow, Russia) accepts applications for postdoctoral positions in the following research areas: theoretical computer science, theoretical foundation of ML, interpretable knowledge discovery and explainable AI, complex systems and applied mathematics, formal concept analysis, process mining, bioinformatics, ML for bioinformatics, generative modelling, algebraic topology, algebraic transformation groups, data and material/physical science, pattern mining, recommender systems, NLP and programming code analysis.

Application deadline is January 31, 2022: https://cs.hse.ru/en/news/554897133.html


CANADA: The Department of Computer Science at the University of Victoria is seeking to hire 2 faculty members at the rank of Assistant Professor with eligibility for tenure with preference for applicants from any of the following equity-deserving groups: Indigenous peoples, persons with disabilities, women, or those who identify as Black. Applicants are asked to self-identify in their cover letter. The anticipated start date of July 1, 2022. We are considering candidates in two areas:

Area A
We seek candidates whose research addresses any or several of the following topics:
? Fairness
? Ethics
? Accountability
? Transparency
? Interpretability
? Theory of data privacy

Preference will be given to candidates with theoretical computer science, AI/machine learning, or algorithmic game theory approaches to the topics above.

For more information please see https://academicjobsonline.org/ajo/jobs/20771 or write to the recruiting chair at ac.civu.csc|hcraes#ac.civu.csc|hcraes.

Deadline is Jan 21.


Université libre de Bruxelles (ULB) in Brussels (Belgium)

- Postdoc position within the research project "BD-DELTA (Integer Linear Programs with Bounded Subdeterminants)" of Prof. Samuel Fiorini, with funding for 1,5 years. Strong candidates with interests in Discrete optimization and/or Graph theory and/or Matroid theory are encouraged to apply.

- Postdoc position within the research project "Product structure of planar graphs" with Prof. Gwenaël Joret.

About the scientific environment, Samuel Fiorini is a member of the Algebra and combinatorics research group of the Department of Mathematics. Other members include Spela Spenko (algebraic geometry), Dimitri Leemans (finite geometries, abstract polytopes), and Joost Vercruysse (categorical algebra).

He is also a member of the Algorithms group of the Computer Science Department. Other members include

- Jean Cardinal (algorithms, data structures, discrete and computational geometry),
- John Iacono (algorithms, data structures, GPU computing),
- Gwenaël Joret (structural and algorithmic graph theory), and
- Stefan Langerman (algorithms, data structures, discrete and computational geometry)


UNIVERSITY OF VIENNA - TENURE TRACK ASSISTANT PROFESSOR POSITIONS IN ALGORITHMS

The department of Computer Science at the University of Vienna invites excellent candidates to apply for a full-time tenure-track assistant professor position in ALGORITHMS.

For more information click here <https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_cA7B26705-229F-7D89-F267-4D0F9735CF03_k02BF4C57-7913-E791-9B12-93C663CA3F0B&tid=88323.28>. The application deadline is January 24, 2022.


A postdoc position in computational complexity theory and related areas is available in the research group of Igor Oliveira at the University of Warwick. The position offers flexible conditions and comes with generous travel support. The start date is negotiable. The position is available for up to 22 months.

In addition to joining one of the leading theory groups in Europe, you will be a member of the Centre for Discrete Mathematics and its Applications (DIMAP) and have the opportunity to take part in a number of local activities jointly organised with Imperial College London and the University of Oxford as part of our Complexity Network. Warwick is also home to the Oxford-Warwick Complexity Meetings, which covers exciting new developments in complexity theory.

To be considered, please send an email to Igor Oliveira (moc.liamg|bracrogi#moc.liamg|bracrogi) with your CV and a list of publications. Applications submitted before 20/January/2022 will receive full consideration. Applications received after this deadline will still be considered until the position is filled. Informal enquiries are also welcome.


Deadline January 31, 2022. The CS department at Lund University invites applications for two PhD positions in theoretical computer science. The PhD students will be working in the research group of Susanna de Rezende where the focus is on computational complexity and algorithms. There is a growing research group in algorithms and complexity theory at Lund University. We expect to have four PhD students by the autumn, in addition to two faculty and some MSc students working in computational complexity.

Lund University was founded in 1666 and is repeatedly ranked among the top 100 universities in the world. It is located in the Öresund area, which is offering one of the strongest and most exciting environments in computational complexity research in Europe. There is extensive collaboration with the University of Copenhagen (UCPH), the IT University of Copenhagen (ITU), and the Technical University of Denmark (DTU) on the other side of the Öresund Bridge. In particular, we will be collaborating with the MIAO research group, which is active at both Lund University and the University of Copenhagen. The PhD students can also look forward to interacting with the five additional faculty in complexity theory in Copenhagen, together with their students and postdocs, as well as with the algorithms group at the Basic Algorithms Research Copenhagen (BARC) centre.

These are four-year full-time employed positions, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting date is negotiable but should ideally be as early as possible during the autumn of 2022. The application deadline is January 31, 2022 at midnight local time. See https://derezende.github.io/openpositions/PhD.html for more information and instructions on how to apply. Informal enquiries are welcome and can be sent to es.htl.sc|ednezer.annasus#es.htl.sc|ednezer.annasus.


Call for Postdocs 2021

https://eimi.ru/call-for-postdocs/

The Leonhard Euler International Mathematical Institute in St. Petersburg is seeking postdocs in all areas of Mathematics, Theoretical Computer Science, Mathematical and Theoretical Physics.

Applicants should send their applications to moc.liamg|codtsop.relue#moc.liamg|codtsop.relue

St. Petersburg is the most beautiful city in the world and has multiple mathematical locations including St. Petersburg Department of Steklov Institute of Mathematics and the newly created Department of Mathematics and Computer Science in St. Petersburg State University.

The preference is given to applications completed before December 9, 2021. However, the Call will remain active throughout the whole year.

Preferable starting date is September 1, 2022.


The IBM Research Mathematical Sciences Council invites postdocs for its 2022–2023 Herman Goldstine Memorial Postdoctoral Fellowship for research in mathematical and computer sciences. Permanent members, academic visitors, and postdoctoral fellows pursue research in pure and applied mathematics and in theoretical and exploratory computer
science. Up to two fellowships will be awarded. The fellowship has a period of one year, and may be extended for another year by mutual agreement.

For full details and to apply, please visit: https://research.ibm.com/goldstine/

Submission deadline: 31 Dec 2021

Eligibility: Candidates must have received a Ph.D. degree after September 2017 or should expect to receive one before the fellowship commences in the second half of 2022 (usually in September)

Location: One of the IBM Research laboratories. Email questions to moc.mbi|wollefpg#moc.mbi|wollefpg


Postdoctoral positions: The "Laboratoire d'Excellence" (LabEx) MILyon opens its annual campaign of postdoctoral fellowships in Lyon-St-Etienne in Mathematics, Computer Science and their interactions (including some aspects of theoretical physics).

MILyon offers two postdoctoral positions of two years, with no teaching load, for the period 2022-2024. The application is open to all research areas of LabEx MILyon, in particular fundamental computer science (Logic, combinatorics, computer algebra, graph theory, algorithms, …)

More information on the link below:

https://milyon.universite-lyon.fr/postdoctoral-positions-2022-2024-130160.kjsp?RH=1571748911317

Deadline for applications: January 4th, 2022.


Postdoctoral research positions, hosted by Hubie Chen, are available at Birkbeck, University of London, starting in early 2022. Successful candidates will work on the parameterized complexity of database query evaluation and related mathematics. The positions are funded by a grant from UK's EPSRC. Interested persons are encouraged to initiate e-mail discussion with Hubie Chen (ku.ca.kbb.scd|eibuh#ku.ca.kbb.scd|eibuh).


Assistant Professor positions in theoretical computer science at the UESTC, Chengdu. Contact Bakh Khoussainov <zn.ca.dnalkcua.sc|kmb#zn.ca.dnalkcua.sc|kmb> or Mingyu Xiao <moc.liamg|oaixym#moc.liamg|oaixym>. See the ALG web page:
https://tcs.uestc.edu.cn/ <https://tcs.uestc.edu.cn/>


Deadline November 14, 2021 for Postdoc and Ph.D. Student Positions in Symbolic Algorithms - University of Bergen (Norway) - Deadline 14/Nov/2021

Symbolic algorithms are algorithms where the input data is represented implicitly. Such algorithms are particularly relevant in contexts where the data to be processed is too large to be specified in an explicit form. The Algorithms Group at the University of Bergen (Norway) has currently two open positions in the field of symbolic algorithms. These positions are financed by the project "Symbolic Algorithms: A Parameterized Approach", a 12 Million NOK research project funded by the Research Council of Norway under the Ground Breaking Research framework.

Postdoc Position - 3 years position with an initial salary of 535,500 NOK per year (approx 52,500 EUR per year) before taxes.
Ph.D. Position - 3 years position, with the possibility of a fourth year, if teaching is involved. Initial salary: 491,200 NOK per year (approx 48,000 EUR per year) before taxes.

Applicants for the Ph.D. student position should have a master's degree (or obtain a master's degree before 31/01/2022) and a strong background in a related subfield of theoretical computer science. Applicants for the Postdoc position should have in addition, a Ph.D. degree (or obtain a Ph.D. degree before 31/01/2022) and a strong publication record in some related subfield of theoretical computer science. Examples of fields of relevance to the position are: algorithms, graph theory, combinatorics, automata theory, type theory, etc.

For more information, please contact the project leader, Mateus de Oliveira Oliveira (on.biu|arievilo.suetam#on.biu|arievilo.suetam).


Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License