1

Approximability of (Simultaneous) Class Cover for Boxes
Bereg et al. (2012) introduced the Boxes Class Cover problem, which has its roots in classification and clustering applications: Given …
Jean Cardinal, Justin Dallant, John Iacono
PDF Cite
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem
Hadwiger and Debrunner showed that for families of convex sets in Rd with the property that among any p of them some q have a common …
Justin Dallant, Patrick Schnider
PDF Cite
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility
Afshani, Barbay and Chan (2017) introduced the notion of instance-optimal algorithm in the order-oblivious setting. An algorithm A is …
Jean Cardinal, Justin Dallant, John Iacono
Cite DOI