Algorithms and Complexity of s-Club Cluster Vertex Deletion

[1]  Yuichi Asahiro,et al.  Approximating Maximum Diameter-Bounded Subgraphs , 2010, LATIN.

[2]  Ekkehard Köhler,et al.  Linear Time LexDFS on Cocomparability Graphs , 2014, SWAT.

[3]  Hong Liu,et al.  On Editing Graphs into 2-Club Clusters , 2012, FAW-AAIM.

[4]  Kurt Mehlhorn,et al.  Certifying algorithms for recognizing interval graphs and permutation graphs , 2003, SODA '03.

[5]  Asahi Takaoka,et al.  A recognition algorithm for simple-triangle graphs , 2017, Discret. Appl. Math..

[6]  Srinivas Pasupuleti,et al.  Detection of Protein Complexes in Protein Interaction Networks Using n-Clubs , 2008, EvoBIO.

[7]  Christian Komusiewicz,et al.  Parameterized computational complexity of finding small-diameter subgraphs , 2012, Optim. Lett..

[8]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1994, Discret. Appl. Math..

[9]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[10]  Yota Otachi,et al.  Vertex deletion problems on chordal graphs , 2018, Theor. Comput. Sci..

[11]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[12]  Sergiy Butenko,et al.  Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..

[13]  Viggo Kann,et al.  Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.

[14]  Christian Komusiewicz,et al.  On structural parameterizations for the 2-club problem , 2013, Discret. Appl. Math..

[15]  Christian Komusiewicz,et al.  Fixed-Parameter Algorithms for Cluster Vertex Deletion , 2010, Theory of Computing Systems.

[16]  Maw-Shang Chang,et al.  Finding large $$k$$-clubs in undirected graphs , 2013, Computing.

[17]  Madhumangal Pal,et al.  An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs , 2002, Theory of Computing Systems.

[18]  Madhumangal Pal,et al.  An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs , 2001, Comput. Optim. Appl..

[19]  George B. Mertzios.  The recognition of triangle graphs , 2012, Theor. Comput. Sci..

[20]  Ekkehard Köhler,et al.  A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs , 2016, Inf. Process. Lett..

[21]  Peter Damaschke.  Distances in cocomparability graphs and their powers , 1992, Discret. Appl. Math..