The Discrete Structures Group of Prof Johannes Carmesin is inviting applications for a postdoc position, preferably with research expertise in topological graph theory, matroid theory or algorithms. Exceptional candidates from other areas of Mathematics are also encouraged to apply.
The second EBC (Escola Brasileira de Combinatória / Brazilian School of Combinatorics) will be held at IMPA in Rio de Janeiro, RJ, during the week of March 10-14, 2025.
The University of St Andrews is hiring a PhD student to work on the project “Algorithms for Multidimensional Words” supervised by Dr Duncan Adamson. This is an open-ended project with a broad range of possible research directions, covering various combinatorial, algorithmic and optimisation problems.
A PhD position for UK Home students is available in the School of Electronic Engineering and Computer Science at Queen Mary University of London, under the supervision of Marc Roth. The research project will focus on the parameterized and fine-grained complexity of computational counting problems related to the analysis of large networks.
Aarhus University is looking for candidates for its four opportunities in the Department of Computer Science. Candidates with expertise in “Algorithms, Data Structures and Foundations of Machine Learning”, “Data Intensive Systems”, “Cryptography and Cybersecurity”, “Computational Complexity and Game Theory”, “Logic and Semantics”, “Ubiquitous Computing and Interaction”, “Collaboration and Computer-Human Interaction”, and “Programming Languages” are encouraged to apply.
The Department of Liberal Arts and Sciences is offering an opening for a fully funded doctoral research opportunity (100% position – TVL E13) supervised by Prof. Dr. Johannes Thürauf (Professor for Discrete Optimization).
The 26th International Conference on Descriptional Complexity of Formal Systems is organized by the Department of Computer Science, Loughborough University, and by the IFIP Working Group 1.02 “Descriptional Complexity”.
The Faculty of Science at the University of Calgary invites applications for a Tenure-Track Assistant Professor (Research and Teaching) in Computer Science position with a focus on Theoretical Foundations of Computer Science.
The investigator group Scalable Automated Reasoning at Karlsruhe Institute of Technology (KIT), Germany, is looking for a research assistant (a.k.a. doctoral researcher, PhD student), beginning as soon as possible.
The conference aims to unite scholars from different disciplinary backgrounds to emphasize disseminating ongoing research and development.
The 4th edition of the workshop Metabolism and Mathematical Models: Two for a tango will focus on metabolism in general, with a special but not exclusive focus on parasitology. In addition to exploring the biological, biochemical, and biomedical aspects, the workshop will also aim to present some of the mathematical modeling, algorithmic theory, and software development that have become essential to explore such aspects.
Télécom SudParis, Institut Polytechnique de Paris, is seeking a 12-month postdoctoral researcher to work in the area of intrusion detection in Cooperative Intelligent Transportation Systems (C-ITS) under the supervision of Maryline LAURENT and Badis HAMMI.
The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.
The first edition of the Workshop in Phylogeny and Cophylogeny: Tree for a Tango will be will be on phylogeny and cophylogeny in general, mathematical modelling and algorithms, and on biology/health. The workshop is open to the community in general and will be held in a virtual way.
The Swiss Winter School on Theoretical Computer Science will be the third in a series of annual winter schools jointly organized by EPFL and ETH Zurich, to educate outstanding international PhD students about exciting recent developments in theoretical computer science.
The research group for theoretical computer science at the Hamburg University of Technology is inviting applications for one full-time research assistant position to do research in the field of constraint satisfaction problems. The research will take place under the supervision of Antoine Mottet.
Max Planck Institute for Informatics is looking for applicants from all areas of algorithms and complexity as well as related areas (such as algorithm engineering, high-performance computing, theory of computation, and quantum computing).
The Symposium on Algorithmic Foundations of Dynamic Networks is a primary venue for original research on the fundamental aspects of computing in dynamic networks and dynamic computational processes.
Book: Securing the Digital Supply Chain: Advances, Challenges, and Solutions – SDSC 2024 – Publisher: Springer Nature
The workshop will investigate how technologies that are typically exploited in the context of Cloud and Edge environments, including serverless computing, microservices, and load balancers, must be adapted, tailored and managed to achieve efficient and scalable solutions able to support the execution of HPC applications.
In this talk divisible load theory (DLT) will be introduced. The theory is a scheduling and computer performance model applicable in data-parallel applications.
