Independent and hitting sets of rectangles intersecting a diagonal line

DOI10.1007/978-3-642-54423-1_4MaRDI QIDQ5405026zbMATH OpenOpenAlexFDO

Authors José R. Correa, Laurent Feuilloley, José A. Soto

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
• A note on maximum independent sets in rectangle intersection graphs
• Independent sets and hitting sets of bicolored rectangular families
• Covering, hitting, piercing and packing rectangles intersecting an inclined line
• Maximum independent set of rectangles

Cited in

(10)

• On Wegner's inequality for axis-parallel rectangles
• Maximum independent set of rectangles
• Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
• A note on maximum independent sets in rectangle intersection graphs
• Grid intersection graphs and order dimension
• Independent sets and hitting sets of bicolored rectangular families
• Hitting and Piercing Rectangles Induced by a Point Set
• On the stab number of rectangle intersection graphs
• Max point-tolerance graphs
• Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve

This page was built for publication: Independent and hitting sets of rectangles intersecting a diagonal line

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