Jack M. Robertson

According to our database, Jack M. Robertson authored at least 9 papers between 1983 and 1998.

Collaborative distances:

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

1998

Cake-cutting algorithms - be fair if you can.

Jack M. Robertson, William A. Webb

A K Peters, ISBN: 978-1-56881-076-8, 1998

1997

Near Exact and Envy Free Cake Division.

Jack M. Robertson, William A. Webb

Ars Comb., 1997

When are chordal graphs also partition graphs?

Carreen Anbeek, Duane W. DeTemple, Kevin McAvaney, Jack M. Robertson

Australas. J Comb., 1997

1995

Approximating Fair Division with a Limited Number of Cuts.

Jack M. Robertson, William A. Webb

J. Comb. Theory A, 1995

1993

A characterization and hereditary properties for partitoon graphs.

Kevin McAvaney, Jack M. Robertson, Duane W. DeTemple

Discret. Math., 1993

Recent examples in the theory of partition graphs.

Duane W. DeTemple, M. J. Dineen, Jack M. Robertson, K. L. McAvaney

Discret. Math., 1993

1992

Ramsey partitions of integers and fair divisions.

Kevin McAvaney, Jack M. Robertson, William A. Webb

Comb., 1992

1990

Uniquely Remotal Hulls.

Duane W. DeTemple, Jack M. Robertson, Graham Wood

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1983

Permutations associated with billiard paths.

Duane W. DeTemple, Jack M. Robertson

Discret. Math., 1983