JOBS: Positions Available and People Looking

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

Posted August 2016
Tenure Track Assistant Professor Algorithms (0,8-1,0 fte)
Department of Information and Computer Science, Utrecht University

Job description
The Department of Information and Computer Science of Utrecht University, the Netherlands,
is looking for an Assistant Professor (Universitair Docent - UD) in the field of algorithms and complexity,
in particular parameterized algorithms. You have expertise and experience in scientific teaching and
research in algorithms. You will teach in the Bachelor’s and Master’s programmes of the department
in courses related to your expertise. You will be expected to develop an independent research line in
this specific field, in cooperation with the other members of the department.

The tasks include:
- Carry out scientific research in the field of algorithms and complexity, in particular in the area of parameterized algorithms;
- Supervising PhD students and acquiring research funding;
- Developing and teaching courses, especially within the Master’s programme Computing Science and
the Bachelor’s programme Computer Science;
- Supervising internships and theses;
- Organizational activities within the department and/or faculty.

* We are looking for candidates with a PhD, preferably in the above mentioned areas.
* Experience in performing (post)graduate teaching within a university setting is desired.
* The candidate shall have published on the aforementioned areas in national and international conferences and/or journals.
* Well-developed teaching skills and command of English in speaking and writing is a requirement.

Candidates who prefer part-time employment are also invited to apply by specifying the desired part-time ratio.
We aim to employ more women in areas where they are underrepresented.
Female candidates are therefore especially invited to apply.

Additional information about the vacancy can be obtained from: Prof Dr Hans Bodlaender; ln.uu|rednealdob.l.h#ln.uu|rednealdob.l.h, +31 (30) 253 4409.
As part of the selection procedure, the candidate is expected to give an outline of his/her research plans in a written report and an oral presentation.

To apply please attach a letter of motivation, curriculum vitae and (email) addresses of two referees. Application deadline is September 12, 2016.
To apply, please click the application button, reachable via this link:,55523865,0,0,0,845492,0,0,0,0,0,0,0,0,0,0,0&PortalID=4124&preview=1&VacatureID=845492

Posted 15 April 2016
Department of Computer Science, Faculty of Informatics, Masaryk
University, Brno CZ,,
announces an open call for special PhD positions starting from September 2016,
in the following particular area:

  • Topic: Structural Graph Theory and Algorithmic Metatheorems

Supervisor: Prof. Petr Hliněný

The perspective student shall work on width and depth parameters
(such as tree-width and tree-depth and other) of graphs and
other relational structures, and apply the theoretical results
in algorithmic metatheorems on restricted graph classes.
The focus shall be on investigation of sparse graph classes
and on complementary “dense” depth parameters such as the
new shrub-depth, and on metatheorems for problems formulated
in FO logic. Prior introductory knowledge of structural graph
theory, logic and parameterized complexity is welcome.
See also

General information
Perspective PhD students are expected to show their research background
and skills in the area of the selected PhD topic. They should also be
proficient in English; knowledge of Czech is NOT necessary.

See also this link for more information and other PhD topics:
The deadline for application is June 1, 2016.

The PhD position is funded with a stipend of net value 20000CZK per
month, which is approximately 750Eur and is on the level of an average
net salary in the Czech Republic. The stipend is granted to successful
applicant for the first 2 years, with an expected renewal (after an
evaluation) for another 2 years. The total length of study is 4 years.

Applicants are strongly advised to contact their perspective supervisor
for more specific details, well ahead of the deadline.
Petr Hlineny <zc.inum.if|ynenilh#zc.inum.if|ynenilh>
FI MU Brno, CZ

Posted 9 April 2016.

Assistant Professor in the
department of Computer Science at the UPR.
Contact: Professor Mariano Marcano
Department of Computer Science
UPR— Río Piedras
Tel. (787) 764-0000 (Ext. 88365)
Fax. (787) 773-1717 <>

Posted 6 April 2016
6-year position at Technische Universität Berlin
Faculty IV - Electrical Engineering and Computer Science
Department of Software Engineering and Theoretical Computer Science

offers an open position of a

Junior professor - salary grade W1 -
in the field of "Efficient Algorithms".

Reference number: IV-68/16
(starting at the earliest possible / to be filled as soon
as possible for a period of 3 years;
an extension of 3 more years is possible after successful evaluation /
closing date for applications 28/04/16)

