New Techniques for Realization of Transfer Functions - Seifollah Louis Hakimi (1959)

Cut-set matrices and linear codes (Corresp.). - Seifollah Louis Hakimi; H. Frank (IEEE Trans. Inf. Theory, 1965)

Decoding of graph theoretic codes (Corresp.). - Jon G. Bredeson; Seifollah Louis Hakimi (IEEE Trans. Inf. Theory, 1967)

Graph theoretic error-correcting codes. - Seifollah Louis Hakimi; Jon G. Bredeson (IEEE Trans. Inf. Theory, 1968)

A Graph-Theoretic Approach to a Class of Integer-Programming Problems. - J. F. Desler; S. Louis Hakimi (Oper. Res., 1969)

Ternary graph theoretic error-correcting codes (Corresp.). - S. Louis Hakimi; Jon G. Bredeson (IEEE Trans. Inf. Theory, 1969)

Graph Theoretic Prefix Codes and Their Synchronizing Properties - L. S. Bobrow; S. Louis Hakimi (Inf. Control., 1969)

Steiner's problem in graphs and its implications. - S. Louis Hakimi (Networks, 1971)

Graph theoretic q -ary codes (Corresp.). - L. S. Bobrow; S. Louis Hakimi (IEEE Trans. Inf. Theory, 1971)

Optimum Locations of Centers in Networks. - S. Louis Hakimi; Shachindra N. Maheshwari (Oper. Res., 1972)

On the design of reliable networks. - S. Louis Hakimi; Ashok T. Amin (Networks, 1973)

Characterization of Connection Assignment of Diagnosable Systems. - S. Louis Hakimi; Ashok T. Amin (IEEE Trans. Computers, 1974)

The Program, Conclusions and Recommendations. - S. Louis Hakimi (Networks, 1975)

Relations between graphs and integer-pair sequences. - A. N. Patrinos; S. Louis Hakimi (Discret. Math., 1976)

On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. - Shachindra N. Maheshwari; S. Louis Hakimi (IEEE Trans. Computers, 1976)

On the connectivity of maximal planar graphs. - Seifollah Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1978)

Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis". - Shachindra N. Maheshwari; S. Louis Hakimi (IEEE Trans. Computers, 1978)

On the number of cycles of length k in a maximal planar graph. - Seifollah Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1979)

On the number of hamiltonian cycles in a maximal planar graph. - Seifollah Louis Hakimi; Edward F. Schmeichel; Carsten Thomassen (J. Graph Theory, 1979)

On Path Cover Problems in Digraphs and Applications to Program Testing. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Software Eng., 1979)

The Complexity of Searching a Graph (Preliminary Version) - Nimrod Megiddo; S. Louis Hakimi; M. R. Garey; David S. Johnson 001; Christos H. Papadimitriou (FOCS, 1981)

On Fault Identification in Diagnosable Systems. - Kyung-Yong Chwa; S. Louis Hakimi (IEEE Trans. Computers, 1981)

On Structured Digraphs and Program Testing. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Computers, 1981)

On the complexity of some coding problems. - Simeon C. Ntafos; S. Louis Hakimi (IEEE Trans. Inf. Theory, 1981)

Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems - Kyung-Yong Chwa; S. Louis Hakimi (Inf. Control., 1981)

Complexity Results for Scheduling Tasks with Discrete Starting Times. - Kazuo Nakajima; S. Louis Hakimi (J. Algorithms, 1982)

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. - Katsuto Nakajima; S. Louis Hakimi; Jan Karel Lenstra (SIAM J. Comput., 1982)

An Adaptive Algorithm for System Level Diagnosis. - S. Louis Hakimi; Edward F. Schmeichel (J. Algorithms, 1984)

On computing the connectivities of graphs and digraphs. - Abdol-Hossein Esfahanian; S. Louis Hakimi (Networks, 1984)

Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. - S. Louis Hakimi; Oded Kariv (SIGACT News, 1984)

On Adaptive System Diagnosis. - S. Louis Hakimi; Kazuo Nakajima (IEEE Trans. Computers, 1984)

Fault-Tolerant Routing in DeBruijn Communication Networks. - Abdol-Hossein Esfahanian; S. Louis Hakimi (IEEE Trans. Computers, 1985)

System-level diagnosis: Analysis of two new models. - Steven E. Kreutzer; S. Louis Hakimi (Inf. Sci., 1986)

A generalization of edge-coloring in graphs. - S. Louis Hakimi; Oded Kariv (J. Graph Theory, 1986)

Data transfers in networks with transceivers. - Hyeong-Ah Choi; S. Louis Hakimi (Networks, 1987)

Scheduling File Transfers for Trees and Odd Cycles. - Hyeong-Ah Choi; S. Louis Hakimi (SIAM J. Comput., 1987)

On minimizing testing rounds for fault identification. - Edward F. Schmeichel; S. Louis Hakimi; M. Otsuka; Geoff Sullivan (FTCS, 1988)

Data Transfers in Networks. - Hyeong-Ah Choi; S. Louis Hakimi (Algorithmica, 1988)

On Computing a Conditional Edge-Connectivity of a Graph. - Abdol-Hossein Esfahanian; S. Louis Hakimi (Inf. Process. Lett., 1988)

