NP-completeness in hedonic games, Games and Economic Behavior, vol.49, issue.1, pp.1-30, 2004. ,
DOI : 10.1016/j.geb.2003.10.003
Graph theory, Grad. Texts in Math, vol.244, 2008. ,
DOI : 10.1007/978-1-84628-970-5
Coalition formation games with separable preferences, Mathematical Social Sciences, vol.45, issue.1, pp.27-52, 2003. ,
DOI : 10.1016/S0165-4896(02)00082-3
Distributed Game-Theoretic Vertex Coloring, OPODIS'10, pp.103-118 ,
DOI : 10.1007/978-3-540-92182-0_19
A theory of strict P-completeness, Computational Complexity, vol.13, issue.5, pp.220-241, 1994. ,
DOI : 10.1007/BF01206637
The complexity of hedonic coalitions under bounded cooperation ,
Sharing the Cost of Multicast Transmissions, Journal of Computer and System Sciences, vol.63, issue.1, pp.21-41, 2001. ,
DOI : 10.1006/jcss.2001.1754
Computing Stable Outcomes in Hedonic Games, SAGT'10, pp.174-185 ,
DOI : 10.1016/j.ejor.2009.09.004
Limits to parallel computation: P-completeness theory, 1995. ,
A Model of Computation for MapReduce, SODA'10, pp.938-948 ,
DOI : 10.1137/1.9781611973075.76
An Experimental Study of the Coloring Problem on Human Subject Networks, Science, vol.313, issue.5788, pp.313824-827, 2006. ,
DOI : 10.1126/science.1127207
Information-sharing in social networks, Games and Economic Behavior, vol.82, pp.702-716, 2013. ,
DOI : 10.1016/j.geb.2013.10.002
Distributed Welfare Games, Operations Research, vol.61, issue.1, pp.155-168, 2013. ,
DOI : 10.1287/opre.1120.1137
A Game Theoretic Approach for Efficient Graph Coloring, ISAAC'08, pp.183-195 ,
DOI : 10.1007/978-3-540-92182-0_19
Computational complexity, 2003. ,
Fine-Grained Algorithms and Complexity (Invited Talk), STACS'16 ,