JOBS: Positions Available and People Looking

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


Deadline July 31, 2020 for PHD IN STRUCTURAL AND ALGORITHMIC ASPECTS OF PREFERENCE-BASED PROBLEMS IN SOCIAL CHOICE The research topics include voting, structured preferences, stable matching (matchings under preferences) with a focus on parameterized and approximation algorithm design. The PhD position(s) entails an employment contract. The position is available immediately and the starting date is quite flexible. Applicants with a solid background in areas such as algorithm design (including BUT NOT LIMITED to parameterized algorithms and approximation algorithms), computational complexity, and/or discrete mathematics are welcome to apply. For informal inquiries you can also contact Jiehua Chen ta.ca.neiwut|nehc.auheij#ta.ca.neiwut|nehc.auheij

Details and application: http://www.vcla.at/2020/06/phd-position-in-structural-and-algorithmic-aspects-of-preference-based-problems-in-social-choice/


Deadline 28 July, 2020 for Postdoctoral position in Algorithms at UNIVERSITY OF VIENNA in the research group “Theory and Applications of Algorithms” lead by Professor Monika Henzinger.

Contact: <mailto:jobcenter@univie.ac.at>

See http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/

Additionally this fall the second round of the doctoral school “Computational Optimization” (which is a collaboration of various universities in the Vienna area) will start, leading to a large number of visiting professors and invited lectures on this topic over the next 3 years.

The position is available starting November 1, 2020 (or later) and will be for 3 years.See <https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_c729A6DDD-2C92-7ED8-A730-5417B1AA995B_k2C22DA60-D6F2-908C-8CCB-5BDB19FD2197&tid=80272.28> for more details.


Deadline 31 July, 2020 for Ph.D. Students and/or Postdoctoral Researchers in Algorithms at HASSO PLATTNER INSTITUTE, POTSDAM (HPI).

Contact: ed.iph|hcirdeirf-sboj#ed.iph|hcirdeirf-sboj

The Algorithm Engineering group at the currently hosts about twenty-five researchers using methods from mathematics and computer science to approach a range of algorithmic areas including artificial intelligence, network theory and random structures. As part of the privately funded Faculty of Digital Engineering of the University of Potsdam, we engage both in teaching of outstanding and highly selected students as well as in internationally renowned research. The group and the institute is located at the beautiful Campus Griebnitzsee, at the border to Berlin, offering a vibrant scientific environment.


