The following pages link to Diogo V. Andrade (Q519099):
Displaying 6 items.
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- (Q2017042) (redirect page) (← links)
- Combinatorial games modeling seki in Go (Q2017043) (← links)
- On graphs whose maximal cliques and stable sets intersect (Q2315571) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
