JOBS: Positions Available and People Looking

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

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.

Deadline 26 February for 4 lecturer positions (education focused) at UNSW Sydney.
Two positions are 3-year fixed term positions and two positions are convertible tenure-track positions in the School of Computer Science and Engineering at UNSW Sydney.


Deadline of 28 February for priority for a postdoctoral fellow to work on the project "Complexity of Graph Patterns" at IIT Gandhinagar, India. The advertisement can be found at:

The form to apply can be found at:

Please email Balagopal Komarath
Assistant Professor, Discipline of Computer Science and Engineering,
IIT Gandhinagar, India.

Deadline is 12 noon,Friday 26 March 2021 for a postdoctoral position in Algorithms and Complexity Theory working with Leslie Ann Goldberg at the University of Oxford.

The job is available for four years starting from 1 Oct 2021.
Contact Leslie Ann Goldberg, Progessor
Dept. of Computer Science and St Edmund Hall, University of Oxford||grebdlog.eilsel (direct)||grebdlog.eilsel (also works, with some extra mail redirection)​<>

Deadline 22 March 2021. The Technical University of Denmark (DTU) in the Copenhagen area offers a postdoc in algorithms with a focus on dynamic graphs.

In order to handle changes to the graph, an efficient dynamic graph algorithm maintains a data structure containing partial answers to a specific type of query, in a way that allows the right partial answers to be updated when the graph is changed, and the right partial answers to be combined when a query is asked. The fun challenge is in this field is to find just the right partial answers to maintain, while letting the algorithm for answering queries do some of the work of putting the answer together, and often, the road to efficient algorithms goes via new graph theoretic insights.

The postdoc is financed by the Independent Research Fund Denmark grant "Dynamic Network Analysis", a 3-year project running simultaneously with Eva Rotenbergs Villum Young Investigator project "Efficient Recomputations for Changeful Problems", as well as other projects on algorithms, complexity, and graph theory.

Contact: Eva Rotenberg, kd.utd|tore#kd.utd|tore.

Deadline March 1, 2021: Faculty Positions (Research) in Computer Science (2 preferential, 2 regular positions)
In accordance with the University of Victoria's
Equity Plan, and pursuant with Section 42 of the BC Human Rights code, the Department of Computer Science at the University of Victoria is seeking to hire four faculty members, two positions are with preference for people from any of the following three designated groups: aboriginal peoples, persons with disabilities, or women. These positions are at the rank of Assistant Professor with eligibility for tenure and an anticipated start date of July 1, 2021. We are seeking candidates in the areas of:

A. Equity, fairness, accountability, transparency, explainability, privacy or other social aspects of decision making and support as they relate to the study and design of machine learning, artificial intelligence, algorithms and systems.
B. Theory of Computer Science including algorithmic game theory; logic and complexity (including formal methods); theory of security and cryptography; and parallel, distributed, and streaming algorithms.
C. Machine learning and applications, such as natural language processing and computational linguistics, computer vision, deep learning, reinforcement learning, and probabilistic graphical models.
D. Software development with an emphasis on one or more of the following: software testing, software experimentation, DevOps and AIOps, formal methods, programming languages, accessibility, security, ethics, diversity and/or inclusion.

More details regarding these positions are available at:

Preferential Hire: Applications should be submitted at:
Non-preferential Hire: Applications should be submitted at

The Algorithms group of TU Eindhoven is offering a postdoc position in parameterized algorithms and kernelization, funded by the ERC Starting grant ‘ReduceSearch’. For more information about the positions and how to apply, please visit:

TU Eindhoven is offering a postdoc position for a talented and motivated researcher with a strong interest in algorithms and complexity. The research is supported by ERC Starting grant "Rigorous Search Space Reduction" and is aimed at advancing the theory of algorithmic preprocessing. The project investigates questions such as: why does preprocessing lead to such large speedups for some NP-hard problems? How does a preprocessing algorithm reduce the search space of the follow-up algorithm? Which aspects of a problem input make it amenable to preprocessing? How can new preprocessing algorithms be developed that deliver speedups of several orders of magnitude? These questions are tackled using the framework of parameterized complexity and kernelization, and are asked for a diverse set of NP-hard problems concerning graphs, logic, and constraint satisfaction.

The position is supervised by dr. Bart M. P. Jansen ( )

Deadline - Inquiries welcome. Rahul Santhanam (Oxford) and Igor Oliveira (Warwick) invite expressions of interest for a joint POSTDOC position in computational complexity theory and related areas. This position is funded by the EPSRC Proposal "Structure vs Randomness in
Algorithms and Computation", which explores the theory of pseudorandomness to obtain new algorithms, complexity lower bounds, and independence results in logic. Strong candidates interested in one or more of these research directions are encouraged to apply.