Deadline July 1, 2020 for TWO FULLY-FUNDED PHD STUDENT POSITIONS IN DATA SCIENCE/ALGORITHMS RESEARCH AT HAMBURG UNIVERSITY OF TECHNOLOGY (TUHH). The position is within the newly formed Institute for Algorithms and Complexity, 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 starting date is negotiable starting. The doctoral candidates will be offered an employment contract for a starting period of 3 years. Apply using the official application portal of the vacancy (https://stellenportal.tuhh.de/jobposting/af68e494bdab40eb435a7795839fa648e4aa77fa).
Contact: Matthias Mnich (ed.hhut|hcinm.saihttam#ed.hhut|hcinm.saihttam).


Deadline June 12, 2020 for MULTIPLE FULLY FUNDED PHD POSITIONS IN THE DOCTORAL PROGRAM LOGICAL METHODS IN COMPUTER SCIENCE (LOGICS) IN AUSTRIA At the moment the TU Wien, TU Graz and JKU Linz, are recruiting doctoral candidates interested in the following areas: *Automated Software Verification *Description Logics *Epistemic logic in distributed computing *Explainable AI *Fixed-Parameter Algorithms and Complexity *Formal Verification of hybrid systems *Knowledge Representation and Reasoning *Model Checking *Modeling and analysis of digital integrated circuits *Normative Reasoning *Ontology-based Data Access *Security and Privacy *Scheduling and logic programming *Study of the Interaction between rules from a knowledge base and rules arising from machine learning *Topology in distributed computing *Quantified Boolean Formulas. OFFER We are recruiting up to 15 doctoral candidates with a negotiable starting date. The doctoral candidates will be offered an employment contract for a starting period of 3 years. Details and application: https://logic-cs.at/phd/


Deadline May 28, 2020 for 6-YEAR POSTDOC POSITION IN ALGORITHMS at the Faculty of Informatics of the Vienna University of Technology (Technische Universitat Wien - TU Wien). Research experience in at least one of the following areas is desirable: parameterized algorithms and complexity, algorithmic applications of graph decompositions, satisfiability and constraint satisfaction. Expected start: 1.10.2020 (negotiable). Vienna features a vibrant and excellence-driven research landscape, with exceptional quality of life. For inquires about the vacant post-doctoral position please do not hesitate to contact Stefan Szeider (ta.ca.neiwut.ca|zs#ta.ca.neiwut.ca|zs) and visit URL: https://www.ac.tuwien.ac.at/jobs/#junprof


Deadline April 29, 2020 for 5-year SENIOR RESEARCHER POSITION IN DATA SCIENCE/ALGORITHMS RESEARCH AT
HAMBURG UNIVERSITY OF TECHNOLOGY (TUHH).
The position is within the newly formed Institute for Algorithms and
Complexity, 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. Apply using the official application portal of the vacancy
(https://stellenportal.tuhh.de/jobposting/6f54fa6a185d75ad8aecf9c945dfee245eba442d0).
Contact: Matthias Mnich (ed.hhut|hcinm.saihttam#ed.hhut|hcinm.saihttam).


Deadline April 26, 2020 for several postdoctoral research fellowship positions with the IBS Discrete Mathematics Group (DIMAG) in Daejeon, Korea. (URL: https://dimag.ibs.re.kr/hiring/).

DIMAG is a new research group that was established in December 2018 at the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG is located at the headquarters of the Institute for Basic Science (IBS) in Daejeon, South Korea, a city of 1.5 million people.

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. These non-tenure-track appointments are for two or three years


Deadline: 17th May 2020
A one-year full-time postdoc position is available in the G²OAT research group at the Czech Technical University in Prague, Czech Republic with preferred starting date September 2020 (negotiable, with possible extension for at least one more year).
The research interests of the group (including Dušan Knop and Ondra Suchý) range from graph algorithms, through classical and parameterized complexity and integer linear programming to combinatorial games.

More details on http://users.fit.cvut.cz/suchyon7/ggoat/postdoc.html, or by email to zc.tuvc.tif|yhcus.jerdno#zc.tuvc.tif|yhcus.jerdno.


Deadline: 29th April 2020 for postdoctoral position at the University of Glasgow, working with Kitty Meeks and Jessica Enright on the EPSRC-funded project Multilayer Algorithmics to Leverage Graph Structure (MultilayerALGS). The position is funded for up to 36 months starting on 1st July 2020 or as soon as possible thereafter.

Candidates should have (or expect to obtain very soon) a PhD in Computer Science, Mathematics, or a closely related area. We are ideally looking for a candidate with experience in algorithmic graph theory and/or parameterised complexity, as well as practical coding skills (e.g. knowledge of Python, C, Java or another suitable programming language).

The closing date for applications is 29th April 2020, and interviews are scheduled to take place remotely on 20th May 2020. Informal enquiries to Kitty Meeks (ku.ca.wogsalg|skeem.yttik#ku.ca.wogsalg|skeem.yttik<mailto:kitty.meeks@glasgow.ac.uk>) or Jessica Enright (ku.ca.wogsalg|thgirne.acissej#ku.ca.wogsalg|thgirne.acissej<mailto:jessica.enright@glasgow.ac.uk>) are very welcome.

For more details and to apply, see https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=037548.


Deadline: 1st of June, 2020 for Postodctoral Researcher in Millennium Institute for Foundational Research on Data, IMFD Chile
The Millennium Institute for Foundational Research on Data (IMFD Chile, www.imfd.cl) offers an open position for a postdoctoral researcher to advance the understanding of theoretical aspects of modern neural network architectures, more in particular, its expressive and computational power. The coordinators of this project are Professors Pablo Barceló (http://pbarcelo.ing.uc.cl/) and Jorge Pérez (https://users.dcc.uchile.cl/~jperez/).
For more info please see: https://docs.google.com/document/d/1PyHp-MRAPWg_0aeinpDGmzJGZbwMtsqC6BqE_4T3KFc/edit
contact: Pablo Barcelo < lc.cu|olecrabp#lc.cu|olecrabp>


Deadline: 31st of January, 2020 for Lecturer ("Assistant Professor"), Senior Lecturer, or Reader ("Associate Professor") in Algorithms and Complexity for Optimization in the School of Informatics at the University of Edinburgh.
Please see: https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=050688
contact: Kousha Etessami < ku.ca.de.fni|ahsuok#ku.ca.de.fni|ahsuok>


Deadline: Applications are currently being accepted (posted December 17, 2019) for a Postdoc at CWI on the subject of "Towards a Quantitative Theory of Integer Programming" Wanted is a strong interest in the theory and practice of Integer Programming (IP). TThe goals of this research are (1) to develop a quantitative theory that can explain the effectiveness of the prevalent techniques used for solving IPs (e.g. branch & bound, cutting planes, diving heuristics, etc.), (2) to develop new and effective techniques for solving IPs and (3) to build new connections between the study of IP, theoretical computer science and optimization. The research projects are designed to be interdisciplinary and are expected to require combining techniques from various areas of optimization (first order methods, interior point methods, simplex algorithms), theoretical computer science (discrepancy theory, fixed parameter tractability, smoothed analysis) and geometry (convex geometry, geometry of Euclidean lattices). The process will remain open until the position is filled. For more information, please consult the official advertisement here:

Postdoc: https://www.cwi.nl/jobs/vacancies/postdoc-on-the-subject-of-towards-a-quantitative-theory-of-integer-programming-1

Contact: Daniel Dadush Homepage: https://homepages.cwi.nl/~dadush/


Applications will be reviewed starting January 20, 2020 for Postdoc in Algorithms at TU Munich in the research group of Prof. Susanne Albers,
A research interest in approximation and online algorithms, algorithmic game theory or algorithm engineering is very welcome.
See http://wwwalbers.in.tum.de/index.html.en
E-mail: ed.mut.ni|srebla#ed.mut.ni|srebla


Deadline January 05, interviews will be in February. The CS department at Saarland University has 4 open positions for a Tenure-Track Associate Professor.

This is an open call, so all subareas of CS can apply; "theory and algorithms" is specifically listed as one of the topics. German language skills are not required for the application. Candidates should have the willingness to learn German in the first few years.

The full announcement can be found here:

https://www.uni-saarland.de/fileadmin/user_upload/verwaltung/stellen/wissenschaftler/2019/Ausschreibungstext_final.pdf

Also contact ed.gpm.fni-ipm|amgnirbk#ed.gpm.fni-ipm|amgnirbk.


Deadline soon: The Department of Quantitative Economics of the School of Business and Economics at Maastricht University is looking for an Assistant Professor (on a tenure-track position) in economic theory, with special interest in one or more of the following areas: mathematical economics, mechanism design, game theory, or social choice theory.

Personal impression by Ulle Endriss (<ln.avu|ssirdne.ellu#ln.avu|ssirdne.ellu> To:ude.ekud|cosmoc#ude.ekud|cosmoc, Dec 8) of Economics in Maastricht is that they are
fairly open-minded when it comes to connections to Computer Science, so this post should be of interest to COMSOC.


Deadline 5th December 2019 for two postdoctoral positions at the University of Glasgow, working with Kitty Meeks and Jessica Enright on the EPSRC-funded project Multilayer Algorithmics to Leverage Graph Structure (MultilayerALGS). The two positions require slightly different expertise: for the first, we are looking for experience in random graphs and/or complex network models, and for the second the emphasis is on algorithmic graph theory and/or parameterised complexity. Candidates whose skills span the two positions are strongly encouraged to apply for both. Informal enquiries to Kitty Meeks (ku.ca.wogsalg|skeem.yttik#ku.ca.wogsalg|skeem.yttik<mailto:kitty.meeks@glasgow.ac.uk>) or Jessica Enright (ku.ca.wogsalg|thgirne.acissej#ku.ca.wogsalg|thgirne.acissej<mailto:jessica.enright@glasgow.ac.uk>) are welcome.

For more details and to apply, see https://www.jobs.ac.uk/job/BWG821/research-associate.


Deadline January 20. The Informatics Dept at Univ Bergen, Norway offers a 3—year postdoctoral research fellowship in parameterized complexity with emphasis on computationally feasible relations between directed graphs and consistency of logical theories. For details see \url{https://www.jobbnorge.no/en/available-jobs/job/176468/postdoctoral-research-fellow-position-in-informatics-logic-and-graph-theory} or contact Prof. Michael Fellows <on.biu|swollef.leahcim#on.biu|swollef.leahcim>.


Deadline Nov 8 or Nov 22 for Research Visit to Univ Bergen on the algorithmic aspects of automated theorem proving. Contact: Mateus de Oliveira Oliveira <moc.liamg|arievilo.suetam#moc.liamg|arievilo.suetam>.

*Requirements:*

1) The prospective visitor should have received a Ph.D. in computer science or mathematics and should currently be employed in a Postdoc or more senior position (anywhere on earth).

2) Visitors with either a strong background in theory or with a strong background in programming are welcome. Fields of interest include automated reasoning, automata theory, algorithms, proof theory, proof complexity theory, machine learning, artificial intelligence, etc.

3) Visitors are expected to have a genuine interest in working on algorithmic problems in the field of automated theorem proving, although previous work in this specific area is not a requirement.

*Application Process:*

Expressions of interest will start to be analyzed on *November 8*. Interested researchers are strongly encouraged to submit their expressions of interest before this date. Late submissions may still be considered until November 22, depending on disponibility.

The host will discuss a suitable project and visiting plan with selected prospective visitors. Short formal applications will be sent by the host, on the behalf of the visitors, to the SPIRE program, a strategic program from the University of Bergen aimed at supporting international research collaboration.

*Financial support:*
Successful applications will receive funding of up to 15000 NOK ( approx 1600 USD) per month to cover the following expenses.

1) Return flight/train tickets between the visitor's location and Bergen.
2) Accommodation.

Note: The cost of flight/train tickets will be reimbursed at the end of the stay. On the other hand, if the researcher prefers, accommodation can be booked and paid for directly by the university using the available funds.


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