From pekka.orponen at aalto.fi Sun Mar 8 13:27:14 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:27:14 +0200 Subject: [Job-offers-cs] New positions on the Informatics Europe job platform Message-ID: <794826d1-57da-4ab6-9bc1-1a8f43b08385@aalto.fi> https://www.informatics-europe.org/services/informatics-job-platform.html From pekka.orponen at aalto.fi Sun Mar 8 13:28:32 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:28:32 +0200 Subject: [Job-offers-cs] Lecturers in Computer Science (three positions), Aalto University Message-ID: <10c7c56e-0f53-4c69-b588-e6991932b28b@aalto.fi> The Department of Computer Science ?at Aalto University is looking for new Lecturers in Computer Science. The positions in the lecturer career track are full-time and permanent, and open in the following areas: * Bioinformatics, biostatistics, and health data science * General computer science: programming, algorithms, and theory * Software engineering More information and how to apply . *The call closes on 16 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:30:13 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:30:13 +0200 Subject: [Job-offers-cs] HIIT Postdoctoral Fellow positions in Computer Science (Aalto University/University of Helsinki) Message-ID: <6e13a6f5-d455-4833-ba23-72b67c2649df@aalto.fi> The Helsinki Institute for Information Technology (HIIT) is seeking Postdoctoral Fellows to join the Helsinki region information technology research community. The position is intended support early-career researchers on their road towards being independent researchers, in collaboration with one or more supervisors in HIIT Faculty. The position gives the fellows excellent opportunities for high-quality and high-impact research and for creating research networks supporting their careers. We welcome applications across all areas in Computer Science, including * Algorithms and theory * Bioinformatics and digital health * Computing systems and networks * Cybersecurity * Human-computer interaction * Machine learning and artificial intelligence * Software engineering More information and how to apply . *The call closes on 22 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:31:35 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:31:35 +0200 Subject: [Job-offers-cs] Assistant Professor in Operations Research (Aalto University) Message-ID: <2b377552-e326-4617-8a0b-94dde21958bc@aalto.fi> The Department of Mathematics and Systems Analysis ?at Aalto University invites applications for a tenure-track position at the assistant professor level. This is a unique opportunity for talented individuals with a doctorate in operations research or a closely related field to contribute to our leading role in systems and operations research in Finland. We welcome applications in all areas of operations research, including but not limited to:?optimization,?mathematical programming,?analytics,?data-driven decision-making,?stochastic modelling, and?systems analysis. More information and the application form . *The call closes on 15 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:32:13 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:32:13 +0200 Subject: [Job-offers-cs] Postdoctoral Artificial Intelligence Research Software Engineer (Aalto University) Message-ID: <470c9620-bc2a-4724-9551-5abf394d06a3@aalto.fi> Postdoctoral Artificial Intelligence Research Software Engineer with an emphasis on AI research, performance optimization of AI training and inference, and hands-on-experience with PyTorch or similar. You should have experience in software development, computing, GPU computing, and data management for the support of AI projects. An ideal candidate also has a good understanding of recent advancement in AI and capability to read and implement research papers. More information and the application form . *The call closes on 31 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:33:28 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:33:28 +0200 Subject: [Job-offers-cs] Postdoctoral researchers in AI & machine learning (ELLIS Institute Finland; deadline Feb 9) Message-ID: <85747ecd-c4ef-4a38-b7e9-6c373087b2c7@aalto.fi> ELLIS Institute Finland is hiring postdoctoral researchers in AI + machine learning. World-class resources for research incl. LUMI supercomputer, dozens of supervisors across Finnish universities, and close collaboration with companies and the ELLIS network. Apply by February 9: https://www.ellisinstitute.fi/postdoc-recruit-2026 -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:34:51 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:34:51 +0200 Subject: [Job-offers-cs] Tenure-track and PhD positions at Uppsala University Message-ID: <80023a73-c0fb-4c33-b2dc-1ba07381ce37@aalto.fi> Dear Colleagues, There are openings for an Assistant Professor (tenure-track) and for PhD positions at Uppsala University. Uppsala is a university town, 40min by train from Stockholm in Sweden. There is a strong probability and combinatorics group - including Svante Janson, Cecilia Holmgren, Annika Heckel and Sascha Troscheit; usually 2-4 postdocs, 3-5 PhD students. The tenure-track job is joint between mathematics and computer science, while the PhD positions are to work with anyone in the maths department. There is no Swedish language requirement in the selection. Link to job ads: tenure track https://www.uu.se/en/about-uu/join-us/jobs-and-vacancies/job-details?query=895804, deadline 20th March PhD positions https://www.uu.se/en/about-uu/join-us/jobs-and-vacancies/job-details?query=901355, deadline 16th March Best, Fiona Skerman From pekka.orponen at aalto.fi Sun Mar 8 13:36:11 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:36:11 +0200 Subject: [Job-offers-cs] TT Professorship 'Operations Research and AI' at the Technical University of Munich Message-ID: <27842756-1816-4a86-a31b-399982e70d9c@aalto.fi> The Technical University of Munich (TUM) invites applications for the position?of?Tenure?Track?Assistant?Professor in??Operations?Research?and?AI? to begin as soon as possible. The position is a W2 fixed-term (6 year) tenure-track?professorship?with?the possibility?for?promotion?to?a?tenured?W3. => Please submit your application by 30 March 2026 via the TUM recruitment?portal: http://www.recruit.tum.de/ Scientific?Environment The professorship will be assigned to the TUM School of Management and located?in?Munich.?The?TUM?School of Management is one of the leading management schools in Germany and internationally.?Our?focus?in?research and teaching is at the interface of management and technology, where we aim?to?make?a?real?impact.?Our?faculty members publish regularly in top business, economics, and general science?journals.?An?interdisciplinary?research environment awaits the successful candidate. The school has close ties to?industry. Responsibilities The responsibilities include research and teaching as well as the promotion?of?early-career?scientists.?We?seek?to appoint an expert in the research area of Operations Research with a focus?on?Artificial?Intelligence,?especially data driven optimization and machine learning. Teaching responsibilities include?courses?in?the?university's bachelor's, master's, and PhD programs, particularly in the Master in Management?and?Technology. Qualifications We are looking for candidates who have demonstrated initial scientific achievements?and?the?capacity?for independent research at the highest international level. The ideal candidate?combines?strong?methodological expertise in both disciplines and their intersections and should have the?potential?to?publish?in?leading?academic journals. A university degree and an outstanding doctoral degree or equivalent?scientific?qualification,?as?well?as pedagogical aptitude, are prerequisites. Substantial research experience abroad?is?expected?(please?see http://www.tum.de/en/faculty-recruiting-faq/?for?further?information). Our?Offer Based on the best international standards and transparent performance criteria,?TUM?offers?a?merit-based academic career path for tenure track faculty from Assistant Professor through?a?permanent?position?as?Associate Professor, and on to Full Professor. The regulations of the TUM Faculty Recruitment?and?Career?System?apply. TUM provides excellent working conditions in a lively scientific community,?embedded?in?the?vibrant?research environment of the Greater Munich Area. The TUM environment is multicultural,?with?English?serving?as?a?common interface for scientific interaction. TUM offers attractive salary conditions?and?social?benefits. The TUM Munich Dual Career Office (MDCO) provides tailored career consulting?to?the?partners?of?newly appointed professors. The MDCO assists the relocation and integration of new?professors,?their?partners?and accompanying?family?members. Your?Application TUM is an equal opportunity employer and explicitly encourages applications?from?women.?The?position?is?suitable for disabled persons. Disabled applicants will be given preference in case?of?generally?equivalent?suitability, aptitude?and?professional?performance. Application documents should be submitted in accordance with TUM's application?guidelines?for?professors. These guidelines and detailed information about the TUM Faculty Recruitment?and?Career?System?are?available at http://www.tum.de/faculty-recruiting. Here you will also find TUM's information?on?collecting?and?processing?personal data?as?part?of?the?application?process. From pekka.orponen at aalto.fi Sun Mar 8 13:37:16 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:37:16 +0200 Subject: [Job-offers-cs] Faculty positions in Applied Mathematics at the University of Western Australia Message-ID: The University of Western Australia is recruiting several academic position in applied mathematics (ongoing teaching and research positions at Australian academic level B and C - Assistant/Assoc. Professor in North America). We are particularly eager to hear from applicants in various areas of modern applied mathematics with potential applications outside the discipline. Applicants from Dynamical Systems are particularly welcome. Applicants that compliment and expand on our traditional areas of expertise are encouraged. This includes potential for collaborations across campus with UWA's Research Institutes, including the UWA Data Institute. Successful applicants will contribute to teaching our existing undergraduate programmes at all year levels. Applications close in one month. external.jobs.uwa.edu.au/en/job/522589/... -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:39:17 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:39:17 +0200 Subject: [Job-offers-cs] Two Postdoc positions in Formal Methods for AI at TU Dortmund University (Germany) In-Reply-To: <0c1162c5-2cae-434c-82dd-1fac96d150ee@tu-dortmund.de> References: <0c1162c5-2cae-434c-82dd-1fac96d150ee@tu-dortmund.de> Message-ID: The Reliable AI group at TU Dortmund University (Germany) and the Center Trustworthy Data Science and Security seeks talented and motivated candidates for *two* 2-year Postdoc positions in Verification and Formal Methods for AI. We specifically welcome candidates with research interests in verification and formal guarantees for deep neural networks or probabilistic programs, program synthesis (e.g., using large language models), safe machine learning (deep learning or reinforcement learning), neuro-symbolic techniques or deep learning under logic constraints, as well as broader topics related to formal methods and verification. The positions are fully funded (TV-L E13/14) and include comprehensive benefits, including 30 day of paid vacation, health insurance, and retirement contributions. Both positions will be supervised by Prof. Daniel Neider (https://rc-trust.ai/about/scientists/daniel-neider. For more details on the positions, and to apply (deadline: March 10, 2026), please see https://service.tu-dortmund.de/documents/18/2120797/w03-26_2PhD_RAR_englisch_NEU_SJA.pdf From pekka.orponen at aalto.fi Sun Mar 8 13:39:58 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:39:58 +0200 Subject: [Job-offers-cs] 1-year postdoc in combinatorial optimisation in Barcelona In-Reply-To: <690f14e0-dcc6-48a6-8ba3-36765eb06bdc@app.fastmail.com> References: <690f14e0-dcc6-48a6-8ba3-36765eb06bdc@app.fastmail.com> Message-ID: We are seeking a motivated candidate for a 1-year post-doctoral position in Operations Research at Universitat Pompeu Fabra in Barcelona, Spain. Complete information: https://santini.in/academic/postdoc-position Application form: https://forms.gle/2Y5XWquvHmKz52Bj9 == The Project == The researcher will be financed through the research project "Fairness and social well-being in optimisation models". The overarching theme of this project is incorporating ethical aspects into mathematical models for public resource allocation and labour organisation. Specifically, the project aims to include fairness and social well-being considerations in optimisation models through two research lines: fairness in public budget allocation models and workers' well-being in service industry optimisation models. The researcher will join the Statistics, Probability and Machine Learning research group (https://www.upf.edu/web/statistics-group The IP of the project is Alberto Santini, associate professor of Operational Research at Universitat Pompeu Fabra. == Requirements == Candidates will have completed a PhD in Operational Research, Computer Science, Mathematics, Computer Engineering, Economics, or other areas closely related to operational research and mathematical optimisation. Candidates with proven experience in at least one of the following areas are particularly encouraged to apply: Rostering and scheduling problems, Exact methods based on column generation, Multi-objective optimisation, Bi-level programming and Stackelberg games. == What we offer == A 12-month contract with a minimum salary of around 31200 euros per year. The candidate is expected to focus solely on research and will not have any teaching or administrative duties. If they want to gain teaching experience, this can also possibly be arranged and is paid separately. The scholarship comes with funding to cover research expenses, such as travelling to conferences or stays abroad. UPF offers plenty of opportunities for career growth, including research and soft-skills seminars. The university also has a comprehensive language-learning programme. == Timeline == Please complete the form as soon as possible and, in any case, before March 27. Remember to include your CV and a recommendation letter. We will be reviewing applications and scheduling interviews continuously. During the interviews, we will explain how to submit your application through the official university system. The contract will start at a mutually agreed date in 2026. Best, Alberto Santini From pekka.orponen at aalto.fi Sun Mar 8 13:40:18 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:40:18 +0200 Subject: [Job-offers-cs] =?utf-8?q?Postdoc_position_at_King=E2=80=99s_Col?= =?utf-8?q?lege_London?= In-Reply-To: References: Message-ID: <4d93dc9a-272b-425a-9e2b-5bb39fb12534@aalto.fi> We have one opening for a postdoctoral researcher in mechanism design at King?s College London. The post holder will work on a project that models the imperfect rationality of AI agents and explores the frontier between (i) their evolving capabilities and (ii) what can be implemented?and aligned?within the theoretical framework of mechanism design. The position is funded through the end of February 2028, with a possibility of further extension (up to two years of employment). Further details and application instructions are available here: https://www.jobs.ac.uk/job/DQQ204/postdoctoral-research-associate-in-mechanism-design-for-ai-alignment>. Application deadline: 9 March 2026. Inquiries: carmine.ventre at kcl.ac.uk Please feel free to share this with potentially interested candidates. From pekka.orponen at aalto.fi Sun Mar 8 13:40:42 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:40:42 +0200 Subject: [Job-offers-cs] PhD and postdoc positions at IT University of Copenhagen In-Reply-To: References: Message-ID: <5a2f1ffe-4e8e-4796-aa63-f6d4c1121849@aalto.fi> The Algorithms group at the IT University of Copenhagen invites highly motivated individuals to apply for a PhD and postdoc positions starting 1 September 2026 or soon thereafter. The PhD call is here https://tinyurl.com/yc8rk4nw (deadline: March 10, 2026) and the postdoc call is here https://tinyurl.com/475vckww (deadline: March 15, 2026). The positions are funded by the project Algebraic Hardness and Applications (AHA), which is supported by the Carlsberg Foundation and by the BARC Center for Basic Algorithms Research financed by the VILLUM foundation. Questions about the positions can be directed to Professor Nutan Limaye, IT University of Copenhagen, nuli at itu.dk. Please add ? AHA PhD/postdoc Application 2026? to your subject line when you send your inquiries. Questions related to the application procedure may be directed to HR, hr at itu.dk. From pekka.orponen at aalto.fi Sun Mar 8 13:41:41 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:41:41 +0200 Subject: [Job-offers-cs] Postdoc position in Prague: Solving Large-Scale Scheduling Problems: Hybridization, Parallelism, and Model Diversity in Constraint Programming In-Reply-To: <8a868744-025a-4a71-85d4-19e352896e91@cvut.cz> References: <8a868744-025a-4a71-85d4-19e352896e91@cvut.cz> Message-ID: <8afa4e82-50d3-4189-89d7-f5848c3ffbce@aalto.fi> Offer Description: Scheduling problems such as the Resource-Constrained Project Scheduling Problem (RCPSP) remains one of the central challenges in combinatorial optimization, particularly in large-scale industrial settings. As instance sizes grow and objective functions become more sophisticated, classical exact or single-strategy heuristic approaches are no longer sufficient. Future progress requires carefully designed hybrid and parallel solution frameworks. Today, Large Neighborhood Search (LNS) is the dominant heuristic paradigm in modern constraint programming (CP) scheduling solvers such as IBM ILOG CP Optimizer, Google OR-Tools, and OptalCP. Compared to traditional local search, LNS offers improved diversification and a stronger ability to escape local optima by iteratively destroying and repairing large fragments of a schedule. In parallel, Failure-Directed Search (FDS) provides a systematic mechanism for exploring the entire search space using a fail-first principle to prove infeasibility or optimality. While this combination is highly effective for classical objectives such as makespan minimization, CP solvers become less efficient when handling more complex criteria, such as cost-aware scheduling, or specific constraints, such as sequence dependent setup times. In such cases, purely generic search strategies may struggle to quickly produce high-quality incumbents, which are crucial for pruning the search space. A promising research direction is the integration of problem-oriented heuristics within the CP solving process. Fast constructive or improvement heuristics tailored to specific RCPSP structures can generate strong feasible solutions early in the search. These solutions provide tight upper bounds that can be injected into the CP model as hard objective constraints, significantly reducing the search space explored by FDS. The stronger the incumbent, the more aggressively the complete search can prune suboptimal regions. Beyond hybridization, large-scale RCPSP strongly benefits from parallel search architecture. Modern CP solvers, such as OptaCP, support multiple solver workers running concurrently. Instead of replicating identical models across workers, we propose exploiting model diversity: each worker can employ a different CP model formulation, search strategy, or propagation emphasis. For example, one worker may use a time-indexed formulation, another a start-time interval-based model, and another a precedence- or flow-oriented reformulation. Similarly, workers can differ in symmetry braking, variable ordering, restart policies, or LNS neighborhood design. Such heterogeneous parallelism increases robustness and coverage of the search space. Workers can share global incumbents, objective bounds, and nogoods during execution. When one worker discovers a high-quality solution, all others immediately benefit through tighter pruning. Conversely, proofs of infeasibility or bound improvements obtained by one model can accelerate convergence across the entire portfolio. This cooperative, portfolio-based architecture combines intensification within each worker with diversification across workers. The proposed research aims to design and analyze these hybrid and parallel CP frameworks namely for large-scale RCPSP. Emphasis will be placed on principled model reformulation, effective bound sharing, and scalable synchronization mechanisms that preserve solver efficiency while maximizing information exchange. [PER] L. Perron, P. Shaw, V. Furnon, Propagation guided large neighborhood search, in: M. Wallace (Ed.), Principles and Practice of Constraint Programming ? CP 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 468?481. [OPT] ScheduleOpt: OptalCP?s solver landing page (2023). URL https://scheduleopt.com/>[VIL ]P. Vil?m, P. Laborie, P. Shaw, Failure-directed search for constraint-based scheduling, in: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Springer, 2015, pp. 437?453. Contract details and dates ?Hours Per Week: 40 ?Offer Starting Date: April 1, 2026 Application Deadline Date and Time: March 31, 2026 - 23:45 (Europe/Prague) Company/Institute: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, City: Prague Postal Code: 160 00 Street: Jugosl?vsk?ch partyz?n? 1580/3 Skills/Qualifications: ?Motivation to perform excellent research, become part of the world's research communities in your field, and publish in first-tier scientific conferences and journals, ?Ph.D. degree or equivalent (awarded or to be completed soon), ?Co-author of at least 3 papers published in impact factor journals or prestigious conferences, ?Professional proficiency in spoken/written English (knowledge of the Czech language is not required). Specific Requirements: good background in scheduling, combinatorial optimization and algorithm design/implementation. Benefits: ?An initial appointment for 1 year (with an extension of up to 2 years) ?Salary around 70000 CZK gross monthly; check the Numbeo database for the cost of living in Prague ?Full social and health insurance ?30 days of paid annual leave ?Children?s corner, kindergarten, and elementary school operated by the Czech Technical University in Prague ?Additional benefits such as subsidized meals, yearly benefits supporting recreational and sports activities, as well as health care programs ?An informal and inclusive international working environment at the Industrial Informatics Department, CIIRC, CTU in Prague. Selection process: Interested candidates are invited to submit their applications at: https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID: 03-Postdoc-Hanzalek] The application package should contain: ?Motivation letter (up to two pages), stating personal goals and research interests ?Academic curriculum vitae, including a list of publications highlighting the three most important ones ?Contact details for two to three referees who could support your application, ?A copy or a link to your Ph.D. thesis, ?Date of your Ph.D. award or the expected date of your Ph.D. thesis defense. Euraxess code: https://www.euraxess.cz/jobs/415419> -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzale/> From pekka.orponen at aalto.fi Sun Mar 8 13:42:13 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:42:13 +0200 Subject: [Job-offers-cs] Postdoc position in Prague: Learning-Augmented Combinatorial Optimization Algorithms for Scheduling and Packing In-Reply-To: <1d6af934-2dc4-4de5-939e-84e558d5509b@cvut.cz> References: <1d6af934-2dc4-4de5-939e-84e558d5509b@cvut.cz> Message-ID: <724f9211-aab7-4c0d-b676-0009fe54f372@aalto.fi> Offer Description: The project addresses difficult scheduling and packing problems in the sense of computational complexity, for which classical exact approaches are often impractical at realistic scales. The goal is to design new algorithmic frameworks that combine established tools from Operations Research with modern Machine Learning methods to produce high-quality solutions within acceptable computational times. While rooted in OR, the project requires and will further develop strong competencies in Machine Learning. Over the past decade, learning-augmented optimization has emerged as a promising paradigm. In exact methods, machine learning has been used to tune solver parameters or guide search in tree-based algorithms for mathematical programming. In heuristic optimization, learning has supported diversification strategies, automated selection of algorithms for specific instances, and even direct construction of solutions. More recently, reinforcement learning and deep learning techniques have been used to guide local search procedures, particularly for transportation and routing problems, demonstrating substantial performance improvements. This project will focus on scheduling and packing settings, developing general methodologies rather than problem-specific tricks. Two complementary research directions will be pursued. First, machine learning will be used to improve the parameterization of heuristic algorithms. Second, learning methods?especially reinforcement learning?will be employed to guide the exploration of solution spaces. This includes selecting promising neighborhoods, prioritizing moves in local search, or constructing solutions incrementally. The research will build on several successful applications of ML in combinatorial optimization. These include reinforcement learning?guided greedy procedures for graph optimization problems, predictive models for deciding when decomposition techniques should be applied, and classifiers that identify structural characteristics of high-quality solutions. Additional directions involve predicting optimal objective values for complex engineering design problems and developing reinforcement learning?enhanced metaheuristics, such as iterated local search for makespan minimization in advanced manufacturing scheduling. The developed methods will be evaluated on challenging NP-hard scheduling and packing problems, including both well-studied benchmark problems with strong existing heuristics and more applied, real-world problems where current methods remain insufficient. The objective is to demonstrate that the integration of ML and OR techniques can yield robust improvements across different problem types. About the group: The Optimization Group, led by Zdenek Hanzalek, focuses on scheduling and combinatorial optimization.? The group collaborates strongly with high-tech companies (CEZ ? Czech Energy Group, Porsche Engineering Services, EATON, Skoda Auto, ST Microelectronics, Volkswagen, DHL, ?). Zdenek is the principal investigator of the Roboprox project and organizer of SchedulingSeminar.com. [1] Bengio, Y., Lodi, A. Prouvost, A. (2021). Machine Learning for Combinatorial Optimization: a Methodological Tour d?Horizon, European Journal of Operational Research, 290:405-421. [2] Nina Mazyavkina, Sergey Sviridov, Sergei Ivanov, Evgeny Burnaev, Reinforcement learning for combinatorial optimization: A survey, Computers & Operations Research, Volume 134, 2021. [3] Heinz, V.; Hanz?lek, Z.; Vil?m, P.: Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks, Computers & Industrial Engineering, Volume 209, November 2025, 111413. [4] Roman V?clav?k, Anton?n Nov?k, P?emysl ??cha, Zden?k Hanz?lek, Accelerating the Branch-and-Price Algorithm Using Machine Learning, European Journal of Operational Research, Volume 271, Issue 3, 2018, Pages 1055-1069. [5] Grus, J.; Hanzalek, Z.: Automated placement of analog integrated circuits using priority-based constructive heuristic, Computers & Operations Research, Volume 167, 106643, July 2024. Contract details and dates ?Hours Per Week: 40 ?Offer Starting Date: April 1, 2026 Application Deadline Date and Time: March 31, 2026 - 23:45 (Europe/Prague) Company/Institute: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, City: Prague Postal Code: 160 00 Street: Jugosl?vsk?ch partyz?n? 1580/3 Skills/Qualifications: ? ? Motivation to perform excellent research, become part of the world's research communities in your field, and publish in first-tier scientific conferences and journals, ? ? Ph.D. degree or equivalent (awarded or to be completed soon), ? ? Co-author of at least 3 papers published in impact factor journals or prestigious conferences, ? ? Professional proficiency in spoken/written English (knowledge of the Czech language is not required). Specific Requirements:? good background in scheduling, combinatorial optimization and algorithm design/implementation. Benefits: ? ? ? ? ?An initial appointment for 1 year (with an extension of up to 2 years) ? ? ? ? ?Salary around 70000 CZK gross monthly; check the Numbeo database for the cost of living in Prague ? ? ? ? ?Full social and health insurance ? ? ? ? ?30 days of paid annual leave ? ? ? ? ?Children?s corner, kindergarten, and elementary school operated by the Czech Technical University in Prague ? ? ? ? ?Additional benefits such as subsidized meals, yearly benefits supporting recreational and sports activities, as well as health care programs ? ? ? ? ?An informal and inclusive international working environment at the Industrial Informatics Department, CIIRC, CTU in Prague. Selection process: Interested candidates are invited to submit their applications at: https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID: 04-Postdoc-Hanzalek] The application package should contain: ? Motivation letter (up to two pages), stating personal goals and research interests ? Academic curriculum vitae, including a list of publications highlighting the three most important ones ? Contact details for two to three referees who could support your application, ? A copy or a link to your Ph.D. thesis, ? Date of your Ph.D. award or the expected date of your Ph.D. thesis defense. Euraxess code: https://www.euraxess.cz/jobs/415421> -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/> From pekka.orponen at aalto.fi Sun Mar 8 13:42:45 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:42:45 +0200 Subject: [Job-offers-cs] Postdoc position at Rice/University of Houston Message-ID: <004f2a48-06e7-4751-b112-eb9ff07a8814@aalto.fi> Kre?imir Josi? (UH) and Matthew Bennett (Rice University) are looking for a postdoc to work with us on developing mathematical modeling techniques that describe the spatiotemporal dynamics of intercellular signaling in spatially extended bacterial systems. In previous work, we have developed models of spatially extended synthetic bacterial systems and methods for monitoring intercellular signaling, gene expression, and cellular growth within them. The goal of the project is to use these techniques in a series of increasingly complex experiments to determine how mathematical models need to be altered to better reproduce and predict the spatiotemporal dynamics of spatially extended synthetic multicellular systems. Our ultimate goal is to more develop mathematical models that will enable us to better design large-scale, complex synthetic systems capable of coordinating their spatiotemporal gene expression patterns. This is a 2 year position, with a possibility of renewal. ?More information is available here: careers.uh.edu/jobs/... -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 8 13:47:25 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 8 Mar 2026 13:47:25 +0200 Subject: [Job-offers-cs] Principal Research Scientist in AI Security (Huawei Helsinki) Message-ID: <0a2aa849-ae18-4cd7-b978-c6aa66905262@aalto.fi> About the job Huawei Consumer Business Group is the leader in the all-scenario AI life. It covers smartphones, PC and tablets, wearables, mobile broadband devices, family devices and device cloud services. Huawei Consumer Business Group is dedicated to delivering the latest technologies to consumers. We believe in creating safe, privacy-friendly, and high-quality products with great user experiences for our consumers. Content Security Lab in Helsinki Research Center?s mission to advancing technology to protect the online safety of Huawei mobile users in Harmony OS ecosystem. We build advance AI detection solutions to ensure content safety and safety in LLM/VLM/agentic AI such as harmful content detection, agentic AI safety and machine unlearning. We are looking for a passionate and motivated technical leader with a solid track record of solving challenging problems, advancing state-of-the-art, and demonstrated passion for ground-breaking research that could be scaled to production environment with an emphasis on the intersection of AI and Safety. *Responsibilities * * Lead the research, design and development of highly trustworthy, robust and reliable, high performance, efficient detection solutions, generative service and Safe Agentic AI systems. * Contribute to the development of Online Safety Research Roadmap to advance AI-based detection solution and ensure the safety of AI systems of classification, generative AI and agentic AI systems. * Provide technology insights and research proposal for advancing the state-of-the-art research and development. * Design and evaluate solution architecture and design, assess the competitiveness of the technology. * Conduct hands-on research and experiments in collaboration with team members. * Establish collaboration with universities and cross-functional teams within the company. Active communication with internal stakeholders and external audiences. *Requirements * * PhD in Computer Science, Deep Learning, Machine Learning, Mathematics or other related fields. * 8+ years of experience, focused on the research in AI and/or Security field with a strong track record and high motivation to the Trust & Safety domain. * Proven experience in designing and building efficient, high?performance LLMs/VLMs and agentic AI / reasoning systems, including model architecture, optimization and large?scale deployment. * Successful experience in advanced AI in aligning AI with human values and expectations such as RLHF, adversarial training, neural network editing, formal logic & game theory, capabilities to detect and understand risks, intent modeling and reasoning, robustness, capabilities of understanding local cultures and explainable AI. * Experience in security threat or abuse detection, deep fake detection, fairness, transparency, robust and explainable AI is a plus. * Experience implementing solution that comply with EU online safety regulations and privacy protection laws (e.g., Digital Service Act, GDPR, AI Act) is a plus. * Ability to explain complex technical concepts at every level in the organization and transform the concepts into product. * Pioneering novel methods and neural networks that revolutionized machine learning or the AI field, or revolutionized the industry, is a big bonus. * International awards in the field of AI/ML/CV and highly recognized by experts of the same field. * Strong knowledge and experience in LLM/VLM pre?training models, neural network architecture and algorithm design. * Strong publication record in top conferences e.g., AAAI/ACL/CVPR/ICCV/EMNLP/NAACL. * Demonstrated ability to collaborate effectively in multicultural teams, with a proactive mindset and a passion for challenging the status quo. *Location:*Helsinki, Finland. *Why join us? * * As a Principal Research Scientist you will define Huawei?s strategy in AI Security, Machine Unlearning, and high?performance LLM/VLM and agentic reasoning systems rather than just executing someone else?s roadmap. * Your research will move from top?tier publications into large?scale deployment, shaping how foundation models are secured and governed for hundreds of millions of users. * Work in our AI Security Lab in Helsinki, alongside experienced international researchers and engineers in a focused environment that values scientific excellence, depth, and real impact to protect millions of Huawei Mobile users. * You will drive research program in collaborations with leading universities and talented teams with strong research backing for bold, multi?year research initiatives. *About Huawei *Huawei is a leading global provider of information and communications technology (ICT) infrastructure and smart devices. With integrated solutions across four key domains ? telecom networks, IT, smart devices, and cloud services ? we are committed to bringing digital to every person, home and organization for a fully connected, intelligent world. At Huawei, innovation focuses on customer needs. We invest heavily in basic research, concentrating on technological breakthroughs that drive the world forward. We have 207,000 employees, and we operate in more than 170 countries and regions. Founded in 1987, Huawei is a private company fully owned by its employees. Huawei continues to invest in basic research and open innovation, and accommodates and addresses customer needs with an open mind, while steering these needs with science and technology. We have also built flexible business models and encourage numerous industries to adopt a vast range of models and applications. Through such initiatives, we are bringing digital to every person, home and organization for a fully connected, intelligent world. We seek and reward talent! At Huawei, if you are dedicated to creativity, engagement of technical risks and delivery of target-driven results, your efforts will be rewarded with outstanding career prospects. *About Huawei Finland R&D *With 28 sites across Europe and over 2000 researchers, Huawei?s European Research Institute (ERI) oversees fundamental and applied technology research, academic research cooperation projects, and strategic technical planning across our network of European R&D facilities. Huawei Finland Research Center was established in 2012. At our sites in Helsinki and Tampere, you will have an outstanding opportunity to be part of the leading research and development of future smart devices. We offer a career in a forward-looking industrial research team with a solid track record in innovation and publication and delivering its result as factual contributions to on-the-market devices. -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:22:25 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:22:25 +0200 Subject: [Job-offers-cs] New positions on the Informatics Europe job platform Message-ID: https://www.informatics-europe.org/services/informatics-job-platform.html From pekka.orponen at aalto.fi Sat Mar 14 15:30:14 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:30:14 +0200 Subject: [Job-offers-cs] Tenure Track Assistant Professor, Software Engineering (University of Oulu) Message-ID: About the job Faculty of Information Technology and Electrical Engineering, Software Engineering and Information Systems /The University of Oulu is a multidisciplinary, international research university, with about 4000 employees who produce new knowledge based on high-standards research and provide research based education to build a more sustainable, smarter, and more humane world. The University of Oulu community has about 17,000 people in total. Our northern scientific community operates globally and creates conditions for the emergence of innovations. /We are now looking for *Assistant Professor *to join us in the Software Engineering and Information Systems unit at the Faculty of Information Technology and Electrical Engineering. We are now seeking an Assistant Professor to join us in the Software Engineering (M3S) research group. M3S conducts basic and applied software engineering research at a high-quality, internationally recognized level. Our applied research involves several application domains, for example, automotive, health and wellness, cyber-physical systems, and emerging technologies such as AI and Quantum Software. The unit has a versatile portfolio of externally funded projects with industry collaborators, including Horizon Europe, ITEA, Research Council of Finland, and Business Finland. The unit is also responsible for software engineering education in Bachelor?s and Master?s programs at the University of Oulu and offers a double-degree Bachelor?s program in Software Engineering at the joint institute of the Oulu School and Nanjing Institute of Technology. The position aims to*further develop the unit's expertise in Software Architecture*within software engineering. While a Strong Research Profile In Software Architecture Is Considered a Key Qualification, We Are Also Open To Considering Outstanding Candidates In Other Areas Of Software Engineering Whose Work Complements Or Strengthens The Overall Research Strategy. These Areas May Include, But Are Not Limited To * Software engineering in relation to emerging technologies and paradigms (e.g., AI, Quantum) and applied domains * Requirements Engineering * Software Quality Assurance / Testing * Human, behavioral, and cognitive aspects of Software Engineering * Software security *About The Job *As an Assistant Professor of Software Engineering, you will: * Establish your own research track(s) in the field in line with the research unit's strategy. * Conduct independent research in your research track(s) and sustain international recognition. * Supervise doctoral researchers and mentor postdoctoral researchers. * Publish your research outcomes in top-quality software engineering journals and conferences. * Contribute to the software engineering teaching responsibilities of the unit as a responsible teacher for teaching courses and supervising thesis students. * Establish a sustainable funding portfolio in your research track(s) and form your own team. * Grow into taking leadership and administrative responsibilities within the research group and the university. Please note that this position is on-site in Oulu, Finland, and full-time remote work is not considered. *What We Offer * * The support to advance in your career through the University of Oulu tenure track. * An engaging work environment of an experienced and enthusiastic team of 70+ people, where you can share your expertise and grow as an expert. * Wellness benefit ePassi covering sport, culture, and well-being. Read more about other staff benefits. * Work that matters and a workplace that promotes flexibility and work-life balance. Read more about working with us. * We have an HR Excellence in Research -quality label, which is a recognition awarded by the European Commission for the development of researchers? working conditions and careers. * Our Buddy Programme and Spouse Network support you and your close ones in settling into Oulu. * If you are moving from abroad, we offer comprehensive relocation packages to support your smooth relocation to Oulu. * Finland is one of the most livable countries in the world, with a high quality of life, safety, an excellent education system, and a competitive economy. Read more about living in Oulu. *Who are you? *You should have excellent potential for a successful scientific career. The top candidates undergo an evaluation by external experts and must achieve a rating of ?excellent? or ?outstanding? in both the overall grade and the ?scientific excellence? category. In addition, top candidates are asked to give a teaching demonstration as part of the assessment of teaching skills. In evaluating teaching skills, the person selected for the tenure-track position must achieve at least a grade of ?good? (3/5). Find out more about our tenure-track system, entry criteria, evaluation procedures, and career advancement on our careers website. In order to succeed and enjoy the position, we require from you: * Doctoral degree in an applicable research field. To be eligible for a position as Assistant Professor, you must have received your doctoral degree not more than ten years ago. The doctoral degree must have been completed by the application closing date. * You must demonstrate the ability to engage in independent scientific research work. * Proven teaching skills required for the position. * In addition, publications and other demonstrated abilities and motivation for a scientific career are required * Excellent written and spoken communication skills in English *We Also Appreciate * * Evidence of acquired competitive research funding as PI, co-PI, or member of the research group. * Sufficient and relevant experience in international software engineering communities and evidence of international cooperation and recognition. * Evidence for continuous activity for pedagogical competence development. * Leadership and administration experience in research and teaching. * Significant periods of international mobility experience (teaching and/or research). * Societal engagement and impact activities. When assessing the candidate?s merits for the position of Assistant Professor, attention will be paid to scientific excellence, such as research outputs, international scientific activities and collaboration, supervision of undergraduate students, pedagogical competence, societal relevance, impact and potential of scientific activities, and services for the academic community. *Salary *The position is a fixed-term for 5 years, effective 1.9.2026, or as soon as possible thereafter. The salary will be based on the levels 5-6 of the demand level chart for teaching and research staff of Finnish universities. In addition, a salary component based on personal work performance will be paid (a maximum of 50 % of the job-specific component). The starting gross salary will be approx./4000-4700 /? per month (before taxes). A 6-month trial period is applied to the position. *How to apply? *Interested? If yes, please apply*by 15th April 2026*(23:59 Finnish local time) through our recruitment system. The application should be written in English and include the following: * Cover letter, including contact details of 2?4 persons available for recommendation. * CV following the guidelines of the Finnish Advisory Board on Research Integrity * List of publications following the guidelines of the Research Council of Finland, with the ten most important ones marked * Brief account of research merits * Teaching portfolio including: o Teaching philosophy, teaching strategies, and methods o A description of oneself as a teacher and an implementer of educational work o Practical experience in teaching and efforts to improve teaching, digital teaching skills, and giving feedback, possible participation in continuous learning provision, and international educational collaboration o Production and use of learning materials, including open educational resources o Maintaining and developing one?s own teaching and supervision competence; description of one?s pedagogical training; the significance of research in maintaining and developing one's teaching and supervision competence o Feedback received on teaching (student evaluations, peer evaluations, awards, and assessed test lectures) o Vision for the development of one?s teaching * Details regarding the acquisition of research funds * A brief research and action plan The selection process follows the University of Oulu tenure-track guidelines and is conducted by a recruitment committee. The candidates are subjected to publication analyses based on their publication lists. The candidates who are considered most suitable by the recruitment committee will undergo an expert evaluation. Top candidates will also be invited to an on-site or remote interview and asked to give a teaching demonstration as part of the assessment of teaching skills. All applicants will be notified during the selection process. We welcome applicants from all backgrounds, including people of different ages, genders, languages, cultures, and minority communities. *Contact Information *If you have any further questions, please contact Professor Minna Isomursu, M3S research group leader, minna.isomursu at oulu.fi, +358 50 5979660 Type of employment Temporary position over 6 months Contract type Full time Number of positions 1 Full-time equivalent 100% City Oulu County Pohjois-Pohjanmaa Country Finland Reference number 2026/95 Contact * Minna Isomursu, 0505979660 -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:32:58 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:32:58 +0200 Subject: [Job-offers-cs] University Lecturer in Computer Science (University of Helsinki) Message-ID: The duties of the University Lecturer include a broad range of computer science teaching in Finnish within the Bachelor?s and Master?s Programmes in Computer Science, as well as teaching in English within the multidisciplinary Bachelor?s Programme in Science. The role also involves supervising theses written in Finnish. More information and the application form in the Finnish version of the job announcement . *The call closes on 31 March 2026.* * * -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:33:44 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:33:44 +0200 Subject: [Job-offers-cs] Lecturers in Computer Science (Aalto University) Message-ID: <2681f10c-66a2-44e9-aad0-fd692a931514@aalto.fi> The Department of Computer Science at Aalto University is looking for new Lecturers in Computer Science. The positions in the lecturer career track are full-time and permanent, and open in the following areas: Bioinformatics, biostatistics, and health data science,?General computer science: programming, algorithms, and theory, and?Software engineering. More information and how to apply . *The call closes on 16 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:34:52 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:34:52 +0200 Subject: [Job-offers-cs] HIIT Postdoctoral Fellows in Computer Science (Aalto University, University of Helsinki) Message-ID: The Helsinki Institute for Information Technology (HIIT) is seeking Postdoctoral Fellows to join the Helsinki region information technology research community. The position is intended support early-career researchers on their road towards being independent researchers, in collaboration with one or more supervisors in HIIT Faculty. The position gives the fellows excellent opportunities for high-quality and high-impact research and for creating research networks supporting their careers.?We welcome applications across all areas in Computer Science, including?Algorithms and theory,?Bioinformatics and digital health,?Computing systems and networks,?Cybersecurity,?Human-computer interaction,?Machine learning and artificial intelligence, and?Software engineering. More information and how to apply . *The call closes on 22 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:38:24 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:38:24 +0200 Subject: [Job-offers-cs] Postdoctoral Artificial Intelligence Research Software Engineer (Aalto University) Message-ID: Postdoctoral Artificial Intelligence Research Software Engineer with an emphasis on AI research, performance optimization of AI training and inference, and hands-on-experience with PyTorch or similar. You should have experience in software development, computing, GPU computing, and data management for the support of AI projects. An ideal candidate also has a good understanding of recent advancement in AI and capability to read and implement research papers. More information and the application form . *The call closes on 31 March 2026.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:39:22 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:39:22 +0200 Subject: [Job-offers-cs] Postdoc Position in Hamburg In-Reply-To: <5DD3C780-5149-424C-A8E2-B9B97FAA71F0@uni-hamburg.de> References: <5DD3C780-5149-424C-A8E2-B9B97FAA71F0@uni-hamburg.de> Message-ID: <6faa10fc-182d-4e1a-ae9f-d00d067b2894@aalto.fi> We are seeking a motivated candidate for a 14 month full-time post-doctoral position in Randomized Algorithms in Hamburg, Germany. There is a possibility to extend the contract after 14 month. The researcher will join the ART Group at the University of Hamburg. The candidate is expected to focus solely on research and will not have any teaching or administrative duties. Prof. Dr. Petra Berenbrink : Universit?t Hamburg Candidates will have completed a PhD in Computer Science, Mathematics, Computer Engineerin or a related area. Information how to apply can be found under Ausschreibung Remember to include your CV and a recommendation letter. The application deadline is end of April. Please to not restate to contact me for further information, Petra Berenbrink From pekka.orponen at aalto.fi Sat Mar 14 15:39:57 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:39:57 +0200 Subject: [Job-offers-cs] Postdoctoral Research Associate in Data-driven Modelling of Collective Cell Behaviour Message-ID: <55c5d6c8-d3c6-4897-924b-b3930b0b86a5@aalto.fi> We invite applications for an outstanding postdoctoral research associate in data-driven modelling of collective cell behaviour to work with Professor Ruth Baker at the Mathematical Institute, University of Oxford. This is a 24-month, fixed-term position, funded by the Simons Foundation.?The start-date for this position is flexible, but September-November 2026 is preferred. The project will focus on combining theoretical and computational approaches (including data-driven mathematical models, tools for identifiability analysis and uncertainty quantification) to understand fundamental aspects of collective cell behaviours. Examples of topics studied in the Baker group include collective cell invasion, wound healing, and regenerative medicine. There will be the opportunity to work closely with experimental collaborators of the Baker Group. The research undertaken in this role will be carried out under the Simons Foundation Grant "Simons Investigator Award" (MP-SIP-00001828). The postdoctoral researcher will be expected to conduct research both independently and collaboratively with other members of the group at Oxford and elsewhere. They are also expected to provide informal mentorship of doctoral students in the group. Candidates should have strong training in cross-disciplinary applied mathematics, with a demonstrated interest in biology, and experience in machine learning approaches is a plus. More information can be found at www.maths.ox.ac.uk/node/80472. ------------------------------ Ruth Baker University of Oxford Oxford ------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sat Mar 14 15:40:46 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:40:46 +0200 Subject: [Job-offers-cs] Postdoctoral position | Bilkent University In-Reply-To: References: Message-ID: <902d2c98-60dd-4f10-83a1-04a18b2d3f1f@aalto.fi> Dear Colleagues, I am inviting applications for a postdoctoral position in my research group, the Bilkent Quantum & Topology Group (BilQCT), at Bilkent University. We are especially interested in researchers with a background in polyhedral geometry, algorithmic optimization, or graph-theoretic methods who are interested in applications to foundational problems in quantum computing. Full details and application instructions can be found on MathJobs: https://www.mathjobs.org/jobs/list/28142 Initial review begins May 15. Please feel free to forward this to interested candidates or reach out to me directly at cihan.okay at bilkent.edu.tr with any questions. Best, Cihan https://www.cihanokay.com/ From pekka.orponen at aalto.fi Sat Mar 14 15:41:12 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sat, 14 Mar 2026 15:41:12 +0200 Subject: [Job-offers-cs] Post-doc in graph algorithms (University of Warsaw) In-Reply-To: <3b4978c85536db54c9c36b5ec8087bbe@mimuw.edu.pl> References: <3b4978c85536db54c9c36b5ec8087bbe@mimuw.edu.pl> Message-ID: Hello, I am currently looking for a postdoctoral researcher in my project focused on the theory of graph algorithms (e.g., parallel, dynamic) at the University of Warsaw, Poland. More details about the position are available here: https://konkursydlanauczycieli.uw.edu.pl/api/document/3739/datafile/pdf For full consideration, please apply by March 15. As this is a very late call, the position will likely remain open until a suitable candidate is found. Please feel free to contact me directly if you have any questions. Best regards, Adam Karczmarz From pekka.orponen at aalto.fi Mon Mar 23 22:10:33 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Mon, 23 Mar 2026 22:10:33 +0200 Subject: [Job-offers-cs] Postdoc in complexity at Imperial College London (deadline this week, 27 March) In-Reply-To: References: Message-ID: Dear Colleagues, This is just to let you know that I am looking for postdocs in computational complexity to join my group at Imperial College London. The deadline is very close: *27 March 2026*. Please see below for further information. To apply, please use this link: https://www.imperial.ac.uk/jobs/search-jobs/description/index.php?jobId=27302&jobTitle=Research+Assistant+or+Associate+in+Computational+Complexity> Best wishes, --- Iddo ------------------------------ POSTDOCTORAL POSITION IN COMPUTATIONAL COMPLEXITY IMPERIAL COLLEGE LONDON DEPARTMENT OF COMPUTING ------------------------------ *Duration:* one year *Start date:* Autumn 2026 (flexible) *Deadline:* 27 March 2026 Applications are invited for a postdoctoral position in computational complexity in the Department of Computing at Imperial College London. The successful candidate will join the Complexity Group led by Iddo Tzameret and conduct research in computational complexity theory, with particular emphasis on fundamental lower bound questions. The position is based in the Department of Computing at Imperial College London, a major international computer science department in a strong research environment. The postholder will carry out an independent and collaborative research programme in computational complexity and related areas of theoretical computer science. Further information about the group is available at: https://ccag.doc.ic.ac.uk/> Further information about my research interests and papers is available at: http://www.doc.ic.ac.uk/~itzamere> Informal enquiries may be sent to: iddo.tzameret at gmail.com *How to apply* https://www.imperial.ac.uk/jobs/search-jobs/description/index.php?jobId=27302&jobTitle=Research+Assistant+or+Associate+in+Computational+Complexity> From pekka.orponen at aalto.fi Mon Mar 23 22:12:26 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Mon, 23 Mar 2026 22:12:26 +0200 Subject: [Job-offers-cs] Assistant/Associate Professor in Computer Science at the University of Warwick (Deadline: March 29, 2026) In-Reply-To: <7cf785a1-8697-e702-51b1-634a49a557de@warwick.ac.uk> References: <7cf785a1-8697-e702-51b1-634a49a557de@warwick.ac.uk> Message-ID: Assistant/Associate Professor opening in Computer Science at the University of Warwick https://warwick.ac.uk/dimap/focs_post_2026/ ---------------------------------------------------------------------------------------------------------- We are looking for enthusiastic researchers working in computer science to make a major contribution to the Department of Computer Science at the University of Warwick activities in research and teaching. This is an opportunity to join one of the UK's most prominent Computer Science departments, widely recognized for its excellence in Theoretical Computer Science (https://warwick.ac.uk/fac/sci/dcs/research/focs/ Discrete Mathematics (https://warwick.ac.uk/dimap/ and related areas, and to be part of an exciting time of growth in the Department. The applicants are expected to hold a PhD or equivalent in Computer Science or a related discipline. They should have an outstanding academic record, and show clear promise of developing a career in academia. They should have a strong commitment to undergraduate and postgraduate education. The post is in general computer science, though for us, research areas of interest include, but are not limited to, foundations of computer science (e.g., the design and analysis of algorithms, computational complexity, logic, discrete mathematics, combinatorics, and graph theory). Informal inquires can be addressed to Prof. Artur Czumaj (https://www.dcs.warwick.ac.uk/~czumaj/ any Theory group member (https://warwick.ac.uk/fac/sci/dcs/research/focs/people/ or Prof. Yulia Timofeeva (Head of Warwick Computer Science, https://www.dcs.warwick.ac.uk/~yulia/> *Closing date: March 29, 2026 (11:55pm UK time sharp).* It is expected that interviews will take place in May 2026. For more details and links to the application form, see this link: https://warwick-careers.tal.net/vx/lang-en-GB/mobile-0/appcentre-1/brand-4/user-11595/xf-287774c8e052/candidate/so/pm/1/pl/3/opp/3810-Assistant-Professor-and-Associate-Professor-30150-0226/en-GB From pekka.orponen at aalto.fi Sun Mar 29 15:11:14 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:11:14 +0300 Subject: [Job-offers-cs] New positions on the Informatics Europe job platform Message-ID: <000c7e58-d766-4926-ba0a-39696ab0af6f@aalto.fi> https://www.informatics-europe.org/services/informatics-job-platform.html From pekka.orponen at aalto.fi Sun Mar 29 15:27:01 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:27:01 +0300 Subject: [Job-offers-cs] Keith Julien Visiting Assistant Professorship in Applied Mathematics - University of Colorado Boulder Message-ID: The Department of Applied Mathematics at the University of Colorado Boulder invites applications for non-tenure-track*Keith Julien Visiting Assistant Professor*positions, to begin in August 2026. These term positions are renewable annually for up to a total of three years. Candidates in all areas of applied mathematics will be considered. The department is looking for candidates who have demonstrated excellence in research and who present documented evidence of teaching potential. The position includes developing one's research portfolio through collaborations within and outside the department and teaching one course per semester in the academic year. _What we can offer:_ $75,000/yr, and $4,000 startup in the first year with an additional $2,000 in research funds available every academic year. For full consideration, please apply by*April 1, 2026.*Position will remain open until filled. jobs.colorado.edu/jobs/JobDetail/?jobId=70547 ------------------------------ Stephen Becker, Associate Professor Dept. of Applied Math University of Colorado Boulder ------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 29 15:30:32 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:30:32 +0300 Subject: [Job-offers-cs] Three open positions in Optimization/Operations Research at the WU Vienna In-Reply-To: References: Message-ID: <43e18b64-b39a-451c-bd7d-3f1500b2fa48@aalto.fi> Dear colleagues, At the WU Vienna, at the Institute for Statistics and Mathematics, there are currently three open positions in Optimization/Operations Research. Please see: https://www.wu.ac.at/karriere/jobportal/jobs - PhD student: job ID 2701 https://wirtschaftsuniversitaet-wien-portal.rexx-systems.com/Teaching-and-Research-Associate-eng-j2701.html - Assistant Professor, non tenure-track: job ID 2699 https://wirtschaftsuniversitaet-wien-portal.rexx-systems.com/Assistant-Professor-non-tenure-track-eng-j2699.html - Assistant Professor, tenure-track: job ID 2705 https://wirtschaftsuniversitaet-wien-portal.rexx-systems.com/Assistant-Professor-tenure-track-qualification-agreement-eng-j2705.html Deadline for applications is April 15. Best regards, Ivana Ljubic From pekka.orponen at aalto.fi Sun Mar 29 15:32:14 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:32:14 +0300 Subject: [Job-offers-cs] Post-doc position at Kyoto University, Japan In-Reply-To: References: Message-ID: <59e8ab69-80a7-4fd5-bcc3-dab25c1c26bd@aalto.fi> EMPLOYMENT OPPORTUNITY --- One post-doc position in Discrete Mathematics / Algorithms / Combinatorial Optimization is available at Kyoto University, Japan. The expected starting date is 2026-10-01. The position is financed by a JSPS Fund for the Promotion of Joint International Research grant, "Next Generation International Research Hub for Algorithms, Combinatorial Optimization and Discrete Mathematics" with project leader Professor Ken-ichi Kawarabayashi (NII). The appointee will be hired by Professor Shin-ichi Minato and supervised by Professor David Avis and Dr. Jesper Jansson at Kyoto University, Japan. For more details, including information about the application procedure, please see: https://jrecin.jst.go.jp/seek/SeekJorDetail?id=D126031115&ln=1 --- From pekka.orponen at aalto.fi Sun Mar 29 15:33:02 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:33:02 +0300 Subject: [Job-offers-cs] Postdoctoral researcher position (nonlinear optimization) at the University of Tokyo Message-ID: <7e59437e-4ff7-49a0-9f78-b982abb9785d@aalto.fi> Ching-pei Lee and Akiko Takeda are recruiting a postdoctoral researcher to work on nonlinear optimization for?up to 5 years with a starting date set for September 2026 (negotiable). The position is based in the 5th Laboratory of the Department of Mathematical Informatics at the University of Tokyo. Full details are available at the following link: leepei.github.io/postdoc_ad.pdf This position is funded by the Boost program of the Japan Science and Technology Agency. ------------------------------ Ching-pei Lee Tokyo ------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 29 15:34:55 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:34:55 +0300 Subject: [Job-offers-cs] UChicago postdoc opportunity on AI for astrophysics Message-ID: <2b2a09ff-ed96-42d1-bcce-4db7bfa70a6c@aalto.fi> Dear all, The University of Chicago and the NSF-Simons AI Institute for the Sky (SkAI ) are seeking a Postdoctoral Associate. The associate will work on generative machine learning methods for astrophysical dynamics under the mentorship of Rebecca Willett, Nisha Chandramoorthy (University of Chicago), and Frederic Rasio (Northwestern University). The appointment is initially for one year, with the possibility of renewal for two additional years. Spurred by the coming generation of large sky surveys, the SkAI Institute brings together astrophysics and AI researchers to advance both fields through cross-disciplinary collaboration and will serve as a nexus for the further development of a nationwide Astro-AI community. SkAI is a vibrant research community of scholars from computer science, astronomy, applied mathematics, astrophysics, and statistics. The associate will benefit from a dynamic, cross-disciplinary intellectual environment (including workshops, lecture series, conferences, retreats, and more), engaged mentorship, training opportunities, access to computing resources suited for AI research, and opportunities to collaborate with peers and mentor students from SkAI academic partners. This position requires a PhD in Mathematics, Physics, Engineering, or a related field, with strong ML/AI experience and an interest in astrophysics. Please send your expression of interest in an email with your CV attached to Nisha Chandramoorthy (email: nishac at uchicago.edu). -------------- next part -------------- An HTML attachment was scrubbed... URL: From pekka.orponen at aalto.fi Sun Mar 29 15:36:03 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:36:03 +0300 Subject: [Job-offers-cs] Postdoctoral Position for Female Candidates (FGV EMAp, Rio) - Deadline 31/03/2026 In-Reply-To: References: Message-ID: <39cd655f-0e87-4c4b-aee3-86bdc0b2f9b4@aalto.fi> *Chair Mar?lia Chaves Peixoto at FGV EMAp 2026* The School of Applied Mathematics at Funda??o Getulio Vargas (*FGV EMAp Kind regards. *School of Applied Mathematics* *Funda??o Getulio Vargas - FGV EMAp* *+ 55 21 3799 5917* *https://emap.fgv.br/ *emap at fgv.br * Mar?a Soledad Aronna Associate Professor at FGV EMAp, Rio de Janeiro, Brazil President of the Brazilian Society of Computational and Applied Mathematics (SBMAC) https://sites.google.com/view/aronna From pekka.orponen at aalto.fi Sun Mar 29 15:36:50 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:36:50 +0300 Subject: [Job-offers-cs] Postdoc position in Prague: Learning-Augmented Combinatorial Optimization Algorithms for Scheduling and Packing In-Reply-To: <5424d46c-5107-4f9f-b947-85040b6ec764@cvut.cz> References: <5424d46c-5107-4f9f-b947-85040b6ec764@cvut.cz> Message-ID: Offer Description: The project addresses difficult scheduling and packing problems in the sense of computational complexity, for which classical exact approaches are often impractical at realistic scales. The goal is to design new algorithmic frameworks that combine established tools from Operations Research with modern Machine Learning methods to produce high-quality solutions within acceptable computational times. While rooted in OR, the project requires and will further develop strong competencies in Machine Learning. Over the past decade, learning-augmented optimization has emerged as a promising paradigm. In exact methods, machine learning has been used to tune solver parameters or guide search in tree-based algorithms for mathematical programming. In heuristic optimization, learning has supported diversification strategies, automated selection of algorithms for specific instances, and even direct construction of solutions. More recently, reinforcement learning and deep learning techniques have been used to guide local search procedures, particularly for transportation and routing problems, demonstrating substantial performance improvements. This project will focus on scheduling and packing settings, developing general methodologies rather than problem-specific tricks. Two complementary research directions will be pursued. First, machine learning will be used to improve the parameterization of heuristic algorithms. Second, learning methods?especially reinforcement learning?will be employed to guide the exploration of solution spaces. This includes selecting promising neighborhoods, prioritizing moves in local search, or constructing solutions incrementally. The research will build on several successful applications of ML in combinatorial optimization. These include reinforcement learning?guided greedy procedures for graph optimization problems, predictive models for deciding when decomposition techniques should be applied, and classifiers that identify structural characteristics of high-quality solutions. Additional directions involve predicting optimal objective values for complex engineering design problems and developing reinforcement learning?enhanced metaheuristics, such as iterated local search for makespan minimization in advanced manufacturing scheduling. The developed methods will be evaluated on challenging NP-hard scheduling and packing problems, including both well-studied benchmark problems with strong existing heuristics and more applied, real-world problems where current methods remain insufficient. The objective is to demonstrate that the integration of ML and OR techniques can yield robust improvements across different problem types. About the group: The Optimization Group, led by Zdenek Hanzalek, focuses on scheduling and combinatorial optimization.? The group collaborates strongly with high-tech companies (CEZ ? Czech Energy Group, Porsche Engineering Services, EATON, Skoda Auto, ST Microelectronics, Volkswagen, DHL, ?). Zdenek is the principal investigator of the Roboprox project and organizer of SchedulingSeminar.com. [1] Bengio, Y., Lodi, A. Prouvost, A. (2021). Machine Learning for Combinatorial Optimization: a Methodological Tour d?Horizon, European Journal of Operational Research, 290:405-421. [2] Nina Mazyavkina, Sergey Sviridov, Sergei Ivanov, Evgeny Burnaev, Reinforcement learning for combinatorial optimization: A survey, Computers & Operations Research, Volume 134, 2021. [3] Heinz, V.; Hanz?lek, Z.; Vil?m, P.: Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks, Computers & Industrial Engineering, Volume 209, November 2025, 111413. [4] Roman V?clav?k, Anton?n Nov?k, P?emysl ??cha, Zden?k Hanz?lek, Accelerating the Branch-and-Price Algorithm Using Machine Learning, European Journal of Operational Research, Volume 271, Issue 3, 2018, Pages 1055-1069. [5] Grus, J.; Hanzalek, Z.: Automated placement of analog integrated circuits using priority-based constructive heuristic, Computers & Operations Research, Volume 167, 106643, July 2024. Contract details and dates ?Hours Per Week: 40 ?Offer Starting Date: April 1, 2026 Application Deadline Date and Time: March 31, 2026 - 23:45 (Europe/Prague) Company/Institute: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, City: Prague Postal Code: 160 00 Street: Jugosl?vsk?ch partyz?n? 1580/3 Skills/Qualifications: ? ? Motivation to perform excellent research, become part of the world's research communities in your field, and publish in first-tier scientific conferences and journals, ? ? Ph.D. degree or equivalent (awarded or to be completed soon), ? ? Co-author of at least 3 papers published in impact factor journals or prestigious conferences, ? ? Professional proficiency in spoken/written English (knowledge of the Czech language is not required). Specific Requirements:? good background in scheduling, combinatorial optimization and algorithm design/implementation. Benefits: ? ? ? ? ?An initial appointment for 1 year (with an extension of up to 2 years) ? ? ? ? ?Salary around 70000 CZK gross monthly; check the Numbeo database for the cost of living in Prague ? ? ? ? ?Full social and health insurance ? ? ? ? ?30 days of paid annual leave ? ? ? ? ?Children?s corner, kindergarten, and elementary school operated by the Czech Technical University in Prague ? ? ? ? ?Additional benefits such as subsidized meals, yearly benefits supporting recreational and sports activities, as well as health care programs ? ? ? ? ?An informal and inclusive international working environment at the Industrial Informatics Department, CIIRC, CTU in Prague. Selection process: Interested candidates are invited to submit their applications at: https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID: 04-Postdoc-Hanzalek] The application package should contain: ? Motivation letter (up to two pages), stating personal goals and research interests ? Academic curriculum vitae, including a list of publications highlighting the three most important ones ? Contact details for two to three referees who could support your application, ? A copy or a link to your Ph.D. thesis, ? Date of your Ph.D. award or the expected date of your Ph.D. thesis defense. Euraxess code: https://www.euraxess.cz/jobs/415421> -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/ From pekka.orponen at aalto.fi Sun Mar 29 15:37:41 2026 From: pekka.orponen at aalto.fi (Pekka Orponen) Date: Sun, 29 Mar 2026 15:37:41 +0300 Subject: [Job-offers-cs] Postdoc position in Prague: Solving Large-Scale Scheduling Problems: Hybridization, Parallelism, and Model Diversity in Constraint Programming In-Reply-To: <366ce5f7-9462-482f-b7e0-7bc085d4c136@cvut.cz> References: <366ce5f7-9462-482f-b7e0-7bc085d4c136@cvut.cz> Message-ID: Offer Description: Scheduling problems such as the Resource-Constrained Project Scheduling Problem (RCPSP) remains one of the central challenges in combinatorial optimization, particularly in large-scale industrial settings. As instance sizes grow and objective functions become more sophisticated, classical exact or single-strategy heuristic approaches are no longer sufficient. Future progress requires carefully designed hybrid and parallel solution frameworks. Today, Large Neighborhood Search (LNS) is the dominant heuristic paradigm in modern constraint programming (CP) scheduling solvers such as IBM ILOG CP Optimizer, Google OR-Tools, and OptalCP. Compared to traditional local search, LNS offers improved diversification and a stronger ability to escape local optima by iteratively destroying and repairing large fragments of a schedule. In parallel, Failure-Directed Search (FDS) provides a systematic mechanism for exploring the entire search space using a fail-first principle to prove infeasibility or optimality. While this combination is highly effective for classical objectives such as makespan minimization, CP solvers become less efficient when handling more complex criteria, such as cost-aware scheduling, or specific constraints, such as sequence dependent setup times. In such cases, purely generic search strategies may struggle to quickly produce high-quality incumbents, which are crucial for pruning the search space. A promising research direction is the integration of problem-oriented heuristics within the CP solving process. Fast constructive or improvement heuristics tailored to specific RCPSP structures can generate strong feasible solutions early in the search. These solutions provide tight upper bounds that can be injected into the CP model as hard objective constraints, significantly reducing the search space explored by FDS. The stronger the incumbent, the more aggressively the complete search can prune suboptimal regions. Beyond hybridization, large-scale RCPSP strongly benefits from parallel search architecture. Modern CP solvers, such as OptaCP, support multiple solver workers running concurrently. Instead of replicating identical models across workers, we propose exploiting model diversity: each worker can employ a different CP model formulation, search strategy, or propagation emphasis. For example, one worker may use a time-indexed formulation, another a start-time interval-based model, and another a precedence- or flow-oriented reformulation. Similarly, workers can differ in symmetry braking, variable ordering, restart policies, or LNS neighborhood design. Such heterogeneous parallelism increases robustness and coverage of the search space. Workers can share global incumbents, objective bounds, and nogoods during execution. When one worker discovers a high-quality solution, all others immediately benefit through tighter pruning. Conversely, proofs of infeasibility or bound improvements obtained by one model can accelerate convergence across the entire portfolio. This cooperative, portfolio-based architecture combines intensification within each worker with diversification across workers. The proposed research aims to design and analyze these hybrid and parallel CP frameworks namely for large-scale RCPSP. Emphasis will be placed on principled model reformulation, effective bound sharing, and scalable synchronization mechanisms that preserve solver efficiency while maximizing information exchange. [PER] L. Perron, P. Shaw, V. Furnon, Propagation guided large neighborhood search, in: M. Wallace (Ed.), Principles and Practice of Constraint Programming ? CP 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 468?481. [OPT] ScheduleOpt: OptalCP?s solver landing page (2023). URL https://scheduleopt.com/>[VIL ]P. Vil?m, P. Laborie, P. Shaw, Failure-directed search for constraint-based scheduling, in: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Springer, 2015, pp. 437?453. Contract details and dates ?Hours Per Week: 40 ?Offer Starting Date: April 1, 2026 Application Deadline Date and Time: March 31, 2026 - 23:45 (Europe/Prague) Company/Institute: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, City: Prague Postal Code: 160 00 Street: Jugosl?vsk?ch partyz?n? 1580/3 Skills/Qualifications: ?Motivation to perform excellent research, become part of the world's research communities in your field, and publish in first-tier scientific conferences and journals, ?Ph.D. degree or equivalent (awarded or to be completed soon), ?Co-author of at least 3 papers published in impact factor journals or prestigious conferences, ?Professional proficiency in spoken/written English (knowledge of the Czech language is not required). Specific Requirements: good background in scheduling, combinatorial optimization and algorithm design/implementation. Benefits: ?An initial appointment for 1 year (with an extension of up to 2 years) ?Salary around 70000 CZK gross monthly; check the Numbeo database for the cost of living in Prague ?Full social and health insurance ?30 days of paid annual leave ?Children?s corner, kindergarten, and elementary school operated by the Czech Technical University in Prague ?Additional benefits such as subsidized meals, yearly benefits supporting recreational and sports activities, as well as health care programs ?An informal and inclusive international working environment at the Industrial Informatics Department, CIIRC, CTU in Prague. Selection process: Interested candidates are invited to submit their applications at: https://forms.gle/hj7bMTuKM4ghzPC17 [using Postdoc Position ID: 03-Postdoc-Hanzalek] The application package should contain: ?Motivation letter (up to two pages), stating personal goals and research interests ?Academic curriculum vitae, including a list of publications highlighting the three most important ones ?Contact details for two to three referees who could support your application, ?A copy or a link to your Ph.D. thesis, ?Date of your Ph.D. award or the expected date of your Ph.D. thesis defense. Euraxess code: https://www.euraxess.cz/jobs/415419> -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/