Hamed Hatami

	2009
17		Hamed Hatami: Decision Trees and Influences of Variables Over Product Probability Spaces. Combinatorics, Probability & Computing 18(3): 357-369 (2009)
	2008
16		Peyman Afshani, Hamed Hatami: Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. 105(3): 83-87 (2008)
15		Mahya Ghandehari, Hamed Hatami: Fourier analysis and large independent sets in powers of complete graphs. J. Comb. Theory, Ser. B 98(1): 164-172 (2008)
14		Hamed Hatami, Michael Molloy: Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33(3): 310-332 (2008)
	2007
13		Hamed Hatami, Avner Magen, Evangelos Markakis: Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. APPROX-RANDOM 2007: 164-179
12		Hamed Hatami, Ruzbeh Tusserkani: On the Complexity of the Circular Chromatic Number CoRR abs/cs/0701007: (2007)
11		Hamed Hatami, Hossein Maserrat: On the Computational Complexity of Defining Sets CoRR abs/cs/0701008: (2007)
10		Peyman Afshani, Hamed Hatami: Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions CoRR abs/cs/0701009: (2007)
9		Hamed Hatami, Pooya Hatami: Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electr. J. Comb. 14(1): (2007)
	2006
8		Hamed Hatami, Avner Magen, Vangelis Markakis: Integrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of Negative Type metrics CoRR abs/cs/0601011: (2006)
	2005
7		Hamed Hatami, Hossein Maserrat: On the computational complexity of defining sets. Discrete Applied Mathematics 149(1-3): 101-110 (2005)
6		Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian: On the size of the minimum critical set of a Latin square. Discrete Mathematics 293(1-3): 121-127 (2005)
5		Hamed Hatami: Random cubic graphs are not homomorphic to the cycle of size 7. J. Comb. Theory, Ser. B 93(2): 319-325 (2005)
4		Hamed Hatami: Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Comb. Theory, Ser. B 95(2): 246-256 (2005)
3		Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu: Circular chromatic index of graphs of maximum degree 3. Journal of Graph Theory 49(4): 325-335 (2005)
	2004
2		Hamed Hatami, Ruzbeh Tusserkani: On the complexity of the circular chromatic number. Journal of Graph Theory 47(3): 226-230 (2004)
	2000
1		Jafar Habibi, Ehsan Foroughi, Mehran Motamed, Pooya Karimian, Hamed Hatami, Hossein Fardad: SharifII Soccer Simulation Team. RoboCup 2000: 437-440

Coauthor Index

1	Peyman Afshani	[3] [10] [16]
2	Hossein Fardad	[1]
3	Ehsan Foroughi	[1]
4	Mahsa Ghandehari	[3]
5	Mahya Ghandehari	[3] [6] [15]
6	Jafar Habibi	[1]
7	Pooya Hatami	[9]
8	Pooya Karimian	[1]
9	Avner Magen	[8] [13]
10	Ebadollah S. Mahmoodian	[6]
11	Evangelos Markakis (Vangelis Markakis)	[8] [13]
12	Hossein Maserrat	[7] [11]
13	Michael Molloy (Michael S. O. Molloy)	[14]
14	Mehran Motamed	[1]
15	Ruzbeh Tusserkani	[2] [3] [12]
16	Xuding Zhu	[3]

Colors in the list of coauthors