Lyle McGeoch Algorithms for Two Graph Problems: Computing Maximum-genus Imbedding and the Two-server Problem Degree Type: Ph.D. in Computer Science Advisor(s): Merrick Furst Graduated: August 1987 Abstract Currently Unavailable Thesis Document Currently Unavailable Electronically Return to Degrees List Thesis Repositories SCS Technical Reports Kilthub Proquest (requires CMU login)
