The following pages link to (Q5365106):
Displaying 19 items.
- The clique problem in ray intersection graphs (Q377488) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- (Q5088986) (← links)
- (Q5116474) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Many disjoint edges in topological graphs (Q5890932) (← links)
- Disjoint edges in complete topological graphs (Q5917904) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Many disjoint edges in topological graphs (Q5919826) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\) (Q6658088) (← links)
