S. Louis Hakimi

Publication Activity (10 Years)

Years Active: 1969-2009
Publications (10 Years): 0

Publications

Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
-edge-connectedness of a graph. Networks 54 (2) (2009)
S. Louis Hakimi, Edward F. Schmeichel
Improved bounds for the chromatic number of a graph. J. Graph Theory 47 (3) (2004)
William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
Bounds for the chromatic number of graphs with partial information. Discret. Math. 263 (1-3) (2003)
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
Orienting Graphs to Optimize Reachability CoRR (2002)
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, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107 (2) (2000)
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
Locations on time-varying networks. Networks 34 (4) (1999)
S. Louis Hakimi, Edward F. Schmeichel
Improved bounds for the chromatic index of graphs and multigraphs. J. Graph Theory 32 (4) (1999)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998)
S. Louis Hakimi
Graphs with given odd sets and the least number of vertices. J. Graph Theory 24 (1) (1997)
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63 (5) (1997)
Zhengyu Ge, S. Louis Hakimi
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. SIAM J. Comput. 26 (1) (1997)
S. Louis Hakimi, Edward F. Schmeichel
Locating replicas of a database on a network. Networks 30 (1) (1997)
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. Oper. Res. Lett. 18 (4) (1996)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Gossiping with Multiple Sends and Receives. Discret. Appl. Math. 64 (2) (1996)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Star arboricity of graphs. Discret. Math. 149 (1-3) (1996)
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Degree-bounded coloring of graphs: Variations on a theme by brooks. J. Graph Theory 20 (2) (1995)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Gossiping with Multiple Sends and Receives. IPPS (1994)
Anindo Bagchi, S. Louis Hakimi
Information Dissemination in Distributed Systems With Faulty Units. IEEE Trans. Computers 43 (6) (1994)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Parallel Information Dissemination by Packets. SIAM J. Comput. 23 (2) (1994)
Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
Edge-disjoint packings of graphs. Discret. Appl. Math. 50 (2) (1994)
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15 (3) (1994)
Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
Gossigping in a Distributed Network. IEEE Trans. Computers 42 (2) (1993)
S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé
On locating path- or tree-shaped facilities on networks. Networks 23 (6) (1993)
S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
On Minimum Fault-Tolerant Networks. SIAM J. Discret. Math. 6 (4) (1993)
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS J. Comput. 4 (4) (1992)
Anindo Bagchi, S. Louis Hakimi
Data Transfers in Broadcast Networks. IEEE Trans. Computers 41 (7) (1992)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Sequential information dissemination by packets. Networks 22 (4) (1992)
S. Louis Hakimi, Edward F. Schmeichel
Fitting polygonal functions to a set of points in the plane. CVGIP Graph. Model. Image Process. 53 (2) (1991)
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Parallel algorithms for information dissemination by packets. SPDP (1991)
Anindo Bagchi, S. Louis Hakimi
An Optimal Algorithm for Distributed System Level Diagnosis. FTCS (1991)
Martine Labbé, S. Louis Hakimi
Market and Locational Equilibrium for Two Competitors. Oper. Res. 39 (5) (1991)
Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
Parallel Algorithms for Gossiping by Mail. Inf. Process. Lett. 34 (4) (1990)
Tai-Ching Tuan, S. Louis Hakimi
River Routing with a Small Number of Jogs. SIAM J. Discret. Math. 3 (4) (1990)
Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28 (3) (1990)
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
A Parallel Fault Identification Algorithm. J. Algorithms 11 (2) (1990)
S. Louis Hakimi, Edward F. Schmeichel
A Note on the Vertex Arboricity of a Graph. SIAM J. Discret. Math. 2 (1) (1989)
S. Louis Hakimi, Edward F. Schmeichel
Chromatic factorizations of a graph. J. Graph Theory 12 (2) (1988)
Abdol-Hossein Esfahanian, S. Louis Hakimi
On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27 (4) (1988)
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
On minimizing testing rounds for fault identification. FTCS (1988)
Edward F. Schmeichel, S. Louis Hakimi
A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45 (1) (1988)
Hyeong-Ah Choi, S. Louis Hakimi
Data transfers in networks with transceivers. Networks 18 (3) (1988)
Steven E. Kreutzer, S. Louis Hakimi
Distributed Diagnosis and the System User. IEEE Trans. Computers 37 (1) (1988)
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
The complexity of searching a graph. J. ACM 35 (1) (1988)
Hyeong-Ah Choi, S. Louis Hakimi
Data Transfers in Networks. Algorithmica 3 (1988)
Hyeong-Ah Choi, S. Louis Hakimi
Scheduling File Transfers for Trees and Odd Cycles. SIAM J. Comput. 16 (1) (1987)
Hyeong-Ah Choi, S. Louis Hakimi
Data transfers in networks with transceivers. Networks 17 (4) (1987)
S. Louis Hakimi, Oded Kariv
A generalization of edge-coloring in graphs. J. Graph Theory 10 (2) (1986)
Steven E. Kreutzer, S. Louis Hakimi
System-level diagnosis: Analysis of two new models. Inf. Sci. 40 (2) (1986)
Abdol-Hossein Esfahanian, S. Louis Hakimi
Fault-Tolerant Routing in DeBruijn Communication Networks. IEEE Trans. Computers 34 (9) (1985)
S. Louis Hakimi, Kazuo Nakajima
On Adaptive System Diagnosis. IEEE Trans. Computers 33 (3) (1984)
S. Louis Hakimi, Oded Kariv
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. SIGACT News 16 (1) (1984)
Abdol-Hossein Esfahanian, S. Louis Hakimi
On computing the connectivities of graphs and digraphs. Networks 14 (2) (1984)
S. Louis Hakimi, Edward F. Schmeichel
An Adaptive Algorithm for System Level Diagnosis. J. Algorithms 5 (4) (1984)
S. Louis Hakimi, Oded Kariv
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. SIGACT News 15 (4) (1984)
Kazuo Nakajima, S. Louis Hakimi
Complexity Results for Scheduling Tasks with Discrete Starting Times. J. Algorithms 3 (4) (1982)
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) (1982)
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
The Complexity of Searching a Graph (Preliminary Version) FOCS (1981)
Kyung-Yong Chwa, S. Louis Hakimi
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems Inf. Control. 49 (3) (1981)
Kyung-Yong Chwa, S. Louis Hakimi
On Fault Identification in Diagnosable Systems. IEEE Trans. Computers 30 (6) (1981)
Simeon C. Ntafos, S. Louis Hakimi
On Structured Digraphs and Program Testing. IEEE Trans. Computers 30 (1) (1981)
Simeon C. Ntafos, S. Louis Hakimi
On the complexity of some coding problems. IEEE Trans. Inf. Theory 27 (6) (1981)
Simeon C. Ntafos, S. Louis Hakimi
On Path Cover Problems in Digraphs and Applications to Program Testing. IEEE Trans. Software Eng. 5 (5) (1979)
Shachindra N. Maheshwari, S. Louis Hakimi
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis". IEEE Trans. Computers 27 (3) (1978)
A. N. Patrinos, S. Louis Hakimi
Relations between graphs and integer-pair sequences. Discret. Math. 15 (4) (1976)
Shachindra N. Maheshwari, S. Louis Hakimi
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis. IEEE Trans. Computers 25 (3) (1976)
S. Louis Hakimi
The Program, Conclusions and Recommendations. Networks 5 (4) (1975)
S. Louis Hakimi, Ashok T. Amin
Characterization of Connection Assignment of Diagnosable Systems. IEEE Trans. Computers 23 (1) (1974)
S. Louis Hakimi, Ashok T. Amin
On the design of reliable networks. Networks 3 (3) (1973)
S. Louis Hakimi, Shachindra N. Maheshwari
Optimum Locations of Centers in Networks. Oper. Res. 20 (5) (1972)
S. Louis Hakimi
Steiner's problem in graphs and its implications. Networks 1 (2) (1971)
L. S. Bobrow, S. Louis Hakimi
Graph theoretic q -ary codes (Corresp.). IEEE Trans. Inf. Theory 17 (2) (1971)
J. F. Desler, S. Louis Hakimi
A Graph-Theoretic Approach to a Class of Integer-Programming Problems. Oper. Res. 17 (6) (1969)
S. Louis Hakimi, Jon G. Bredeson
Ternary graph theoretic error-correcting codes (Corresp.). IEEE Trans. Inf. Theory 15 (3) (1969)
L. S. Bobrow, S. Louis Hakimi
Graph Theoretic Prefix Codes and Their Synchronizing Properties Inf. Control. 15 (1) (1969)