JOBS: Positions Available and People Looking

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


Closing date Sep. 1st, 2019: PhD scholarship at The University of Newcastle, Australia. Qualification: Completed a MSc. by Research Thesis and who would be willing to do a PhD in Computer Science with emphasis in Artificial Intelligence, Memetic Algorithms, Parameterized Complexity and/or Symbolic Regression with a strong emphasis in Discrete Applied Mathematics.

https://www.newcastle.edu.au/research-and-innovation/graduate-research/future-students/scholarships/vcs-hdr-scholarships

Topics of interest may include research that is spin off of some of our current publications, for instance: Machine Teaching, Target Curricula via Selection of Minimum Feature Sets: a Case Study in Boolean Networks http://www.jmlr.org/papers/v18/17-007.html
Separating sets of strings by finding matching patterns is almost always hard Theoretical Computer Science 665 (2017) 73-86.
Data Science, Business and Consumer Analytics, https://www.springer.com/gp/book/9783030062217.
Symbolic Regression, Symbolic Regression Modeling of Drug Responses, https://ieeexplore.ieee.org/document/8665684
A Memetic Algorithm for Symbolic Regression (soon available via IEEE Explore) http://cec2019.org/assets/downloads/IEEE_CEC_2019_Program.pdf
Other problems domains of Discrete Applied Mathematics and Computer Science may be of interest as well.

Candidate experience in Teaching is also valued and during the period in Newcastle there would be further training offered.
Interested can contact: ua.ude.eltsacwen|otacsom.olbap#ua.ude.eltsacwen|otacsom.olbap


Closing date 15 September 2019. PhD position in database theory at RWTH Aachen University. The successful applicant is expected to carry out research in the project "Quantitative Reasoning About Database Queries" lead jointly by Martin Grohe (RWTH Aachen) and Benny Kimelfeld (Technion).

The ideal candidate should have a strong background in theoretical computer science, especially algorithms, complexity theory and logic, and an interest in applications in database systems and machine learning. All applicants should have an excellent master's degree in computer science, mathematics, or a related discipline. Applications should include a detailed CV, a copy of master thesis, a brief statement of research interests, and a list of publications (if applicable). Please also mention names and contact details of one or two references, preferably one from the thesis advisor.

The position is fulltime and can be started as soon as possible for the applicant. The position is funded for two years, with a possible extension of two more years.

