Tim Mott

According to our database, Tim Mott authored at least 2 papers between 2006 and 2008.

Collaborative distances:

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

2008

Constant memory routing in quasi-planar and quasi-polyhedral graphs.

Evangelos Kranakis, Tim Mott, Ladislav Stacho

Discret. Appl. Math., 2008

2006

Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs.

Evangelos Kranakis, Tim Mott, Ladislav Stacho

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006