JOBS: Positions Available and People Looking

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

Deadline June 8, 2021. The CS department at Lund University invites applications for a tenure-track assistant professorship in algorithms and complexity theory.

Lund University was founded in 1666 and is repeatedly ranked among the top 100 universities in the world. Lund Technical College (LTH) forms the Faculty of Engineering at Lund University, where research of the highest international standard is conducted. The Department of Computer Science at LTH is a partner in the Wallenberg AI, Autonomous Systems and Software Program (WASP), the largest individual research program in Swedish history, and also in the ELLIIT Excellence Centre focused on basic and applied research in information technologies broadly construed. Furthermore, there are extensive collaborations with the University of Copenhagen, the IT University of Copenhagen (ITU), and the Technical University of Denmark (DTU) on the other side of the Oresund bridge.

See for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to||mortsdron.bokaj.

Deadline is June 6th for a postdoc position at Czech Technical University in Prague, Czech Republic.
A one-year full-time postdoc position is available in the G²OAT research group at the Czech Technical University in Prague, Czech Republic with preferred starting date October 2021.
The research interests of the group (including Dušan Knop, Ondra Suchý, and Pratibha Choudhary) range from graph algorithms, through classical and parameterized complexity and integer linear programming to combinatorial games.

More details on, or by email to Ondra Suchý sent to zc.tuvc.tif|yhcus.jerdno#zc.tuvc.tif|yhcus.jerdno.

Deadline is June 15th for a postdoc position at Warwick, UK. It is a 21-month post with possible extension to work on the UKRI FLF project, "Embeddings in sparse graphs" (PI: Hong Liu).

Details can be found in the call:

The webpage for the project is:

Hong Liu welcomes informal inquiries sent to||9.uil.h

Deadline is June 18, 2021 for applications for the position of a Full Professor in Algorithms and Complexity Theory in the Faculty of Information Systems and Applied Computer Sciences of the University of Bamberg, Germany.

The successful candidate will represent the field in research and teaching with a focus on algorithms and complexity theory for distributed and concurrent software systems as well for the acquisition, processing and visualisation of data in networked systems in the widest sense.

The applicant should have made excellent contributions in one or more of the following research areas:

  • distributed or parallel algorithms
  • automated deduction
  • combinatorial optimisation
  • randomised or approximate algorithms
  • parameterised algorithms
  • sublinear-time algorithms
  • algebraic complexity theory
  • online algorithms
  • quantum algorithms.


CONTACT: I am happy to answer any questions; please pass this on to anyone who might be interested.
Prof. Michael Mendler, PhD, The University of Bamberg
Faculty of Information Systems and Applied Computer Sciences
Head of Interview Panel (Berufungsausschuss) Algorithms and Complexity Theory
An der Weberei 5
D-96047 Bamberg, Germany

Deadline 28 April. Postdoc at University of Warwick, UK to work on an EPSRC funded project titled "Graph theory in higher dimensions”. The project offers a variety of subtopics including adaptations of graph minor theory to more geometric setups, and discrete random geometry. The post is for 3 years, to commence in 1st July 2021 (or later by mutual agreement).

The ideal candidate will have a strong research track record in graph minor theory, topological graph theory, discrete geometry, or discrete probability. For details about the application process and salary please see
Contact: Agelos Georgakopoulos, University of Warwick.

Deadline Ph.D. applications should be sent within May 2021. PostDoc applications can be sent at any time during the first 3 years of the project. Tentatively, one PostDoc position will be filled in within late 2021-early 2022.The Algorithms and Complexity Group of IDSIA, USI-SUPSI, Lugano (Switzerland), opens 2 Ph.D. positions and some PostDoc positions.

These positions are supported by the Swiss National Science Foundation project "Approximation Algorithms for Resource Scheduling" (November 2021-October 2025). The main goal of this project is to design improved approximation algorithms for a wide family of applications. Besides the classical (offline, centralized) setting, the group is also interested in algorithms for distributed, dynamic and online settings.

