The following pages link to Martin Wahlen (Q835019):
Displaying 11 items.
- A note on maximum independent set and related problems on box graphs (Q835020) (← links)
- (Q1006086) (redirect page) (← links)
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs (Q3082912) (← links)
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Q3540236) (← links)
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (Q3587397) (← links)
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (Q4962155) (← links)
- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) (Q5385937) (← links)
- On Exact Complexity of Subgraph Homeomorphism (Q5425438) (← links)
