Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
S. Louis Hakimi
2000 – 2009
- 2009
[j54]Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel: Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009)- 2004
- [j53]S. Louis Hakimi, Edward F. Schmeichel: Improved bounds for the chromatic number of a graph. Journal of Graph Theory 47(3): 217-225 (2004)
- 2003
- [j52]William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel: Bounds for the chromatic number of graphs with partial information. Discrete Mathematics 263(1-3): 47-59 (2003)
- 2002
- [i1]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability. CoRR cs.DS/0205042 (2002)
1990 – 1999
- 1999
- [j51]S. Louis Hakimi, Edward F. Schmeichel: Improved bounds for the chromatic index of graphs and multigraphs. Journal of Graph Theory 32(4): 311-326 (1999)
- [j50]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: Locations on time-varying networks. Networks 34(4): 250-257 (1999)
- 1998
- [j49]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998)
- 1997
- [j48]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997)
- [j47]S. Louis Hakimi: Graphs with given odd sets and the least number of vertices. Journal of Graph Theory 24(1): 81-83 (1997)
- [j46]S. Louis Hakimi, Edward F. Schmeichel: Locating replicas of a database on a network. Networks 30(1): 31-36 (1997)
- [j45]Zhengyu Ge, S. Louis Hakimi: Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. SIAM J. Comput. 26(1): 79-92 (1997)
- 1996
- [j44]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. Discrete Applied Mathematics 64(2): 105-116 (1996)
- [j43]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Star arboricity of graphs. Discrete Mathematics 149(1-3): 93-98 (1996)
- 1995
- [j42]S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Degree-bounded coloring of graphs: Variations on a theme by brooks. Journal of Graph Theory 20(2): 177-194 (1995)
- 1994
- [j41]Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi: Edge-disjoint packings of graphs. Discrete Applied Mathematics 50(2): 135-148 (1994)
- [j40]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994)
- [j39]Anindo Bagchi, S. Louis Hakimi: Information Dissemination in Distributed Systems With Faulty Units. IEEE Trans. Computers 43(6): 698-710 (1994)
- [c5]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761
- 1993
- [j38]S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé: On locating path- or tree-shaped facilities on networks. Networks 23(6): 543-555 (1993)
- [j37]S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: On Minimum Fault-Tolerant Networks. SIAM J. Discrete Math. 6(4): 565-574 (1993)
- [j36]Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993)
- 1992
- [j35]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS Journal on Computing 4(4): 412-417 (1992)
- [j34]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Sequential information dissemination by packets. Networks 22(4): 317-333 (1992)
- [j33]Anindo Bagchi, S. Louis Hakimi: Data Transfers in Broadcast Networks. IEEE Trans. Computers 41(7): 842-847 (1992)
- 1991
- [j32]S. Louis Hakimi, Edward F. Schmeichel: Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Model and Image Processing 53(2): 132-136 (1991)
- [c4]Anindo Bagchi, S. Louis Hakimi: An Optimal Algorithm for Distributed System Level Diagnosis. FTCS 1991: 214-221
- [c3]Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281
- 1990
- [j31]Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel: Recognizing tough graphs is NP-hard. Discrete Applied Mathematics 28(3): 191-195 (1990)
- [j30]Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990)
- [j29]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990)
- [j28]Tai-Ching Tuan, S. Louis Hakimi: River Routing with a Small Number of Jogs. SIAM J. Discrete Math. 3(4): 585-597 (1990)
1980 – 1989
- 1989
- [j27]S. Louis Hakimi, Edward F. Schmeichel: A Note on the Vertex Arboricity of a Graph. SIAM J. Discrete Math. 2(1): 64-67 (1989)
- 1988
- [j26]
- [j25]Abdol-Hossein Esfahanian, S. Louis Hakimi: On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27(4): 195-199 (1988)
- [j24]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The complexity of searching a graph. J. ACM 35(1): 18-44 (1988)
- [j23]Edward F. Schmeichel, S. Louis Hakimi: A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45(1): 99-107 (1988)
- [j22]S. Louis Hakimi, Edward F. Schmeichel: Chromatic factorizations of a graph. Journal of Graph Theory 12(2): 177-182 (1988)
- [j21]Hyeong-Ah Choi, S. Louis Hakimi: Data transfers in networks with transceivers. Networks 18(3): 223-251 (1988)
- [j20]Steven E. Kreutzer, S. Louis Hakimi: Distributed Diagnosis and the System User. IEEE Trans. Computers 37(1): 71-78 (1988)
- [c2]Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: On minimizing testing rounds for fault identification. FTCS 1988: 266-271
- 1987
- [j19]Hyeong-Ah Choi, S. Louis Hakimi: Data transfers in networks with transceivers. Networks 17(4): 393-421 (1987)
- [j18]Hyeong-Ah Choi, S. Louis Hakimi: Scheduling File Transfers for Trees and Odd Cycles. SIAM J. Comput. 16(1): 162-168 (1987)
- 1986
- [j17]Steven E. Kreutzer, S. Louis Hakimi: System-level diagnosis: Analysis of two new models. Inf. Sci. 40(2): 117-130 (1986)
- 1985
- [j16]Abdol-Hossein Esfahanian, S. Louis Hakimi: Fault-Tolerant Routing in DeBruijn Communication Networks. IEEE Trans. Computers 34(9): 777-788 (1985)
- 1984
- [j15]S. Louis Hakimi, Edward F. Schmeichel: An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984)
- [j14]Abdol-Hossein Esfahanian, S. Louis Hakimi: On computing the connectivities of graphs and digraphs. Networks 14(2): 355-366 (1984)
- [j13]S. Louis Hakimi, Kazuo Nakajima: On Adaptive System Diagnosis. IEEE Trans. Computers 33(3): 234-240 (1984)
- 1982
- [j12]Kazuo Nakajima, S. Louis Hakimi: Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3(4): 344-361 (1982)
- [j11]Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra: Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM J. Comput. 11(3): 512-520 (1982)
- 1981
- [j10]Kyung-Yong Chwa, S. Louis Hakimi: Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems. Information and Control 49(3): 212-238 (1981)
- [j9]Simeon C. Ntafos, S. Louis Hakimi: On Structured Digraphs and Program Testing. IEEE Trans. Computers 30(1): 67-77 (1981)
- [j8]Kyung-Yong Chwa, S. Louis Hakimi: On Fault Identification in Diagnosable Systems. IEEE Trans. Computers 30(6): 414-422 (1981)
- [j7]Simeon C. Ntafos, S. Louis Hakimi: On the complexity of some coding problems. IEEE Transactions on Information Theory 27(6): 794-796 (1981)
- [c1]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The Complexity of Searching a Graph (Preliminary Version). FOCS 1981: 376-385
1970 – 1979
- 1979
- [j6]Simeon C. Ntafos, S. Louis Hakimi: On Path Cover Problems in Digraphs and Applications to Program Testing. IEEE Trans. Software Eng. 5(5): 520-529 (1979)
- 1978
- [j5]S. N. Maheshwari, S. Louis Hakimi: Corrections and Comments on ``On Models for Diagnosable Systems and Probabilistic Fault Diagnosis''. IEEE Trans. Computers 27(3): 287 (1978)
- 1976
- [j4]Shachindra N. Maheshwari, S. Louis Hakimi: On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. IEEE Trans. Computers 25(3): 228-236 (1976)
- 1973
- [j3]
- 1971
- [j2]
1960 – 1969
- 1969
- [j1]L. S. Bobrow, S. Louis Hakimi: Graph Theoretic Prefix Codes and Their Synchronizing Properties. Information and Control 15(1): 70-94 (1969)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 22:12 CEST by the dblp team