2026 S. L. Hakimi: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	37	2417	2145	1014	847	109	12022

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Mathematics

2417

2145

1014

847

109

12022

Overview

S. L. Hakimi is a researcher affiliated with Northwestern University in the United States. Their work spans multiple fields within engineering, with a particular focus on applications integrating technology and finance as well as material sciences.

The research contributions cover areas such as:

Engineering
Management Information Systems
Media Technology
Economics and Econometrics
Mechanical Engineering
Mechanics of Materials

Hakimi's main topics of work include:

FinTech, Crowdfunding, Digital Finance
ICT Impact and Policies
Microfinance and Financial Inclusion
Metal Forming Simulation Techniques
Metallurgy and Material Forming
Laser and Thermal Forming Techniques

Their recent scholarly output consists of two notable papers. The first is titled "DIGITAL TRANSFORMATION OF AFGHANISTAN BANKING: EXPLORING E-BANKING TRENDS AND IMPACTS", published in 2024 in the journal KEUNIS. This paper explores digital finance trends and their impacts within the Afghan banking sector.

The second publication is "Evaluation of the sensitivity of springback to various process parameters of aluminum alloy sheet with different heat treatment conditions", appearing in 2021 in Engineering Solid Mechanics. This work focuses on material forming behaviour specific to aluminum alloys subjected to varied heat treatments.

Hakimi has collaborated with several co-authors across different studies. Frequent collaborators include:

Musawer Hakimi
Sebghatullah Aslamzai
Nurseto Adhi
A. Soualem

Publication venues where Hakimi's research has appeared most frequently include:

KEUNIS
Engineering Solid Mechanics

This body of work illustrates an interdisciplinary approach, combining digital finance, information systems, and advanced engineering methodologies. The research addresses both technological innovation in finance and the mechanical properties of materials, reflecting a diverse expertise across applied sciences.

Best Publications

An Algorithmic Approach to Network Location Problems. II: The p-Medians

Unknown

1313
Citations
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

Unknown

1296
Citations
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Unknown

741
Citations
The complexity of searching a graph

N. Megiddo;S. L. Hakimi;M. R. Garey;D. S. Johnson

544
Citations
An Algorithmic Approach to Network Location Problems. I: The p-Centers

Unknown

530
Citations
On Computing a Conditional Edge-Connectivity of a Graph

Unknown

401
Citations
The Maximum Coverage Location Problem

Nimrod Megiddo;Eitan Zemel;S. Louis Hakimi

295
Citations
On the degrees of the vertices of a directed graph

Unknown

247
Citations
Distance matrix of a graph and its realizability

S. L. Hakimi;S. S. Yau

212
Citations
On locating path‐ or tree‐shaped facilities on networks

Shabnam Louis Hakimi;Edward Schmeichel;Martine Labbé

114
Citations
Recognizing tough graphs is NP-hard

Unknown

102
Citations
A generalization of edge-coloring in graphs

Unknown

94
Citations
The Voronoi Partition of a Network and Its Implications in Location Theory

S. Louis Hakimi;Martine Labbé Labbé;Edward Schmeichel

75
Citations
The distance matrix of a graph and its tree realization

Unknown

73
Citations
On p -Centers in Networks

Unknown

69
Citations
On the number of cycles of length k in a maximal planar graph

Unknown

65
Citations
On computing the connectivities of graphs and digraphs

Unknown

64
Citations
A Note on the Vertex Arboricity of a Graph

Unknown

50
Citations
Upper Bounds on the Order of a Clique of a Graph

Unknown

50
Citations
Star arboricity of graphs

S. L. Hakimi;J. Mitchem;E. Schmeichel

47
Citations
Orienting graphs to optimize reachability

S. Louis Hakimi;Edward F. Schmeichel;Neal E. Young

31
Citations
Parallel algorithms for gossiping by mail

A. Bagchi;S. L. Hakimi;J. Mitchem;E. Schmeichel

25
Citations
On the number of hamiltonian cycles in a maximal planar graph

Seifollah Louis Hakimi;Edward F. Schmeichel;Carsten Thomassen

25
Citations
Orienting Graphs to Optimize Reachability

S. L. Hakimi;E. Schmeichel;Neal E. Young

21
Citations
Parallel Information Dissemination by Packets

A. Bagchi;E. F. Schmeichel;S. L. Hakimi

20
Citations
Sequential information dissemination by packets

A. Bagchi;E. F. Schmeichel;S. L. Hakimi

18
Citations
Data transfer in networks with transceivers

H.-A. Choi;S. L. Hakimi

16
Citations
Locations on time‐varying networks

Shabnam Louis Hakimi;Martine Labbé;Edward Schmeichel

15
Citations
On minimum fault-tolerant networks

S. Ueno;A. Bagchi;S. L. Hakimi;E. F. Schmeichel

14
Citations
Complexity results for scheduling tasks in fixed intervals on two types of machines

K Nakajima;SL Hakimi;JK Jan Karel Lenstra

12
Citations
Gossiping in a distributed network

A. Bagchi;S.L. Hakimi;E.F. Schmeichel

9
Citations
Approximation algorithms for the capacitated plant allocation problem

Martine Labbé;E. F. Schmeichel;S.Louis Hakimi

8
Citations
Edge-disjoint packings of graphs

Derek G. Corneil;Shigeru Masuyama;S. Louis Hakimi

7
Citations
Sufficient degree conditions for k-edge-connectedness of a graph

D. Bauer;S. L. Hakimi;N. Kahl;E. Schmeichel

6
Citations
Degree-bounded coloring of graphs: variations on a theme by Brooks

S. L. Hakimi;J. Mitchem;E. F. Schmeichel

2
Citations

Frequent Co-Authors

Martine Labbé Université Libre de Bruxelles

Neal E. Young University of California, Riverside

External Links

Personal website of S. L. Hakimi

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students exploring Mathematics in the USA, online degree options provide flexible pathways to broaden skills and elevate career prospects. Many professionals choose to complement their mathematical background with advanced business qualifications. For instance, pursuing a Doctor of Business Administration through affordable and reputable dba programs can enhance leadership roles in quantitative fields.

Those interested in finance can explore cheap online masters in finance that allow students to deepen their understanding of financial modeling and risk analysis without prohibitive costs. Similarly, business-oriented mathematicians may benefit from gaining broader managerial skills through fastest online mba degree programs that emphasize efficiency and time management.

Marketing analytics is another evolving domain where math graduates can excel. Pursuing marketing graduate programs with a data focus prepares candidates to analyze consumer trends and optimize campaigns using quantitative tools.

Overall, these related online degrees open valuable career pathways, allowing Mathematics graduates to apply their analytical expertise across diverse industries while balancing education with other commitments.