IDSIA offers an international working environment. Lugano is a tidy and lively town, with a wonderful view on Ceresio lake and mountains around. Ticino Canton offers many opportunities for hiking, biking, skiing, etc. Local restaurants serve very good (Italian style!) food.

The interested candidates should email a detailed CV and contact details of 2-3 references to Prof. Fabrizio Grandoni, fabrizio at

Deadline April 15, 2021. Postdoctoral Fellow in the general area of Theoretical Computer Science, especially Parameterized Complexity at the Lane Department of Computer Science and Electrical Engineering in the Benjamin M. Statler College of Engineering and Mineral Resources at West Virginia University, USA. This position supports research initiatives related to the design and analysis of parameterized and approximation algorithms and computational complexity. The period of this appointment is for one year and the anticipated start date is August 15, 2021. However, earlier start dates can be accommodated.

Applicants must have a PhD in theoretical computer science, operations research or mathematics, with a background in parameterized algorithm design and parameterized complexity. Two years of experience with approximation algorithms, computational complexity and operations research is also required as is a record of research publications in scientific journals. All applicants must be capable of completing the assigned tasks within the United States.

Responsibilities will include but are not limited to the following: conducting research on parameterized algorithms and complexity; guiding graduate and/or undergraduate students; liaison with other researchers from national labs, academia, and industry on all aspects related to this work and write proposals to seek funding; attending research conferences and reading of scientific literature to keep abreast of technological advances and latest research findings; searching scientific literature to select and adapt methods or procedures that are most appropriate for specific research goals.

West Virginia University is the State's comprehensive Land Grant University with an enrollment of about 29,000 students and a R1 Carnegie Classification. Morgantown and its vicinity have a diverse population of about 62,000 residents and are ranked highly among the most livable small cities in the country. The community lies within a high technology corridor that also includes several federal research facilities, as well as industries active in shale gas operations. The city is readily accessible and within driving distance from Pittsburgh, PA and Washington, DC. For more information on WVU and Morgantown, see and

Apply: For questions or additional information, contact K. Subramani at ude.uvw.liam|inamarbus.k#ude.uvw.liam|inamarbus.k<>. Department website at

Deadline to apply: April 15 for Parameterized Complexity postdoc in Paris at LAMSADE (, a joint laboratory of Paris-Dauphine University and CNRS, Paris, France. The ANR JCJC project ASSK (ANR-18-CE40-0025-01) offers a post-doctoral position for two year. The theme of this project is small separation phenomena on graphs and linear matroids, emphasizing the applications on algorithms design.

A successful applicant will have strong research potential with expertise in structural graph theory, graph width parameters, combinatorial optimization, matroid theory or algorithms design (with emphasis on fixed-parameter algorithms). Prior experience with algorithm design for graph width parameters and solid background knowledge in matroid theory are highly appreciated.

The expected starting date of the position is 1st September 2021, which is negotiable. The working language is English.

Further information about the project, job opening and how to apply can be found at

Contact: Eunjung Kim, Charge de recherche, LAMSADE, CNRS. and Mamadou Kanté (mamadou.kante at uca dot fr).

Deadline March 19, 2021 for PhD position at UNSW Sydney, Australia.

In the context of a Discovery Project funded by the Australian Research Council, applications are sought for the position of

one PhD candidate

to work on graph algorithms based on a combination of random sampling and multivariate subroutines.

Keywords: approximation algorithms, dominating set, exponential time algorithms, feedback vertex set, graph algorithms, kernelization algorithms, parameterized algorithms, parameterized complexity

The successful candidate will be supervised by the project leader, A/Prof. Serge Gaspers at UNSW Sydney, and is expected to collaborate with partner investigators Prof. Fedor V. Fomin (University of Bergen) and A/Prof. Daniel Lokshtanov (University of California Santa Barbara).
The expected start is Term 3 in 2021, i.e., around September 2021.

Interested applicants are invited to send an expression of interest to A/Prof. Serge Gaspers ua.ude.wsnu|srepsag.egres#ua.ude.wsnu|srepsag.egres including
- a CV,
- a short description of research interests,
- all university transcripts,
- contact details of 2 references, and
- the result of this online self-assessment tool:
Applications received by 19 March 2021 will receive full consideration.

- Graduate Research Scholarships at UNSW Sydney.
- Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019).
- Serge Gaspers, Fedor V. Fomin, and Daniel Lokshtanov. ARC Discovery Project DP210103849 "Improved algorithms via random sampling", A$ 435,346 (2021-2023).

