Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Erik D. Demaine MIT, Cambridge, Massachusetts
Fedor V. Fomin University of Bergen, Bergen, Norway
Mohammadtaghi Hajiaghayi MIT, Cambridge, Massachusetts
Dimitrios M. Thilikos National and Capodistrian University of Athens, Athens, Greece
Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i>-minor-free graphs Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 69
· Downloads (cumulative): 811
· Citation Count: 59

Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 52 Issue 6, November 2005
Pages 866-893
ACM New York, NY, USA
table of contents doi>10.1145/1101821.1101823

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder