JOBS: Positions Available and People Looking

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


PhD positions in TCS and/or combinatorial optimization in Copenhagen (application deadline July 1, 2024)

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

The PhD students will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (https://jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise.

The application deadline is July 1, 2024. Please see https://jakobnordstrom.se/openings/PhD-UCPH-240701.html for more information and instructions how to apply. Informal enquiries are welcome and can be made to Jakob Nordstrom at kd.uk.id|nj#kd.uk.id|nj.


Danish Data Science Academy postdoc and PhD positions (application deadline February 28, 2024)

The Danish Data Science Academy invites applications for postdoc and PhD fellowships for visionary and ambitious young data scientists who want to pursue their own research ideas in collaboration with a Danish research environment. The postdoc call is at https://ddsa.dk/postdocfellowshipprogramme/ and the PhD call at https://ddsa.dk/phdfellowshipprogramme/, and the application deadline is February 28, 2024.

Applications can be within any field of data science aligning with the DDSA research scope (https://ddsa.dk/ddsaresearchscope/), including, but not limited to, algorithms research within data science and AI and applications of data science or computer science to other areas in natural, technical, or life sciences. The positions will be awarded to the most promising candidates according to their scientific qualifications, motivation, and engagement, as well as the quality, originality, relevance and potential impact of the proposed project. It is a requirement that the applicant has a well-defined research project proposal as well as an agreement with a principal supervisor at a Danish university.

Informal inquiries about opportunities in the Algorithms and Complexity Section at the University of Copenhagen (https://di.ku.dk/english/research/ac/) are welcome and can be directed to Jakob Nordstrom (kd.uk.id|nj#kd.uk.id|nj) or other faculty in the section. Please contact us during January if you are interested, so that there is enough time to talk about your research ideas and provide feedback on how to turn them into a successful DDSA proposal.


Postdoc and PhD positions in TCS at Lund University, Sweden (Deadline Jan 31, 2024)

The Department of Computer Science at LTH Lund University invites applications for a 2-year postdoc position and up to two PhD positions in theoretical computer science with focus on computational complexity and algorithms to be working in the research group of Susanna de Rezende. Both postdoc and PhD positions are full-time employed positions (including travel money) that come with an internationally very competitive salary. There is a growing research group in foundations of computer science at Lund University. We expect to have eight PhD students by the autumn, in addition to three faculty, a postdoc and some MSc students.

Lund University 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. The postdoc and students can look forward to interacting with the four 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.

The application deadline is January 31, 2024. For more information, please see https://derezende.github.io/openpositions/. Informal enquiries are welcome and may be sent to es.htl.sc|ednezer.annasus#es.htl.sc|ednezer.annasus


Tenure-track assistant professorship in foundations of computer science with a focus on logic and automated reasoning (application deadline Jan 26, 2024)

The Department of Computer Science at Lund University invites applications for a tenure-track assistant professorship in the foundations of computer science with a focus on logic and automated reasoning.

The assistant professor will be working at the Department of Computer Science, where research into the foundations of computer science is conducted by professors Susanna de Rezende and Jakob Nordstrom. Jakob Nordstrom leads the research group Mathematical Insights into Algorithms for Optimization (http://www.jakobnordstrom.se/miao-group), which is also active at the University of Copenhagen. The research has a unique profile in that it spans a wide range of questions from the theoretical, mathematical foundations of efficient computation all the way to state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where the research projects do not only go deep into different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise.

This position focuses on algorithms for foundational problems within logic, automated reasoning, and combinatorial optimization. This includes design and implementation of algorithms for computational problems within Boolean satisfiability (SAT) solving, constraint programming, mixed integer linear programming, and/or satisfiability modulo theories (SMT) solving. In addition to algorithm construction, another topic of interest is to develop a scientific understanding of the practical performance of automated reasoning algorithms, and to investigate relations between empirical observations and theoretical results in algorithm analysis and computational complexity theory. Yet another related area concerns methods of ensuring that algorithms compute provably correct results, which can be used to develop trustworthy solvers for automated reasoning and combinatorial optimization.

The application deadline is January 26, 2024. See http://www.jakobnordstrom.se/openings/AsstProf-Lund-240126.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to es.htl.sc|mortsdron.bokaj#es.htl.sc|mortsdron.bokaj.


Postdoc and PhD positions in TCS and/or combinatorial optimization at University of Copenhagen (deadline Jan 10, 2024)

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

The postdocs and PhD students will be part of a world-leading research environment in algorithms and complexity theory. We are home to the Basic Algorithms Research Copenhagen (BARC) centre (barc.ku.dk) joint with the IT University of Copenhagen (ITU), and have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While our focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline for all positions is January 10, 2024. For more information about the postdoc positions see http://www.jakobnordstrom.se/openings/Postdoc-UCPH-240110.html and for the PhD positions see http://www.jakobnordstrom.se/openings/PhD-UCPH-240110.html. Informal enquiries are welcome and can be made to Mikkel Abrahamsen (kd.uk.id|baim#kd.uk.id|baim), Jakob Nordstrom (kd.uk.id|nj#kd.uk.id|nj), Rasmus Pagh (kd.uk.id|hgap#kd.uk.id|hgap), Srikanth Srinivasan (kd.uk.id|rsrs#kd.uk.id|rsrs), Mikkel Thorup (kd.uk.id|purohtm#kd.uk.id|purohtm), or Amir Yehudayoff (kd.uk.id|eyma#kd.uk.id|eyma).


Postdoc position in TCS at TUHH, Hamburg, Apply by November 17

The Institute of Algorithms and Complexity at TUHH: Hamburg University of Technology (www.algo.tuhh.de) in Hamburg, Germany offers an exciting opportunity to work as a postdoctoral researcher at the forefront of algorithms/optimization.

The position is offered for a period of 3 years. The salary of the position is determined according to level TV-L E-14 of the German public sector. The exact amount of salary depends on experience, family circumstances, tax classification and other factors. Travel funding is available, for attending conferences and workshops, and visiting other researchers.

The successful candidate will join the TUHH Institute for Algorithms and Complexity (www.algo.tuhh.de <https://www.algo.tuhh.de>), whose research covers a broad spectrum of algorithmic research; this includes big data algorithms, foundations of data science, combinatorial optimization, approximation and parameterized algorithms, and applications in operations research and discrete mathematics. The Institute for Algorithms and Complexity at TU Hamburg currently hosts several international researchers, so English is used on a daily basis as a working language.

For a full job description and details on how to apply see https://www.tuhh.de/algo/jobs/postdoc/senior-positions. Any questions regarding the position should be directed to Prof. Matthias Mnich (ed.hhut|ogla#ed.hhut|ogla).

Submission Deadline: 17 November 2023


PhD opening in TCS and/or combinatorial optimization (deadline September 25, 2023)

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (http://www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is September 25. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-230925.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to es.htl.sc|mortsdron.bokaj#es.htl.sc|mortsdron.bokaj.


Researcher in SAT Solving - University of Bergen, Norway - Deadline June 30, 2023

The Algorithms group at the University of Bergen has an open position for a Researcher in SAT-solving. The position is connected with the projects AUTOPROVING and SYMBOALGO, both financed by the Research Council of Norway. Your main task will be the application of SAT solving techniques in the development of algorithms and in the investigation of mathematical conjectures arising in combinatorics, graph theory, and related areas. You should have strong documented expertise in topics related to SAT solving, either from a theoretical point of view, or from a practical point of view.

More information about the position can be found at https://www.jobbnorge.no/en/available-jobs/job/242720/researcher-in-informatics-sat-solving. For further questions about the position, please contact Mateus de Oliveira Oliveira (on.biu|arievilo.suetam#on.biu|arievilo.suetam).


PhD opening in TCS and/or combinatorial optimization (deadline June 1, 2023)

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (http://www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is June 1. Early applications are welcome, since this will help speed up the recruitment process, but all applications submitted before the deadline will be given equal consideration. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-230601.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to es.htl.sc|mortsdron.bokaj#es.htl.sc|mortsdron.bokaj.


Danish Data Science Academy PhD positions (Deadline March 19, 2023)

The Danish Data Science Academy announces an open call https://ddsa.dk/phdfellowshipprogramme/ for PhD positions for visionary and ambitious young data scientists who want to pursue their own research ideas in collaboration with a Danish research environment.

Applications can be within any field of data science aligning with the DDSA research scope (https://ddsa.dk/ddsaresearchscope/), including, but not limited to, algorithms research with data science and AI and applications of data science or computer science to other areas in natural, technical, or life sciences. The positions will be awarded to the most promising candidates according to their scientific qualifications, motivation and engagement, as well as the quality, originality, relevance and potential impact of the proposed project. It is a requirement that the applicant has a well-defined research project proposal as well as an agreement with a principal supervisor at a Danish university.

Applicants with a MSc degree can be accepted to the PhD program directly, whereas applicants with a BSc degree can pursue an integrated MSc and PhD program.

The application deadline is Sunday March 19, 2023, at midnight local time. Please see https://ddsa.dk/phdfellowshipprogramme/ for more information. Applications should be submitted via https://ddsa.eu-1.smartsimple.eu/s_Login.jsp.

Informal inquiries about opportunities in the Algorithms and Complexity Section at the University of Copenhagen (https://di.ku.dk/english/research/ac/) are welcome and can be directed to Jakob Nordstrom (kd.uk.id|nj#kd.uk.id|nj) or other faculty in the section.


PhD position in Theoretical Computer Science at Newcastle University, UK (deadline Friday 24th February 2023)

The School of Computing at Newcastle University, UK is offering three fully funded PhD studentships. One of the possible topics is "Applications of Graph Width Parameters to Computational Complexity." Prospective Students interested in this topic are encouraged to contact Dr Konrad Dabrowski at konrad.dabrowski@newcastle.ac.uk for more information.

Project description: Many real-world computational problems can be modelled as problems on graphs. However, in most cases the resulting algorithmic graph problem is computationally intractable (for example, it is NP-hard or W[1]-hard) if any graph is allowed as input. In practical applications, we often find that the input for such problems is far from arbitrary, but has some additional properties or structure, and in some cases this structure is sufficient to construct efficient algorithms for these problems.

Thus it is useful to know what types of structure allow us to solve algorithmic problems efficiently. Ideally, we want to find properties that allow us to solve many different problems simultaneously, rather than solving each one in an ad hoc way. One of the techniques by which this can be done is by bounding width parameters of graphs. Some of these, such as treewidth and clique-width have been extensively studied, but others, such as mim-width and twin-width are more recent innovations. Width parameters allow us to measure how “well-structured” the graph under consideration is and, if the parameter is small, we can then use this structure to simultaneously construct polynomial algorithms for wide classes of algorithmic graph problems, by the use of certain meta-theorems. Recent research has shown cases where even if such a parameter is not bounded on a class of graphs, it is often possible to combine bounding width parameters with additional tools to reduce problems to subclasses where the parameter is bounded, and thus achieve polynomial runtimes.

This project aims to systematically study the interplay between width parameters and other techniques to pinpoint exactly which types of structure allow us to solve computationally hard problems in an efficient manner (both from a classical complexity and a parameterized point of view). Finding such properties helps give insight into the mathematical structure of tractable instances. Conversely, if we find properties under which problems remain computationally hard, this increases our understanding about what it is that makes problems computational hard. An expected outcome of the project is to develop novel connections between Discrete Mathematics and Theoretical Computer Science by finding links between graph structure and algorithmic complexity.

Further Details: The studentships cover 3.5 years PhD studies, covering 100% fees (UK home or international) and a minimum tax-free annual living allowance of £17,668 (2022-23 UKRI rate). Expected start date of September 2023. Full details are available at https://www.ncl.ac.uk/computing/study/postgraduate-research/studentship-advert/ .


PhD positions in TCS at Lund University, Sweden (deadline Feb 20)

The Department of Computer Science at LTH Lund University invites applications for up to two PhD positions in theoretical computer science with focus on computational complexity and algorithms. These are four-year full-time employed positions (including travel money) that come with an internationally very competitive salary. The PhD students will be working in the research group of Susanna de Rezende.

There is a growing research group in algorithms and complexity theory at Lund University. We expect to have six PhD students by the autumn, in addition to two faculty and some MSc students working in computational complexity. 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.

The application deadline is February 20, 2023. For more information, please see https://derezende.github.io/openpositions/PhD.html. Informal enquiries may be sent to es.htl.sc|ednezer.annasus#es.htl.sc|ednezer.annasus


PhD opening in TCS and/or combinatorial optimization at UCPH (deadline January 10)

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

The PhD students will be part of a world-leading research environment (currently ranked 11th worldwide by CSrankings.org in algorithms and complexity theory), with a strong presence at top-tier conferences like STOC, FOCS, and SODA, and also with publications in premier AI venues like AAAI, IJCAI, and NeurIPS. We are home to the Basic Algorithms Research Copenhagen (BARC) centre (barc.ku.dk), joint with the IT University of Copenhagen, and have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While our focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is January 10, 2023. Please see http://www.jakobnordstrom.se/openings/PhD-UCPH-230110.html for more information and instructions how to apply. Informal enquiries are welcome and can be made to Mikkel Abrahamsen (kd.uk.id|baim#kd.uk.id|baim), Jakob Nordstrom (kd.uk.id|nj#kd.uk.id|nj), or Rasmus Pagh (kd.uk.id|hgap#kd.uk.id|hgap).


Postdoc positions in theoretical computer science at UCPH (deadline January 10, 2023)

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc positions in theoretical computer science.

We are looking for outstanding junior researchers with an innovative mind-set and intellectual curiosity to strengthen and complement the research profile of the Algorithms and Complexity Section at DIKU. This is a world-leading research environment (currently ranked 11th worldwide by CSrankings.org in algorithms and complexity theory), with a strong presence at top-tier conferences like STOC, FOCS, and SODA, and also with publications in premier AI venues like AAAI, IJCAI, and NeurIPS. We are home to the Basic Algorithms Research Copenhagen (BARC) centre (barc.ku.dk), joint with the IT University of Copenhagen (ITU), and have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While our focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is January 10, 2023. See http://www.jakobnordstrom.se/openings/Postdoc-UCPH-230110.html for more information and instructions how to apply. Informal enquiries are welcome and can be made to Mikkel Abrahamsen (kd.uk.id|baim#kd.uk.id|baim), Jakob Nordstrom (kd.uk.id|nj#kd.uk.id|nj), or Rasmus Pagh (kd.uk.id|hgap#kd.uk.id|hgap).


Postdoc positions in combinatorial optimization at UCPH (deadline January 15, 2023)

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc positions in combinatorial optimization.

We are looking for outstanding junior researchers 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. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is January 15, 2023. See http://www.jakobnordstrom.se/openings/Postdoc-UCPH-230115.html for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to kd.uk.id|nj#kd.uk.id|nj.


PhD opening in TCS and/or combinatorial optimization at Lund University (deadline January 12)

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in 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. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is January 12. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-230112.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to es.htl.sc|mortsdron.bokaj#es.htl.sc|mortsdron.bokaj.


Assistant Professor in Algorithms at TU Eindhoven (Deadline November 23)

The Algorithms, Geometry, and Applications (ALGA) group at TU Eindhoven has a vacancy for an assistant professor in any field within algorithms. The application deadline is November 23, 2022. Research in ALGA spans a spectrum of exciting topics within algorithms, including computational geometry and topology, graph algorithms and parameterized complexity, and distributed and streaming algorithms, with applications to visualization, GIS, networks, and more. As a new faculty member, you may strengthen the research in one of these existing topics or you may expand ALGA’s research portfolio. The position comes with an attractive starting package that includes the possibility to hire a PhD student.

For more information, including how to apply, please look here


Lecturer / Senior Lecturer in Theoretical Computer Science, Logic, or Formal Methods (deadline Oct 12)

The School of Computer Science and Engineering at the University of New South Wales (UNSW Sydney, Australia) is seeking outstanding candidates for a (Senior) Lecturer position in Theoretical Computer Science, Logic, or Formal Methods. This is a full-time, tenure-track, research & teaching position (40% teaching, and slightly less for new staff and early-career academics).

The application deadline is Wednesday 12th October 2022, 11:50 pm (Sydney time; which is a few hours ahead of most of the world).
Apply here


Tenure-track assistant or associate professorship in complexity theory (deadline Oct 2)

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for a tenure-track assistant or associate professorship in computational complexity theory.

We are looking for an outstanding researcher with an innovative mind-set and intellectual curiosity to strengthen and complement the research profile of the Algorithms and Complexity Section at DIKU. This is a world-leading research environment with a strong presence at top-tier conferences like STOC, FOCS, CCC, and SODA, and also with publications in premier AI conferences like AAAI, IJCAI, and NeurIPS. We are home to the Basic Algorithms Research Copenhagen (BARC) centre, joint with the IT University of Copenhagen, and have extensive collaborations with the Technical University of Denmark (DTU) and with Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The University of Copenhagen was founded in 1479 and is the oldest and largest university in Denmark. It is often ranked as the best university in Scandinavia and consistently as one of the top places in Europe. Within computer science, it is ranked 2nd in the European Union (post-Brexit) by ShanghaiRanking.

The application deadline is October 2, 2022. See http://www.jakobnordstrom.se/openings/AsstAssocProf-UCPH-221002.html for more information and instructions how to apply. Informal enquiries are welcome and may be sent to kd.uk.id|nj#kd.uk.id|nj.


Early- and Mid-Career fellowships in Australia, specifically UNSW Sydney (soft deadline September 30)

The School of Computer Science and Engineering at the University of New South Wales (UNSW Sydney) is seeking outstanding early-career and mid-career candidates with a solid research track record in Computer Science to apply for the Australian Research Council (ARC) Discovery Early Career Research Awards (DECRA) and the ARC Future Fellowships.

DECRAs (0-5 years post-PhD, adjusted for interruptions): https://jobs.acm.org/link.cfm?c=IltWXv3OGzTY
Future Fellowships (5-15 years post-PhD, adjusted for interruptions): https://jobs.acm.org/link.cfm?c=YFXgpcAveibs

Contact Serge Gaspers for more information.


PhD opening in TCS and/or combinatorial optimization (deadline September 15)

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

The PhD student will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom (http://www.jakobnordstrom.se), which is active at both the University of Copenhagen and Lund University on either side of the Oresund Bridge. We are closely affiliated with the Basic Algorithms Research Copenhagen (BARC) centre, and are part of a world-leading environment in algorithms and complexity theory encompassing also the IT University of Copenhagen and the Technical University of Denmark (DTU). We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory. While the focus in on foundational research, we do have a track record of surprising algorithmic discoveries leading to major industrial applications.

The application deadline is September 15. Please see http://www.jakobnordstrom.se/openings/PhD-Lund-220915.html for more information and instructions for how to apply. Informal enquiries are welcome and may be sent to es.htl.sc|mortsdron.bokaj#es.htl.sc|mortsdron.bokaj.


PhD positions in Eindhoven

Bart Jansen (ln.eut|nesnaj.p.m.b#ln.eut|nesnaj.p.m.b) is offering a 1-year postdoc position, with possible extension, starting in Fall 2022. The position is funded by ERC Grant 'ReduceSearch' and is targeted at researchers who have obtained a PhD and have a good track record publishing papers on parameterized complexity and kernelization. Apply via https://jobs.tue.nl/en/vacancy/postdoc-position-quotreduce-search-projectquot-948352.html . Application deadline is September 15.


Application deadline: 30 June, 2022.

PhD positions in TCS at Lund University

The Department of Computer Science at LTH, Lund University invites applications for two PhD positions in theoretical computer science with focus on computational complexity and algorithms.

These are four-year full-time employed positions (including travel money) that come with an internationally very competitive salary. The PhD students will be working in the research group of Susanna de Rezende.

The application deadline is June 30, 2022. For more information, please see https://derezende.github.io/openpositions/PhD.html. Informal enquiries are welcome and may be sent to es.htl.sc|ednezer.annasus#es.htl.sc|ednezer.annasus


Please apply before 30 June, 2022.

Peter Shaw’s team at Oujiang Lab in Wenzhou, China seeks full-time, 2-year post doctoral positions in interdisciplinary research of AI application in cancer treatments. Applicants should have a Ph.D. degree in the relevant fields (see left column), 2-3 SCI/JCR publications, prior experience in grant applications, and fluency in English. Successful applicants will be expected to work in Wenzhou, China. Salary and benefits are competitive (median RMB 400k-450k/year).

Ph.D. in the following areas: Computer Science, Software Engineering, or Mathematics.Expected proficiency in: AI for Organ-on-a-chip (OoC) ; Clinical AI ; FPT Algorithms;AI using novel graph.
Expected duties include but are not limited to the following: assists the development and implementation of lab; helps to foster undergraduate student research in the lab related to the overall project; leads and assists with data analysis, data management, and the publication of results; assists in grant and patent applications; maintain utmost work ethics and research data integrity; and contributes to a diverse and inclusive laboratory, department and team environment. A complete application packet should include: • CV, which lists all peer-reviewed publications and preprints. • Conference or journal articles, book chapters or equivalent writing samples which best demonstrate your expertise. Please apply before 30 June, 2022 by sending all your documents to nc.ca.baljo|wahsretep#nc.ca.baljo|wahsretep


Closing date is June 15, 2022.

A roughly 16 months full-time postdoc position is available in the G2OAT research group at the Czech Technical University in Prague
(CTU), The Czech Republic with a preferred starting date of October 2022 (slightly negotiable). The prospective mentor for the position is Dušan Knop zc.tuvc.tif|ponk.nasud#zc.tuvc.tif|ponk.nasud. Send informal inquiries.
The main topic for the project is in the intersection of parameterized complexity and computational social choice.The research interests of the group from graph algorithms, through classical and parameterized complexity and integer linear programming to combinatorial games.

The research group Graphs, Games, Optimization, Algorithms, and Theoretical Computer Science (G2OAT) is a part of the Department of Theoretical Computer Science at the Faculty of Information Tech at CTU. The department also includes Stringology and Arborology research groups.


Postdoctoral Researcher positions Formalization of Algorithms (deadline June 30, 2022)

The Department of Informatics at the University of Bergen (Norway) has an open postdoctoral researcher position in the formalization of algorithms in proof assistants. This position is connected to the project SYMBOALGO - Symbolic Algorithms headed by Mateus de Oliveira Oliveira.

As a researcher in the project, you will be working in the formalization of combinatorial constructions in the Coq proof assistant, and with the implementation of formally verified algorithms for combinatorial problems. Documented ability in formalizing mathematical constructions or algorithms in Coq is the main requirement for this position.

A more detailed description of the position, and instructions of how to apply can be found at https://www.jobbnorge.no/en/available-jobs/job/227117/researcher-in-informatics-formalization-of-algorithms-in-proof-assistants .

For questions about the project, please send an email to on.biu|arievilo.suetam#on.biu|arievilo.suetam


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


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