Working field: The position includes teaching duties in the Bachelor and
Master programs "Computer Science", "Computer Engineering", and
"Information Systems Engineering and Management". In addition, an active
participation in Berlin's algorithmic research (in particular concerning
successful grant application, cooperations, committee work, regular
publications) is expected.

Requirements: Candidates must meet the requirements of the Berlin Higher
Education Act (§102a BerlHG)
(the information leaflet will be forwarded upon request), including a
completed academic education, qualified achievements in research,
usually proven by an outstanding doctoral thesis (PhD),
educational and didactic competences. We are seeking a scientist with
a PhD and expertise in the theoretical study of algorithms or a closely
related area. Applicants should have a strong scientific track record
witnessed by publications in peer-reviewed journals
and conferences related to algorithmic research.
Applicants should be experts in one of the following research areas or
in a related field:

  • algorithm engineering,
  • algorithms for massive data (in particular streaming algorithms),
  • algorithmic game theory,
  • approximation and online algorithms,
  • data structures,
  • graph algorithms,
  • parameterized algorithms,
  • randomized algorithms.

In addition, knowledge in one or more areas of applied computer science
is favourable, for example in

  • bioinformatics,
  • computational social choice,
  • data mining,
  • machine learning,
  • social network analysis.

Technische Universität Berlin strives to increase the proportion of
women in research and teaching and therefore
strongly encourages qualified female researchers to apply. Qualified
individuals with disabilities will be favored.
Technische Universität Berlin is a certified family-friendly higher
education institution, and our Dual Career Service offers assistance to
you and your family when relocating to Berlin.

Please send your written application with the reference number and the
usual documents (including a CV listing publications, teaching
experience etc., copies of academic degrees,
as well as copies of up to five selected publications)
until 28/04/2016 to

Technische Universität Berlin - Der Präsident -, Dekan der Fakultät IV,
Sekr. MAR 6-1, Marchstr. 23,
D-10587 Berlin, Germany
or by email to ed.nilreb-ut|nhah.acnaib#ed.nilreb-ut|nhah.acnaib

Please send copies only. Original documents will not be returned.
The vacancy is also available on the internet at

Postdoctoral position in Sydney, Australia

A research associate position is available at the University of New South Wales.

You will join the UNSW Algorithms group and conduct research with Serge Gaspers in the areas of exact algorithms, parameterized complexity, approximation algorithms, computational social choice, and/or algorithmic game theory. Pursuing your own research agenda and collaborating with other local groups (such as the Data61 Algorithmic Decision Theory group and the Sydney Algorithms and Computing Theory group at the University of Sydney) is possible and encouraged. Travel funding for 2-3 conference/workshop/research trips is available.

Duration: 1 year; extension possible subject to available funding
Start date: 1 July 2016 (negotiable)
Salary: AUD 87,735 per year plus 9.5% superannuation (Level A, step 6)

To apply, please send an email with subject "[Postdoc application] <first name> <last name>" to <ua.ude.wsnu.esc|gegres#ua.ude.wsnu.esc|gegres> and attach
— a short research statement,
— a detailed curriculum vitae,
— one or two reference letters (these can also be sent separately by the referee(s) to the same email address with the same subject), and
— contact details of one or two additional references.
The closing date for applying is 14 March 2016.


Applications are invited for a

Postdoctoral position in Algorithms and Parameterized complexity

hosted by Danny Hermelin at the Ben Gurion University of the Negev (BGU)
which is located in Be'er Sheva, Israel. The university is the fastest
growing university in Israel, located right in the middle of the fastest
developing city in Israel . BGU carries out internationally acclaimed
research and offers an innovative and vibrant scientific environment..

All positions are full-time and can be started as soon as possible for the
applicant. The salary is competitive and depends on the applicant's
qualification. The contract will be limited to one or two years with the
possibility of extension.

Applicants should have a theoretical/mathematical background and an
interest in at least one of the following topics:
— parameterized complexity and algorithms;
— approximation algorithms;
— graph algorithms and theory;
— scheduling and related areas;
— mathematical optimization;

All applicants should have an excellent first academic degree in
mathematics, computer science or a related discipline. Applications should
include a detailed CV, a copy of a PhD thesis, a brief statement of
research interests, and a list of publications. Please also mention names
and contact details of two or three references — preferably one from the
thesis advisor.

For further information, please contact Danny personally via email:||nilemreh or at moc.liamg|nilemreh.ynnad#moc.liamg|nilemreh.ynnad.

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