The complexity of searching a graph. - Nimrod Megiddo; S. Louis Hakimi; M. R. Garey; David S. Johnson 001; Christos H. Papadimitriou (J. ACM, 1988)

A cycle structure theorem for hamiltonian graphs. - Edward F. Schmeichel; S. Louis Hakimi (J. Comb. Theory B, 1988)

Chromatic factorizations of a graph. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1988)

Distributed Diagnosis and the System User. - Steven E. Kreutzer; S. Louis Hakimi (IEEE Trans. Computers, 1988)

A Note on the Vertex Arboricity of a Graph. - S. Louis Hakimi; Edward F. Schmeichel (SIAM J. Discret. Math., 1989)

Recognizing tough graphs is NP-hard. - Douglas Bauer; S. Louis Hakimi; Edward F. Schmeichel (Discret. Appl. Math., 1990)

Parallel Algorithms for Gossiping by Mail. - Anindo Bagchi; S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Inf. Process. Lett., 1990)

A Parallel Fault Identification Algorithm. - Edward F. Schmeichel; S. Louis Hakimi; M. Otsuka; Geoff Sullivan (J. Algorithms, 1990)

River Routing with a Small Number of Jogs. - Tai-Ching Tuan; S. Louis Hakimi (SIAM J. Discret. Math., 1990)

An Optimal Algorithm for Distributed System Level Diagnosis. - Anindo Bagchi; S. Louis Hakimi (FTCS, 1991)

Parallel algorithms for information dissemination by packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (SPDP, 1991)

Fitting polygonal functions to a set of points in the plane. - S. Louis Hakimi; Edward F. Schmeichel (CVGIP Graph. Model. Image Process., 1991)

Market and Locational Equilibrium for Two Competitors. - Martine Labbé; S. Louis Hakimi (Oper. Res., 1991)

The Voronoi Partition of a Network and Its Implications in Location Theory. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (INFORMS J. Comput., 1992)

Sequential information dissemination by packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (Networks, 1992)

Data Transfers in Broadcast Networks. - Anindo Bagchi; S. Louis Hakimi (IEEE Trans. Computers, 1992)

On locating path- or tree-shaped facilities on networks. - S. Louis Hakimi; Edward F. Schmeichel; Martine Labbé (Networks, 1993)

On Minimum Fault-Tolerant Networks. - S. Ueno; Anindo Bagchi; S. Louis Hakimi; Edward F. Schmeichel (SIAM J. Discret. Math., 1993)

Gossigping in a Distributed Network. - Anindo Bagchi; S. Louis Hakimi; Edward F. Schmeichel (IEEE Trans. Computers, 1993)

Edge-disjoint packings of graphs. - Derek G. Corneil; Shigeru Masuyama; S. Louis Hakimi (Discret. Appl. Math., 1994)

Approximation algorithms for the capacitated plant allocation problem. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1994)

Parallel Information Dissemination by Packets. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (SIAM J. Comput., 1994)

Information Dissemination in Distributed Systems With Faulty Units. - Anindo Bagchi; S. Louis Hakimi (IEEE Trans. Computers, 1994)

Degree-bounded coloring of graphs: Variations on a theme by brooks. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (J. Graph Theory, 1995)

Gossiping with Multiple Sends and Receives. - Anindo Bagchi; Edward F. Schmeichel; S. Louis Hakimi (Discret. Appl. Math., 1996)

Star arboricity of graphs. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Discret. Math., 1996)

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1996)

Orienting Graphs to Optimize Reachability. - S. Louis Hakimi; Edward F. Schmeichel; Neal E. Young (Inf. Process. Lett., 1997)

Graphs with given odd sets and the least number of vertices. - S. Louis Hakimi (J. Graph Theory, 1997)

Locating replicas of a database on a network. - S. Louis Hakimi; Edward F. Schmeichel (Networks, 1997)

Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. - Zhengyu Ge; S. Louis Hakimi (SIAM J. Comput., 1997)

Short Proofs of Theorems of Nash-Williams and Tutte. - S. Louis Hakimi; John Mitchem; Edward F. Schmeichel (Ars Comb., 1998)

Improved bounds for the chromatic index of graphs and multigraphs. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 1999)

Locations on time-varying networks. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (Networks, 1999)

Discrete Optimization. - Beth Novick; S. Louis Hakimi; Sunil Chopra; David Simchi-Levi; Salah E. Elmaghraby; Michael Mesterton-Gibbons; Joseph R. Barr (Handbook of Discrete and Combinatorial Mathematics, 1999)

Tiling Rectangles with Trominoes: 10641. - Jerrold R. Griggs; Michael Woltermann; B. Borchers; David Callan; Robin J. Chapman; J. Chilcott; Paul Cull; A. Ferguson; K. Martin; G. G. Gagola; Solomon W. Golomb; J. Guilford; et al. (Am. Math. Mon., 2000)

Bounds for the chromatic number of graphs with partial information. - William C. Coffman; S. Louis Hakimi; Edward F. Schmeichel (Discret. Math., 2003)

Improved bounds for the chromatic number of a graph. - S. Louis Hakimi; Edward F. Schmeichel (J. Graph Theory, 2004)

Sufficient degree conditions for k-edge-connectedness of a graph. - Douglas Bauer; S. Louis Hakimi; Nathan Kahl; Edward F. Schmeichel (Networks, 2009)