default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdol-Hossein Esfahanian
Person information
- affiliation: Michigan State University, East Lansing, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c49]Francisco Santos, Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian:
DeepFairRank: A Multi-objective Framework for Fair Top-k Node Ranking in Network Data. ASONAM (1) 2024: 171-187- [i5]Anna Stephens, Francisco Santos, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Population Graph Cross-Network Node Classification for Autism Detection Across Sample Groups. CoRR abs/2401.05478 (2024) - 2023
- [j22]M. H. Khalifeh
, Abdol-Hossein Esfahanian:
Some results about the inset edge and average distance of trees. Discret. Appl. Math. 325: 186-199 (2023) - [c48]Anna Stephens, Francisco Santos, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Population Graph Cross-Network Node Classification for Autism Detection Across Sample Groups. ICDM (Workshops) 2023: 348-355 - [c47]Francisco Santos, Anna Stephens, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Influence Propagation for Linear Threshold Model with Graph Neural Networks. ICDM (Workshops) 2023: 1141-1148 - 2022
- [c46]Farzan Masrour, Francisco Santos, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Fairness-Aware Graph Sampling for Network Analysis. ICDM 2022: 1107-1112 - [c45]Francisco Santos, Junke Ye, Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian:
FACS-GCN: Fairness-Aware Cost-Sensitive Boosting of Graph Convolutional Networks. IJCNN 2022: 1-8 - 2020
- [j21]Chin-Jung Liu, Pei Huang, Li Xiao, Abdol-Hossein Esfahanian:
Inter-Femtocell Interference Identification and Resource Management. IEEE Trans. Mob. Comput. 19(1): 116-129 (2020) - [j20]Alireza Ameli Renani, Jun Huang, Guoliang Xing, Abdol-Hossein Esfahanian, Weiguo Wu:
Harnessing Hardware Defects for Improving Wireless Link Performance. IEEE/ACM Trans. Netw. 28(5): 1913-1924 (2020) - [c44]Farzan Masrour, Tyler Wilson, Heng Yan, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Bursting the Filter Bubble: Fairness-Aware Network Link Prediction. AAAI 2020: 841-848 - [c43]Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Fairness Perception from a Network-Centric Perspective. ICDM 2020: 1178-1183 - [i4]M. H. Khalifeh, Abdol-Hossein Esfahanian:
Inset Edges Effect and Average Distance of Trees. CoRR abs/2008.05674 (2020) - [i3]M. H. Khalifeh, Abdol-Hossein Esfahanian:
Some Preliminary Result About the Inset Edge and Average Distance of Trees. CoRR abs/2008.05677 (2020) - [i2]Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Fairness Perception from a Network-Centric Perspective. CoRR abs/2010.05887 (2020)
2010 – 2019
- 2019
- [c42]Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian:
OPTANE: an OPtimal transport algorithm for NEtwork alignment. ASONAM 2019: 448-451 - 2018
- [c41]Farzan Masrour, Pang-Ning Tan, Abdol-Hossein Esfahanian, Courtland VanDam:
Attributed Network Representation Learning Approaches for Link Prediction. ASONAM 2018: 560-563 - 2017
- [c40]Rana Forsati, Iman Barjasteh, Abdol-Hossein Esfahanian:
Semi-supervised Collaborative Ranking with Push at the Top. ASONAM 2017: 401-408 - [c39]Emad Zahedi, Masoud Mirmomeni, Abdol-Hossein Esfahanian:
An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs. ASONAM 2017: 577-584 - [c38]Rana Forsati, Iman Barjasteh, Dennis Ross, Abdol-Hossein Esfahanian:
Learning the Implicit Preference of Users for Effective Recommendation. ASONAM 2017: 636-639 - [c37]Alireza Ameli Renani, Jun Huang, Guoliang Xing, Abdol-Hossein Esfahanian:
Harnessing hardware defects for improving wireless link performance: Measurements and applications. INFOCOM 2017: 1-9 - 2016
- [j19]Rana Forsati, Iman Barjasteh, Dennis Ross, Abdol-Hossein Esfahanian, Hayder Radha:
Network completion by leveraging similarity of nodes. Soc. Netw. Anal. Min. 6(1): 102:1-102:22 (2016) - [j18]Iman Barjasteh, Rana Forsati, Dennis Ross, Abdol-Hossein Esfahanian, Hayder Radha:
Cold-Start Recommendation with Provable Guarantees: A Decoupled Approach. IEEE Trans. Knowl. Data Eng. 28(6): 1462-1474 (2016) - 2015
- [c36]Farzan Masrour, Iman Barjasteh, Rana Forsati, Abdol-Hossein Esfahanian, Hayder Radha:
Network Completion with Node Similarity: A Matrix Completion Approach with Provable Guarantees. ASONAM 2015: 302-307 - [c35]Rana Forsati, Iman Barjasteh, Farzan Masrour, Abdol-Hossein Esfahanian, Hayder Radha:
PushTrust: An Efficient Recommendation Algorithm by Leveraging Trust and Distrust Relations. RecSys 2015: 51-58 - [c34]Iman Barjasteh, Rana Forsati, Farzan Masrour, Abdol-Hossein Esfahanian, Hayder Radha:
Cold-Start Item and User Recommendation with Decoupled Completion and Transduction. RecSys 2015: 91-98 - [i1]Iman Barjasteh, Rana Forsati, Abdol-Hossein Esfahanian, Hayder Radha:
Semi-supervised Collaborative Ranking with Push at Top. CoRR abs/1511.05266 (2015) - 2014
- [c33]Chin-Jung Liu, Pei Huang, Li Xiao, Abdol-Hossein Esfahanian:
Interference identification and resource management in OFDMA femtocell networks. Networking 2014: 1-9 - 2013
- [p2]Ronald Nussbaum, Abdol-Hossein Esfahanian, Pang-Ning Tan:
Clustering Social Networks Using Distance-Preserving Subgraphs. The Influence of Technology on Social Network Analysis and Mining 2013: 331-349 - 2012
- [c32]Claudia E. Vergara, Daina Briedis, Neeraj Buch, Abdol-Hossein Esfahanian, Jon Sticklen, Mark Urban-Lurain, Louise Paquette, Cindee Dresen, Kysha Frazier:
Work in progress: Integrating computation across engineering curricula: Preliminary impact on students. FIE 2012: 1-2 - 2011
- [p1]Jerry Scripps, Ronald Nussbaum, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Link-Based Network Mining. Structural Analysis of Complex Networks 2011: 403-419 - 2010
- [c31]Ronald Nussbaum, Abdol-Hossein Esfahanian, Pang-Ning Tan:
Clustering Social Networks Using Distance-Preserving Subgraphs. ASONAM 2010: 380-385
2000 – 2009
- 2009
- [c30]Jerry Scripps, Pang-Ning Tan, Feilong Chen, Abdol-Hossein Esfahanian:
A Matrix Alignment Approach for Collective Classification. ASONAM 2009: 155-159 - [c29]Ronald Nussbaum, Abdol-Hossein Esfahanian, Pang-Ning Tan:
History-Based Email Prioritization. ASONAM 2009: 364-365 - [c28]Jerry Scripps, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Measuring the effects of preprocessing decisions and network forces in dynamic network analysis. KDD 2009: 747-756 - 2008
- [j17]Abhishek P. Patil, Abdol-Hossein Esfahanian, Yunhao Liu, Li Xiao:
Resource Allocation Using Multiple Edge-Sharing Multicast Trees. IEEE Trans. Veh. Technol. 57(5): 3178-3186 (2008) - [j16]Abhishek P. Patil, Yunhao Liu, Li Xiao, Abdol-Hossein Esfahanian, Lionel M. Ni:
SOLONet: Sub-optimal location-aided overlay network for MANETs. Wirel. Networks 14(4): 415-433 (2008) - [c27]Jerry Scripps, Pang-Ning Tan, Feilong Chen, Abdol-Hossein Esfahanian:
A matrix alignment approach for link prediction. ICPR 2008: 1-4 - 2007
- [c26]Jerry Scripps, Pang-Ning Tan, Abdol-Hossein Esfahanian:
Exploration of Link Structure and Community-Based Node Roles in Network Analysis. ICDM 2007: 649-654 - 2005
- [c25]Andrew Chen, Abdol-Hossein Esfahanian:
A Demography of t-Optimal (n, m) Graphs Where n <= 12. AMCS 2005: 121-127 - [c24]Yunhao Liu, Lionel M. Ni, Li Xiao, Abdol-Hossein Esfahanian:
Approaching Optimal Peer-to-Peer Overlays. MASCOTS 2005: 407-414 - [c23]Abhishek P. Patil, Abdol-Hossein Esfahanian, Li Xiao, Yunhao Liu:
Resource allocation using multiple edge-sharing multicast trees. MASS 2005 - 2004
- [j15]Li Xiao, Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Abdol-Hossein Esfahanian:
Prioritized Overlay Multicast in Mobile Ad Hoc Environments. Computer 37(2): 67-74 (2004) - [c22]Abhishek P. Patil, Yunhao Liu, Li Xiao, Abdol-Hossein Esfahanian, Lionel M. Ni:
SOLONet: sub-optimal location-aided overlay network for MANETs. MASS 2004: 324-333 - 2003
- [c21]Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Li Xiao, Abdol-Hossein Esfahanian:
POMA: Prioritized Overlay Multicast in Ad Hoc Environments. HiPC 2003: 228-237 - [c20]Baijian Yang, Abdol-Hossein Esfahanian, Lionel M. Ni, Prasant Mohapatra:
A Tree Building Technique for Overlay Multicasting in DiffServ Domains. International Conference on Internet Computing 2003: 893-899 - 2002
- [c19]Fan Du, Lionel M. Ni, Abdol-Hossein Esfahanian:
HOPOVER: a new handoff protocol for overlay networks. ICC 2002: 3234-3239 - [c18]Boris Gelfand, Abdol-Hossein Esfahanian, Matt W. Mutka:
An Agent-Based Approach to Enforcing Fairness in Peer-to-Peer Distributed File Systems. ICPADS 2002: 157- - 2000
- [j14]Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng:
Source-limited inclusive routing: A new paradigm for multicast communication. Networks 35(1): 40-55 (2000) - [c17]Wei-Kuo Liao, Abdol-Hossein Esfahanian, Lionel M. Ni:
Flow control for ABR dispersity multicasting. ICCCN 2000: 598-603 - [c16]Wenting Tang, Fan Du, Matt W. Mutka, Lionel M. Ni, Abdol-Hossein Esfahanian:
Supporting Global Replicated Services by a Routing-Metric-Aware DNS. WECWIS 2000: 67-74
1990 – 1999
- 1999
- [c15]Fan Du, Lionel M. Ni, Abdol-Hossein Esfahanian:
Towards solving multicast key management problem. ICCCN 1999: 232-236 - [c14]Matthew A. Pfeiffer, Daniel A. Dapkus, Abdol-Hossein Esfahanian, Charles B. Owen:
The Shuffler: Software for a World-Wide-Web Based Form Routing System. WebNet 1999: 877-882 - [c13]Matthew A. Pfeiffer, Daniel A. Dapkus, Abdol-Hossein Esfahanian, Charles B. Owen:
The Shuffler: Software for a World-Wide-Web Based Form Routing System. WebNet 1999: 1744 - 1998
- [j13]Xiaola Lin, Abdol-Hossein Esfahanian, A. Burago:
Adaptive Wormhole Routing in Hypercube Multicomputers. J. Parallel Distributed Comput. 48(2): 165-174 (1998) - 1997
- [c12]Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng:
Sufficient Conditions for Optimal Multicast Communication. ICPP 1997: 390-395 - 1996
- [c11]Swamy K. Sitarama, Abdol-Hossein Esfahanian:
Designing Distance-Preserving Fault-Tolerant Topologies. WG 1996: 352-366 - 1995
- [j12]Xiaola Lin, Philip K. McKinley, Abdol-Hossein Esfahanian:
Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers. J. Parallel Distributed Comput. 28(1): 19-31 (1995) - [c10]Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng:
Toward a General Theory of Unicast-Based Multicast Communication. WG 1995: 237-251 - 1994
- [j11]Philip K. McKinley, Hong Xu, Abdol-Hossein Esfahanian, Lionel M. Ni:
Unicast-Based Multicast Communication in Wormhole-Routed Networks. IEEE Trans. Parallel Distributed Syst. 5(12): 1252-1265 (1994) - 1993
- [c9]Xiaola Lin, Philip K. McKinley, Abdol-Hossein Esfahanian:
Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers. PARLE 1993: 228-241 - [c8]Xiaola Lin, Abdol-Hossein Esfahanian, Philip K. McKinley, A. Burago:
Adaptive Wormhole Routing in Hypercube Multicomputers. SPDP 1993: 72-81 - 1992
- [j10]Guy W. Zimmerman, Abdol-Hossein Esfahanian:
Chordal Rings as Fault-Tolerant Loops. Discret. Appl. Math. 37/38: 563-573 (1992) - [j9]Hyeong-Ah Choi, Abdol-Hossein Esfahanian:
A message-routing strategy for multicomputer systems. Networks 22(7): 627-646 (1992) - [c7]Guy W. Zimmerman, Abdol-Hossein Esfahanian, David Vasquez:
GMP/X, An X-Windows Based Graph Manipulation Package. Computational Support for Discrete Mathematics 1992: 245-254 - [c6]Philip K. McKinley, Hong Xu, Abdol-Hossein Esfahanian, Lionel M. Ni:
Unicast-based Multicast Communication in Wormhole-routed Networks. ICPP (2) 1992: 10-19 - 1991
- [j8]Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan:
The Twisted N-Cube with Application to Multiprocessing. IEEE Trans. Computers 40(1): 88-93 (1991) - [c5]A. Duksu Oh, Hyeong-Ah Choi, Abdol-Hossein Esfahanian:
On the complexity of a fault-tolerance model for multicomputer systems. Great Lakes Symposium on VLSI 1991: 62-67 - 1990
- [j7]Youran Lan, Abdol-Hossein Esfahanian, Lionel M. Ni:
Multicast in Hypercube Multiprocessors. J. Parallel Distributed Comput. 8(1): 30-41 (1990) - [c4]Hyeong-Ah Choi, Abdol-Hossein Esfahanian:
On Complexity of a Message-Routing Strategy for Multicomputer Systems. WG 1990: 170-181
1980 – 1989
- 1989
- [j6]Lionel M. Ni, Youran Lan, Abdol-Hossein Esfahanian:
A VLSI router design for hypercube multiprocessors. Integr. 7(2): 103-125 (1989) - [j5]Abdol-Hossein Esfahanian:
Generalized Measures of Fault Tolerance with Application to N-Cube Networks. IEEE Trans. Computers 38(11): 1586-1591 (1989) - [c3]Guy W. Zimmerman, Abdol-Hossein Esfahanian:
A New Approach to System-Level Fault-Tolerance in Message-Passing MultiComputers. Great Lakes Computer Science Conference 1989: 357-363 - 1988
- [j4]Abdol-Hossein Esfahanian, S. Louis Hakimi:
On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27(4): 195-199 (1988) - [c2]Youran Lan, L. M. Li, Abdol-Hossein Esfahanian:
Distributed multi-destination routing in hypercube multiprocessors. C³P 1988: 631-639 - [c1]Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan:
On Enhancing Hypercube Multiprocessors. ICPP (1) 1988: 86-89 - 1985
- [j3]Abdol-Hossein Esfahanian:
Lower-bounds on the connectivities of a graph. J. Graph Theory 9(4): 503-511 (1985) - [j2]Abdol-Hossein Esfahanian, S. Louis Hakimi:
Fault-Tolerant Routing in DeBruijn Communication Networks. IEEE Trans. Computers 34(9): 777-788 (1985) - 1984
- [j1]Abdol-Hossein Esfahanian, S. Louis Hakimi:
On computing the connectivities of graphs and digraphs. Networks 14(2): 355-366 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-15 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