Deadline March 31, 2021 for Associate Professor in the Dept of Informatics, Kyushu University Ito Campus,744 Motooka, Nishi, Fukuoka, 819-0395, Japan.;!!OToaGQ!57V_nySdNO2fd1u5KR07ATuu8ACeB8K7L5D5Y1g6UG8JyPYbIaIR7B61t-mjKHk$

Specialties: Multiagent systems, game theory, market design, artificial intelligence, combinatorial optimization, and other related topics in informatics.

Enquiries and contact: Makoto Yokoo (tel: +81-92-802-3585,||tiurcer) Distinguished Professor,

Deadline 7 April 2021 for assistant and associate professor positions at the Univ of Southern Denmark (SDU), Odense in the Dept of Mathematics and Computer Science<> (IMADA).

We are interested in applicants from all CS fields who can strengthen or complement the current research conducted at IMADA. See:


The ideal candidate can support other degrees (Data Science, Pure/Applied Mathematics) and is interested in combining theory and practice of computer science.

More information and directions for applying can be found at:

Contact: Joan Boyar <kd.uds.adami|naoj#kd.uds.adami|naoj>

Deadline 26 March for Postdoc in graph theory at Univ Montreal, Dept CS and OR, led by Prof. Gena Hahn and Dr. Ben Seamone. The primary interests of the group are, broadly speaking, graph structure, graph colouring, games on graphs,
and infinite graphs.

For further information, consult the collective agreement (French <>) and the postdoctoral fellow guide (English <>
| French <> ).

Applications and inquiries should be sent to moc.liamg|orid.ta.yroehthparg#moc.liamg|orid.ta.yroehthparg.
Contacts: Ben Seamone & Gena Hahn

Apply now for POST-DOC at University of Milano-Bicocca (Milan, Italy) in the Bioinformatics and Experimental Algorithms lab ( o working on "Efficient algorithms in computational pangenomics'' (PANGAIA EU-funded project ( . The main focus is on graph-based representations of pangenomes and their applications to transcriptomics and tumor evolution. The research activity will focus on designing, implementing and analyzing, both from a theoretical and experimental point of views, new combinatorial algorithms for problems for novel alternative splicing event inference and quantification, for pangenome comparison, for evolutionary history construction and comparison.


Please do not hesitate to contact me (Yuri Pirola <ti.biminu|alorip.iruy#ti.biminu|alorip.iruy>) for more information.

Deadline to apply: 31 March 2021 for POSTDOC IN COMPUTATIONAL COMPLEXITY, IMPERIAL COLLEGE LONDON. The Research Associate (postdoc) will conduct world-leading research in computational complexity theory with an emphasis on fundamental lower bound questions. The successful candidate will join the ERC (European Research Commission) EPRICOT project led by Professor Iddo Tzameret.

Further information:, and for a survey. Candidates will have freedom to pursue their own research agenda assuming it aligns with that of the group.

Informal enquiries are strongly encouraged and should be directed to Iddo Tzameret: moc.liamg|teremazt.oddi#moc.liamg|teremazt.oddi. To apply,
candidates should send their full CV (containing a list of all publications) to Tzameret.

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