List H-Coloring a Graph by Removing Few Vertices
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[2] Wolfgang Thomas,et al. Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .
[3] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[4] Yijia Chen,et al. On Parameterized Approximability , 2006, IWPEC.
[5] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[6] Pavol Hell,et al. List homomorphisms of graphs with bounded degrees , 2007, Discret. Math..
[7] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[8] Pavol Hell,et al. The dichotomy of list homomorphisms for digraphs , 2011, SODA '11.
[9] Dániel Marx,et al. Fixed-parameter tractability of multicut parameterized by the size of the cutset , 2010, STOC '11.
[10] Dániel Marx,et al. Clustering with local restrictions , 2011, Inf. Comput..
[11] P. Hell,et al. Sparse pseudo-random graphs are Hamiltonian , 2003 .
[12] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[13] Pavol Hell,et al. List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.
[14] Pascal Tesson,et al. The Complexity of the List Homomorphism Problem for Graphs , 2010, STACS.
[15] Saket Saurabh,et al. Faster Parameterized Algorithms Using Linear Programming , 2012, ACM Trans. Algorithms.
[16] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[17] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[18] Jörg Flum,et al. Query evaluation via tree-decompositions , 2001, JACM.
[19] Mohammad Taghi Hajiaghayi,et al. Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable , 2010, TALG.
[20] Pavol Hell,et al. List Homomorphisms and Circular Arc Graphs , 1999, Comb..
[21] M. S. Ramanujan,et al. Parameterized Tractability of Multiway Cut with Parity Constraints , 2012, ICALP.
[22] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[23] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[24] Jeremy P. Spinrad. Circular-arc graphs with clique cover number two , 1988, J. Comb. Theory, Ser. B.
[25] Barry O'Sullivan,et al. Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..
[26] Gregory Gutin,et al. Minimum cost and list homomorphisms to semicomplete digraphs , 2005, Discret. Appl. Math..
[27] Bruno Courcelle,et al. Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[28] Barry O'Sullivan,et al. Finding small separators in linear time via treewidth reduction , 2011, TALG.
[29] Pavol Hell,et al. Space complexity of list H-colouring: a dichotomy , 2013, SODA.
[30] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[31] Dániel Marx,et al. Parameterized graph separation problems , 2004, Theor. Comput. Sci..
[32] Michal Pilipczuk,et al. On Multiway Cut Parameterized above Lower Bounds , 2011, IPEC.
[33] Mohammad Taghi Hajiaghayi,et al. Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset , 2011, SODA.
[34] Michal Pilipczuk,et al. Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs , 2015, SIAM J. Discret. Math..
[35] Dániel Marx,et al. List H-Coloring a Graph by Removing Few Vertices , 2013, ESA.
[36] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..