T. A. Jenkyns

According to our database1, T. A. Jenkyns authored at least 3 papers between 1979 and 1995.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1995
Generating all k-subsets of {1, ..., n} with minimal changes.
Ars Comb., 1995

1991
On the Inadequacy of Tournament Algorithms for the N-SCS Problem.
Inf. Process. Lett., 1991

1979
The greedy travelling salesman's problem.
Networks, 1979


  Loading...