For all positions in the Algorithms and Complexity Group we particularly encourage women to apply.
There is an opening for a fully funded PhD position on the topic of Speeding up Algorithms with Machine Learning (ML) Methods at TU Wien, Vienna, Austria. The PhD student will 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. 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 skill, interest in theory, and background in ML and/or SAT-solving.
The position is for a duration of three years (the expected duration for completing the PhD). The successful candidate will be part of the Doctoral Program on Logical Methods in Computer Science (LogiCS) 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). For the application procedure please see http://logic-cs.at/phd/admission/
Informal inquiries to Prof. Szeider <firstname.lastname@example.org> are welcome. The next deadline for applications is September 1st, 2018, but sending applications earlier, with cc to Prof. Szeider, is encouraged.
PhD and Postdoc position in Human-Centered Algorithm Engineering
Two researcher positions are available in the FWF-funded project "Human-Centered Algorithm Engineering: Graph and Map Visualization" led by Martin Nöllenburg. See the linked announcements for further detail.
- A PhD student with a strong background in algorithmics / algorithm engineering and experience or an interest in graph and map visualization or human-computer interaction
- A Postdoc researcher with a track record in HCI, Visualization, or Visual Analytics and some prior experience and a strong interest in the underlying visualization algorithms and computational geometry
PhD position (Project Assistant) in the Algorithms and Complexity Group
The position is part of the Austrian research project "New Frontiers for Parameterized Complexity", which investigates the parameterized complexity of problems not only in the traditional graph setting, but also in areas such as Machine Learning, Integer Linear Programming and Artificial Intelligence. The candidate will be supervised by Robert Ganian (Project PI).
Applicants are expected to have excellent mathematical skills as well as interest and background in discrete algorithms.
The position should start in the second half of 2018 and is for up to three years (the expected duration of the PhD program). The salary is according to the FWF standard contracts for PhD candidates (approx. EUR 38,000.00 gross, p.a.), which allows for a convenient life in Vienna close to the city centre.
The application should include the candidate's CV, an abstract of the diploma/masters thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file). The application should also mention possible starting dates and should be sent to rganian [at] gmail.com by 14 May 2018.
Enquiries and questions about the position are welcome and may also be sent to rganian [at] gmail.com.
Postdoc (Univ.-Ass.) position (Teaching and Research)
[this position requires proficiency in German]
Eine Stelle für eine_n Assistent_in am Institut für Logic and Computation, Forschungsbereich Algorithms and Complexity, ist voraussichtlich ab 1.5.2018 für die Dauer von 6 Jahren, Gehaltsgruppe B1, mit einem Beschäftigungsausmaß von 40 Wochenstunden zu besetzen.
Das monatliche Mindestentgelt für diese Gehaltsgruppe beträgt derzeit EUR 3.711,10 brutto (14x jährlich).
Aufgrund tätigkeitsbezogener Vorerfahrungen kann sich das Entgelt erhöhen.
Einschlägiges abgeschlossenes Doktoratsstudium der Fachrichtung Informatik oder einer verwandten Studienrichtung bzw. ein gleichwertiges Universitätsstudium im In- oder Ausland.
- ausgezeichnete Kenntnisse im Bereich Algorithmen und Datenstrukturen sowie
- Interesse für die Lehre
- Im Speziellen erwünscht sind Forschungserfahrung in den Bereichen der algorithmischen Anwendungen von Graphenzerlegungen, sowie bei der Entwicklung von Algorithmen und Datenstrukturen die dem Lösen schwerer Zähl- und Entscheidungsproblemen jenseits von NP dienen.
- sehr gute Deutsch- und Englischkenntnisse
Bewerbungsfrist: bis 05.04.2018 (Datum des Poststempels)
Bewerbungen richten Sie an die Personaladministration, Fachbereich wiss. Personal der TU Wien, Karlsplatz 13, 1040 Wien. Onlinebewerbungen an: email@example.com
Die Bewerber und Bewerberinnen haben keinen Anspruch auf Abgeltung angefallener Reise- und Aufenthaltskosten, die aus Anlass des Aufnahmeverfahrens entstanden sind.
16 fully funded PhD positions
As part of the joint doctoral program Logical Methods in Computer Science LogiCS, we are seeking exceptionally talented and motivated students. The LogiCS doctoral college focuses on interdisciplinary research topics covering:
(i) computational logic (that includes discrete algorithms and complexity),
and applications of logic to
(ii) databases and artificial intelligence as well as to
(iii) computer-aided veriﬁcation.
For further details, consider the LogiCS website.
PhD position (University Assistant) in the Algorithms and Complexity Group (Closed)
The Algorithms and Complexity Group at TU Wien invites applications for a PhD candidate Assistant position. The position is for a duration of four years and is paid according to pay scale B1 at 25 hours per week (an optional possibility for a full-time employment via an additional project contract exists). The successful candidate has excellent knowledge in algorithmics, particular interest in combinatorial optimization with heuristic and exact techniques, and will contribute to the research and teaching (e.g., Algorithms and Data Structures 1 and 2, Heuristic Optimization Techniques). The deadline for applications is September 28, 2017. Application details can be found here. For further information please contact Günther Raidl.
Project Team Member / College Assistant (PhD) in the Vienna Graduate School On Computational Optimization (Closed)
The Vienna Graduate School in Computational Optimization offers Pre-Doc contracts for PhD candidates in different areas of optimization such as Combinatorial Optimization, Global Optimization, Heuristic Optimization, Nonlinear Optimization, Stochastic Optimization, Dynamic Optimization, Algorithmic Game Theory, and Optimization for intelligent Data Analysis. The program started on October 1 but two assistant positions are still available. Employment (30 hrs/week) is based on a 3-year contract (extendable to 3.5 years depending on the evaluation).
The doctoral program is a joint initiative between the University of Vienna, TU Wien, and the Institute of Science and Technology. Candidates must follow the rules for PhD studies at one of the aforementioned institutions and participate in the joint teaching and research program. The goal of the Graduate School is to give the PhD candidates a comprehensive education in many aspects of optimization including modeling, theory and implementation. It is intended to cover by the research topics the broad scope of Theory-Algorithms-Applications. In addition to the main scientific goals, other skills will be trained such as efficient literature search, writing scientific papers, presentation of results, the transformation of mathematical ideas into working algorithms, understanding the peculiar problems of application areas and putting them into a mathematical formulation. In the long term we will foster collaboration between the members and their respective institutions in order to make Vienna a place of excellence in Computational Optimization.
If interested, please contact Günther Raidl <firstname.lastname@example.org>.
For application details see http://vgsco.univie.ac.at/vacant-positions/project-team-member-phd/
The deadline for applications is December 31, 2016.
Further information: http://vgsco.univie.ac.at
PhD position (University Assistant) in the Algorithms and Complexity Group (Closed)
The Institute for Computer Graphics and Algorithms, Algorithms and Complexity Group at the Vienna University of Technology (TU Wien) invites applications for an Assistant position for a PhD candidate. The position is for a duration of four years and is paid according to pay scale B1 at 25 hours per week. The successful candidate has excellent knowledge in algorithmics, is fluent in English and German and will contribute to the research and teaching (e.g., Bachelor's courses Algorithms and Data Structures 1 and 2) of the Algorithms and Complexity Group. The deadline for applications is March 17, 2016. Application details can be found here.
Two Assistant Professors, Tenure Track (Closed)
The Faculty of Informatics at the Vienna University of Technology (TU Wien) invites applications for 2 Assistant Professor positions (tenure track).
Candidates can apply in any of the Faculty’s main research areas: Computer Engineering, Distributed and Parallel Systems, Logic & Computation (which includes Algorithms and Complexity), Media Informatics & Visual Computing, as well as Business Informatics, but the two positions will not be staffed within the same research area. The initial appointment is for 6 years with the possibility of promotion to a permanent position as Associate Professor following a positive tenure evaluation.
Duties include research in one of the Faculty’s main research areas (see above) as well as graduate and undergraduate teaching. The deadline for applications is Oktober 31, 2015. Application details can be found here.
Two Postdoc Researcher Positions for Women (Closed)
The Faculty of Informatics at the Vienna University of Technology (TU Wien) announces 2 postdoc researcher positions for women. Candidates can apply in any of the Faculty’s main research areas: Computer Engineering, Distributed and Parallel Systems, Logic and Computation (which includes Algorithms and Complexity), Media Informatics and Visual Computing, as well as Business Informatics. The deadline for applications is August 30, 2015. Application details can be found here (pdf).
PhD position in Quantified Boolean Formula (QBF) solving (Closed)
There is an opening for a funded PhD position in Quantified Boolean Formula (QBF) solving at the Vienna University of Technology, Vienna, Austria. The PhD student will join Stefan Szeider’s research group to develop and implement new methods for leveraging variable independence in QBF solvers, as part of a new research project funded by the Austrian Science Fund (FWF).
Applicants are expected to have solid programming skills and a strong interest in theory. A background in QBF or SAT solving is of advantage. The position is for a duration of three years (the expected duration for completing the PhD). The successful applicant is expected to start in 2015. The salary is according to standard FWF contracts for PhD candidates (approx. EUR 27,500 gross, p.a.), which allows for a convenient living in Vienna close to the city center.
The application should include the candidate’s CV, an abstract of their diploma/masters thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file). The application should also mention possible starting dates and should be sent to <qbf @ kr.tuwien.ac.at>.
Postdoc position in Parameterized Complexity (Closed)
There is an opening for a fully funded postdoc position for the duration of two years at our research group.
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 @ ads.tuwien.ac.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 @ szeider.net>) are welcome.