The following pages link to (Q5875545):
Displaying 13 items.
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- On the bond polytope (Q6060889) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)
