1. On the complexity of the maximum cut problem;Bodlaender;Nordic J. Comput.,2000
2. Graph Theory;Bondy,2007
3. Dominating sets for split and bipartite graphs;Bertossi;Inform. Process. Lett.,1984
4. Election, naming and cellular edge local computations;Chalopin,2004
5. Local computations in graphs: the case of cellular edge local computations;Chalopin;Fund. Inform.,2006