In order to be considered, please send an email to Rahul Santhanam (||manahtnas.luhar) and Igor Oliveira (||arievilo.rogi) with your CV and a list of publications. Informal enquiries are also

Job Announcements below are past deadline, but maybe still relevant. Inquire if interested.

Old-maybe still relevant. Inquire. Deadline is February 11th, 2021.The ERC project BOBR: Decomposition Methods for Discrete Problems, led by Michał Pilipczuk at the Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, is seeking up to two candidates for post-doc positions.

The project BOBR aims to explore connections between algorithm design (with a particular focus on parameterized and approximation algorithms), structural graph theory (in particular graph decompositions), and finite model theory (particularly, algorithmic aspects thereof). Specific research directions that will be pursued are (1) the theory of sparse and structurally sparse graphs, (2) dynamic data structures for parameterized problems, (3) parameterized approximation schemes in topologically constrained graph classes, and (4) algorithms in graph classes defined by forbidding induced subgraphs. We expect the candidates to have relevant background and research experience.

Applications should be sent electronically. Further information as well as a specification of the format of applications can be found in the full description of the call:

Old-maybe still relevant. Inquire. Deadline for applications is 10.02.2021. Associate Professorship (W2) in Algorithms and Data Structures at Heinrich-Heine-Universitaet Duesseldorf (Germany):

Contact: Jörg-Matthias Rothe <ed.uhh|ehtor#ed.uhh|ehtor>

Old-maybe still relevant. Inquire. Deadline for applications: 12th February, 2021. The University of Warsaw (MIM UW) invites applications for positions of an assistant professor (“adiunkt” in Polish) in Computer Science, starting on 1st October 2021 (or 1st Feb 2022).MIM UW is one of the strongest computer science faculties in Europe. It is known for talented students (e.g., two wins and 14 times in top ten at the ACM International Collegiate Programming Contest) and strong research teams, especially in algorithms, logic and automata and computational biology. There is also a growing number of successful smaller groups in areas like cryptography, game theory, distributed systems, machine learning and others. There are five ERC grants in computer science running at MIM UW at the moment.

More details, including application procedure can be found under the
following links:


