Independent set of intersection graphs of convex objects in 2D
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1947059 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A note on maximum independent sets in rectangle intersection graphs
- Algorithmic graph theory and perfect graphs
- Approximating maximum independent sets by excluding subgraphs
- Approximation algorithms for NP-complete problems on planar graphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Cutting glass
- Decomposable searching problems I. Static-to-dynamic transformation
- Efficient approximation algorithms for tiling and packing problems with rectangles
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Intersection graphs of segments
- Label placement by maximum independent set in rectangles
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On computing the length of longest increasing subsequences
- On rectangle intersection and overlap graphs
- Optimization, approximation, and complexity classes
- Polynomial-time approximation schemes for geometric graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Some geometric applications of Dilworth's theorem
Cited in
(36)- The clique problem in ray intersection graphs
- Computing maximum independent set on outerstring graphs and their relatives
- Optimality of geometric local search
- Stochastic makespan minimization in structured set systems (extended abstract)
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- A tight analysis of geometric local search
- Stochastic makespan minimization in structured set systems
- On the chromatic number of disjointness graphs of curves
- White space regions
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- scientific article; zbMATH DE number 7559254 (Why is no real title available?)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Improved results on geometric hitting set problems
- A note on maximum independent sets in rectangle intersection graphs
- Geometric hitting sets for disks: theory and practice
- Computing the independence number of intersection graphs
- A bipartite analogue of Dilworth's theorem for multiple partial orders
- A survey on variant domination problems in geometric intersection graphs
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- Maximum independent set in 2-direction outersegment graphs
- Optimal space coverage with white convex polygons
- Simple PTAS's for families of graphs excluding a minor
- Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs
- Practical and efficient algorithms for the geometric hitting set problem
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Limits of local search: quality and efficiency
- On the size of outer-string representations
- On streaming algorithms for geometric independent set and clique
- Approximation algorithms for maximum independent set of pseudo-disks
- Matching colored points with rectangles
- Algorithm Theory - SWAT 2004
- Packing and covering with balls on Busemann surfaces
- Packing and covering with non-piercing regions
This page was built for publication: Independent set of intersection graphs of convex objects in 2D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489017)
