Pages that link to "Item:Q3921261"

The following pages link to Node-Deletion Problems on Bipartite Graphs (Q3921261):

Displaying 50 items.

• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
• A polynomial kernel for diamond-free editing (Q2072105) (← links)
• Relating dissociation, independence, and matchings (Q2081478) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
• Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
• A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
• The geodesic-transversal problem (Q2246468) (← links)
• Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
• Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
• Minimum \(k\)-path vertex cover (Q2275922) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
• Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
• Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• Connected matchings in chordal bipartite graphs (Q2339830) (← links)
• Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
• New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Independent packings in structured graphs (Q2583122) (← links)
• On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
• Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
• Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
• Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
• Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)
• On the Hardness of Energy Minimisation for Crystal Structure Prediction (Q3297788) (← links)
• THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
• Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
• Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
• Computing the Minimum Fill-In is NP-Complete (Q3960122) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
• ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (Q4903635) (← links)
• Secure total domination in chain graphs and cographs (Q4956172) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5009483) (← links)