1. Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time;Broersma;Theor. Comput. Sci.,2012
2. Isomorphism testing for graphs excluding small topological subgraphs;Neuen,2022
3. Distributed Computing: a Locality-Sensitive Approach;Peleg,2000
4. On the power of the congested clique model;Drucker,2014
5. Possibilities and impossibilities for distributed subgraph detection;Fischer,2018