◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Leila Parsaei-Majd

2 papers hereh-index 00 citations4 works total

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

author position
  • sole author1
  • middle author1

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

fields
  • math.CO2
same name
  • Leila Parsaei-Majd — 4 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators

2 papers

math.CO2025

Correlation Clustering for General Graphs

Leila Parsaei-Majd

Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal…

math.CO2024

Weakly Negative Circles Versus Best Clustering in Signed Graphs

Michael G. Gottstein, Leila Parsaei-Majd, Thomas Zaslavsky

Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always po…

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