Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SODA
2004
ACM

favoriteEmaildiscussreport

64views Algorithms» more SODA 2004»

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

13 years 5 months ago

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

Download erikdemaine.org

Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha

Real-time Traffic

Algorithms | SODA 2004 |

claim paper

Related Content

» The Bidimensional Theory of BoundedGenus Graphs

» Subexponential Algorithms for Partial Cover Problems

» Subexponential parameterized algorithms for degreeconstrained subgraph problems on planar ...

» Bidimensionality and Kernels

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

» Linear kernels for connected dominating set on Hminorfree graphs

» Bidimensionality and geometric graphs

» On Parameterized Exponential Time Complexity

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos

Comments (0)