Pages that link to "Item:Q1029038"

The following pages link to A note on maximum independent sets in rectangle intersection graphs (Q1029038):

Displaying 14 items.

• Approximation algorithms for free-label maximization (Q419365) (← links)
• Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
• Matching colored points with rectangles (Q511687) (← links)
• Minimum vertex cover in rectangle graphs (Q551504) (← links)
• On the stab number of rectangle intersection graphs (Q778517) (← links)
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
• Stochastic makespan minimization in structured set systems (Q2118147) (← links)
• Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
• Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
• Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
• DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION (Q3401890) (← links)
• Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
• Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) (Q5041742) (← links)
• Keep your distance: land division with separation (Q6114476) (← links)