1: Deciding k-colourability of $P_5$-free graphs in polynomial time
2: Parameterized Algorithms for Directed Maximum Leaf Problems
3: Nash equilibria in Voronoi games on graphs
4: A probabilistic analysis of a leader election algorithm
5: An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
6: Neighbor selection and hitting probability in small-world graphs
7: A Local Algorithm for Finding Dense Subgraphs