POSITIONS AVAILABLE: Please put your contact details here if you have a position available. See below for several recent openings: Austria (Stefan Szeider at TU Vienna), Australia (Toby Walsh at NICTA), Czech Republic (Petr Hliney at Masaryk Univ), London (Gregory Gutin at Royal Holloway).
POSTDOC POSITIONS AT VIENNA UNIVERSITY OF TECHNOLOGY, AUSTRIA.
Postdoc positions are available at the Institute of Information Systems, Vienna University of Technology, Austria. The positions are supported by the European Research Council (ERC) Starting Grant "The parameterized complexity of computational reasoning" held by Stefan Szeider and are available for a duration between one year and two and a half years.
Further information on the project, the job requirements, and the application procedure can be found at the project's web-site:
http://www.kr.tuwien.ac.at/drm/szeider/complex-reason
TWO OR MORE POSITIONS FOR RESEARCHERS AT NATIONAL ICT AUSTRALIA (NICTA).
At least 2 positions available for researchers on the interface of optimization, social choice
and machine learning.
Competitive Salary: 85K-110K Australian, incl. superannuation.
Duration: Up to 3 years in the first instance.
Research project: Optimisation, Preferences and Mechanism Design in Social Networks.
NICTA (National ICT Australia) is Australia's Information and Communications Technology (ICT) Research Centre of Excellence. Our primary goal is to conduct world-class research generating fundamental scientific results with an impact on society. NICTA aspires to be one of the world's top ten ICT research centres by 2020.
Applications are invited for researcher positions within the Optimisation Research Group, to work with Toby Walsh and other members of the group in Sydney.
We seek outstanding researchers who have recently received their PhD to be part of a large, world-class optimisation group. The researchers will join a new research project on the interface of the optimisation, machine learning, and social networks. Social networks are transforming the way that people and businesses interact. However, they throw up many challenging new optimisation problems. How do we best combine the preferences of multiple users? How do best learn these preferences? How do we design mechanisms that use
these preferences which encourage truthful behaviour yet generate outcomes which are (close to) optimal? Can we exploit the structure of the social network?
Candidates should have a PhD in computer science, computational aspects of economics, operations research, or related areas, with a strong background in artificial intelligence, social choice, operations research, machine learning or mechanism design. Candidates should have a strong theoretical background, as well as programming skills and experience in using optimisation technologies.
Please email resume, motivation letter, short research statement, and names of 3 referees to:
Toby Walsh (ua.moc.atcin|hslaw.ybot#ua.moc.atcin|hslaw.ybot)
POST DOC POSITION IN THE FACUTLY OF INFORMATICS, MASARYK UNIV, CZECH REPUBLIC
http://www.fi.muni.cz/~hlineny/res-en.html#collabs
New postdoc research position at FI MU Brno, CZ; available since 1.7.2012 for 3 years in the areas of Structural graph theory and Parameterized algorithms.
• Salary about 55000 CZK per month. Must have received Ph.D. between 28.3.2008 - 1.7.2012, start by 1.9.2012, and be fluent in English. Teaching load around 3-5 hours per week (quite mild).
Apply by 31.3.2012, informally send your inquiry directly to Petr Hlineny
Petr Hlineny [zc.inum.if|ynenilh#zc.inum.if|ynenilh]
BERGEN, NORWAY
Daniel Lokshtanov will be looking for post-docs for when he returns to Univ. Bergen. Contact Daniel for more information.
LONDON, UK – PhD STUDENT
PhD position in Department of Computer Science, Royal Holloway,
University of London
I am looking for a PhD candidate with a strong mathematical background interested in doing PhD in the area of parameterized algorithms and complexity, see http://fpt.wikidot.com/ and
http://www.cs.rhul.ac.uk/home/gutin/pppublications.html
Due to funding limitations, mainly candidates from EU countries will be considered.
The PhD student will start in mid-September 2012 and will be supervised by Prof. Gregory Gutin. To express your interest please write to Gregory Gutin, ku.ca.luhr.sc|nitug#ku.ca.luhr.sc|nitug, as soon as possible.
POSTDOC POSITIONS AVAILABLE IN PARAMETERIZED COMPLEXITY & ALGORITHMS (BUDAPEST, HUNGARY)
Postdoc positions are available at the Computer and Automation Research Institute (Hungarian Academy of Sciences), Budapest, Hungary, supported by the European Research Council (ERC) Starting Grant PARAMTIGHT: "Parameterized complexity and the search for tight complexity results" held by Dániel Marx. The goal of the project is to systematically push the boundaries of algorithmic and hardness results, mostly in the framework of parameterized complexity, with the aim of obtaining tight results that give an optimal understanding of the complexity of a problem.
The candidates should have a PhD degree in Computer Science or related area; research experience at postdoctoral level is of advantage. A successful candidate should have excellent knowledge of algorithms and/or complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Strong background in graph theory, combinatorics, constraint satisfaction, approximation, or kernelization is of advantage.
The earliest starting date is January 2012. The review of applicants will begin immediately and continue until the positions are filled. Applications received by 1 November 2012 will receive full consideration. Informal inquires by email ( dmarx at cs dot bme dot hu ) are welcome.
Posted 21 Feb at DMANET: Research Fellow, University of Warwick
Fixed term contract for 24 months
You will research in the area of Combinatorics and Graph Theory, directed by Vadim Lozin
of the Warwick Mathematics Institute and supported by EPSRC. You will receive support
for computing resources and conference travel and may have at most a light teaching load.
You will have experience and strong research potential in a number of the following
research areas: structural, algorithmic and extremal graph theory, graph classes,
graph width parameters (tree-width, clique-width), the theory of partially ordered sets.
Further details and application procedure can be found at
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job23925.html
**
Announcement made February 2011. Write immediately if interested. Avaliable: PhD position in Department of Computer Science, Royal Holloway, University
of London
We are looking for a PhD candidate with a strong mathematical background
interested in doing PhD in the area of parameterized algorithms and
complexity, see http://fpt.wikidot.com/ and
http://www.cs.rhul.ac.uk/home/gutin/pppublications.html
Due to funding limitations, mainly candidates from EU countries will be
considered.
The PhD student will start in mid-September 2011 and will be supervised by
both Prof. Gregory Gutin and Dr. Anders Yeo. To express your interest please
write to Gregory Gutin, ku.ca.luhr.sc|nitug#ku.ca.luhr.sc|nitug, as soon as possible.
Applications Due 2/28/2011 Postdoctoral Researcher, University of Warwick
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job16052.html
Applicants sought for a postdoctoral position in connection with
an EPSRC grant EP/G064679/1 "Advances in Sublinear Algorithms"
(PI: Prof Artur Czumaj).
We are looking for highly qualified candidates with a PhD degree (or
expecting to get one very soon) in combinatorics, discrete mathematics,
theoretical computer science, or related fields.
The main focus of the post is on the research in the broadly understood
area of design and mathematical analysis of sublinear algorithms,
including research in property testing and combinatorics, and
sublinear-time approximation algorithms for combinatorial and optimization
problems.
The position is affiliated with the Foundations of Computer Science
Research Group (http://www.dcs.warwick.ac.uk/research/focs/) at
the Department of Computer Science and the Centre for Discrete Mathematics
and its Applications DIMAP (http://go.warwick.ac.uk/dimap/) at the
University of Warwick.
The post is Fixed Term Contract for 20 months with likely possibility of
extension.
GBP 27,319 - GBP 35,646 pa (appointments are usually made on the first point
of the salary range)
Closing date for receipt of applications: Monday, February 28, 2011.
To apply, please follow the instructions on the official advert web page
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job26484.html.
For any further information, please contact
Artur Czumaj (http://www.dcs.warwick.ac.uk/~czumaj/).
** Due February 28, 2011 Braunschweig Institute of Technology, Germany**
From: "Max Pagel" <ed.sb-ut|legap.m#ed.sb-ut|legap.m>The Department of Computer Science at Braunschweig Institute of Technology
(http://www.tu-bs.de) in Germany is looking for a candidate with a doctoral
degree who has a solid background in algorithms and optimization.
Duties combine teaching in English with coordinating international programs for
our students. Therefore, proficiency in English is a must, and sufficient
knowledge of German desired. In addition, candidates will have the opportunity
to participate in a variety of research activities. Pay is according to the
German bracket "TV-L 13" (between 3060 and 3940 Euros gross per month,
depending on previous experience and employment). The position is open and can
be filled as soon as possible. Funded with student fees, the initial term is
two years; renewal is possible, provided that an extension will be approved
by the relevant bodies.
We are looking for applicants with an above-average degree and a doctorate in
mathematics or computer science, who have a solid knowledge in optimization and
algorithms, an interest in and a capability for communication, teaching and
networking, who feel they could benefit from an interesting scientific
environment with a wide range of scientific work.
We are offering an opportunity to enhance and deepen the teaching and
scientific record as well as the participation in exciting interdisciplinary
projects that span all the way from basic research in algorithms to its
practical and technical application. The successful candidate will benefit
from the infrastructure of the Algorithmis Group within the Department of
Computer Science, and thus be part of a motivated team that maintains various
interdisciplinary and international contacts and activities.
Among applicants with equal qualifications, handicapped persons will be given
preference. The Braunschweig Institute of Technology is an equal-opportunity
employer and encourages women to apply.
Please send your detailed application by
** February 28, 2011 **
with the usual documents to:
Prof.Dr. Sandor Fekete
Technische Universitaet Braunschweig
Department of Computer Science
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany
fax: +49 531 391 3109
Electronic applications are welcome. If there are questions, please
contact Max Pagel via mail (m.pagel "at" tu-bs.de) or
phone (+49 531 391 3116).
*
Due 15 March 2011
Bioinformatics at Jena, Germany PostDoc and also Junior Professorship. Check the website.
The Chair for Bioinformatics, Institute of Computer Science at the Friedrich-Schiller University Jena offers the following position:
PostDoc/PhD student as a research associate (Wissenschaftliche/r Mitarbeiter/in)
This position is part of the project "Parameterized Algorithmics for Bioinformatics", funded by the Deutsche Forschungsgemeinschaft. Scope of this project is to develop efficient algorithms for NP-hard bioinformatics problems, in particular using parameterized algorithmics. Focus of research is, besides developing such algorithms, also their implementation, evaluation, algorithm engineering, and biological case studies.
http://bio.informatik.uni-jena.de/research/#pabi
http://bio.informatik.uni-jena.de/publications/?sort=theme#fpt
Applicants for this project must have or be about to obtain a Master's degree or a qualification equivalent to the German Diploma in bioinformatics, computer science, or mathematics. The applicant should have an excellent background in algorithmics. Introductory course level knowledge or better in biology and molecular biology is required. Good programming skills are required, and experience in software design would be helpful.
Salary is according to Entgeltgruppe 13 TV-L, either a full position (for PostDocs) or 3/4 position (for PhD students). The position is temporary.
Handicapped applicants will be given preference in case of equal qualifications.
Please send your application with the usual documents (CV, list of publications, copies of certificates, in paper or preferably via email) until March 15th 2011 to:
Prof. Dr. Sebastian Böcker
Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany
http://bio.informatik.uni-jena.de/jobs/mitarbeiter-pabi/
Am Lehrstuhl für Bioinformatik, Institut für Informatik der Friedrich-Schiller Universität Jena ist zum nächstmöglichen Zeitpunkt die Stelle eines/r
Wissenschaftlichen Mitarbeiters/in (Post-Doktorand oder Doktorand)
zu besetzen. Die Stelle ist Teil des von der DFG geförderten Projekts Parametrisierte Algorithmik bioinformatischer Probleme. Im Rahmen dieses Projektes sollen effiziente Algorithmen, insbesondere aus dem Bereich der parametrischen Algorithmik, für NP-schwere Probleme der Bioinformatik entwickelt werden. Fokus der Forschung sind, neben der Entwicklung solcher Algorithmen, auch ihre Implementierung, Evaluierung, Algorithm Engineering und biologische Fallstudien.
http://bio.informatik.uni-jena.de/research/#pabi
http://bio.informatik.uni-jena.de/publications/?sort=theme#fpt
Bewerber müssen über ein abgeschlossenes Diplom- oder Master-Studium in den Bereichen Bioinformatik, Informatik oder Mathematik verfügen, oder ein solches Studium in nächster Zukunft abschließen. Notwendig sind exzellente Kenntnisse in Bereich Algorithmik sowie Grundkenntnisse in den Bereichen Biologie und Molekularbiologie. Die Projektarbeit erfordert gute Programmierkenntnisse, Erfahrung im Bereich Software Design ist wünschenswert.
Die Vergütung erfolgt gemäß Entgeltgruppe 13 TV-L, es handelt sich um eine volle Stelle (für Post-Doktoranden) bzw. eine 3/4 Stelle (für Doktoranden). Die Stelle ist befristet. Die Möglichkeit zur wissenschaftlichen Qualifikation wird geboten.
Beiträge zur Lehre der Studiengänge Bioinformatik (Diplom, B.Sc., M.Sc.) werden in geringen Umfang erwartet.
Schwerbehinderte werden bei gleicher Eignung, Befähigung und fachlicher Qualifikation bevorzugt berücksichtigt.
Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Publikationsliste, Zeugniskopien) sind bis zum 15.03.2011 (in Papierform oder vorzugsweise elektronisch) einzureichen bei:
Prof. Dr. Sebastian Böcker
Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany
Notice sent December 2010 + Three PhD positions in Amsterdam+
The Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam currently has three opening for PhD positions, starting in September 2011:
http://www.illc.uva.nl/NewsandEvents/newsitem.php?id=3688
One of the (many) eligible topics is computational social choice (candidates interested in COMSOC should apply for the "Faculty of Science" position, deadline 15 March 2011).
If you know of (or are yourself) a strong candidate who might be interested in joining the ILLC as a PhD student working on COMSOC or a related topic, please do not hesitate to get in touch.
All the best,
Ulle
— Ulle Endriss http://www.illc.uva.nl/~ulle/
Institute for Logic, Language & Computation (ILLC)
University of Amsterdam Tel: +31 (0)20 525 6511
Postbus 94242 Fax: +31 (0)20 525 5206
1090 GE Amsterdam (NL) Email: ln.avu|ssirdne.u#ln.avu|ssirdne.u
University Luebeck, Germany. PhD scholarship for the project “Computational analysis of RNA structure “
The Graduate School of Computing in Medicine and Life Sciences (funded by Deutsche Forschungsgemeinschaft, DFG, and the German Government within the German university excellence program) at the University of Luebeck is now offering a PhD scholarship for the project “Computational analysis of RNA structure “ in the research field of Computing in Structural and Cell Biology.
The Project: We propose to develop computer-based tools for the automated theoretical design of gene interruption and to implement suitable algorithms. The development will be based on novel machine learning methods for motif detection and classification.
PhD scholarship amounts to 1250 € per month. Students with a master’s degree (or its equivalent) in computer science, mathematics or engineering are invited to apply for admission. The application deadline is January 15, 2009. In certain cases, students must submit, as part of their application, the results of one of the acknowledged language tests to prove their English proficiency.
For further information, please visit our website at www.gradschool.uni-luebeck.de. Do not hesitate to contact us if you have any further questions via email: management[ at ]gradschool.uni-luebeck.de before sending your application.
Closing date: January 15, 2009
LECTURESHIP IN MATHS; Discrete Maths is one of
the areas we're most interested in (see the link below). Department of Mathematics
Royal Holloway, University of London, Egham, Surrey TW20 0EX, United Kingdom.
http://www.rhul.ac.uk/Personnel/Ads/X0309-0586.html. Contact Prof. Gregory Gutin.
ASSISTANT PROFESSOR, W1-Junior Professiorship, tenure track in TCS at
the Department of Computer Science of the Universität Karlsruhe (TH).
http://www.ira.uka.de/I3V_HOME/STELLEN/W1_Theoretical_CS_en.html. Complement areas of: Cryptography/Security, Algorithms, Formal Methods.
Dean of the Fakultät für Informatik
email: ed.aku.ari|tanaked#ed.aku.ari|tanaked
The application deadline is 20th of April 2009. For further information please contact Dr. Jörn Müller-Quade (Phone: +49 - 721 / 608 - 4327) or Prof. Dr. Ralf Reussner (Phone: +49 - 721 / 608 - 5993).
POSITIONS WANTED: If you are graduating in the next several months—please put your details here if you are job hunting. Put your contact details and possibly a link to your website, advisor, etc.
