Fetching the paper…
Reading the bibliography…
We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs.
Approximation algorithms for np-complete problems on planar graphs
B. S. Baker · 1994
Earlier work this paper cites.
Quickly excluding a planar graph
N. Robertson, P. Seymour, and R. Thomas · 1994
Earlier work this paper cites.
Color-coding
N. Alon, R. Yuster, and U. Zwick · 1995
Earlier work this paper cites.
Which problems have strongly exponential complexity
R. Impagliazzo, R. Paturi, and F. Zane · 2001
Earlier work this paper cites.
Fixed parameter algorithms for dominating set and related problems on planar graphs
J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier · 2002
Earlier work this paper cites.
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
E. D. Demaine and M. Hajiaghayi · 2004
Earlier work this paper cites.
Finding odd cycle transversals
B. A. Reed, K. Smith, and A. Vetta · 2004
Earlier work this paper cites.
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos · 2005
Earlier work this paper cites.
Subexponential parameterized algorithms on graphs of bounded genus and
E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos · 2005
Earlier work this paper cites.
Algorithmic graph minor theory: Decomposition, approximation, and coloring
E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi · 2005
Earlier work this paper cites.
Reducing to independent set structure – the case of
E. Prieto and C. Sloper · 2005
Cited alongside, same era.
Improved parameterized upper bounds for vertex cover
J. Chen, I. A. Kanj, and G. Xia · 2006
Cited alongside, same era.
Parameterized Complexity Theory
J. Flum and M. Grohe · 2006
Cited alongside, same era.
Dominating sets in planar graphs: Branch-width and exponential speed-up
F. V. Fomin and D. M. Thilikos · 2006
Cited alongside, same era.
Invitation to fixed-parameter algorithms
R. Niedermeier · 2006
Cited alongside, same era.
Improved algorithms for feedback vertex set problems
J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger · 2008
Cited alongside, same era.
Subexponential parameterized algorithms
F. Dorn, F. V. Fomin, and D. M. Thilikos · 2008
Later among the works it cites.
Minimum leaf out-branching problems
G. Gutin, E. J. Kim, and I. Razgon · 2008
Later among the works it cites.
A new algorithm for finding trees with many leaves
J. Kneis, A. Langer, and P. Rossmanith · 2008
Later among the works it cites.
Spanning directed trees with many leaves
N. Alon, F. V. Fomin, G. Gutin, M. Krivelevich, and S. Saurabh · 2009
Later among the works it cites.
Fast FAST
N. Alon, D. Lokshtanov, and S. Saurabh · 2009
Later among the works it cites.
On finding directed trees with many leaves
J. Daligault and S. Thomassé · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Daligault, G. Gutin, E. J. Kim, and A. Yeo · 2008
Cited alongside, same era.
Linearity of grid minors in treewidth with applications through bidimensionality
E. D. Demaine and M. Hajiaghayi · 2008
Cited alongside, same era.
The bidimensionality theory and its algorithmic applications
E. D. Demaine and M. T. Hajiaghayi · 2008
Cited alongside, same era.
Catalan structures and dynamic programming in H-minor-free graphs
F. Dorn, F. V. Fomin, and D. M. Thilikos · 2008
Cited alongside, same era.
Tight bounds and a fast FPT algorithm for directed max-leaf spanning tree
P. Bonsma and F. Dorn
Cited in the paper.
Algorithm for finding
N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, and A. Yeo
Cited in the paper.
Kernel(s) for problems with no kernel: On out-trees with many leaves
H. Fernau, F. V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh, and Y. Villanger · 2009
Later among the works it cites.
A linear vertex kernel for maximum internal spanning tree
F. V. Fomin, S. Gaspers, S. Saurabh, and S. Thomassé · 2009
Later among the works it cites.
Contraction bidimensionality: the accurate picture
F. V. Fomin, P. A. Golovach, and D. M. Thilikos · 2009
Later among the works it cites.