According to our database
1,
S. Louis Hakimi
authored at least 78 papers
between 1959 and 2009.
Collaborative distances:
IEEE Fellow 1972, "For contributions in applications of graph theory to circuit analysis".
2009
Sufficient degree conditions for <i>k</i>-edge-connectedness of a graph.
Networks, 2009
2004
Improved bounds for the chromatic number of a graph.
J. Graph Theory, 2004
2003
Bounds for the chromatic number of graphs with partial information.
Discret. Math., 2003
2000
Tiling Rectangles with Trominoes: 10641.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
Am. Math. Mon., 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Locations on time-varying networks.
Networks, 1999
Improved bounds for the chromatic index of graphs and multigraphs.
J. Graph Theory, 1999
1998
Short Proofs of Theorems of Nash-Williams and Tutte.
Ars Comb., 1998
1997
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs.
SIAM J. Comput., 1997
Locating replicas of a database on a network.
Networks, 1997
Graphs with given odd sets and the least number of vertices.
J. Graph Theory, 1997
Orienting Graphs to Optimize Reachability.
Inf. Process. Lett., 1997
1996
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].
Oper. Res. Lett., 1996
Star arboricity of graphs.
Discret. Math., 1996
Gossiping with Multiple Sends and Receives.
Discret. Appl. Math., 1996
1995
Degree-bounded coloring of graphs: Variations on a theme by brooks.
J. Graph Theory, 1995
1994
Information Dissemination in Distributed Systems With Faulty Units.
IEEE Trans. Computers, 1994
Parallel Information Dissemination by Packets.
SIAM J. Comput., 1994
Approximation algorithms for the capacitated plant allocation problem.
Oper. Res. Lett., 1994
Edge-disjoint packings of graphs.
Discret. Appl. Math., 1994
1993
Gossigping in a Distributed Network.
IEEE Trans. Computers, 1993
On Minimum Fault-Tolerant Networks.
SIAM J. Discret. Math., 1993
On locating path- or tree-shaped facilities on networks.
Networks, 1993
1992
Data Transfers in Broadcast Networks.
IEEE Trans. Computers, 1992
Sequential information dissemination by packets.
Networks, 1992
The Voronoi Partition of a Network and Its Implications in Location Theory.
INFORMS J. Comput., 1992
1991
Market and Locational Equilibrium for Two Competitors.
Oper. Res., 1991
Fitting polygonal functions to a set of points in the plane.
CVGIP Graph. Model. Image Process., 1991
Parallel algorithms for information dissemination by packets.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991
An Optimal Algorithm for Distributed System Level Diagnosis.
Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991
1990
River Routing with a Small Number of Jogs.
SIAM J. Discret. Math., 1990
A Parallel Fault Identification Algorithm.
J. Algorithms, 1990
Parallel Algorithms for Gossiping by Mail.
Inf. Process. Lett., 1990
Recognizing tough graphs is NP-hard.
Discret. Appl. Math., 1990
1989
A Note on the Vertex Arboricity of a Graph.
SIAM J. Discret. Math., 1989
1988
Distributed Diagnosis and the System User.
IEEE Trans. Computers, 1988
Chromatic factorizations of a graph.
J. Graph Theory, 1988
A cycle structure theorem for hamiltonian graphs.
J. Comb. Theory, Ser. B, 1988
The complexity of searching a graph.
J. ACM, 1988
On Computing a Conditional Edge-Connectivity of a Graph.
Inf. Process. Lett., 1988
Data Transfers in Networks.
Algorithmica, 1988
On minimizing testing rounds for fault identification.
Proceedings of the Eighteenth International Symposium on Fault-Tolerant Computing, 1988
1987
Scheduling File Transfers for Trees and Odd Cycles.
SIAM J. Comput., 1987
Data transfers in networks with transceivers.
Networks, 1987
1986
A generalization of edge-coloring in graphs.
J. Graph Theory, 1986
System-level diagnosis: Analysis of two new models.
Inf. Sci., 1986
1985
Fault-Tolerant Routing in DeBruijn Communication Networks.
IEEE Trans. Computers, 1985
1984
On Adaptive System Diagnosis.
IEEE Trans. Computers, 1984
Midwest theory of computation symposium: on a generalization of edge-coloring in graphs.
SIGACT News, 1984
On computing the connectivities of graphs and digraphs.
Networks, 1984
An Adaptive Algorithm for System Level Diagnosis.
J. Algorithms, 1984
1982
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
SIAM J. Comput., 1982
Complexity Results for Scheduling Tasks with Discrete Starting Times.
J. Algorithms, 1982
1981
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems
Inf. Control., June, 1981
On the complexity of some coding problems.
IEEE Trans. Inf. Theory, 1981
On Structured Digraphs and Program Testing.
IEEE Trans. Computers, 1981
On Fault Identification in Diagnosable Systems.
IEEE Trans. Computers, 1981
The Complexity of Searching a Graph (Preliminary Version)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1979
On Path Cover Problems in Digraphs and Applications to Program Testing.
IEEE Trans. Software Eng., 1979
On the number of hamiltonian cycles in a maximal planar graph.
J. Graph Theory, 1979
On the number of cycles of length <i>k</i> in a maximal planar graph.
J. Graph Theory, 1979
1978
Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis".
IEEE Trans. Computers, 1978
On the connectivity of maximal planar graphs.
J. Graph Theory, 1978
1976
On Models for Diagnosable Systems and Probabilistic Fault Diagnosis.
IEEE Trans. Computers, 1976
Relations between graphs and integer-pair sequences.
Discret. Math., 1976
1975
The Program, Conclusions and Recommendations.
Networks, 1975
1974
Characterization of Connection Assignment of Diagnosable Systems.
IEEE Trans. Computers, 1974
1973
On the design of reliable networks.
Networks, 1973
1972
Optimum Locations of Centers in Networks.
Oper. Res., 1972
1971
Graph theoretic q -ary codes (Corresp.).
IEEE Trans. Inf. Theory, 1971
Steiner's problem in graphs and its implications.
Networks, 1971
1969
Graph Theoretic Prefix Codes and Their Synchronizing Properties
Inf. Control., July, 1969
Ternary graph theoretic error-correcting codes (Corresp.).
IEEE Trans. Inf. Theory, 1969
A Graph-Theoretic Approach to a Class of Integer-Programming Problems.
Oper. Res., 1969
1968
Graph theoretic error-correcting codes.
IEEE Trans. Inf. Theory, 1968
1967
Decoding of graph theoretic codes (Corresp.).
IEEE Trans. Inf. Theory, 1967
1965
Cut-set matrices and linear codes (Corresp.).
IEEE Trans. Inf. Theory, 1965
1959
New Techniques for Realization of Transfer Functions
PhD thesis, 1959
