编者按：申请欧洲读博通常需要硕士学位才能申请，一般不需要GRE也无需当地语言，考一个雅思|托福成绩即可申请。套磁是申请的关键。欧洲因其高福利著称，读博也不例外，如果可以拿到工作合同，读博工资在当地已属于中产，并享受一切相关福利，毕业后申请当地永居或移民，相比美国也简单很多。

例如我在德国拿到博士学位后工作半年，即具备申请德国永居的资格。

作者 留德华叫兽 系美国Clemson大学数学硕士(运筹学方向)、Ph.D. candidate，欧盟玛丽居里学者，德国海德堡大学数学博士(离散优化、图像处理方)，读博期间前往意大利博洛尼亚大学、IBM实习半年，巴黎综合理工访问一季。现任德国某汽车集团无人驾驶部门，从事大数据和计算机视觉算法的研发。读博期间创办【运筹OR帷幄】、【DIY飞跃计划】社区并运营至今，2020.08创办【DeepMatch交友AI】社区 ，知乎｜今日头条｜微博等平台科普自媒体创作者（近20w关注者）。

以下是一月上旬的全球算法博士职位信息，大家注意deadline！

目录

• 德国比勒费尔德大学：Two PhD positions at Bielefeld University (Alexander Schoenhuth)

• 英国格拉斯哥大学：PhD studentships at the School of Computing Science,University of Glasgow (David Manlove)

• 智利塔尔卡大学：Postdoc position in OR (Eduardo lvarez-Miranda)

• 英国华威大学：Postdoc positions in Parallel/Distributed Algorithms, University of Warwick (Artur Czumaj)

• 捷克布拉格查尔斯大学：A postdoc position at Computer Science Institute, Charles University, Prague (Zdenek Dvorak)

• 捷克科学院：Three-year postdoc position in graph limits at the Czech Academy of Sciences (Jan Hladky)

/ 01 /

Two PhD positions at Bielefeld University (Alexander Schoenhuth)

We have *two* full-time 3-year PhD positions at Bielefeld University, starting from August / September 2021.

The PhD projects make part of the EU-funded International Training Network "ALPACA"(Algorithms for Pangenome Computational Analysis). Please see <https://alpaca-itn.eu> for further information. ALPACA includes various educational training sessions, workshops and summer schools as well as direct exchange with specializing companies.

The two projects will deal with

1. Pan-genome data representations compatible for deep learning applications

2. Measures and algorithms for alignment-free comparative pan-genomics

Please see

1. <https://alpaca-itn.eu/job-offer-bielefeld1>

2. <https://alpaca-itn.eu/job-offer-bielefeld2>

and/or contact

1. Alexander Sch?nhuth <aschoen@cebitec.uni-bielefeld.de>

2. Jens Stoye <jens.stoye@uni-bielefeld.de>

for further information.

The (tentative) deadline for application is February 15, 2021.

/ 02 /

PhD studentships at the School of Computing Science,University of Glasgow (David Manlove)

The School of Computing Science at the University of Glasgow is offering up to 17 studentships to support PhD research for students starting in 2021.  Funding is available to support tuition fees for both home and international students, and in most cases to support living expenses at the recommended UKRI rate (currently ?15,285 per annum) in addition.

Whilst the above funding is open to students in all areas of computing science, applications in the area of algorithms and complexity are welcomed.  Available supervisors in this area at the School include:

• Dr Jessica Enright (graph theory, optimisation, algorithms, network epidemiology), email jessica.enright@glasgow.ac.uk

• Dr Gramoz Goranci (dynamic graph algorithms, graph sparsification, numerical linear algebra, metric embeddings), email ggoranci@cs.toronto.edu

• Prof David Manlove (combinatorial and graph algorithms, optimisation, matching problems), email david.manlove@glasgow.ac.uk

• Dr Ciaran McCreesh (constraint programming, algorithm engineering, empirical algorithmics), email ciaran.mccreesh@glasgow.ac.uk

• Dr Kitty Meeks (graph theory, algorithms, parameterised complexity, counting complexity), email kitty.meeks@glasgow.ac.uk

Students can apply for admission to PhD study at any time, but to be considered for the studentships we are offering at this round, we must receive your application by 31 January 2021.  For more information about how to apply, see

https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents.  

This web page includes information about the research proposal, which is required as part of your application.

Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline.  See

https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/studentshipinformation 

and

https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/phd-projects

for more details about the funding available.

/ 03 /

Postdoc position in OR (Eduardo lvarez-Miranda)

