- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 49 |      | 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 | ||
| 48 | | 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 | ||
| 47 | | 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 | ||
| 46 | | S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability CoRR cs.DS/0205042: (2002) |
| 1999 | ||
| 45 | | S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: Locations on time-varying networks. Networks 34(4): 250-257 (1999) |
| 1998 | ||
| 44 |  | S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50: (1998) |
| 1997 | ||
| 43 | | S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young: Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997) |
| 42 | | S. Louis Hakimi, Edward F. Schmeichel: Locating replicas of a database on a network. Networks 30(1): 31-36 (1997) |
| 41 | | 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 | ||
| 40 | | Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. Discrete Applied Mathematics 64(2): 105-116 (1996) |
| 39 | | S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Star arboricity of graphs. Discrete Mathematics 149(1-3): 93-98 (1996) |
| 1994 | ||
| 38 | | Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Gossiping with Multiple Sends and Receives. IPPS 1994: 757-761 |
| 37 | | Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi: Edge-disjoint packings of graphs. Discrete Applied Mathematics 50(2): 135-148 (1994) |
| 36 | | Anindo Bagchi, S. Louis Hakimi: Information Dissemination in Distributed Systems With Faulty Units. IEEE Trans. Computers 43(6): 698-710 (1994) |
| 35 | | Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel Information Dissemination by Packets. SIAM J. Comput. 23(2): 355-372 (1994) |
| 1993 | ||
| 34 | | Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: Gossigping in a Distributed Network. IEEE Trans. Computers 42(2): 253-256 (1993) |
| 33 | | S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel: On Minimum Fault-Tolerant Networks. SIAM J. Discrete Math. 6(4): 565-574 (1993) |
| 1992 | ||
| 32 | | Anindo Bagchi, S. Louis Hakimi: Data Transfers in Broadcast Networks. IEEE Trans. Computers 41(7): 842-847 (1992) |
| 31 | | 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) |
| 1991 | ||
| 30 | | Anindo Bagchi, S. Louis Hakimi: An Optimal Algorithm for Distributed System Level Diagnosis. FTCS 1991: 214-221 |
| 29 | | Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi: Parallel algorithms for information dissemination by packets. SPDP 1991: 274-281 |
| 28 | | 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) |
| 1990 | ||
| 27 | | Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel: Recognizing tough graphs is NP-hard. Discrete Applied Mathematics 28(3): 191-195 (1990) |
| 26 | | Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel: Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34(4): 197-202 (1990) |
| 25 | | Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990) |
| 24 | | Tai-Ching Tuan, S. Louis Hakimi: River Routing with a Small Number of Jogs. SIAM J. Discrete Math. 3(4): 585-597 (1990) |
| 1989 | ||
| 23 | | 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 | ||
| 22 | | Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan: On minimizing testing rounds for fault identification. FTCS 1988: 266-271 |
| 21 | | Hyeong-Ah Choi, S. Louis Hakimi: Data Transfers in Networks. Algorithmica 3: 223-245 (1988) |
| 20 | | Steven E. Kreutzer, S. Louis Hakimi: Distributed Diagnosis and the System User. IEEE Trans. Computers 37(1): 71-78 (1988) |
| 19 | | Abdol-Hossein Esfahanian, S. Louis Hakimi: On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27(4): 195-199 (1988) |
| 18 | | 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) |
| 17 | | Edward F. Schmeichel, S. Louis Hakimi: A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45(1): 99-107 (1988) |
| 1987 | ||
| 16 | | Hyeong-Ah Choi, S. Louis Hakimi: Scheduling File Transfers for Trees and Odd Cycles. SIAM J. Comput. 16(1): 162-168 (1987) |
| 1986 | ||
| 15 | | Steven E. Kreutzer, S. Louis Hakimi: System-level diagnosis: Analysis of two new models. Inf. Sci. 40(2): 117-130 (1986) |
| 1985 | ||
| 14 | | Abdol-Hossein Esfahanian, S. Louis Hakimi: Fault-Tolerant Routing in DeBruijn Communication Networks. IEEE Trans. Computers 34(9): 777-788 (1985) |
| 1984 | ||
| 13 | | S. Louis Hakimi, Kazuo Nakajima: On Adaptive System Diagnosis. IEEE Trans. Computers 33(3): 234-240 (1984) |
| 12 | | S. Louis Hakimi, Edward F. Schmeichel: An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5(4): 526-530 (1984) |
| 1982 | ||
| 11 | | Kazuo Nakajima, S. Louis Hakimi: Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3(4): 344-361 (1982) |
| 10 | | 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 | ||
| 9 | | 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 |
| 8 | | Simeon C. Ntafos, S. Louis Hakimi: On Structured Digraphs and Program Testing. IEEE Trans. Computers 30(1): 67-77 (1981) |
| 7 | | Kyung-Yong Chwa, S. Louis Hakimi: On Fault Identification in Diagnosable Systems. IEEE Trans. Computers 30(6): 414-422 (1981) |
| 6 | | Simeon C. Ntafos, S. Louis Hakimi: On the complexity of some coding problems. IEEE Transactions on Information Theory 27(6): 794-796 (1981) |
| 5 | | 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) |
| 1979 | ||
| 4 | | 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 | ||
| 3 | | 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 | ||
| 2 | | Shachindra N. Maheshwari, S. Louis Hakimi: On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. IEEE Trans. Computers 25(3): 228-236 (1976) |
| 1969 | ||
| 1 | | L. S. Bobrow, S. Louis Hakimi: Graph Theoretic Prefix Codes and Their Synchronizing Properties Information and Control 15(1): 70-94 (1969) |
| 1 | Anindo Bagchi | [26] [29] [30] [32] [33] [34] [35] [36] [38] [40] |
| 2 | Douglas Bauer | [27] [49] |
| 3 | L. S. Bobrow | [1] |
| 4 | Hyeong-Ah Choi | [16] [21] |
| 5 | Kyung-Yong Chwa | [5] [7] |
| 6 | William C. Coffman | [47] |
| 7 | Derek G. Corneil | [37] |
| 8 | Abdol-Hossein Esfahanian | [14] [19] |
| 9 | M. R. Garey (Michael R. Garey) | [9] [18] |
| 10 | Zhengyu Ge | [41] |
| 11 | David S. Johnson | [9] [18] |
| 12 | Nathan Kahl | [49] |
| 13 | Steven E. Kreutzer | [15] [20] |
| 14 | Martine Labbé | [31] [45] |
| 15 | Jan Karel Lenstra | [10] |
| 16 | S. N. Maheshwari | [3] |
| 17 | Shachindra N. Maheshwari | [2] |
| 18 | Shigeru Masuyama | [37] |
| 19 | Nimrod Megiddo | [9] [18] |
| 20 | John Mitchem | [26] [39] [44] |
| 21 | Katsuto Nakajima | [10] |
| 22 | Kazuo Nakajima | [11] [13] |
| 23 | Simeon C. Ntafos | [4] [6] [8] |
| 24 | M. Otsuka | [22] [25] |
| 25 | Christos H. Papadimitriou | [9] [18] |
| 26 | Edward F. Schmeichel | [12] [17] [22] [23] [25] [26] [27] [28] [29] [31] [33] [34] [35] [38] [39] [40] [42] [43] [44] [45] [46] [47] [48] [49] |
| 27 | Geoff Sullivan | [22] [25] |
| 28 | Tai-Ching Tuan | [24] |
| 29 | S. Ueno | [33] |
| 30 | Neal E. Young | [43] [46] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page