Alan C. Tucker

According to our database, Alan C. Tucker authored at least 7 papers between 1974 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1999

Counting Methods.

Jay Yellen, Edward W. Packel, Robert G. Rieper, George E. Andrews, Alan C. Tucker, Edward A. Bender, Bruce E. Sagan

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

1988

Greedy packing and series-parallel graphs.

Alan J. Hoffman, Alan C. Tucker

J. Comb. Theory A, 1988

1984

An O(N²) Algorithm for Coloring Perfect Planar Graphs.

Alan C. Tucker, Donna Wilson

J. Algorithms, 1984

1982

A matroid related to finitely chainlike, countably infinite networks.

Alan C. Tucker, Armen H. Zemanian

Networks, 1982

1980

An Efficient Test for Circular-Arc Graphs.

Alan C. Tucker

SIAM J. Comput., 1980

1978

Computer Science Core Curriculum And Mathematics.

Alan C. Tucker

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1974

The Cost of a Class of Optimal Binary Trees.

Alan C. Tucker

J. Comb. Theory A, 1974