Contactt Prof. Lukasz Kowalik (lp.ude.wumim|kilawok#lp.ude.wumim|kilawok).

Old-maybe still relevant. Inquire. Deadline for the assistant professorship is January 17, 2021, and for all the other positions the deadline is January 24, 2021. The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for:
- A tenure-track assistant professorship in computational complexity theory
- Postdocs in theoretical computer science
- A postdoc in combinatorial optimization
- PhD positions in theoretical computer science and/or combinatorial optimization

Informal enquiries about these positions are welcome and may be sent to||nj.

Old-maybe still relevant. Inquire. Deadline 18 Jan 2021 A for a Postdoctoral Research Fellow in the area of parameterized algorithms, at the University of Warwick. The position is for 2 years and the start date can be negotiated for the successful candidate.

The position is available in connection with a research grant of Dr. Ramanujan Sridharan ( with the goal of pursuing cutting edge research in the design of parameterized graph algorithms exploiting novel notions of graph-edit distance. The project comes with a generous travel budget which will enable the project team to closely collaborate with internationally leading research groups in algorithms and complexity.

You will need to have a strong background in the mathematical analysis of algorithms, with a specialization in one of the following areas: graph algorithms, combinatorics or parameterized complexity. You will need to have (or expect to obtain shortly) a PhD in the relevant area.

You will be formally based in the Department of Computer Science at the University of Warwick, and you will be associated with the Centre for Discrete Mathematics and its Applications ( and the Division of Theory and Foundations at the University of Warwick. The Department of Computer Science at the University of Warwick is one of the top-ranking computing departments in the United Kingdom. The department is especially renowned for its excellence in theoretical aspects of computer science, in the areas of algorithms and combinatorial optimization.

The Centre for Discrete Mathematics and its Applications (DIMAP) is an internationally renowned centre of excellence in algorithms, discrete mathematics and combinatorics, theoretical computer science and mathematical aspects of operational research. It is led by a number of internationally recognised researchers and has an extensive programme of scientific seminars, international workshops and conferences, and visiting researchers. For further information about DIMAP, please see our website

For further information about the position, please contact Dr. Sridharan (

If you are interested in this position, please submit your application by 18 Jan 2021 at the following link:

Old-maybe still relevant. Inquire. Deadline for the assistant professorship is January 17, 2021, and for all the other positions the deadline is January 24, 2021 for openings in Copenhagen:

- Tenure-track assistant professorship in computational complexity theory
- Postdocs in theoretical computer science
- Postdoc in combinatorial
- PhD positions in theoretical computer science and/or combinatorial optimizationhttps:
Contact: Jakob Nordström, <||mortsdron.bokaj>
University of Copenhagen and Lund University
Phone: +46 70 742 21 98

Old-maybe still relevant. Inquire. Deadline Dec 31, 2020. Postdoc positions with the CS theory group at the University of Toronto for Fall 2021. The positions are typically for up to two years, but the start time and duration are flexible.

- Two positions for EconCS (including computational social choice, algorithmic fairness, AGT, mechanism design, and incentives in machine learning). Postdocs hired under these positions will work with me as well as with other relevant faculty members.

- Three additional positions for general TCS (including algorithms, complexity theory, cryptography, differential privacy, distributed computing, graph theory, quantum computing, and theoretical aspects of machine learning). Postdocs hired under these positions will work with the relevant faculty members from the whole group.

The link below provides details on how to apply. For full consideration, applicants should send their CV + research statement and have their reference letters sent to||ppacodtsop by Dec 31.

Old-maybe still relevant. Inquire. Deadline: Jan 6th 2021. The Excellence Laboratory Milyon recruits three postdoctoral researchers in Mathematics, Computer Science and their interactions for the period 2021-2023.

In particular, applications in all fields of fundamental computer science are welcome for a postdoc in LIP:

More information and application here:

Old-maybe still relevant. Inquire. Deadline 11 January 2021. Four tenure-track Assistant professors and Associate professors, and candidates within all areas of Computer Science being hired at Aarhus University - an international top-100 University.

How to apply:
Read more about Dept. Of Computer Science:

Lecturer in Algorithms at the University of Sheffield, UK, a world top 100 University, in the design and analysis of algorithms, with specialist expertise in an area including, but not limited to:

- randomised algorithms
- streaming algorithms and sublinear-time algorithms
- combinatorial optimisation
- approximation algorithms
- parameterised complexity and fixed-parameter tractable algorithms
- distributed computing
- graph algorithms analysis
- data structures design and analysis
- algorithmic game theory
- randomised search heuristics

For more information:
Contact: Pietro S. Oliveto, Department of Computer Science,
The University of Sheffield, Sheffield, UK.*

Old-maybe still relevant. Inquire. Deadline 18 December 2020 for PhD positions are available at the Theory and Foundations group in the Department of Computer Science, University of Warwick, UK. The group works on various aspects of theoretical computer science such as:

  • automata and formal languages,
  • logic and games,
  • algorithmic game theory,
  • online and dynamic algorithms,
  • sublinear and streaming algorithms,
  • parameterized complexity and structural graph theory,
  • string algorithms,
  • parallel algorithms,
  • approximation algorithms,
  • combinatorial and graph algorithms,
  • random structures and randomized algorithms,
  • computational complexity,
  • privacy-preserving algorithms, cryptography and quantum computing.

The group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP), established in 2007 jointly with Warwick Mathematics Institute and Warwick Business School. Together with DIMAP, the group is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science.

The Department of Computer Science at Warwick offers an excellent research environment. It was ranked 2nd in the latest UK research assessment in Research Excellence Framework (REF) in 2014. The University of Warwick is one of the founding members of the Alan Turing Institute.

Contact either Dr Sayan Bhattacharya (||ayrahcattahB.S<>) or Dr Torsten Mutze (||eztum.netsrot<>) with a CV and the names and email addresses of two references by 18 December 2020.

Deadline December 5, 2020, Saturday for one postdoctoral research fellowship position in the IBS Discrete Mathematics Group (DIMAG), located at the headquarters of the Institute for Basic Science (IBS) in Daejeon, Korea, led by Prof. Sang-il Oum ( <||lignas>).

The position is available for individuals who are within the first five years after obtaining their Ph.D at the date of appointment or be expected to obtain a Ph.D within three months from the date of appointment. Successful candidates for postdoctoral research fellowship positions will be new or recent Ph.D.’s with outstanding research potential in all fields of discrete mathematics with emphasis on structural graph theory, extremal graph theory, combinatorial optimization, matroid theory, or
fixed-parameter tractable algorithms.

This appointment is for two years, and the starting salary is no less than KRW 57,000,000. The appointment is one time renewable up to 3 years in total contingent upon the outstanding performance of the researcher. The expected appointment date is September 1, 2021. This is a purely research position and will have no teaching duties.

For full consideration, applicants should email items 1, 2, 3, and 4 and arrange their recommendation letters emailed to||gamid by December 5, 2020, Saturday.

Deadline 18 Oct 2020 (Sydney timezone). Four 5-year postdocs in the Algorithmic Decision Theory group at UNSW Sydney.


The positions are funded through Toby Walsh's Laureate Fellowship on Trustworthy Artificial Intelligence.

8 PhD positions are also available.

Deadlines November 1st (PhDs) and October 9th (postdoc). Two PhD students (in Algorithmic Game Theory and Computational Social Choice) and a 2-year postdoc ** 2-year POSTDOC at Aarhus University, Denmark** . The application deadlines are November 1st (PhDs) and October 9th (postdoc), respectively. You can find a description of the positions and guidelines here:

PhD position in AGT:

PhD position in COMSOC:

Postdoc position:

Contact: Ioannis Caragiannis. Voice: +45 4189 3304. Email:||sinnai<>

Deadline 15 October 2020 for several 2-YEAR POSTDOC POSITIONS at CISPA, Saarbrücken, Germany in the Algorithms & Complexity group of Dániel Marx. CISPA is a German national Big Science Institution within the Helmholtz Association. It is located on Saarland Informatics Campus, in the close proximity of Saarland University, Max Planck Insitute for Informatics, and Max Planck Institute for Software Systems. The working language of the institute is English. The starting date is flexible.

Strong candidates are sought in ALL theoretical areas related to algorithms and complexity, with particular focus on the following topics: - graph algorithms, combinatorial optimization, parameterized algorithms and complexity

Applications for the positions should be submitted online on the CISPA website by *October 15, 2020* for full consideration:

The uploaded cover letter should indicate that the application is to the group of Dániel Marx, and provide names and addresses of 3 references. Informal enquiries are welcome and may be sent to Dániel Marx ( dnalraas.apsic|xram#dnalraas.apsic|xram ).

Deadline 15 October 2020 for POSTDOC POSITION IN PARAMETERIZED COMPLEXITY IN VIENNA (TU Wien). The position is part of the project "New Frontiers for Parameterized Complexity" of the FWF Austrian Science Fund and is hosted by the Algorithms and Complexity Group at the Vienna University of Technology (TU Wien). There are no teaching obligations
associated with the position. The starting date is flexible and the position is offered for a minimum of 1 year, with the possibility of extension.

Applicants are expected to have a strong research record in algorithmic theory and complexity, preferably (but not necessarily)
with a focus on parameterized complexity.

The application should include the candidate's CV, a short motivation letter, and two letters of recommendation (all in a single pdf file; alternatively, letters of recommendation may be sent directly by their authors). The application should also mention possible starting dates.

CONTACT: Informal enquiries and questions about the position are very welcome. Direct them to Robert Ganian (||nainagr, the principal investigator of the project.

Deadline: as soon as possible for a 4-year PHD POSITION at MAASTRICHT UNIV, Netherlands within the Algorithms, Complexity and Optimization (ALGOPT) group to work on the interface of parameterized complexity / fixed parameter tractability with phylogenetics (the study of evolutionary trees). The PhD position is funded by NWO KLEIN 1 grant "Deep kernelization for phylogenetic discordance".

The primary goal of the project is to explore the limits of kernelizationa — just how small can we make the reduced instances by applying ever-more powerful reduction rules? — and, secondarily, to leverage combinatorial insights resulting from the kernelization in the development of bounded-search, exponential-time and polynomial-time approximation algorithms.

Prior experience with parameterized complexity / fixed parameter tractability, or phylogenetics, is not required, but is obviously a bonus. The project is emphatically a theory project so candidates must have a strong algorithmic background and be comfortable with proofs.

More information and official application website here:

Contact: Dr. Steven Kelk (

Deadline September 30, 2020 for PHD POSITION IN PARAMETERIZED COMPLEXITY IN VIENNA (TU Wien). The position is part of the prestigious START project "Parameterized Analysis in Artificial Intelligence" of the Austrian Science Fund (FWF), supervised by Robert Ganian (principal investigator). Do you expect to receive a Master’s degree in Computer Science or Mathematics within the next 12 months (or have already received one)? The starting date is flexible and the position is offered for 3.5 years, with the possibility of extension. Informal enquiries and questions about the position are very welcome. Direct them to Robert Ganian (||nainagr). For details see:

Deadline September 30, 2020 for POSTDOC IN SAMPLE COMPLEXITY (or MACHINE LEARNING) IN VIENNA (TU Wien) Do you hold a PhD in Computer Science or Mathematics, or have the expectation to receive one within the next 12 months? The starting date of this position is flexible and the position is offered for 2 years, with the possibility of extension. The position is part of the prestigious START project "Parameterized Analysis in Artificial Intelligence" of the Austrian Science Fund (FWF), supervised by Robert Ganian (principal investigator). Informal enquiries and questions about the position are very welcome. Direct them to Robert Ganian (||nainagr). For details see:

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