scientific article; zbMATH DE number 3513839

Cited in

(50)

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Decomposition by clique separators
Packing and covering a tree by subtrees
Maximal chordal subgraphs
A decomposition strategy for the vertex cover problem
Independent domination in chordal graphs
New clique and independent set algorithms for circle graphs
On a class of balanced hypergraphs
Induced matchings
The struction algorithm for the maximum stable set problem revisited
Maximum independent set and maximum clique algorithms for overlap graphs
An algorithm for source location in directed graphs
Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
On the -interval and the -convexity numbers of graphs and graph products
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
The path partition problem and related problems in bipartite graphs
Perspectives on \(A\)-homotopy theory and its applications
Structure of squares and efficient domination in graph classes
A sufficient condition to extend polynomial results for the maximum independent set problem
On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
Approximation algorithms for intersection graphs
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Treewidth versus clique number. I: Graph classes with a forbidden structure
Computing maximum independent set on outerstring graphs and their relatives
Incremental optimization of independent sets under the reconfiguration framework
On efficient domination for some classes of \(H\)-free chordal graphs
On efficient domination for some classes of \(H\)-free chordal graphs
Stackelberg packing games
A polytime preprocess algorithm for the maximum independent set problem
Bisimplicial separators
New partitioning techniques and faster algorithms for approximate interval scheduling
Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
On P₅-free locally split graphs
Generating subgraphs in chordal graphs
Intervention efficient algorithms for approximate learning of causal graphs
Maximum weight independent sets in hole- and dart-free graphs
On distance-3 matchings and induced matchings
Title not available (Why is no real title available?)
Graphs without large apples and the maximum weight independent set problem
Grundy dominating sequences on X-join product
Packing \(r\)-cliques in weighted chordal graphs
On algorithms for (P₅, gem)-free graphs
Weighted efficient domination in two subclasses of P₆-free graphs
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
Some remarks on \(\lambda _{p,q}\)-connectedness

This page was built for publication:

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