Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

Cited In (52)

A novel approximation algorithm for max-covering circle problem
Approximation algorithms for finding maximum containing circle and sphere
A characterization of intersection graphs of the maximal rectangles of a polyomino
Computing coverage kernels under restricted settings
Fast stabbing of boxes in high dimensions
Parallel computational geometry of rectangles
Facility location problems in the plane based on reverse nearest neighbor queries
Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
Dynamic connectivity for axis-parallel rectangles
Complexity of maximum cut on interval graphs
Connected component and simple polygon intersection searching
Title not available (Why is that?)
Computing a maximum clique in geometric superclasses of disk graphs
Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
Label placement by maximum independent set in rectangles
The cubicity of hypercube graphs
On a circle placement problem
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Coloring and Maximum Independent Set of Rectangles
Near-linear time approximation schemes for geometric maximum coverage
A note on maximum independent sets in rectangle intersection graphs
Independent sets and hitting sets of bicolored rectangular families
Lower bounds for boxicity
Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
On Local Structures of Cubicity 2 Graphs
Many disjoint edges in topological graphs
In-place algorithms for computing a largest clique in geometric intersection graphs
On rectangle intersection graphs with stab number at most two
On the stab number of rectangle intersection graphs
Computing Weighted Strength and Applications to Partitioning
An upper bound for cubicity in terms of boxicity
Homothetic polygons and beyond: maximal cliques in intersection graphs
Interval graphs and related topics
Linear Time Approximation Schemes for Geometric Maximum Coverage
Cubicity of interval graphs and the claw number
Approximation algorithms for intersection graphs
The balanced connected subgraph problem for geometric intersection graphs
Space-efficient algorithms for reachability in directed geometric graphs
Connected component and simple polygon intersection searching
Max point-tolerance graphs
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
Co-bipartite neighborhood edge elimination orderings
On planar medianoid competitive location problems with Manhattan distance
DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION
Boxicity and treewidth
Disjoint edges in complete topological graphs
Matching colored points with rectangles
Many disjoint edges in topological graphs
Independent set of intersection graphs of convex objects in 2D
On the cubicity of certain graphs

This page was built for publication: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340176)