S. L. Hakimi | Academic Influence

S. L. Hakimi's AcademicInfluence.com Rankings

S. L. Hakimi

Mathematics

#4476

World Rank

#6351

Historical Rank

#1536

USA Rank

Measure Theory

#524

World Rank

#738

Historical Rank

#214

USA Rank

mathematics Degrees

Download Badge

Mathematics

S. L. Hakimi's Degrees

PhD Mathematics University of Tehran
Masters Mathematics University of Tehran
Bachelors Mathematics University of Tehran

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is S. L. Hakimi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Seifollah Louis Hakimi was an Iranian-American mathematician born in Iran, a professor emeritus at Northwestern University, where he chaired the department of electrical engineering from 1973 to 1978. He was chair of the Department of Electrical Engineering at University of California, Davis, from 1986 to 1996.

(See a Problem?)

S. L. Hakimi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964) (2274)
An Algorithmic Approach to Network Location Problems. II: The p-Medians (1979) (1260)
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems (1965) (1104)
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I (1962) (603)
Characterization of Connection Assignment of Diagnosable Systems (1974) (424)
The complexity of searching a graph (1981) (396)
An Algorithmic Approach to Network Location Problems. I: The p-Centers (1979) (390)
Steiner's problem in graphs and its implications (1971) (378)
On locating new facilities in a competitive environment (1983) (356)
On Computing a Conditional Edge-Connectivity of a Graph (1988) (330)
The Maximum Coverage Location Problem (1983) (220)
On the degrees of the vertices of a directed graph (1965) (202)
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems (1981) (192)
On Path Cover Problems in Digraphs and Applications to Program Testing (1979) (139)
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis (1976) (137)
Distance matrix of a graph and its realizability (1965) (136)
On Fault Identification in Diagnosable Systems (1981) (134)
Fault-Tolerant Routing in DeBruijn Comrnunication Networks (1985) (120)
On Adaptive System Diagnosis (1984) (100)
Recognizing tough graphs is NP-hard (1990) (93)
Fitting polygonal functions to a set of points in the plane (1991) (91)
A generalization of edge-coloring in graphs (1986) (88)
On locating path- or tree-shaped facilities on networks (1993) (82)
Market and Locational Equilibrium for Two Competitors (1991) (80)
An optimal algorithm for distributed system level diagnosis (1991) (73)
p-Median theorems for competitive locations (1986) (70)
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness (1963) (69)
The distance matrix of a graph and its tree realization (1972) (69)
Optimum Locations of Centers in Networks (1972) (66)
On p -Centers in Networks (1978) (63)
Graph theoretic error-correcting codes (1968) (57)
Design of multi-input multi-output systems with minimum sensitivity (1988) (55)
A cycle structure theorem for hamiltonian graphs (1987) (54)
The Voronoi Partition of a Network and Its Implications in Location Theory (1992) (53)
On computing the connectivities of graphs and digraphs (1984) (50)
Probabilistic Flows Through a Communication Network (1965) (50)
Upper Bounds on the Order of a Clique of a Graph (1972) (48)
Analog methods for computation of the generalized inverse (1968) (45)
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs (1997) (44)
Globally optimal floorplanning for a layout problem (1996) (44)
On the number of cycles of length k in a maximal planar graph (1979) (42)
Complexity Results for Scheduling Tasks with Discrete Starting Times (1982) (42)
Pancyclic graphs and a conjecture of Bondy and Chvátal (1974) (41)
A Note on the Vertex Arboricity of a Graph (1989) (40)
Graphs and Their Degree Sequences: A Survey. (1978) (40)
Scheduling File Transfers for Trees and Odd Cycles (1987) (37)
On trees of a graph and their generation (1961) (37)
Relations between graphs and integer-pair sequences (1976) (37)
An Algorithm for Construction of the Least Vulnerable Communication Network or the Graph with the Maximum Connectivity (1969) (36)
Cut-set matrices and linear codes (Corresp.) (1965) (36)
On Planar Graphical Degree Sequences (1977) (34)
An Adaptive Algorithm for System Level Diagnosis (1984) (34)
Generation and Realization of Trees and k-Trees (1964) (31)
Orienting Graphs to Optimize Reachability (1997) (30)
On the design of reliable networks (1973) (30)
System-level fault diagnosis: A survey (1987) (29)
On the complexity of some coding problems (1981) (28)
Parallel Algorithms for Gossiping by Mail (1990) (26)
On a theory of t-fault diagnosable analog systems (1984) (26)
A Graph-Theoretic Approach to a Class of Integer-Programming Problems (1969) (25)
On the number of hamiltonian cycles in a maximal planar graph (1979) (24)
Distributed Diagnosis and the System User (1988) (23)
Parallel Information Dissemination by Packets (1994) (22)
Information Dissemination in Distributed Systems With Faulty Units (1994) (22)
On a general network location-production-allocation problem (1991) (22)
Fault-tolerant routing in DeBruijn communication networks (1994) (22)
On an Algorithm for Identifying Faults in a T-Diagnosable System, (1976) (20)
Simultaneous Flows Through a Communication Network (1962) (19)
Star arboricity of graphs (1996) (19)
The Complexity of Searching a Graph (Preliminary Version) (1981) (19)
Generation of Complete Trees (1968) (19)
Data Transfers in Broadcast Networks (1992) (18)
Data transfers in networks with transceivers (1987) (18)
On Minimum Fault-Tolerant Networks (1993) (17)
Sequential information dissemination by packets (1992) (16)
On minimizing testing rounds for fault identification (1988) (16)
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (1982) (16)
Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivability (1973) (15)
Decoding of graph theoretic codes (Corresp.) (1967) (15)
On the connectivity of maximal planar graphs (1978) (15)
A Parallel Fault Identification Algorithm (1990) (15)
On structured digraphs and program testing (1981) (14)
Sufficient degree conditions for k‐edge‐connectedness of a graph (2009) (13)
River Routing with a Small Number of Jogs (1990) (13)
On Realizability of a Set of Trees (1961) (13)
The Generalized Inverse in Network Analysis and Quadratic Error-Minimization Problems (1969) (12)
On the Existence of Graphs with Prescribed Degrees and Connectivity (1974) (12)
Locations on time‐varying networks (1999) (12)
Locating replicas of a database on a network (1997) (11)
Graphs with two kinds of elements (1960) (11)
Graph Theoretic Prefix Codes and Their Synchronizing Properties (1969) (10)
Locations on time-varying networks (1999) (9)
Approximation algorithms for the capacitated plant allocation problem (1994) (9)
Maximum internally stable sets of a graph (1969) (9)
On Coefficients of Polynomials in Network Functions (1960) (8)
Graph Theory and Combinatorics with Applications to Digital Systems and Networks (1977) (8)
Comments on "Simultaneous Flows Through a Communication Network (1963) (8)
On the optimum synthesis of statistical communication Nets-Pseudo parametric techniques (1967) (8)
Edge-disjoint packings of graphs (1994) (7)
A problem on rectangular floorplans (1988) (7)
Best Monotone Degree Bounds for Various Graph Parameters (2008) (7)
Improved bounds for the chromatic index of graphs and multigraphs (1999) (6)
Data transfers in networks (1988) (6)
Analysis and design of communication networks with memory (1969) (6)
Bounds for the chromatic number of graphs with partial information (2003) (6)
Graph theoretic q -ary codes (Corresp.) (1971) (5)
Sufficient degree conditions for k-edge-connectedness of a graph (2009) (5)
Short Proofs of Theorems of Nash-Williams and Tutte (1998) (4)
Gossigping in a Distributed Network (1993) (4)
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis" (1978) (3)
A Note on Active RC Realization of Voltage Transfer Functions (1964) (3)
Degree-bounded coloring of graphs: Variations on a theme by brooks (1995) (3)
ON SIMULTANEOUS FLOWS IN A COMMUNICATION NETWORK (1961) (3)
Parametric synthesis of statistical communication nets (1968) (3)
The Rank of a Bashkow-Bryant A-Matrix and a Network Characterization of the Interdependence of the State Variables (1966) (3)
Pursuing Mobile Hiders in a Graph (1978) (3)
Network location theory and contingency planning (1983) (3)
A Simple Procedure for the Synthesis of Lossless Networks (1960) (2)
Ternary graph theoretic error-correcting codes (Corresp.) (1969) (2)
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126] (1996) (2)
The Realization of n-Port Networks Without Transformers - A Panel Discussion: Evaluation and Questions (1962) (2)
Parallel algorithms for information dissemination by packets (1991) (2)
A scattering matrix synthesis technique for transformers, circulators, and gyrators (1972) (2)
Bounds on the number of cycles of length three in a planar graph (1982) (2)
File Organizations with Consecutive Retrieval and Related Properties. (1975) (1)
A Note on Zeros of Transmission of RLC Two-Ports on the Positive Real Axis (1961) (1)
Almost linear time optimization for single-row floorplanning (1994) (1)
System-level diagnosis: Analysis of two new models (1986) (1)
Linear time optimization of partially solved floorplans (1990) (1)
Application of graph theory to problems in communications systems and networks (1976) (1)
Minimum Cost Increase of the Terminal Capacities of a Communication Network (1966) (1)
ON UNIQUELY DECIPHERABLE CODES WITH GIVEN COMPOSITIONS. (1976) (1)
New Techniques for Realization of Transfer Functions (1959) (1)
Tiling Rectangles with Trominoes: 10641 (2000) (0)
Reliability and Optimum Design of the Interconnections of a Power System (1966) (0)
MIDWEST SYMPOSIUM ON CIRCUIT THEORY, 15TH, PROCEEDINGS, 1972. (1972) (0)
Discrete Optimization (1999) (0)
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs (1984) (0)
On Application of Graph Theory to Networks and Coding Theory (1971) (0)
Reliability and Optimum Design of the (1966) (0)
Gossiping with multiple sends and receives (1994) (0)
Ordering Problems in Trees and Their Applications to Tree-Structured Operations or Files, (1974) (0)
Graphs with given odd sets and the least number of vertices (1997) (0)
Book announcements (1981) (0)
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs (1984) (0)
Embedding and Existence Problems in Trees. (1975) (0)
Improved bounds for the chromatic number of a graph (2004) (0)
BOUNDS ON THE NUMBER OF SHORT CYCLES We begin with the following theorem : Theorem 1 (2006) (0)
North-Holland RECOGNIZING TOUGH GRAPHS IS NP-HARD (2001) (0)
Chromatic factorizations of a graph (1988) (0)

This paper list is powered by the following services:

Other Resources About S. L. Hakimi

en.wikipedia.org

What Schools Are Affiliated With S. L. Hakimi?

S. L. Hakimi is affiliated with the following schools: