◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Esfahanian

6 papers hereh-index 252.8k citations96 works total

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

author position
  • first author1
  • middle author1
  • last author4

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

fields
  • cs.SI2
  • cs.CC1
  • cs.DS1
  • cs.LG1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20142024
most citedOn Constructing Regular Distance-Preserving Graphs

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

collaborators
Showing 2020Show all

3 papers · 1 filter

cs.SI2020

Fairness Perception from a Network-Centric Perspective

Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian

Algorithmic fairness is a major concern in recent years as the influence of machine learning algorithms becomes more widespread. In this paper, we investigate the issue of algorith…

cs.CC2020

Some Preliminary Result About the Inset Edge and Average Distance of Trees

M. H. Khalifeh, A. -H. Esfahanian

An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity…

cs.DS2020

Inset Edges Effect and Average Distance of Trees

M. H. Khalifeh, A. -H. Esfahanian

An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the p…

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