Hamed Hatami

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
2013
j16
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov: On the number of pentagons in triangle-free graphs. J. Comb. Theory, Ser. A 120(3): 722-732 (2013)
2012
j15
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov: Non-Three-Colourable Common Graphs Exist. Combinatorics, Probability & Computing 21(5): 734-742 (2012)
j14
Hamed Hatami, Michael Molloy: The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1): 99-123 (2012)
c5
Anil Ada, Omar Fawzi, Hamed Hatami: Spectral Norm of Symmetric Functions. APPROX-RANDOM 2012: 338-349
i10
Anil Ada, Omar Fawzi, Hamed Hatami: Spectral Norm of Symmetric Functions. CoRR abs/1205.5282 (2012)
i9
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012)
i8
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. Electronic Colloquium on Computational Complexity (ECCC) 19: 184 (2012)
2011
c4
Hamed Hatami, Shachar Lovett: Correlation testing for affine invariant properties on Fpn in the high error regime. STOC 2011: 187-194
i7
Hamed Hatami, Shachar Lovett: Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime. CoRR abs/1104.3335 (2011)
i6
Hamed Hatami, Shachar Lovett: Correlation testing for affine invariant properties on Fpn in the high error regime. Electronic Colloquium on Computational Complexity (ECCC) 18: 29 (2011)
2010
c3
Hamed Hatami, Michael Molloy: The Scaling Window for a Random Graph with a Given Degree Sequence. SODA 2010: 1403-1411
i5
Hamed Hatami, Shachar Lovett: Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms. Electronic Colloquium on Computational Complexity (ECCC) 17: 181 (2010)
2009
j13
Hamed Hatami: Decision Trees and Influences of Variables Over Product Probability Spaces. Combinatorics, Probability & Computing 18(3): 357-369 (2009)
j12
Hamed Hatami, Xuding Zhu: The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discrete Math. 23(4): 1762-1775 (2009)
2008
j11
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)
j10
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)
j9
Hamed Hatami, Michael Molloy: Sharp thresholds for constraint satisfaction problems and homomorphisms. Random Struct. Algorithms 33(3): 310-332 (2008)
j8
Hamed Hatami, Avner Magen, Evangelos Markakis: Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics. SIAM J. Discrete Math. 23(1): 178-194 (2008)
2007
j7
Hamed Hatami, Pooya Hatami: Perfect Dominating Sets in the Cartesian Products of Prime Cycles. Electr. J. Comb. 14(1) (2007)
c2
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
i4
Hamed Hatami, Ruzbeh Tusserkani: On the Complexity of the Circular Chromatic Number. CoRR abs/cs/0701007 (2007)
i3
Hamed Hatami, Hossein Maserrat: On the Computational Complexity of Defining Sets. CoRR abs/cs/0701008 (2007)
i2
Peyman Afshani, Hamed Hatami: Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions. CoRR abs/cs/0701009 (2007)
2006
i1
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
j6
Hamed Hatami, Hossein Maserrat: On the computational complexity of defining sets. Discrete Applied Mathematics 149(1-3): 101-110 (2005)
j5
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)
j4
Hamed Hatami: Random cubic graphs are not homomorphic to the cycle of size 7. J. Comb. Theory, Ser. B 93(2): 319-325 (2005)
j3
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)
j2
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
j1
Hamed Hatami, Ruzbeh Tusserkani: On the complexity of the circular chromatic number. Journal of Graph Theory 47(3): 226-230 (2004)
2000
c1
Jafar Habibi, Ehsan Foroughi, Mehran Motamed, Pooya Karimian, Hamed Hatami, Hossein Fardad: SharifII Soccer Simulation Team. RoboCup 2000: 437-440

Coauthor Index

Colors in the list of coauthors

Last update Mon May 20 17:24:00 2013 CET by the DBLP Team Data released under the ODC-BY 1.0 license — See also our legal information page