S. Louis Hakimi
Affiliations: University of California, Davis, CA, USA
 Northwestern University, Evanston, IL, USA
 University of Illinois at UrbanaChampaign, Urbana, IL, USA (PhD 1959)
According to our database^{1},
S. Louis Hakimi
authored at least 78 papers
between 1959 and 2009.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 1972, "For contributions in applications of graph theory to circuit analysis".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org
On csauthors.net:
Bibliography
2009
Networks, 2009
2004
J. Graph Theory, 2004
2003
Discret. Math., 2003
2000
Am. Math. Mon., 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Networks, 1999
J. Graph Theory, 1999
1998
Short Proofs of Theorems of NashWilliams and Tutte.
Ars Comb., 1998
1997
SIAM J. Comput., 1997
Networks, 1997
J. Graph Theory, 1997
Inf. Process. Lett., 1997
1996
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115126].
Oper. Res. Lett., 1996
Discret. Math., 1996
Discret. Appl. Math., 1996
1995
J. Graph Theory, 1995
1994
IEEE Trans. Computers, 1994
SIAM J. Comput., 1994
Oper. Res. Lett., 1994
Discret. Appl. Math., 1994
1993
IEEE Trans. Computers, 1993
SIAM J. Discret. Math., 1993
Networks, 1993
1992
IEEE Trans. Computers, 1992
Networks, 1992
INFORMS J. Comput., 1992
1991
Oper. Res., 1991
CVGIP Graph. Model. Image Process., 1991
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991
Proceedings of the 1991 International Symposium on FaultTolerant Computing, 1991
1990
SIAM J. Discret. Math., 1990
J. Algorithms, 1990
Inf. Process. Lett., 1990
Discret. Appl. Math., 1990
1989
SIAM J. Discret. Math., 1989
1988
IEEE Trans. Computers, 1988
J. Graph Theory, 1988
J. Comb. Theory B, 1988
J. ACM, 1988
Inf. Process. Lett., 1988
Algorithmica, 1988
Proceedings of the Eighteenth International Symposium on FaultTolerant Computing, 1988
1987
SIAM J. Comput., 1987
Networks, 1987
1986
J. Graph Theory, 1986
Inf. Sci., 1986
1985
IEEE Trans. Computers, 1985
1984
IEEE Trans. Computers, 1984
Midwest theory of computation symposium: on a generalization of edgecoloring in graphs.
SIGACT News, 1984
Networks, 1984
J. Algorithms, 1984
1982
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
SIAM J. Comput., 1982
J. Algorithms, 1982
1981
Schemes for FaultTolerant Computing: A Comparison of Modularly Redundant and tDiagnosable Systems
Inf. Control., June, 1981
IEEE Trans. Inf. Theory, 1981
IEEE Trans. Computers, 1981
IEEE Trans. Computers, 1981
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1979
IEEE Trans. Software Eng., 1979
J. Graph Theory, 1979
J. Graph Theory, 1979
1978
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis".
IEEE Trans. Computers, 1978
J. Graph Theory, 1978
1976
IEEE Trans. Computers, 1976
Discret. Math., 1976
1975
Networks, 1975
1974
IEEE Trans. Computers, 1974
1973
Networks, 1973
1972
Oper. Res., 1972
1971
IEEE Trans. Inf. Theory, 1971
Networks, 1971
1969
Inf. Control., July, 1969
IEEE Trans. Inf. Theory, 1969
Oper. Res., 1969
1968
IEEE Trans. Inf. Theory, 1968
1967
IEEE Trans. Inf. Theory, 1967
1965
IEEE Trans. Inf. Theory, 1965
1959
PhD thesis, 1959