Marcin Pilipczuk: Computing sparsity stuff in real world graphs

In the two-lecture course I will survey known approaches to compute generalized coloring numbers and the corresponding orderings (first lecture) and to use the uniform quasi-wideness property (second lecture) from the point of view of algorithmic engineering. Some simplifications will be developed. Finally, we will discuss performance of the algorithms in various real-world graphs. The experimental results are mostly based on a joint work with W. Nadara, R. Rabinovich, F. Reidl, and S. Siebertz from SEA 2018.