Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
暂无分享,去创建一个
Fedor V. Fomin | Saket Saurabh | Venkatesh Raman | Daniel Lokshtanov | Frederic Dorn | F. Fomin | Saket Saurabh | Venkatesh Raman | D. Lokshtanov | F. Dorn
[1] Stephan Kreutzer,et al. The dag-width of directed graphs , 2012, J. Comb. Theory, Ser. B.
[2] Marek Karpinski,et al. Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament , 2010, ISAAC.
[3] Gregory Gutin,et al. FPT algorithms and kernels for the Directed k-Leaf problem , 2008, J. Comput. Syst. Sci..
[4] Ken-ichi Kawarabayashi,et al. Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[5] Dimitrios M. Thilikos,et al. Catalan structures and dynamic programming in H-minor-free graphs , 2008, SODA '08.
[6] Erik D. Demaine,et al. Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.
[7] Stéphan Thomassé,et al. On Finding Directed Trees with Many Leaves , 2009, IWPEC.
[8] Henning Fernau,et al. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.
[9] Gregory Gutin,et al. Minimum Leaf Out-Branching Problems , 2008, AAIM.
[10] Uriel Feige. Faster FAST(Feedback Arc Set in Tournaments) , 2009, ArXiv.
[11] Petr A. Golovach,et al. Contraction obstructions for treewidth , 2011, J. Comb. Theory, Ser. B.
[12] Petr A. Golovach,et al. Contraction Bidimensionality: the Accurate Picture , 2009, Parameterized complexity and approximation algorithms.
[13] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[15] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[16] Erik D. Demaine,et al. Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs , 2004, SODA '04.
[17] Joachim Kneis,et al. A New Algorithm for Finding Trees with Many Leaves , 2008, ISAAC.
[18] Michal Pilipczuk,et al. An O(c^k n) 5-Approximation Algorithm for Treewidth , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[19] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[20] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[21] Ge Xia,et al. Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.
[22] Stefan Kratsch,et al. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth , 2013, Inf. Comput..
[23] Fedor V. Fomin,et al. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem , 2009, J. Comput. Syst. Sci..
[24] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.
[25] Christian Sloper,et al. Reducing to Independent Set Structure -- the Case of k-Internal Spanning Tree , 2005, Nord. J. Comput..
[26] L BodlaenderHans,et al. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth , 2015 .
[27] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[28] Noga Alon,et al. Spanning Directed Trees with Many Leaves , 2008, SIAM J. Discret. Math..
[29] Erik D. Demaine,et al. Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.
[30] Michal Pilipczuk,et al. Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph , 2013, ESA.
[31] Erik D. Demaine,et al. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.
[32] Erik D. Demaine,et al. The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..
[33] Fedor V. Fomin,et al. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions , 2010, Algorithmica.
[34] Robin Thomas,et al. Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.
[35] Dimitrios M. Thilikos,et al. Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.
[36] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[37] Dimitrios M. Thilikos,et al. Subexponential parameterized algorithms , 2008, Comput. Sci. Rev..
[38] Fedor V. Fomin,et al. A Linear Vertex Kernel for Maximum Internal Spanning Tree , 2009, ISAAC.
[39] Erik Jan van Leeuwen,et al. Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs , 2013, STACS.
[40] Jianer Chen,et al. Improved algorithms for feedback vertex set problems , 2008, J. Comput. Syst. Sci..
[41] Erik D. Demaine,et al. Linearity of grid minors in treewidth with applications through bidimensionality , 2008, Comb..
[42] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[43] Stephan Kreutzer,et al. Digraph measures: Kelly decompositions, games, and orderings , 2007, SODA '07.
[44] Henning Fernau,et al. Kernel(s) for problems with no kernel: On out-trees with many leaves , 2008, TALG.
[45] Noga Alon,et al. Fast Fast , 2009, ICALP.
[46] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[47] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.
[48] Paul S. Bonsma,et al. Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree , 2008, TALG.
[49] Fedor V. Fomin,et al. Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms , 2013, SODA.
[50] Noga Alon,et al. Color-coding , 1995, JACM.
[51] Michal Pilipczuk,et al. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[52] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[53] Gregory Gutin,et al. Minimum leaf out-branching and related problems , 2008, Theor. Comput. Sci..
[54] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[55] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..
[56] Eyal Amir,et al. Approximation Algorithms for Treewidth , 2010, Algorithmica.