◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mohammad Taghi Hajiaghayi

2 papers here

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

author position
  • middle author1
  • last author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS1
  • cs.LG1
ORCID 0000-0003-4842-0533

identity via Semantic Scholar / OpenAlex

most citedGeneralized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LG2022★ 2 cited

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost

Marina Knittel, Max Springer, John P. Dickerson +1

Clustering is a fundamental building block of modern statistical analysis pipelines. Fair clustering has seen much attention from the machine learning community in recent years. We…

cs.DS2015

A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands

Rajesh Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi +3

Given an edge-weighted directed graph G=(V,E) on n vertices and a set T={t1​,t2​,…,tp​} of p terminals, the objective of the \scss (p-SCSS) problem is to find a…

◍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.