Exponential speedup of fixed parameter algorithms on graphs excluding a graph with one crossing as a minor

Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos
Proc. 13th Int. Symp. Algorithms & Computation (ISAAC 2002), Lecture Notes in Computer Science 2518, Prosenjit K. Bose and Pat Morin, ed., Springer-Verlag, 2002, pp. 262–273
Tech. report MIT-LCS-TR-838, Massachusetts Inst. Tech., Lab. for Computer Science, Mar 2002
http://www.lcs.mit.edu/publications/specpub.php?id=1611

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!