The following publications are possibly variants of this publication:
- Independent Sets of Maximum Weight in Apple-Free GraphsAndreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. isaac 2008: 848-858 [doi]
- Graphs Without Large Apples and the Maximum Weight Independent Set ProblemVadim V. Lozin, Martin Milanic, Christopher Purcell. gc, 30(2):395-410, 2014. [doi]
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graphVadim V. Lozin, Martin Milanic. jda, 6(4):595-604, 2008. [doi]
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graphVadim V. Lozin, Martin Milanic. soda 2006: 26-30 [doi]
- Maximum weight independent set for ℓclaw-free graphs in polynomial timeAndreas Brandstädt, Raffaele Mosca. DAM, 237:57-64, 2018. [doi]
- Maximum Weight Independent Sets in hole- and co-chair-free graphsAndreas Brandstädt, Vassilis Giakoumakis. ipl, 112(3):67-71, 2012. [doi]
- Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial timeAndreas Brandstädt, Raffaele Mosca. DAM, 236:57-65, 2018. [doi]
- Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphsAndreas Brandstädt, Vassilis Giakoumakis. ipl, 115(2):345-350, 2015. [doi]