S. Louis Hakimi

J. Graph Theory, 2004

2003

Bounds for the chromatic number of graphs with partial information.

[BibT_eX]

[DOI]

William C. Coffman

Michael Mesterton-Gibbons

Discret. Math., 2003

2000

Tiling Rectangles with Trominoes: 10641.

[BibT_eX]

[DOI]

Am. Math. Mon., 2000

1999

Discrete Optimization.

[BibT_eX]

[DOI]

Joseph R. Barr

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Locations on time-varying networks.

[BibT_eX]

[DOI]

Networks, 1999

Improved bounds for the chromatic index of graphs and multigraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

Short Proofs of Theorems of Nash-Williams and Tutte.

[BibT_eX]

John Mitchem

Ars Comb., 1998

1997

Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs.

[BibT_eX]

[DOI]

Zhengyu Ge

SIAM J. Comput., 1997

Locating replicas of a database on a network.

[BibT_eX]

[DOI]

Networks, 1997

Graphs with given odd sets and the least number of vertices.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Orienting Graphs to Optimize Reachability.

[BibT_eX]

[DOI]

Neal E. Young

Inf. Process. Lett., 1997

1996

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

Star arboricity of graphs.

[BibT_eX]

[DOI]

John Mitchem

Discret. Math., 1996

1995

Degree-bounded coloring of graphs: Variations on a theme by brooks.

[BibT_eX]

[DOI]

John Mitchem

J. Graph Theory, 1995

1994

Information Dissemination in Distributed Systems With Faulty Units.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

Parallel Information Dissemination by Packets.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Approximation algorithms for the capacitated plant allocation problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

Edge-disjoint packings of graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

Shigeru Masuyama

Discret. Appl. Math., 1994

Gossiping with Multiple Sends and Receives.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993

Gossigping in a Distributed Network.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

On Minimum Fault-Tolerant Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

On locating path- or tree-shaped facilities on networks.

[BibT_eX]

[DOI]

Networks, 1993

1992

Data Transfers in Broadcast Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Sequential information dissemination by packets.

[BibT_eX]

[DOI]

Networks, 1992

The Voronoi Partition of a Network and Its Implications in Location Theory.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

1991

Market and Locational Equilibrium for Two Competitors.

[BibT_eX]

[DOI]

Oper. Res., 1991

Fitting polygonal functions to a set of points in the plane.

[BibT_eX]

[DOI]

CVGIP Graph. Model. Image Process., 1991

Parallel algorithms for information dissemination by packets.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

An Optimal Algorithm for Distributed System Level Diagnosis.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

1990

River Routing with a Small Number of Jogs.

[BibT_eX]

[DOI]

Tai-Ching Tuan

SIAM J. Discret. Math., 1990

A Parallel Fault Identification Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Parallel Algorithms for Gossiping by Mail.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Recognizing tough graphs is NP-hard.

[BibT_eX]

[DOI]

Douglas Bauer

Discret. Appl. Math., 1990

1989

A Note on the Vertex Arboricity of a Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

1988

Distributed Diagnosis and the System User.

[BibT_eX]

[DOI]

Steven E. Kreutzer

IEEE Trans. Computers, 1988

Data transfers in networks with transceivers.

[BibT_eX]

[DOI]

Hyeong-Ah Choi

Networks, 1988

Chromatic factorizations of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

A cycle structure theorem for hamiltonian graphs.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

J. Comb. Theory B, 1988

The complexity of searching a graph.

[BibT_eX]

[DOI]

J. ACM, 1988

On Computing a Conditional Edge-Connectivity of a Graph.

[BibT_eX]

[DOI]

Abdol-Hossein Esfahanian

Inf. Process. Lett., 1988

Data Transfers in Networks.

[BibT_eX]

[DOI]

Hyeong-Ah Choi

Algorithmica, 1988

On minimizing testing rounds for fault identification.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Symposium on Fault-Tolerant Computing, 1988

1987

Scheduling File Transfers for Trees and Odd Cycles.

[BibT_eX]

[DOI]

Hyeong-Ah Choi

SIAM J. Comput., 1987

System-Level Fault Diagnosis: A survey.

[BibT_eX]

[DOI]

Steven E. Kreutzer

Microprocessing and Microprogramming, 1987

1986

A generalization of edge-coloring in graphs.

[BibT_eX]

[DOI]

Oded Kariv

J. Graph Theory, 1986

System-level diagnosis: Analysis of two new models.

[BibT_eX]

[DOI]

Steven E. Kreutzer

Inf. Sci., 1986

1985

