| 2008 | 
| 16 | EE | Lyle A. McGeoch:
Implementation Challenge for TSP Heuristics.
Encyclopedia of Algorithms 2008 | 
| 2002 | 
| 15 | EE | Scott F. Kaplan,
Lyle A. McGeoch,
Megan F. Cole:
Adaptive caching for demand prepaging.
MSP/ISMM 2002: 221-232 | 
| 14 | EE | Amos Fiat,
Richard M. Karp,
Michael Luby,
Lyle A. McGeoch,
Daniel Dominic Sleator,
Neal E. Young:
Competitive Paging Algorithms
CoRR cs.DS/0205038:  (2002) | 
| 2001 | 
| 13 | EE | Jill Cirasella,
David S. Johnson,
Lyle A. McGeoch,
Weixiong Zhang:
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.
ALENEX 2001: 32-59 | 
| 1996 | 
| 12 |   | David S. Johnson,
Lyle A. McGeoch,
Edward E. Rothberg:
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound.
SODA 1996: 341-350 | 
| 1995 | 
| 11 |   | Michael L. Fredman,
David S. Johnson,
Lyle A. McGeoch,
G. Ostheimer:
Data Structures for Traveling Salesmen.
J. Algorithms 18(3): 432-479 (1995) | 
| 1994 | 
| 10 |   | Anna R. Karlin,
Mark S. Manasse,
Lyle A. McGeoch,
Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems.
Algorithmica 11(6): 542-571 (1994) | 
| 1993 | 
| 9 |   | Michael L. Fredman,
David S. Johnson,
Lyle A. McGeoch,
G. Ostheimer:
Data Structures for Traveling Salesmen.
SODA 1993: 145-154 | 
| 1991 | 
| 8 |   | Edward G. Coffman Jr.,
Costas Courcoubetis,
M. R. Garey,
David S. Johnson,
Lyle A. McGeoch,
Peter W. Shor,
Richard R. Weber,
Mihalis Yannakakis:
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study
STOC 1991: 230-240 | 
| 7 |   | Lyle A. McGeoch,
Daniel Dominic Sleator:
A Strongly Competitive Randomized Paging Algorithm.
Algorithmica 6(6): 816-825 (1991) | 
| 6 |   | Amos Fiat,
Richard M. Karp,
Michael Luby,
Lyle A. McGeoch,
Daniel Dominic Sleator,
Neal E. Young:
Competitive Paging Algorithms.
J. Algorithms 12(4): 685-699 (1991) | 
| 1990 | 
| 5 |   | Anna R. Karlin,
Mark S. Manasse,
Lyle A. McGeoch,
Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems.
SODA 1990: 301-309 | 
| 4 |   | Mark S. Manasse,
Lyle A. McGeoch,
Daniel Dominic Sleator:
Competitive Algorithms for Server Problems.
J. Algorithms 11(2): 208-230 (1990) | 
| 1988 | 
| 3 |   | Mark S. Manasse,
Lyle A. McGeoch,
Daniel Dominic Sleator:
Competitive Algorithms for On-line Problems
STOC 1988: 322-333 | 
| 2 | EE | Merrick L. Furst,
Jonathan L. Gross,
Lyle A. McGeoch:
Finding a maximum-genus graph imbedding.
J. ACM 35(3): 523-534 (1988) | 
| 1984 | 
| 1 |   | Jon Louis Bentley,
David S. Johnson,
Frank Thomson Leighton,
Catherine C. McGeoch,
Lyle A. McGeoch:
Some Unexpected Expected Behavior Results for Bin Packing
STOC 1984: 279-288 |