The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. Louis Hakimi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The Complexity of Searching a Graph (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:376-385 [Conf]
  2. Anindo Bagchi, S. Louis Hakimi
    An Optimal Algorithm for Distributed System Level Diagnosis. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:214-221 [Conf]
  3. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Gossiping with Multiple Sends and Receives. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:757-761 [Conf]
  4. Hyeong-Ah Choi, S. Louis Hakimi
    Data Transfers in Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:223-245 [Journal]
  5. S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Short Proofs of Theorems of Nash-Williams and Tutte. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  6. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  7. S. Louis Hakimi, Edward F. Schmeichel
    Fitting polygonal functions to a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1991, v:53, n:2, pp:132-136 [Journal]
  8. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Gossiping with Multiple Sends and Receives. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:105-116 [Journal]
  9. Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
    Edge-disjoint packings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:135-148 [Journal]
  10. William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
    Bounds for the chromatic number of graphs with partial information. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:47-59 [Journal]
  11. L. S. Bobrow, S. Louis Hakimi
    Graph Theoretic Prefix Codes and Their Synchronizing Properties [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:15, n:1, pp:70-94 [Journal]
  12. Kyung-Yong Chwa, S. Louis Hakimi
    Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:49, n:3, pp:212-238 [Journal]
  13. Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Parallel Algorithms for Gossiping by Mail. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:4, pp:197-202 [Journal]
  14. Abdol-Hossein Esfahanian, S. Louis Hakimi
    On Computing a Conditional Edge-Connectivity of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:4, pp:195-199 [Journal]
  15. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:229-235 [Journal]
  16. Steven E. Kreutzer, S. Louis Hakimi
    System-level diagnosis: Analysis of two new models. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1986, v:40, n:2, pp:117-130 [Journal]
  17. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The complexity of searching a graph. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:1, pp:18-44 [Journal]
  18. S. Louis Hakimi, Edward F. Schmeichel
    An Adaptive Algorithm for System Level Diagnosis. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:526-530 [Journal]
  19. Kazuo Nakajima, S. Louis Hakimi
    Complexity Results for Scheduling Tasks with Discrete Starting Times. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:4, pp:344-361 [Journal]
  20. Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, G. Sullivan
    A Parallel Fault Identification Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:2, pp:231-241 [Journal]
  21. Edward F. Schmeichel, S. Louis Hakimi
    A cycle structure theorem for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:99-107 [Journal]
  22. S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
    Locations on time-varying networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:250-257 [Journal]
  23. S. Louis Hakimi, Edward F. Schmeichel
    Locating replicas of a database on a network. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:1, pp:31-36 [Journal]
  24. Zhengyu Ge, S. Louis Hakimi
    Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:79-92 [Journal]
  25. Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
    Parallel Information Dissemination by Packets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:355-372 [Journal]
  26. Hyeong-Ah Choi, S. Louis Hakimi
    Scheduling File Transfers for Trees and Odd Cycles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:162-168 [Journal]
  27. Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra
    Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:512-520 [Journal]
  28. S. Louis Hakimi, Edward F. Schmeichel
    A Note on the Vertex Arboricity of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:64-67 [Journal]
  29. Tai-Ching Tuan, S. Louis Hakimi
    River Routing with a Small Numer of Jogs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:585-597 [Journal]
  30. S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
    On Minimum Fault-Tolerant Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:565-574 [Journal]
  31. Anindo Bagchi, S. Louis Hakimi
    Data Transfers in Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:7, pp:842-847 [Journal]
  32. Anindo Bagchi, S. Louis Hakimi
    Information Dissemination in Distributed Systems With Faulty Units. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:6, pp:698-710 [Journal]
  33. Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
    Gossigping in a Distributed Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:2, pp:253-256 [Journal]
  34. Kyung-Yong Chwa, S. Louis Hakimi
    On Fault Identification in Diagnosable Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:6, pp:414-422 [Journal]
  35. Abdol-Hossein Esfahanian, S. Louis Hakimi
    Fault-Tolerant Routing in DeBruijn Communication Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:9, pp:777-788 [Journal]
  36. S. Louis Hakimi, Kazuo Nakajima
    On Adaptive System Diagnosis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:3, pp:234-240 [Journal]
  37. Steven E. Kreutzer, S. Louis Hakimi
    Distributed Diagnosis and the System User. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:1, pp:71-78 [Journal]
  38. Shachindra N. Maheshwari, S. Louis Hakimi
    On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:3, pp:228-236 [Journal]
  39. S. N. Maheshwari, S. Louis Hakimi
    Corrections and Comments on ``On Models for Diagnosable Systems and Probabilistic Fault Diagnosis''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:3, pp:287- [Journal]
  40. Simeon C. Ntafos, S. Louis Hakimi
    On Structured Digraphs and Program Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:1, pp:67-77 [Journal]
  41. Simeon C. Ntafos, S. Louis Hakimi
    On the complexity of some coding problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:6, pp:794-0 [Journal]
  42. Simeon C. Ntafos, S. Louis Hakimi
    On Path Cover Problems in Digraphs and Applications to Program Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1979, v:5, n:5, pp:520-529 [Journal]
  43. S. Louis Hakimi, Edward F. Schmeichel
    Improved bounds for the chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:217-225 [Journal]
  44. S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
    Star arboricity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:93-98 [Journal]

  45. Parallel algorithms for information dissemination by packets. [Citation Graph (, )][DBLP]


  46. Recognizing tough graphs is NP-hard. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002