Special PhD positions at the Department of Computer Science
Topic: Distributed Control for Metamorphic Robots
Supervisor: Prof. Jiří Barnat
Topic: Control of distributed multi-agent systems under temporal constraints
Supervisor: Prof. Ivana Černá
Topic: Structural Graph Theory and Algorithmic Metatheorems
Supervisor: Prof. Petr Hliněný
Topic: Analytic methods for large discrete objects
Supervisor: Prof. Daniel Kráľ
The deadline for application is December 16, 2018.
Prospective PhD students are expected to show their research background and skills in the area of the selected PhD topic. They should also be proficient in English; prior knowledge of Czech is not necessary.
Each of the PhD positions is funded with a stipend of net value at least 29000CZK per month (this amount consists of the standard doctoral stipend and the extra departmental supplement of 10000CZK per month), which is approximately 1100Eur and is above the level of an average net salary in the Czech Republic. The stipend is granted to successful applicants for the first 2 years, with an expected renewal (after an evaluation) for another 2 years. The total length of study is 4 years.
Applicants are advised to contact directly their prospective supervisor (as listed below) for more specific details, well ahead of the deadline.
Applications consisting of CV, motivation letter, and possibly other relevant documents supporting the candidate's excellence should be sent
to prof. RNDr. Mojmír Křetínský, CSc. (
mojmirNRKHsK=zB@finTo6Y_Cp8.muni0Z6mVVa7D.cz) December 16, 2018.
Applications will be evaluated by the departmental committee, which will choose the best eligible applicant(s) over all the advertised topics.
The candidates are still obliged to pass the standard admission procedure for doctoral study. The stipend can be awarded only after successfully completing the standard admission procedure.
Distributed Control for Metamorphic RobotsSupervisor: prof. RNDr. Jiří Barnat, Ph.D.
Area: Distributed control of parallel robotic systems
Metamorphic robots are built from a number of identical, but autonomous robotic modules. The modules alone come with very limited capabilities, however, they may connect together and cooperate to perform a more complex task. The Ph.D. position offered focuses on the development of algorithms for distributed control of locomotion and reconfiguration of metamorphic robots, as well as on the ease of use of such the platform. The candidate is also expected to contribute to the construction of a local metamorphic platform.
Control of distributed multi-agent systems under temporal constraintsSupervisor: prof. RNDr. Ivana Černá, CSc.
Area: Theoretical computer science, Formal Methods
Modern engineering systems such as autonomous ground and aerial vehicles, or human-robot collaborative teams, evolve quickly due to industrial needs. As these systems are typically safety critical, there is an equally growing need for formal approaches to their specification, design and verification. The prospective student shall focus on the problem of synthesis of control strategy for a complex dynamic distributed systems that satisfies given both qualitative and quantitative formal specifications. A special focus should be given on coordination of multiple devices working on a common task. Prior introductory knowledge of formal approaches to formal verification is welcome.
Topic: Structural Graph Theory and Algorithmic MetatheoremsSupervisor: prof. RNDr. Petr Hliněný, Ph.D.
Area: Theoretical computer science, Graph Theory
The prospective student shall work on width and depth parameters (such as tree-width and tree-depth and other) of graphs and other relational structures, and apply the theoretical results in
algorithmic metatheorems on restricted graph classes. The focus shall be on investigation of sparse graph classes and on complementary “dense” depth parameters such as the new shrub-depth, and
on metatheorems for problems formulated in FO logic. Prior introductory knowledge of structural graph theory, logic and parameterized complexity is welcome.
For more information, consult the current research directions.
Topic: Analytic methods for large discrete objectsSupervisor: Prof. Daniel Kráľ
Area: Theoretical computer science, Graph Theory
The theory of combinatorial limits is a rapidly evolving area of combinatorics, which offers analytic tools to represent and analyze large discrete objects (such as graphs or hypergraphs) and has many applications in computer science and mathematics. The prospective student shall focus on applications of analytic tools concerning graph limits, e.g., in extremal combinatorics, and on investigating the mutual relation between the existing analytic representations of sparse large graphs. Prior knowledge of graph theory and good background in mathematical analysis are welcome.