Similar Items: Completely Independent Steiner Trees
- Tree-independence number of $P_5$-free graphs with no large bicliques
- Local Homophily on Bicolored Graphs is $mathbf{P}$-complete
- Burning Graph Powers and Branching Trees
- Polynomial Kernels for Spanning Tree with Diversity Requirements
- Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
- Flow Shop Scheduling with Stochastic Reentry