# Graph and Network Algorithms

Graphs are a model of many real world phenomena, e.g., social networks, road networks, electricity networks, control flow graphs of computer programs. We study efficient algorithms to solve research questions on such networks. One important direction is the use of *decomposition techniques* to solve problems more efficiently, with tree decompositions for graphs of *small treewidth* an important example of the application of such techniques. In our research, we aim at applying such decomposition techniques, as well as designing new techniques to increase the applicability and efficiency of the resulting algorithms. We also study optimization and planning problems on networks from applications, e.g., industrial planning, logistics (e.g., public transport planning), electrical networks, and networks representing the structure of software.