The group of Management Informatics of the Universidad de Talca, Chile, is looking for talented (postdoctoral) researchers in the field of (robust/stochastic) mixed-integer programming (and its applications). Selected candidates are expected to contribute to the design and implementation of novel (exact and heuristic) solution methods to solve robust/stochastic mixed-integer programming problems (e.g., network design, scheduling, routing) emerging from different application areas (supply chain management, power systems engineering, healthcare management, natural resources management, among others).

We are looking for candidates with experience and interest in:

   - Coding and implementing exact and heuristic algorithms for solving

   (mixed-integer programming) optimization problems in C++.

   - Presenting and writing up academic papers.

   - Some experience with GIS is a plus.

This is a two-year position (with a possible extension to up to three additional years) and selected applicants are expected to join the group starting from March 2021 (although the start date can be negotiated within a relatively flexible time frame). A yearly budget for travel expenses, conference registration fees and other expenditures is also considered.

If you are interested and/or want more information about the position and application process, please contact Eduardo lvarez-Miranda at ealvarez@utalca.cl and eduardo.alvmir@gmail.com

/ 04 /

Postdoc positions in Parallel/Distributed Algorithms, University of Warwick (Artur Czumaj)

Postdocs in Parallel and Distributed Algorithms University of Warwick

https://warwick.ac.uk/dcs/people/artur_czumaj/postdoc-advert-jan-2021

In connection with a research grant of Professor Artur Czumaj, we are seeking excellent candidates for a postdoctoral fellow position in the area of the design and theoretical analysis of parallel and distributed algorithms. The main objective is to pursue cutting edge research in the broadly understood area of design and mathematical analysis of parallel and distributed algorithms, focusing on fundamental research in this area.

The position is for up to 2 years.

The applicants are expected to have a strong interest and background in the mathematical analysis of algorithms or discrete mathematics, and theoretical computer science. Being familiar with distributed (local, congested clique, congest, etc) or parallel (PRAM, MPC, MapReduce, etc) computing is preferred but not required. This is a theory-focused project, and hence programming skills are not required - even though 

they would be a bonus.

The postdoctoral fellow will join a team of internationally renowned researchers at the Centre for Discrete Mathematics and its Applications (DIMAP,http://www2.warwick.ac.uk/dimap/) and the Foundations of Computer Science Research Group (http://www.dcs.warwick.ac.uk/research/focs/) in the Department of Computer Science at the University of Warwick.

Closing date for receipt of applications: Closing date: January 13, 2021.

Formal applications, which include CV with a list of publications, a research statement, and a short statement highlighting your suitability for this post, should be made following the link at https://www.jobs.ac.uk/job/CDE153/research-fellow-103545-1220.

Informal inquiries should be addressed to Artur Czumaj at A.Czumaj@warwick.ac.uk.

/ 05 /

A postdoc position at Computer Science Institute, Charles University, Prague (Zdenek Dvorak)

A one-year postdoc position (with a possibility of extension) is offered at Computer Science Institute of Charles University (https://www.mff.cuni.cz/en/iuuk). The (negotiable) starting date: September 1, 2021.

The position is funded by the "Algorithms and Complexity within and beyond Bounded Expansion" project; the candidates are expected to have a background in structural, geometric, and/or algorithmic graph theory.

The candidates must have a Ph.D. degree in mathematics or theoretical computer science completed within the last 4 years (with exceptions for individual circumstances such as parental leave) or be expected to obtain the degree by the starting date of the position.

The application should contain:

* A short letter of motivation.

* Professional CV (including the list of publications).

* Two letters of recommendation.

Application deadline: March 1, 2021.

Inquiries and applications should be sent to Zdenk Dvok <rakdver@iuuk.mff.cuni.cz>

/ 06 /

Three-year postdoc position in graph limits at the Czech Academy of Sciences (Jan Hladky)

The Institute of Computer Science of the Czech Academy of Sciences has an opening for a postdoctoral position for a tentative period July 2021-August 2024 within a project "Graph limits and beyond'' with Jan Hladky as the principal investigator. Starting salary is 47000CZK/month. See https://www.numbeo.com/cost-of-living/comparison.jsp

 

There are no teaching duties and support for travel is available.

The candidate should have a strong background in theory of graph limits, extremal graph theory, or random discrete structures. Motivated candidates from other fields of combinatorics, probability, real analysis or theoretical computer science will be also considered.

For informal inquiries, please contact Jan Hladky (hladky@math.cas.cz). The full text of the announcement including application instructions is available at https://www.cs.cas.cz/job-offer/Graph-limits-Hladky/cs. The closing date is February 10, 2021, or until the position is filled.

—— 完 ——