Alan C. Tucker

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

1988
Greedy packing and series-parallel graphs.
J. Comb. Theory A, 1988

1984
An O(N²) Algorithm for Coloring Perfect Planar Graphs.
J. Algorithms, 1984

1982
A matroid related to finitely chainlike, countably infinite networks.
Networks, 1982

1980
An Efficient Test for Circular-Arc Graphs.
SIAM J. Comput., 1980

1978
Computer Science Core Curriculum And Mathematics.
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1974
The Cost of a Class of Optimal Binary Trees.
J. Comb. Theory A, 1974


  Loading...