Fully-funded PhD or Postdoc position in “Parameterized Complexity of Network Dynamics” to be carried out under the supervision of Prof. Holger Dell. The 3-year research project at the intersection of parameterized complexity, statistical physics, and graph theory involves the rigorous analysis of dynamic processes on graphs, such as virus or fake news spreading through a social network.

Website: https://tcs.uni-frankfurt.de/positions/
Email: tcs-applications@dlist.uni-frankfurt.de

(Extended deadline) The Institute of Mathematics of the Czech Academy of Sciences is seeking a researcher for the project “Logic and unsatisfiability”. Applications are invited from candidates who have completed their PhD within the last 5 years (or will have completed it before the time of hiring), and who have a strong background in proof complexity or bounded arithmetic.

Website: http://www.math.cas.cz/recrutements/postes.php
Email: thapen@math.cas.cz

Iowa State University is seeking tenure track faculty in Theoretical Computer Science (broadly defined).

Website: https://cra.org/job/iowa-state-university-tenure-track-faculty-positions-in-computer-science/
Email: pavan@iastate.edu

Jönköping University (JU) advertises one position as PhD student in Computer Science, in collaboration with the theoretical computer science laboratory, Linköping university (LiU). The PhD student will join a research project in the intersection of artificial intelligence, complexity theory, and universal algebra, directed by Johannes Schmidt (JU) and Victor Lagerkvist (LiU).

Website: https://ju.varbi.com/se/what:job/jobID:601050/where:4/
Email: victor.lagerkvist@liu.se

We are offering a 1+1 year post-doc position as part of the ANR funded project Sub-EXponential APproximation and ParametErized ALgorithms (S-EX-AP-PE-AL). The topic of the position is the intersection of FPT algorithms and approximation. The post-doc will be supervised by Michael Lampis and will be based in LAMSADE, Université Paris-Dauphine,
located in central Paris.

Website: https://www.lamsade.dauphine.fr/~mlampis/SEXAPPEAL/events.html
Email: michail.lampis@dauphine.fr

The Algorithms group at the University of Bergen has an open 2-year Postdoctoral Researcher position in SAT-solving (deadline 30 April 2023). The goal is to apply SAT-solving techniques in the development of algorithms and in the investigation of mathematical conjectures arising in combinatorics, graph theory, and related areas.

Website: https://www.jobbnorge.no/en/available-jobs/job/242720/researcher-in-informatics-sat-solving
Email: mateus.oliveira@uib.no

The Toulouse Institute of Mathematics is hiring a top-level researcher specializing in the mathematical aspects of complexity theory. The fixed-term contract of 3 years as an associate professor will open the way to tenure as a full professor at Paul Sabatier University (Toulouse 3).

Website: https://www.math.univ-toulouse.fr/fr/institut/actualites/4bc613f1-bcd7-4d85-8005-9eb18a827a0e/
Email: direction.imt@math.univ-toulouse.fr

IE University’s School of Science and Technology (Sci-Tech) invites qualified applicants for full-time, tenure-track faculty positions in Computer and Data Science beginning September 2023, in Madrid. We are currently offering 6 positions in this area, which will remain open until filled with suitable candidates.

Website: https://apply.interfolio.com/36317/positions
Email: manuele.leonelli@ie.edu

The Concurrency In Reversible Computations (https://github.com/CinRC) project is actively seeking a PhD student to fund starting Spring 2024. The funding for an admitted PhD student includes tuition waiver, stipend, health benefits, (international) conference travel and possibly equipment. Funding is currently available for the first three years of the appointment through a new NSF funded project.

Website: https://spots.augusta.edu/caubert/research/cinrc/phd_ad.html
Email: clement.aubert@math.cnrs.fr

I am (Arnold Filtser) looking for both PhD and Postdoc applicants in the broad area of algorithms. We have a strong and thriving algorithms group here in BIU, and you will have many further options for collaboration. My research interest include (but not limited to): Metric Spaces, Low-Distortion Embeddings, Randomized Algorithms, approximation, and streaming algorithms.

Website: https://arnold.filtser.com/
Email: filtsea@cs.biu.ac.il