Theoretical Computer Science
Projects
- Communication Network Design
- Design of optimal networks having favorable properties for various communication tasks, e.g., broadcasting or gossiping, and for various reliability parameters.
- Computational solutions to algebraic problems
- Computational complexity and practical solvability of questions that can make use of algebraic structures such as groups.
- Fault-tolerant communication networks
- Investigation of classes of minimal graphs preserving connectivity under certain types of element failures.
- Tree-Like Graphs
- structural properties of graphs embeddable in k-trees