◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

MohammadTaghi Hajiaghayi

1 paper here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedThe Satisfiability Threshold of Random 3-SAT Is at Least 3.52

73 citations · 73 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DM2005★ 6 cited

Bidimensionality, Map Graphs, and Grid Minors

Erik D. Demaine, MohammadTaghi Hajiaghayi

In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial…

math.CO2003★ 73 cited

The Satisfiability Threshold of Random 3-SAT Is at Least 3.52

MohammadTaghi Hajiaghayi, Gregory B. Sorkin

We prove that a random 3-SAT instance with clause-to-variable density less than 3.52 is satisfiable with high probability. The proof comes through an algorithm which selects (and s…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.