Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
- Delft University of Technology (TU Delft)
- Empa
- Leiden University
- Umeå University
- CNRS
- DAAD
- Delft University of Technology (TU Delft); 17 Oct ’25 published
- Eindhoven University of Technology (TU/e); yesterday published
- Leiden University; Leiden
- Nature Careers
- Umeå universitet
- University of Birmingham;
- University of Cambridge;
- University of Southern Denmark
- University of Warwick
- 5 more »
- « less
-
Field
-
background in combinatorics, especially graph theory, together with basic knowledge of probability theory, are required. Documented experience in extremal combinatorics, graph theory, set theory
-
successful applicants will take part in the research and teaching activities at the Chair of Algorithmic and Structural Graph Theory within the Institute of Theoretical Computer Science at TUD. The main
-
department is available at: https://www.umu.se/en/department-of-computing-science/ Project description Graph transformation is a well-established theory that studies computational methods to transform graphs
-
to the success of the whole institution. The Faculty of Computer Science, Institute of Theoretical Computer Science, thenewly established Chair of Algorithmic and Structural Graph Theory offers a position as
-
of extensive-form games. These studies highlighted the effectiveness of combining tools from graph theory, mathematical programming, and dynamic programming to compute pure Nash equilibria in extensive-form
-
spectral graph theory. The PhD will be supervised by Anurag Bishnoi.You will have the opportunity to collaborate with Postdocs, PhD candidates, and other faculty members of the research group. You will also
-
the department is available at: https://www.umu.se/en/department-of-computing-science/ Project description Graph transformation is a well-established theory that studies computational methods
-
including: * Algorithmic game theory * Approximation algorithms * Automata and formal languages * Combinatorics and graph algorithms * Computational complexity * Logic and games * Online and dynamic
-
probability, allow for the application of tools from probability theory to combinatorial problems and motivate the study of the typical properties of various combinatorial models, such as the Erdős–Rényi random
-
14 Oct 2025 Job Information Organisation/Company Empa Research Field Computer science » Programming Computer science » Other Engineering » Electrical engineering Engineering » Other Mathematics