Please send your application materials per email to Martin Grohe (ed.nehcaa-htwr.kitamrofni|ehorg#ed.nehcaa-htwr.kitamrofni|ehorg).


Tenured and Tenure-track positions at the Chennai Mathematical Institute, Chennai, India

Chennai Mathematical Institute (CMI) is a centre of excellence for teaching and research in the mathematical sciences. The research groups in Mathematics, Computer Science and Theoretical Physics at CMI are very active, and count among them leaders in their fields. CMI graduates have gone on to contribute to leading organisations throughout the world.

CMI is currently inviting applications for full-time and part-time positions at all levels and in all areas of Mathematics and Theoretical Computer Science. Also, if you are part of a group of people with a strong record of common interests and collaborations, and you wish to move together to a strong institution which will welcome and encourage this interaction, please do contact us. We have excellent students, light teaching loads, good research facilities, access to grants, and a vibrant visitor’s program.

A formal application would require a CV, a statement of purpose, names and email addresses of possible referees, to be sent to ni.ca.imc|rotcerid#ni.ca.imc|rotcerid. Informal enquiries are also very welcome, and will be promptly responded to. If you know someone who would be right for us, please encourage them to contact us.

See the full announcement at: Tenured and Tenure-track positions at CMI


Deadline for applications early August for PhD position at Univ. Bergen, Norway in the Department of Information Science and Media Studies. The position is for 4 years and 25% of the time is compulsory duties at the department. The topic of the position is broad and computational social choice candidates are welcome. We are especially looking for candidates who want to work on the research frontier of formal logic with applications in artificial intelligence and multi-agent systems; project proposals on formal logics for reasoning about social networks are particularly welcome, but the position is also open for qualified applicants within other areas of information science. The PhD candidate will be affiliated with the Logic, Information and Interaction research group.

Details on how to apply
https://urldefense.proofpoint.com/v2/url?u=https-3A__www.jobbnorge.no_en_available-2Djobs_job_171817_phd-2Dposition-2Din-2Dinformation-2Dscience&d=DwIBaQ&c=imBPVzF25OnBgGmVOlcsiEgHoG1i6YHLR0Sj_gZ4adc&r=DgVcb5_57rsfsfza1QC9CQ&m=kCIk2_Q5hcroqagKZHrtF-j7HQoAzkiE6siip8VLqlc&s=Q1RPhKuGtySDE9DFnb762kGWCh7v5nCdZ4E8bReU-p8&e=

Contact Professor Leif Ove Larsen, e-mail on.biu|nesraL.fieL#on.biu|nesraL.fieL or Marija Slavkovik <moc.liamg|kivokvals.ajiram#moc.liamg|kivokvals.ajiram>.


Deadline 28th July. The University of Auckland, New Zealand is advertising a tenurable "Lectureship" (like an Assistant Professor position in the US) in Mathematics, suitable for candidates with connections to Computer Science. This would involve research and teaching an graduate supervision, with at least some teaching of courses in discrete mathematics.

Contact Rodney Downey, Email: zn.ca.wuv|yenwod.dor#zn.ca.wuv|yenwod.dor or Marston Conder, Email: zn.ca.dnalkcua|rednoc.m#zn.ca.dnalkcua|rednoc.m


Deadline 12 July, 2019. Fully-funded PhD positions are available at UNSW Sydney. The successful applicant will work on the project “Mechanism Design for Fair Transport Systems.” The goal of the project will be to incentivise efficient and fair utilisation of transport facilities. The student will work closely with the joint supervisors Haris Aziz (Computer Science, UNSW) and Vinayak Dixit (Civil Engineering, UNSW). They will have David Parkes (Harvard University) as an international co-supervisor.

We are looking for candidates with a strong interest in interdisciplinary research at the intersection of computer science, engineering and economics. Relevant areas include algorithmic market design and computational social choice. In view of the relevant areas, applicants must have a strong background in algorithms and discrete mathematics. Fluency in written and spoken English is required.

The successful applicant will receive a scholarship package for four years, comprising of a $41,209 per annum tax-free stipend and a travel and development support package of up to $10,000 per annum. The development package will support conference and workshop attendance as well as research visits to other groups. There are no teaching obligations. International students also receive a tuition fee scholarship. In addition to this scholarship package, candidates are provided with access to a range of development opportunities across research, teaching and learning and leadership and engagement.

The official PhD advertisement (including applications for an expression of interest) can be found at https://www.scientia.unsw.edu.au/scientia-phd-scholarships/mechanism-design-fair-transport-systems.

For inquiries, please contact Haris Aziz (ua.ude.wsnu|ziza.sirah#ua.ude.wsnu|ziza.sirah)


Deadline June 18, 2019 for a 3-year PhD Position at TU Wien within an FWF-funded research project on SAT-Based Local Improvement for Graph Width Parameters.

ABSTRACT: Structural decomposition is one of the most successful approaches to the solution of hard computational problems, such as for probabilistic reasoning and computational medical diagnosis. Finding a suitable structural decomposition is itself a computationally hard problem. In this project we propose to study a new approach to finding structural decompositions. The idea is to use an exact method (in particular one that is based on satisfiability-solvers) to locally improve a heuristically obtained decomposition. Based on this new idea we will develop new algorithms for the decomposition of graphs and hypergraphs as well as for structural Bayesian Network learning. Our new approach bears the potential of achieving better decompositions for instances that are too large to be handled by exact approaches, and it also provides novel applications for satisfiability solver technology. The research will be a combination of theoretical investigations and the development and testing of prototype implementations.

Applications must be made via the online form https://form.jotformeu.com/szeider/phd-position-slim

The deadline for applications is June 18, 2019. Informal inquiries with Prof Szeider <ta.ca.neiwut.ca|zs#ta.ca.neiwut.ca|zs> are welcome.


Deadline May 05, 2019 for a PhD student position on the Algorithmic Aspects of Automated Theorem Proving at the University of Bergen.

The position is part of the project

"Automated Theorem Proving from the Mindset of Parameterized Complexity Theory",

which is funded by the Research Council of Norway, and which is led by Mateus de Oliveira Oliveira.

Deadline for application: 05/May/2019.
Starting date: 01/August/2019, or as soon as possible thereafter.
Annual salary: NOK 449 400 before taxes (approx EUR 47000 per year before taxes).

The full announcement of the position, including instructions on how to apply, can be found at [https://www.jobbnorge.no/en/available-jobs/job/168659/phd-position-in-algorithms]. For more information, please send an email to on.biu|arievilo.suetam#on.biu|arievilo.suetam.


Deadline March 31, 2019 for TU Eindhoven in the Netherlands. Bart Jansen is offering a 2-year postdoc position, as well as two PhD positions, on the ERC Starting grant 'ReduceSearch'.
Contact for additional information: Bart Jansen |Email: ln.eut|nesnaj.p.m.b#ln.eut|nesnaj.p.m.b


Deadline: January 20, 2019 for a 3-year Postdoctoral Research Fellow in parameterized complexity for practical computing led by Professor Michael Fellows at the Univ Bergen. The project is Parameterized Complexity for Practical Computing, financed by The Research Council of Norway through the ToppForsk programme.

The University of Bergen has renewable energy as one of its main research focus areas. The successful candidate is expected to collaborate with the optimization group of our department, as well as researchers in other departments of the Faculty of mathematics and natural sciences working on offshore wind energy and marine research.

Applicants must hold a PhD or an equivalent degree in computer science (completed by April 30, 2019), with specialization in algorithms or optimization. See: https://www.jobbnorge.no/en/available-jobs/job/161602/postdoctoral-fellow-position-in-algorithms-parameterized-complexity-for-practical-optimization
The application and appendices must be uploaded at www.jobbnorge.no by 20/01/19.
For additional information: Mike Fellows. Email: on.biu|swollef.leahcim#on.biu|swollef.leahcim


Deadline Jan 18, 2019 for UNSW Sydney Head of School for the School of Computer Science & Engineering. This is a continuing position, normally at the level of professor. Announcement:
http://external-careers.jobs.unsw.edu.au/cw/en/job/495688/head-of-school-cse
Contact for additional information: Serge Gaspers |Email: ua.ude.wsnu.esc|gegres#ua.ude.wsnu.esc|gegres


Deadline Jan 15, 2019 for a one year Postdoc researcher (with a possible one year extension) at Algorithms Group, Univ Bergen (http://www.uib.no/rg/algo/) to work on the Norwegian Research Council grant: Multivariate Algorithms: New domains and paradigms led by Fedor Fomin. The project focuses on fine-grained analysis of (parameterized, approximation, polynomial, counting, dynamic, streaming, etc.) algorithms on various objects (graphs, points, vectors, spaces, matrices, matroids, strings, etc.).

Candidates are required to have completed (or being close to completion) a PhD in the area of theoretical computer science, discrete mathematics or a related discipline. Strong background in algorithms, complexity theory, and combinatorics is a plus. Apply: https://www.jobbnorge.no/en/available-jobs/job/160087/researcher-position-in-algorithms

For additional information: Fedor Fomin http://www.ii.uib.no/~fomin/ for more details and information on.biu.ii|nimof#on.biu.ii|nimof


Deadline January 10, 2019 for Assistant Professor, Associate or Full Professor candidates for the Department of Computer Science (https://cs.aalto.fi/), Aalto Univ. Applications welcome from any area of computer science: Algorithm Engineering, Data Management, Human-Computer Interaction, Software Engineering, and Software Systems. Female candidates are especially encouraged to apply.

See https://www.aalto.fi/careers/professors-in-computer-science, and brochure:
https://www.aalto.fi/sites/g/files/flghsv161/files/2018-11/cs2018_brochure_181105.pdf.


Deadline January 1, 2019. The Department of Computer Science at North Carolina State University
(NCSU) seeks to fill a tenure-track/tenured faculty position in theoretical computer science
starting August 2019. This search is part of an ongoing effort to strengthen theory within the department. Candidates can obtain additional information about the department and its research programs at http://www.csc.ncsu.edu/ <http://www.csc.ncsu.edu/>*.
Inquiries may be sent via email to: ude.uscn.stsil|hcraes-yroeht-csc#ude.uscn.stsil|hcraes-yroeht-csc*.* For additional information: Blair Sullivan ude.uscn|villusbv#ude.uscn|villusbv.


Deadline December 14, 2018 for several postdoctoral research fellowship positions in the IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea. The expected start date is 1st of March 2019 but it can be negotiated; it is possible to start earlier or later in 2019 but the candidate should have a Ph.D. by the start date.

DIMAG is a new research group to be established in December 2018 at the Institute for Basic Science (IBS, www.ibs.re.kr), led by Prof. Sang-il Oum (mathsci.kaist.ac.kr/~sangil/). DIMAG is located on the main campus of the Institute for Basic Science (IBS) in Daejeon, South Korea, a city of 1.5 million people.

Successful candidates 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.
Email to rk.er.sbi|gamid#rk.er.sbi|gamid by Friday, December 14, 2018. DIMAG website: dimag.ibs.re.kr


Deadline 11 November 2018. Univ. Melbourne, Australia is hiring academics across a range of areas in Computer Science and Information Systems, including Natural Language Processing, Security and Digital Health. We are also looking for female applicant in any area of Computing and Information Systems. More details are here: http://www.eng.unimelb.edu.au/about/departments/school-of-computing-and-information-systems

Currently ranked number 1 in Australia and 14th in the world in the latest 2018 QS World University Rankings. and supported by a 10-year strategic $1 Billion investment in people and infrastructure. Contact: Head of School T. +613 8344 3635 E: ua.ude.bleminu|nilekcia.ewu#ua.ude.bleminu|nilekcia.ewu <mailto:uwe.aickelin@unimelb.edu.au> W: http://aickelin.com<http://aickelin.com/>


Deadline Wednesday 17 October 2018. Lecturer positions in the Dept of Comp Sci at Royal Holloway, London. https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0918-375. Applications in all areas of Comp Sci will be considered. Contact Prof. Gregory Gutin: ku.ca.luhr.sc|nitug#ku.ca.luhr.sc|nitug


Deadline September 13, 2018. A 2-year postdoctoral position in kernelization and preprocessing in the research group of Prof. Stefan Kratsch at the Department of Computer Science at Humboldt-Universität zu Berlin. The intended starting date is November 2018, a later start may be negotiated. The position is funded until September 30, 2020. Contact: Prof. Stefan Kratsch. Email: kratsch <at> informatik.hu-berlin.de


Deadline September 1st, 2018 for a fully funded PhD position on the topic of Speeding up Algorithms with Machine Learning (ML) Methods at TU Wien, Vienna, Austria. Join Prof. Stefan Szeider’s research group (https://www.ac.tuwien.ac.at) to develop and implement new methods for leveraging Machine Learning algorithms for improving the efficiency of algorithms for hard combinatorial problems. Possible research topics include: (i) ML-based algorithm selection and algorithm tuning, (ii) ML-based heuristics, and (iii) ML-based problem encodings to SAT/SMT/QBF/ILP solvers. Applicants are expected to have solid programming skills as well as interest in theoretical computer science. Background in ML and/or discrete algorithms and/or SAT-solving is of advantage.

The successful candidate will be part of the Doctoral Program on Logical Methods in Computer Science (http://logic-cs.at/phd/) and will have all the benefits from this program (including special courses and seminars, guest lectures, soft skill and career training courses, an international cohort of fellow students).

Informal inquiries to Prof. Szeider <ta.ca.neiwut.ca|zs#ta.ca.neiwut.ca|zs> are welcome. Sending applications earlier, with cc to Prof. Szeider, is encouraged.


Deadline Still open November 2018 for University of Sheffield (UK) 3 year PhD studentship on the development of Parameterized Algorithms for Artificial Intelligence and Logic problems such as satisfiability of propositional formulas, constraint satisfaction, integer linear programming, as well as problems from graph theory and machine learning with the help of sophisticated algorithmic such as meta-theorems, dynamic programming, decompositions, and backdoor sets.

Funding Notes: This fully funded studentship is open to UK or EU students, and provides a tax-free living allowance at the standard Research Council rate (£14,777 p.a. for 2018/19) and full student tuition fees for 3 years.

Application: Send CV, an abstract of the thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file; alternatively, letters of recommendation
may be sent directly by their authors). Mention
possible starting dates. Send to the project supervisor Dr. Sebastian Ordyniak moc.liamg|kainydros#moc.liamg|kainydros. Sebastian is available for informal questions.


Deadline: not fixed, but soon. Postdoctoral positions at Ben-Gurion University of the Negev, Israel, supervised by Meirav Zehavi (https://sites.google.com/site/zehavimeirav/). The candidate will join the project ``New Horizons in Kernelization’’, funded by the Israel Science Foundation (ISF).

The starting date is flexible but not earlier than October 1, 2018. The position is for one year with the possibility of renewal. While there is no fixed deadline for applying, review of candidates will begin shortly and continue until the positions are filled. Applicants with solid background in areas such as algorithm design (including but not limited to parameterized algorithms and approximation algorithms), computational complexity, discrete mathematics, graph theory or computational geometry are welcome to apply. The candidates are expected to have a competitive publication record.

Applications should be sent to moc.liamg|variemivahez#moc.liamg|variemivahez. Include: Cover Letter (motivation and background, 1-2 pages), short research statement, CV + list of publications, and full contact details of 2-3 referees.


Deadline: Apply as soon as possible. The research group AlGCo (Algorithms Graphs and Combinatorics) in Montpellier has a PhD position available for the (flexible) Period 01/10/2018–30/09/2021 for research on graph algorithms and graph mining problems. Keywords of the related research domains are: structural graph theory, graph algorithms, parameterized algorithms, approximation algorithms, community detection, clustering, graph similarity, graph modification problems.

AlGCo is one of the leading research teams in France in Parameterized Computation and has an increasing interest to graph algorithms, kernelization, graph coloring, and structural graph theory.

The candidate should hold a MSc degree and should have a solid background in algorithms, complexity, and graph theory and strong motivation to work on related areas, including parameterized computation and approximation algorithms. Moreover, English language skills and knowledge/experience on programming in Python, C, and C++, will be appreciated.

Send application in English to rf.mmril|luap#rf.mmril|luap <mailto:paul@lirmm.fr> or ofni.sokiliht|klihtdes#ofni.sokiliht|klihtdes <mailto:sedthilk@thilikos.info> Include: Cover Letter, detailing your motivation and background for applying for the PhD project, CV, Proof of diplomas and transcripts of records (BSc and MSc, Other information for consideration, e.g. list of publications (if any), Full contact details (Name, address, telephone & email) of 1-3 referees.


Deadline: 27 June 2018. Three-year postdoc position in Algorithms. Department of Computer Science, Humboldt-Universität zu Berlin. Contact Prof. Stefan Kratsch Prof. Stefan Kratsch
kratsch <at> informatik.hu-berlin.de


Deadline: apply as soon as possible (only applications submitted before 14th of May are guaranteed to receive full consideration): A PhD position in Fine-grained (Parameterized) Complexity of Hard Problems, supervised by Jesper Nederlof (http://www.win.tue.nl/~jnederlo/).
Our main goal is to improve the understanding of the exact complexity of basic (NP-)hard problems such as the Travelling Salesman, Set Cover or Subset Sum problem. In particular, the project aims to study for which classes of instances various elementary algorithms can be improved. A particular emphasis of the project herein is to rigorously investigate the power of standard decomposition methods such as Branching, Dynamic Programming, and Meet-in-the-Middle via parameters of appropriate matrices.

The project will be partially funded by NWO. While the project will mainly touch the fields of Parameterized Complexity and Fine-Grained Complexity, the project is also likely to touch other subfields of Theoretical Computer Science including Communication Complexity and Approximation Algorithms; but the direction may vary depending on the candidate's preferences. Send your CV to ln.eut|folreden.j#ln.eut|folreden.j if you're interested.


Deadline: not fixed, as soon as possible. A PhD position is available in the research group of Dr. Matthias Mnich, Bonn University, Germany. (http://tcs.cs.uni-bonn.de/doku.php?id=staff:matthiasmnich)
The position is full-time. The successful candidate will perform research as part of the DFG funded project "Multivariate Algorithms in Scheduling". Candidates must hold (or be close to completion) of a master's degree (or equivalent) in computer science, mathematics or a related area. They should have a very good knowledge about algorithms and complexity.

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