POSITIONS AVAILABLE: Please put your contact details here if you have a position available.
POSTDOC POSITION AVAILABLE: In Algorithms and Parameterized Complexity (BEN GURION UNIVERSITY, ISRAEL)
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
For further information, please contact Danny personally via email:
li.ca.ugb|nilemreh#li.ca.ugb|nilemreh or at moc.liamg|nilemreh.ynnad#moc.liamg|nilemreh.ynnad.
POSTDOC POSITIONS AVAILABLE IN PARAMETERIZED COMPLEXITY & ALGORITHMS (BUDAPEST, HUNGARY)
One-year postdoc positions are available at the Institute for Computer Science and Control (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 (or expect to have shortly) 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 review of applicants will begin immediately and continue until the positions are filled. The ideal starting date is January 1, 2016. Applications received by September 15, 2015 will receive full consideration. To apply, send a CV and a research statement by email to Dániel Marx ( dmarx at cs dot bme dot hu ) and arrange two letters of recommendation to be send to this address. Questions and informal inquiries are welcome.
12 months postdoctoral position at LIRMM (Laboratoire d’Informatique, Robotique et Micro ́electronique de Montpellier – CNRS, University of Montpellier, France)
in the Algorithms, Graphs and Combinatorics research group. The position is supported by the NumEV Laboratory of Excellence (Digital and Hardware Solutions, Environmental and Organic Life Modeling – www.lirmm.fr/numev), which aims at rallying mathematics, computer science, physics, systems around the objective of tackling organic life, health and environmental issues. It supports multi-disciplinary projects that aim at producing remarkable scientific results, highlighted in high- impact publications or in valuable applications.
The project. This post-doctoral fellowship pertains to the algorithm and computation generic axis of NumEV. More specifically, the topic of interest is to explore the tractability of and to develop combinatorial solutions for clustering / outlier detection problems. These problems are central to biological data processing (comparative genomics, phylogenetics…) From the point of view of appli- cations, heuristic approaches and statistical methods often – but not always – return satisfactory solutions. The project aims at developing combinatorial algorithms to compute accurate solutions with performance guarantees and to compare their performance with heuristics and/or statistical methods.
Project coordinators. Christophe PAUL from AlGCo research group from LIRMM is leading re- search on graph algorithms and parameterized complexity. Celine Scornavacca from the PME (Phy- logeny and Molecular Evolution) research group from I-SEM (Institut des Sciences de l’Evolution de Montpellier – CNRS, University of Montpellier) is an expert on computational biology.
Candidates and applications. We are looking for a young researcher specialized in combinatorial algorithms for hard problems (parameterized algorithms, kernelization, approximation algorithms…). The candidate should have strong expertise on combinatorial algorithms and interest in bridging algorithmic theory to applied problems. Skills in modeling and/or programming would be welcomed. The position is to start before December 2015 (a small delay may be negotiated).
Application deadline is June 21st, 2015. Please send an email containing : • a CV,
• a cover letter, and
• two references.
to rf.mmril|luap#rf.mmril|luap and rf.2ptnom-vinu|accavanrocs.enilec#rf.2ptnom-vinu|accavanrocs.enilec.
Postdoc position in Theoretical Computer Science in Sydney, Australia
We are advertising a 24-month postdoctoral research fellowship in theoretical computer science shared between University of Sydney and University of New South Wales, Australia. The expected start date is September 2015.
The successful applicant will conduct research on algorithms with Serge Gaspers, Joachim Gudmundsson and Julian Mestre in the USYD SACT research group and UNSW Algorithms group. The aim will be to design effective algorithms in the areas of approximation algorithms and parameterized complexity.
We are looking for outstanding PhD graduates with a track record in the broad field of algorithms, ideally with an emphasis on combinatorial optimization, parameterized complexity or computational geometry. Experience in experimental algorithmics is an advantage but not essential.
Salary Package: AUD 85,161 — AUD 91,520 pa plus superannuation.
Your application must include
- a research statement
- a detailed curriculum vitae
- contact details of three references
To apply, please use the following form. The closing date for applying is 31 March 2015.
Postdoc position in Parameterized Complexity at Vienna University of Technology, Austria
There is an opening for a fully funded postdoc position for the duration of two years at the Vienna University of Technology within an active research group and a stimulating environment in an attractive city.
The position is within the research project "Exploiting New Types of Structure for Fixed Parameter Tractability" which is funded by the Austrian Science Fund (FWF). The gross salary p.a. is approximately EUR 49.500. In addition, there are ample funds for traveling.
The candidate should have (or expect to have shortly) 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, satisfiability, or constraint satisfaction is of advantage.
The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references. The application should also mention possible starting dates and should be sent to jobs (at) ads (dot) tuwien (dot) ac (dot) at.
The review of applicants will begin immediately and continue until the position is filled. Applications received by February 28, 2015 will receive full consideration. Informal inquires by email (Stefan Szeider, stefan (at) szeider (dot) net) are welcome.
PhD Position in Graph Algorithms sponsored by the Hong Kong PhD Fellowship Scheme. Supported by Research Grants Council (RGC) of Hong Kong, the Hong Kong PhD Fellowship (HKPF) program looks for outstanding Ph.D. students. The goal of the project is to systematically study the algorithmic techniques for graph modification problems, and the only requirement is excellent mathematical skills. For successful applicants, we provide
monthly stipend of HK$20,000 + department scholarship of HK$10,000 (about EUR 3,000/m in total), as well as travel grants for three years.
The deadline for submitting the application to HK government is December 1, 2014. The departmental internal review of applicants will begin immediately, and only applications received by November 1, 2014 will be guaranteed full consideration. An application should contain the CV (with the contact information of at least two referees), a research statement, and the master thesis (if applicable), and should be addressed to kh.ude.uylop|oac.nixiy#kh.ude.uylop|oac.nixiy. Informal inquires are also welcome at the same address.
Research Associate, University of Newcastle, Australia. Applications close: Wednesday 05 March 2014. Develop a research program using supercomputer-based approaches together with memetic algorithms, to address key areas in graph optimization. See: http://www.seek.com.au/job/25987255. For more information, email: ua.ude.eltsacwen|otacsoM.olbaP#ua.ude.eltsacwen|otacsoM.olbaP
Date:13 July 2013, PhD candidate 'Computationally realistic architectures for a Bayesian brain'
Donders Center for Cognition, Radboud University Nijmegen, The Netherlands
This PhD project aims to advance our understanding of the computational foundations of probabilistic inference and learning in the brain. According to current theory, even only approximately computing probabilistic inferences is computationally intractable for situations of real-world complexity. This is in marked contrast to the efficiency of inference and learning as done by the brain in practice. The objective of the project is to resolve this paradox by developing a new theory that explains the efficiency of inference and learning as done by the brain in practice. Using an innovative approach that combines formal modeling, parameterized complexity analysis and computer simulation, we aim to identify parameters of a computational architecture that can make a probabilistic brain computationally efficient. The project will furthermore involve conceptual (philosophical) analysis to derive the implications of this new theory for current debates in the philosophy of cognitive science.
Details of this vacancy can be found here. Deadline for applications is 13 July 2013; the project starts on 1 September 2013 and lasts four years. Part of the project is a three month research visit to Dr. Todd Wareham, Memorial University of Newfoundland, Canada.
Date: 9 July 2013, Post-Doc RA, Eng and Computing Sciences, Durham Univ, UK
Parameterized Complexity and/or intersection graphs.
Work with Dr. George Mertzios on EPSRC-funded “Algorithmic Aspects of Intersection Graph Models”. The post is for 1 year from the 1st October 2013, or later by mutual agreement. (see http://www.dur.ac.uk/george.mertzios/)
More details at: https://ig5.i-grasp.com/fe/tpl_durham01.asp?newms=jj&id=80716
and details of the grant are available from:
Further information about the Algorithms and Complexity research group (ACiD) at Durham is available on http://www.dur.ac.uk/algorithms.complexity/
An overview of the post can be also found at:
CONTACT: Dr. George B. Mertzios
2 June, 2013 Act Quickly. 3-yr Post-doc RA in Engineering and Computing Sciences, Durham University, UK
Parameterized complexity: structural and algorithmic graph theory, under guidance of Dr Daniel Paulusma and Prof Iain Stewart on EPSRC "Detecting Induced Graph Patterns".
CONTACT: Daniel Paulusma
Tel: +44 (0) 191 3341720
June 7, 2013. Warsaw Center for Mathematics and Computer Science (WCMCS) has PhD fellowships. See http://wcmcs.edu.pl/node/38
Marcin Kamiński (lp.ude.wumim|kjm#lp.ude.wumim|kjm)
Łukasz Kowalik (lp.ude.wumim|kilawok#lp.ude.wumim|kilawok)
Research Fellow, Department of Mathematics, University of Warwick
Fixed Term Contract for 12 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.
You must be available to take up this post on or before 31 August 2013.
For further details and to apply use the following link:
The closing date/time for applications is midnight (British time) at the end of Wednesday 15 May 2013.
PhD position at NICTA and UNSW, Sydney, Australia. In the context of a collaborative research project between National ICT Australia (NICTA) and The University of New South Wales (UNSW), applications are sought for the position of one PhD candidate to work on the computational complexity of resource allocation problems, with a focus on parameterized complexity. The successful candidate will be jointly supervised by the project leaders, Prof Toby Walsh at NICTA and Dr SergeGaspers at UNSW. She/he will be part of the Algorithmic Decision Theory group, http://www.cse.unsw.edu.au/~tw/adt/
To be eligible for this NICTA scholarship the candidate needs to be admissible to UNSW as a research candidate within the School of Computer Science and Engineering (CSE). The expected start date is Semester 2 in 2013, i.e., around the end of July 2013. More information on the NICTA scholarships is available at http://www.nicta.com.au/nictascholarshipunsw
Interested applicants are invited to send an expression of interest to Prof Toby Walsh <ua.moc.atcin|hslaW.yboT#ua.moc.atcin|hslaW.yboT> and Dr Serge Gaspers <ua.ude.wsnu.esc|gegres#ua.ude.wsnu.esc|gegres> including a CV, a research proposal (around 500 words), and recent transcripts by 15 February 2013. Please also organize for one reference letter/email to be sent to the same email addresses. More details about the research topic are available here.
University of Queensland for a Postdoctoral Research Fellow Level A. This is a full-time, fixed-term (1 – 1.5 yrs) appointment to carry out research on an ARC funded project led by Dr Barbara Maenhaut of The University of Queensland. The project involves collaboration with industry partner Jeppesen Rail Logistics and Terminals in research on the development of time-dependent networks for use in algorithm testing and software design. More details are available at:
Closing date is 15 Feb 2013. Please pass this information on to anyone who might be interested.
February 17, 2013 deadline: Postdoc position in Structural graph theory and Parameterized algorithms. FI MU Brno, CZ.
A postdoc research position (for details http://www.fi.muni.cz/~hlineny/postdoc.html) will be available with start date June 1 - Sept 1, 2013, for the period of 2 years at the Faculty of Informatics of Masaryk University in Brno, Czech republic. Salary 50000CZK gross (with cheap living), light teaching load in English.
Contact: Petr Hliněný, hlineny(at)fi.muni.cz, http://www.fi.muni.cz/~hlineny/postdoc.html
December 1, 2012. 2 PhD positions in Parameterized Complexity Research Assistant (100% TV-L 13) Dept Software Engineering and Theoretical Computer Science, Technische Universität Berlin. DFG-funded Junior Research Group:
"Efficient preprocessing for hard problems" led by Stefan Kratsch.
Research on parameterized complexity and kernelization, and related topics.The main focus of research is on rigorous study of polynomial-time preprocessing for hard combinatorial problems.
Both positions are fulltime for an intended length of 3 to 4 years, with an initial contract period of 2 years. No teaching,
positions are available immediately. Starting salary is roughly 1800 Euros net (includes mandatory health insurance; 3000 Euros gross).
The junior research group is associated with the "Algorithms and
complexity" group chaired by Prof. Rolf Niedermeier. (http://www.akt.tu-berlin.de/) The group currently consists of 9 further PhD students and postdocs and is hosting visiting professor Gerhard Woeginger from TU Eindhoven.
Candidates must hold a master's degree (or equivalent) in computer science, mathematics or a related area and should have a very good knowledge about algorithms and complexity. Background in parameterized complexity…
Contact: Dr. Stefan Kratsch, ed.gpm.fni-ipm|hcstarks#ed.gpm.fni-ipm|hcstarks
Until December 7th 2012.
Two PostDocs/PhD students as research associates in Bioinformatics, Institute of Computer Science at the
Friedrich-Schiller University Jena. The positions are part of the project "Parameterized Algorithmics for Bioinformatic", funded by the Deutsche Forschungsgemeinschaft. Develop efficient algorithms for NP-hard bioinformatics problems, in particular using parameterized algorithmics. Additionally, develop, implement algorithms, algorithm engineering, and biological case
studies. Other methods for solving NP-hard optimization problems, such as Integer Linear Programming, will also be considered.
Requirements for PhD students: 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, good background in algorithmics.
Introductory knowledge in biology and molecular
biology. Good programming skills are required, and
experience in software design would be helpful.
Requirements for Postdocs: Applicants must have a PhD
in bioinformatics, computer science, or mathematics, research experience in developing parameterized algorithms, preferably for bioinformatics problems, documented by publications in scientific journals or conference proceedings.
Salary is according to Entgeltgruppe 13 TV-L, either a full position (for PostDocs) or 3/4 position (for PhD students). These positions are temporary appointments.
Please send your application with the usual documents (CV, list of publications, copies of certificates, preferred via email) until
December 7th 2012 to: Kathrin Schowtka, Friedrich-Schiller-Universität Jena, Institut für Informatik, Lehrstuhl für Bioinformatik.
Starting February 2013 for 3 years. Two Positions Research Assistants, Royal Holloway, University of London, Department of Computer Science Work with Gregory Gutin, David Cohen and Jason Crampton. developing,analysing and implementing such algorithms. Wanted: good working knowledge of
parameterized algorithmics. Basic knowledge of constraint satisfaction and exponential algorithms is desirable. The second Research Assistant must have significant experience in algorithms engineering, and have interest in working on problems motivated by the
information security industry. Basic knowledge of constraint satisfaction and parameterized algorithms is desirable.
These are full time posts available from the 1st February 2013 or as soon as possible thereafter for a fixed term period of three years. View and apply online at https://rhul.engageats.co.uk.
Deadline November 11, 2012:
http://www.jobbnorge.no/job.aspx?jobid=87512. Two PhD positions in informatics are available at the University of
Candidates interested in working on graph algorithms should get
in touch with one of the professors in the Algorithms research group before sending in their application: http://www.uib.no/rg/algo
Pinar Heggernes http://www.ii.uib.no/~pinar/
(Extended) Deadline for application: September 20th. A 18 months position in Kernelization and parameterized algorithms at MONTPELLIER (LIRMM Lab, Univ Montpellier 2). "Algorithms, Graphs and Combinatorics" (ALGCO) research group. Position supported by both the French National Research Agency and the Languedoc-Roussillon Region District. Nice research environment (including travel money).
In October 2012, the group will be gathering 12 permanent members (including 6 full-time CNRS fellows) plus a few PhDs. The ALGCO group is part of the "Algorithms and Computation" axe of the Computer Science Department of the LIRMM. ALGCO is recognized for its interest and contributions in graph theory and combinatorial algorithms, more precisely parameterized algorithms and complexity, graph parameters, graph decompositions, st topological graph theory (see http://www2.lirmm.fr/algco/). The group also maintains strong collaborations with the Mathematics Dept, especially on matroids and topological graph theory. It receives around 20 visitors every year.
We expect applicants to have strong background in parameterized complexity and algorithms and its interactions with other fields such as logic, automata theory, structural graph theory, matroid theory, or approximation algorithms (among others).
In order to obtain the full 18 months, the position should start at any time between November 2012 and April 2013. The salary of about 2000€ per month (including health care) allows a comfortable life in Montpellier.
Contact person: Christophe Paul (rf.mmril|luap#rf.mmril|luap). Send to paul@lirmm in a mail entitled "Kernelization and PC postdoc" containing a detailed CV, the list of publications, letters (or contacts) of reference
Deadline 31 October. Several PhD positions in Australia in Optimisation. NICTA VRL, Melbourne, and Victorian Univ. including RMIT and Monash. The optimisation research group led by Professor Pascal Van Hentenryck, at the Univ Melbourne pioneers in constraint programming, hybrid optimisation, and planning, and focuses on grand challenges in disaster management, future energy systems, and multi-modal supply chains. Fundamental and applied research is conducted in continuous and discrete optimisation, decision making under uncertainty, simulation and 3D-visualisation, and algorithmic decision theory. See http://www.nicta.com.au/research/optimisation
Contact: Pascal Van Hentenryck, ua.moc.atcin|hvp#ua.moc.atcin|hvp
Applications and questions should be directed to ua.moc.atcin.stsil|slohcslrv#ua.moc.atcin.stsil|slohcslrv
Two postdoc positions in Warwick, UK available from 1 October 2012, although the start date
is negotiable. Contact: "Daniel Kral" <zc.inuc.ffm.nilrak.yerta|lark#zc.inuc.ffm.nilrak.yerta|lark>. Candidates interested in both positions should submit two separate applications.
Fixed term contract for 12 months for project "Classes of Combinatorial Objects: from Structure to Algorithms" funded by ERC. We seek highly motivated post-doc research fellow in extremal
combinatorics or algorithmic graph theory to work under supervision of Daniel Kral and have a strong research record in some of the areas related to the project, which include extremal
graph theory and extremal combinatorics in general, algorithmic metatheorems, width parameters and fixed parameter algorithms.
Fixed Term Contract for 24 months funded by ERC: post-doc researcher in Extremal Combinatorics to work under supervision of Oleg Pikhurko. The main directions of the research will be asymptotic extremal problems for graphs and k-uniform hypergraphs (such as the Turan function and Ramsey numbers), previous experience in these areas is not required. More importantly, we look for the depth of your research and your proficiency in applying probabilistic, analytic, or algebraic methods to problems of Discrete Mathematics. In particular, a
familiarity with regularity lemmas, graph limits, or flag algebras will be a strong asset.
Deadline for application: August 27, 2013. One-year postdoc in Graph Drawing and Representations at Charles University in Prague. No teaching duties, but some teaching will be possible to gain experience. Comfortable Prague living expense of 2000 euro per month salary. Period of the position: January 1 - December 31, 2013. See http://www.mff.cuni.cz/fakulta/prace/2013postdoc-cs.htm Contact: Jan Kratochvil zc.inuc.ffm.mak|aznoh#zc.inuc.ffm.mak|aznoh
Apply starting now. Mike Langston, Univ. Tennessee and Oak Ridge National Labs. At the APAC workshop, Mike mentioned that he had money for a student to work on applications of biomarker discovery and FPT. Contact Michael Langston <ude.ktu.sc|notsgnal#ude.ktu.sc|notsgnal>
Apply starting now till December 2016. Postdoc in Switzerland. The Dalle Molle Institute (IDSIA), University of Lugano (Switzerland), opens one PhD position and multiple PostDoc positions in the area of algorithms. All the positions are supported by the ERC Starting Grant
"New Approaches to Network Design". Positions will be filled as soon as adequate candidates will apply, starting from September 2012 and till December 2016.
The main themes of the project are approximation algorithms for network design and pricing problems, and the interaction between approximation algorithms and exact/parameterized algorithms. See: www.idsia.ch/~grandoni/ERC2010.html. Contact: Prof. Fabrizio Grandoni
Application deadline July 23, 2012. PH.D. POSITION, Freie Universität Berlin, Germany Dept Computer Science. Research project "Understanding, Modeling and Exploiting Structured Inputs for Geometric Problems" funded by the DFG. The position is for three years. Supervised by Wolfgang Mulzer (http://page.mi.fu-berlin.de/mulzer/) and takes place within the theory
group at FU Berlin (http://www.inf.fu-berlin.de/inst/ag-ti/).
The aim of the project is to develop new algorithms and models for geometric problems when additional information about the input data is available, e.g. low-entropy, restricted position, time coherence. Ideally, we will be able to identify situations in which a significant improvement over the worst-case performance is possible.
Contact: Wolfgang Mulzer and ask for information <mulzer[at]inf.fu-berlin.de>.
Applications close: 10 August 2012. Postdoc in Bergen One year research position, with a possibility of extension, postdoctoral level, at the University of Bergen, Norway.
The successful candidate will work on "Rigorous Theory of Preprocessing" project funded by the European Research Council (ERC) via the Advanced Investigator Grant scheme. The research areas are Algorithms and Complexity, in particular, fixed parameter tractability, parameterized complexity, kernelization.
The position is within Algorithm group http://www.uib.no/rg/algo/
Starting salary is on grade 57 (code 1109/pay framework 24.1) in the Civil Service pay grade table which currently means NOK 448,400 gross p.a., taxes should be at most 40%.
Contact Fedor Fomin on.biu.ii|nimof#on.biu.ii|nimof for more information and instructions how to apply.
Applications close: 10 August 2012. School of Mathematics & Statistics, UNSW, Australia
Postdoc to undertake research on an ARC-funded project entitled “Extremal Problems in Hypergraph Matchings”. Applicants should have a mathematics or theoretical computer science
PhD in an area related to graph theory or combinatorics. They will work under the supervision of Dr Catherine Greenhill. Experience in asymptotic, algorithmic or probabilistic combinatorics is
desirable but not essential. http://www.hr.unsw.edu.au/services/recruitment/jobs/22061202.html http://www.hr.unsw.edu.au/services/recruitment/jobs/22061202.html
Open until June 25th 2012. Friedrich-Schiller University Jena PostDoc/PhD student research associate (Wissenschaftlicher Mitarbeiter) Bioinformatics, Institute of Computer Science. This position is part of the project “Parameterized Algorithmics for Bioinformatic”, 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. Other methods for solving NP-hard optimization problems, such as Integer Linear Programming, will also be considered.
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.
Contact: Sebastian Böcker or Kathrin Schowtka (ed.anej-inu|aktwohcs.nirhtak#ed.anej-inu|aktwohcs.nirhtak).
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:
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
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, directly to Petr Hlineny
Petr Hlineny [zc.inum.if|ynenilh#zc.inum.if|ynenilh]
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
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.
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
Announcement made February 2011. Write immediately if interested. Avaliable: PhD position in Department of Computer Science, Royal Holloway, University
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
Due to funding limitations, mainly candidates from EU countries will be
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
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
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
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
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
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.
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
Institut für Informatik
Lehrstuhl für Bioinformatik
07743 Jena, Germany
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.
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
Institut für Informatik
Lehrstuhl für Bioinformatik
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:
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 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
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.