The following pages link to (Q5403013):
Displaying 8 items.
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks (Q896118) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)