Current position

Name: Anders Yeo
Position: Reader in Computer Science
Employment: The computer Science department at Royal Holloway, University of London.

A. Yeo's Research Interests

I was a Ph.D. student at Odense University until the spring of 1998. I now have a lecture position at Royal Holloway, University of London. My main area's of interest are graph theory, algorithms, computational complexity, combinatorics, combinatorial optimization, operational research and probability.

In graph theory I have mostly been looking at directed graphs, especially semicomplete multipartite digraphs, and edge coloured graphs. Recently I have also been looking at the Traveling Salesman Problem (TSP). Combinatorics I find both very interesting and useful in many cases. Unfortunately I haven't had much time to study this area in depth. I have one publication on the secretary problem, which uses combinatorics and probability theory. My father Geoffrey Yeo was a co-author to this paper.

I have quite a few algorithmic results on digraphs. Some of these give polynomial algorithms for finding certain cycles in semicomplete multipartite digraphs and semicomplete bipartite digraphs. Others are related to the TSP. I have also had several results showing the NP-completeness of problems.

CV, summery of publications, etc..

EXPLANATION	WWW-PAGE	PS-FILE (updated more frequently)
My curriculum vitae	here	ps-file (1 page)
a list of my publications	here	ps-file (2 pages)
a short summery of my publications	here	ps-file (2 pages)
a survey of my publications	not available	ps-file (8 pages)
My teaching experience	not available	ps-file (1 page)

A. Yeo's projects

PROJECT	TITLE	DOWNLOAD
Bachelor Project	Optimalt Spil i Black-Jack (in danish)	ps-file html-page pdf-file
Qualifying Exam (i.e. for masters degree)	Cycles in Semicomplete Multipartite Digraphs	ps-file
Ph.D. Thesis	Semicomplete Multipartite Digraphs The first 45 pages (the thesis, without appendix D) Pages 46 to 291 (appendix D)	ps-file ps-file

Anders Yeo <yeo@daimi.au.dk>