Fault-Tolerant Routing in DeBruijn Communication Networks.

[BibT_eX]

[DOI]

Abdol-Hossein Esfahanian

IEEE Trans. Computers, 1985

1984

On Adaptive System Diagnosis.

[BibT_eX]

[DOI]

Kazuo Nakajima

IEEE Trans. Computers, 1984

Midwest theory of computation symposium: on a generalization of edge-coloring in graphs.

[BibT_eX]

[DOI]

Oded Kariv

SIGACT News, 1984

On computing the connectivities of graphs and digraphs.

[BibT_eX]

[DOI]

Abdol-Hossein Esfahanian

Networks, 1984

An Adaptive Algorithm for System Level Diagnosis.

[BibT_eX]

[DOI]

J. Algorithms, 1984

1982

Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.

[BibT_eX]

[DOI]

Katsuto Nakajima

Jan Karel Lenstra

SIAM J. Comput., 1982

Complexity Results for Scheduling Tasks with Discrete Starting Times.

[BibT_eX]

[DOI]

Kazuo Nakajima

J. Algorithms, 1982

1981

Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems

[BibT_eX]

[DOI]

Kyung-Yong Chwa

Inf. Control., June, 1981

On the complexity of some coding problems.

[BibT_eX]

[DOI]

Simeon C. Ntafos

IEEE Trans. Inf. Theory, 1981

On Structured Digraphs and Program Testing.

[BibT_eX]

[DOI]

Simeon C. Ntafos

IEEE Trans. Computers, 1981

On Fault Identification in Diagnosable Systems.

[BibT_eX]

[DOI]

Kyung-Yong Chwa

Christos H. Papadimitriou

IEEE Trans. Computers, 1981

The Complexity of Searching a Graph (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979

On Path Cover Problems in Digraphs and Applications to Program Testing.

[BibT_eX]

[DOI]

Simeon C. Ntafos

IEEE Trans. Software Eng., 1979

On the number of hamiltonian cycles in a maximal planar graph.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Graph Theory, 1979

On the number of cycles of length <i>k</i> in a maximal planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

1978

Corrections and Comments on "On Models for Diagnosable Systems and Probabilistic Fault Diagnosis".

[BibT_eX]

[DOI]

Shachindra N. Maheshwari

IEEE Trans. Computers, 1978

On the connectivity of maximal planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

1976

On Models for Diagnosable Systems and Probabilistic Fault Diagnosis.

[BibT_eX]

[DOI]

Shachindra N. Maheshwari

IEEE Trans. Computers, 1976

Relations between graphs and integer-pair sequences.

[BibT_eX]

[DOI]

A. N. Patrinos

Discret. Math., 1976

1975

The Program, Conclusions and Recommendations.

[BibT_eX]

[DOI]

Networks, 1975

1974

Characterization of Connection Assignment of Diagnosable Systems.

[BibT_eX]

[DOI]

Ashok T. Amin

IEEE Trans. Computers, 1974

1973

On the design of reliable networks.

[BibT_eX]

[DOI]

Ashok T. Amin

Networks, 1973

1972

Optimum Locations of Centers in Networks.

[BibT_eX]

[DOI]

Shachindra N. Maheshwari

Oper. Res., 1972

1971

Graph theoretic q -ary codes (Corresp.).

[BibT_eX]

[DOI]

L. S. Bobrow

IEEE Trans. Inf. Theory, 1971

Steiner's problem in graphs and its implications.

[BibT_eX]

[DOI]

Networks, 1971

1969

Graph Theoretic Prefix Codes and Their Synchronizing Properties

[BibT_eX]

[DOI]

L. S. Bobrow

Inf. Control., July, 1969

Ternary graph theoretic error-correcting codes (Corresp.).

[BibT_eX]

[DOI]

Jon G. Bredeson

IEEE Trans. Inf. Theory, 1969

A Graph-Theoretic Approach to a Class of Integer-Programming Problems.

[BibT_eX]

[DOI]

J. F. Desler

Oper. Res., 1969

1968

Graph theoretic error-correcting codes.

[BibT_eX]

[DOI]

Jon G. Bredeson

IEEE Trans. Inf. Theory, 1968

1967

Decoding of graph theoretic codes (Corresp.).

[BibT_eX]

[DOI]

Jon G. Bredeson

IEEE Trans. Inf. Theory, 1967

1965

Cut-set matrices and linear codes (Corresp.).

[BibT_eX]

[DOI]

H. Frank

IEEE Trans. Inf. Theory, 1965

1959

New Techniques for Realization of Transfer Functions

[BibT_eX]

[DOI]