S. Louis Hakimi

75 papers A* 1Journal 69Unranked 4
YearRankTypeTitle / Venue / Authors
2009 J jnl
Sufficient degree conditions for
Networks
Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
2004 J jnl
Improved bounds for the chromatic number of a graph.
J. Graph Theory
S. Louis Hakimi, Edward F. Schmeichel
2003 J jnl
Bounds for the chromatic number of graphs with partial information.
Discret. Math.
William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
2002 J jnl
Orienting Graphs to Optimize Reachability
CoRR
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
2000 J jnl
Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon.
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
1999 — ch.
Discrete Optimization.
Handbook of Discrete and Combinatorial Mathematics
Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr
1999 J jnl
Improved bounds for the chromatic index of graphs and multigraphs.
J. Graph Theory
S. Louis Hakimi, Edward F. Schmeichel
1999 J jnl
Locations on time-varying networks.
Networks
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
1998 J jnl
Short Proofs of Theorems of Nash-Williams and Tutte.
Ars Comb.
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
1997 J jnl
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs.
SIAM J. Comput.
Zhengyu Ge, S. Louis Hakimi
1997 J jnl
Graphs with given odd sets and the least number of vertices.
J. Graph Theory
S. Louis Hakimi
1997 J jnl
Locating replicas of a database on a network.
Networks
S. Louis Hakimi, Edward F. Schmeichel
1997 J jnl
Orienting Graphs to Optimize Reachability.
Inf. Process. Lett.
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
1996 J jnl
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].
Oper. Res. Lett.
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
1996 J jnl
Gossiping with Multiple Sends and Receives.
Discret. Appl. Math.
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
1996 J jnl
Star arboricity of graphs.
Discret. Math.
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
1995 J jnl
Degree-bounded coloring of graphs: Variations on a theme by brooks.
J. Graph Theory
S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
1994 J jnl
Approximation algorithms for the capacitated plant allocation problem.
Oper. Res. Lett.
Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi
1994 J jnl
Edge-disjoint packings of graphs.
Discret. Appl. Math.
Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
1994 — conf
Gossiping with Multiple Sends and Receives.
IPPS
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
1994 J jnl
Information Dissemination in Distributed Systems With Faulty Units.
IEEE Trans. Computers
Anindo Bagchi, S. Louis Hakimi
1994 J jnl
Parallel Information Dissemination by Packets.
SIAM J. Comput.
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
1993 J jnl
Gossigping in a Distributed Network.
IEEE Trans. Computers
Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
1993 J jnl
On Minimum Fault-Tolerant Networks.
SIAM J. Discret. Math.
S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel
1993 J jnl
On locating path- or tree-shaped facilities on networks.
Networks
S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé
1992 J jnl
Data Transfers in Broadcast Networks.
IEEE Trans. Computers
Anindo Bagchi, S. Louis Hakimi
1992 J jnl
Sequential information dissemination by packets.
Networks
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
1992 J jnl
The Voronoi Partition of a Network and Its Implications in Location Theory.
INFORMS J. Comput.
S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
1991 — conf
An Optimal Algorithm for Distributed System Level Diagnosis.
FTCS
Anindo Bagchi, S. Louis Hakimi
1991 J jnl
Fitting polygonal functions to a set of points in the plane.
CVGIP Graph. Model. Image Process.
S. Louis Hakimi, Edward F. Schmeichel
1991 J jnl
Market and Locational Equilibrium for Two Competitors.
Oper. Res.
Martine Labbé, S. Louis Hakimi
1991 — conf
Parallel algorithms for information dissemination by packets.
SPDP
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
1990 J jnl
A Parallel Fault Identification Algorithm.
J. Algorithms
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
1990 J jnl
Parallel Algorithms for Gossiping by Mail.
Inf. Process. Lett.
Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
1990 J jnl
Recognizing tough graphs is NP-hard.
Discret. Appl. Math.
Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel
1990 J jnl
River Routing with a Small Number of Jogs.
SIAM J. Discret. Math.
Tai-Ching Tuan, S. Louis Hakimi
1989 J jnl
A Note on the Vertex Arboricity of a Graph.
SIAM J. Discret. Math.
S. Louis Hakimi, Edward F. Schmeichel
1988 J jnl
A cycle structure theorem for hamiltonian graphs.
J. Comb. Theory B
Edward F. Schmeichel, S. Louis Hakimi
1988 J jnl
Chromatic factorizations of a graph.
J. Graph Theory
S. Louis Hakimi, Edward F. Schmeichel
1988 J jnl
Data Transfers in Networks.
Algorithmica
Hyeong-Ah Choi, S. Louis Hakimi
1988 J jnl
Data transfers in networks with transceivers.
Networks
Hyeong-Ah Choi, S. Louis Hakimi
1988 J jnl
Distributed Diagnosis and the System User.
IEEE Trans. Computers
Steven E. Kreutzer, S. Louis Hakimi
1988 J jnl
On Computing a Conditional Edge-Connectivity of a Graph.
Inf. Process. Lett.
Abdol-Hossein Esfahanian, S. Louis Hakimi
1988 — conf
On minimizing testing rounds for fault identification.
FTCS
Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan
1988 J jnl
The complexity of searching a graph.
J. ACM
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
1987 J jnl
Data transfers in networks with transceivers.
Networks
Hyeong-Ah Choi, S. Louis Hakimi
1987 J jnl
Scheduling File Transfers for Trees and Odd Cycles.
SIAM J. Comput.
Hyeong-Ah Choi, S. Louis Hakimi
1986 J jnl
A generalization of edge-coloring in graphs.
J. Graph Theory
S. Louis Hakimi, Oded Kariv
1986 J jnl
System-level diagnosis: Analysis of two new models.
Inf. Sci.
Steven E. Kreutzer, S. Louis Hakimi
1985 J jnl
Fault-Tolerant Routing in DeBruijn Communication Networks.
IEEE Trans. Computers
Abdol-Hossein Esfahanian, S. Louis Hakimi
1984 J jnl
An Adaptive Algorithm for System Level Diagnosis.
J. Algorithms
S. Louis Hakimi, Edward F. Schmeichel
1984 J jnl
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs.
SIGACT News
S. Louis Hakimi, Oded Kariv
1984 J jnl
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs.
SIGACT News
S. Louis Hakimi, Oded Kariv
1984 J jnl
On Adaptive System Diagnosis.
IEEE Trans. Computers
S. Louis Hakimi, Kazuo Nakajima
1984 J jnl
On computing the connectivities of graphs and digraphs.
Networks
Abdol-Hossein Esfahanian, S. Louis Hakimi
1982 J jnl
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
SIAM J. Comput.
Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra
1982 J jnl
Complexity Results for Scheduling Tasks with Discrete Starting Times.
J. Algorithms
Kazuo Nakajima, S. Louis Hakimi
1981 J jnl
On Fault Identification in Diagnosable Systems.
IEEE Trans. Computers
Kyung-Yong Chwa, S. Louis Hakimi
1981 J jnl
On Structured Digraphs and Program Testing.
IEEE Trans. Computers
Simeon C. Ntafos, S. Louis Hakimi
1981 J jnl
On the complexity of some coding problems.
IEEE Trans. Inf. Theory
Simeon C. Ntafos, S. Louis Hakimi
1981 J jnl
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems
Inf. Control.
Kyung-Yong Chwa, S. Louis Hakimi
1981 A* conf
The Complexity of Searching a Graph (Preliminary Version)
FOCS
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
1979 J jnl
On Path Cover Problems in Digraphs and Applications to Program Testing.
IEEE Trans. Software Eng.
Simeon C. Ntafos, S. Louis Hakimi
1978 J jnl
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis".
IEEE Trans. Computers
Shachindra N. Maheshwari, S. Louis Hakimi
1976 J jnl
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis.
IEEE Trans. Computers
Shachindra N. Maheshwari, S. Louis Hakimi
1976 J jnl
Relations between graphs and integer-pair sequences.
Discret. Math.
A. N. Patrinos, S. Louis Hakimi
1975 J jnl
The Program, Conclusions and Recommendations.
Networks
S. Louis Hakimi
1974 J jnl
Characterization of Connection Assignment of Diagnosable Systems.
IEEE Trans. Computers
S. Louis Hakimi, Ashok T. Amin
1973 J jnl
On the design of reliable networks.
Networks
S. Louis Hakimi, Ashok T. Amin
1972 J jnl
Optimum Locations of Centers in Networks.
Oper. Res.
S. Louis Hakimi, Shachindra N. Maheshwari
1971 J jnl
Graph theoretic q -ary codes (Corresp.).
IEEE Trans. Inf. Theory
L. S. Bobrow, S. Louis Hakimi
1971 J jnl
Steiner's problem in graphs and its implications.
Networks
S. Louis Hakimi
1969 J jnl
A Graph-Theoretic Approach to a Class of Integer-Programming Problems.
Oper. Res.
J. F. Desler, S. Louis Hakimi
1969 J jnl
Graph Theoretic Prefix Codes and Their Synchronizing Properties
Inf. Control.
L. S. Bobrow, S. Louis Hakimi
1969 J jnl
Ternary graph theoretic error-correcting codes (Corresp.).
IEEE Trans. Inf. Theory
S. Louis Hakimi, Jon G. Bredeson