Pages that link to "Item:Q1073049"

The following pages link to The complexity of generalized clique packing (Q1073049):

Displaying 22 items.

• Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
• Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
• On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
• Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
• Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
• The complexity of generalized clique covering (Q1262127) (← links)
• Edge-disjoint packings of graphs (Q1326750) (← links)
• The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
• An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
• Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
• (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
• Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
• On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
• Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) (← links)
• Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
• Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
• Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
• Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
• Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)