S. Louis Hakimi

According to our database1, S. Louis Hakimi authored at least 75 papers between 1965 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Sufficient degree conditions for <i>k</i>-edge-connectedness of a graph.
Networks, 2009

Improved bounds for the chromatic number of a graph.
J. Graph Theory, 2004

Bounds for the chromatic number of graphs with partial information.
Discret. Math., 2003

Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon., 2000

Discrete Optimization.
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

Short Proofs of Theorems of Nash-Williams and Tutte.
Ars Comb., 1998

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

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

Degree-bounded coloring of graphs: Variations on a theme by brooks.
J. Graph Theory, 1995

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

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

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

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

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

A Note on the Vertex Arboricity of a Graph.
SIAM J. Discret. Math., 1989

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

Scheduling File Transfers for Trees and Odd Cycles.
SIAM J. Comput., 1987

Data transfers in networks with transceivers.
Networks, 1987

A generalization of edge-coloring in graphs.
J. Graph Theory, 1986

System-level diagnosis: Analysis of two new models.
Inf. Sci., 1986

Fault-Tolerant Routing in DeBruijn Communication Networks.
IEEE Trans. Computers, 1985

On Adaptive System Diagnosis.
IEEE Trans. Computers, 1984

On computing the connectivities of graphs and digraphs.
Networks, 1984

An Adaptive Algorithm for System Level Diagnosis.
J. Algorithms, 1984

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

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

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

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

On Models for Diagnosable Systems and Probabilistic Fault Diagnosis.
IEEE Trans. Computers, 1976

Relations between graphs and integer-pair sequences.
Discret. Math., 1976

Characterization of Connection Assignment of Diagnosable Systems.
IEEE Trans. Computers, 1974

On the design of reliable networks.
Networks, 1973

Optimum Locations of Centers in Networks.
Oper. Res., 1972

Graph theoretic q -ary codes (Corresp.).
IEEE Trans. Inf. Theory, 1971

Steiner's problem in graphs and its implications.
Networks, 1971

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

Graph theoretic error-correcting codes.
IEEE Trans. Inf. Theory, 1968

Decoding of graph theoretic codes (Corresp.).
IEEE Trans. Inf. Theory, 1967

Cut-set matrices and linear codes (Corresp.).
IEEE Trans. Inf. Theory, 1965