The Vienna Graduate School on Computational Optimization (VGSCO) is a research and training program funded by the Austrian Science Funds (FWF). The VGSCO offers lecture series given by international experts in optimization related fields, organizes research seminars, retreats, soft skills courses, scientific workshops, and social events, provides travel grants, and supports research stays abroad.
A 6-Year Postdoc Position in Algorithms is available at TU Wien, Vienna, Austria. Research experience in one of the following areas is of advantage: parameterized complexity, algorithmic applications of graph decompositions, SAT and CSP.
We invite applications for a postdoc position, hosted by Or Meir, at the university of Haifa in Israel. We are especially looking for candidates who are interested in working on communication complexity and circuit complexity, but we will also consider candidates who are interested in other areas of complexity theory and algorithms. For details, please e-mail Or Meir directly.
The Department of Mathematics, Statistics, and Computer Science at UIC is accepting applications for Lecturer positions beginning in Fall 2020 to teach computer science and statistics courses. Please see the full ad at the link for more details.
A postdoc position is available in the project “Distributed Algorithms for Fundamental Graph Problems” led by Sebastian Forster at the University of Salzburg, Austria. Research experience in efficient graph algorithms is required, but not specifically in the distributed setting. The position is for one year with the possibility of extension by another year.
Visiting Professors of Computer Science, 2-10 months appointments during 2020-2021 academic year. No knowledge of Russian is required.
Please send a CV, two letters of reference (to be sent separately), and a cover letter describing your professional background, including the description of courses you have taught or would like to teach, to email@example.com.
The research project NETWORKS is looking for 14 international PhD students in mathematics and computer science. Are you interested in the stochastics and algorithmics behind network problems? And would you like to be part of this project with its many activities? Then we invite you to apply for one of these positions.
The Theory Group in the Dept. of Computing Science at U. of Alberta invites applications for TWO postdoc positions. The successful applicants are expected to work closely with Zachary Friggstad and Mohammad Salavatipour in the areas of: approx algorithms, hardness of approximation, combinatorial optimization. For details see https://webdocs.cs.ualberta.ca/~mreza/pdf-ad7.pdf