Computing the independence number of intersection graphs
From MaRDI portal
Recommendations
Cited in
(26)- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- Independent set of intersection graphs of convex objects in 2D
- Maximum independent set on \(B_1\)-VPG graphs
- The clique problem in ray intersection graphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Geometric Packing under Nonuniform Constraints
- On approximating MIS over B1-VPG graphs*
- On the chromatic number of disjointness graphs of curves
- On the size of outer-string representations
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- Many disjoint edges in topological graphs
- Disjoint edges in complete topological graphs
- Computing maximum independent set on outerstring graphs and their relatives
- Many disjoint edges in topological graphs
- Optimality program in segment and string graphs
- On streaming algorithms for geometric independent set and clique
- A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
- An algorithm for the maximum weight independent set problem on outerstring graphs
- Recognition and proper coloring of unit segment intersection graphs
- A 1.9999-approximation algorithm for vertex cover on string graphs
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Some combinatorial algorithms on the independent number of k-regular connected hypergraphs
- Parameterized complexity of path set packing
- Random-order online independent set of intervals and hyperrectangles
- On the chromatic number of disjointness graphs of curves
This page was built for publication: Computing the independence number of intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365106)
