Node-Deletion Problems on Bipartite Graphs

Cited In (only showing first 100 items - show all)

An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
Edge-contraction problems
Linear structure of bipartite permutation graphs and the longest path problem
Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
Computing the Minimum Fill-In is NP-Complete
\(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
On the weighted \(k\)-path vertex cover problem
Minimum \(d\)-blockers and \(d\)-transversals in graphs
A fixed-parameter algorithm for the vertex cover \(P_3\) problem
An efficient algorithm for minimum feedback vertex sets in rotator graphs
Independent packings in structured graphs
On computing the minimum 3-path vertex cover and dissociation number of graphs
Implications of forbidden structures for extremal algorithmic problems
Edge deletion problems: branching facilitated by modular decomposition
Augmenting approach for some maximum set problems
The \(k\)-path vertex cover of rooted product graphs
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Blockers and transversals
On the complexity of the k-chain subgraph cover problem
New upper bounds on feedback vertex numbers in butterflies
Recognizing interval digraphs and interval bigraphs in polynomial time
The complexity of dissociation set problems in graphs
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
Extracting embedded generalized networks from linear programming problems
Bandwidth of chain graphs
Circular convex bipartite graphs: feedback vertex sets
A probabilistic estimator for the vertex deletion problem
Feedback vertex sets on restricted bipartite graphs
Some new considerations about double nested graphs
Some results on graphs without long induced paths
On computing longest paths in small graph classes
Graph classes with structured neighborhoods and algorithmic applications
The chain graph sandwich problem
Solving matching problems efficiently in bipartite graphs
Conjunctive-query containment and constraint satisfaction
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Biclique graphs and biclique matrices
Secure total domination in chain graphs and cographs
The maximum k-colorable subgraph problem for chordal graphs
On edge perfectness and classes of bipartite graphs
A good submatrix is hard to find
Matching interdiction
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
Minimum \(k\)-path vertex cover
Subset feedback vertex set on graphs of bounded independent set size
Subset feedback vertex set on graphs of bounded independent set size
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
On the vertex \(k\)-path cover
Complexity of learning in concept lattices from positive and negative examples
Stable-\(\Pi\) partitions of graphs
Graph modification problem for some classes of graphs
Optimal edge ranking of trees in polynomial time
A characterization of chain probe graphs
Two characterizations of chain partitioned probe graphs
Algorithms for induced biclique optimization problems
The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
The induced matching and chain subgraph cover problems for convex bipartite graphs
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
Monotonizing linear programs with up to two nonzeroes per column
Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
On sum coloring of graphs
The critical node detection problem in networks: a survey
A faster FPT algorithm for 3-path vertex cover
Two Hardness Results on Feedback Vertex Sets
Maximum bipartite subgraphs of geometric intersection graphs
The maximum number of maximum dissociation sets in trees
Partitioning a graph into small pieces with applications to path transversal
Maximum dissociation sets in subcubic trees
Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
Between 2- and 3-colorability
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
On the hardness of energy minimisation for crystal structure prediction
Maximum weight t-sparse set problem on vector-weighted graphs
Treewidth versus clique number. II: Tree-independence number
Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
Circular convex bipartite graphs: feedback vertex set
Connected matchings in chordal bipartite graphs
A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Enumerating maximal dissociation sets in three classes of grid graphs
Improved approximation algorithms for path vertex covers in regular graphs
Parameterized algorithms for finding highly connected solution
3-path vertex cover and dissociation number of hexagonal graphs
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
Chordless Cycle Packing Is Fixed-Parameter Tractable
The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
A bound on the dissociation number
Approximating bounded degree deletion via matroid matching
The weighted \(k\)-path vertex cover problem on series-parallel graphs
Parameterized complexity of deletion to scattered graph classes
Vertex deletion problems on chordal graphs
Acyclic matchings in subclasses of bipartite graphs
The maximum number of maximum generalized 4-independent sets in trees
Approximating partially bounded degree deletion on directed graphs
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

This page was built for publication: Node-Deletion Problems on Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921261)