Packing 2×2 unit squares into grid polygons is NP-complete. - Dania El-Khechen; Muriel Dulieu; John Iacono; Nikolaj van Omme (CCCG, 2009)

Matching Points with Things. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (LATIN, 2010)

Witness (Delaunay) graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2011)

On the Union Complexity of Diametral Disks. - Boris Aronov; Muriel Dulieu; Rom Pinchasi; Micha Sharir (Electron. J. Comb., 2013)

Non-crossing matchings of points with geometric objects. - Greg Aloupis; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Muriel Dulieu; Ruy Fabila Monroy; Vi Hart; Ferran Hurtado; Stefan Langerman; Maria Saumell; Carlos Seara; et al. (Comput. Geom., 2013)

How to cover a point set with a V-shape of minimum width. - Boris Aronov; Muriel Dulieu (Comput. Geom., 2013)

Witness Gabriel graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2013)

Witness Rectangle Graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Graphs Comb., 2014)

Mutual witness proximity graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Inf. Process. Lett., 2014)

Minimal forcing sets for 1D origami. - Mirela Damian; Erik D. Demaine; Muriel Dulieu; Robin Y. Flatland; Hella Hoffman; Thomas C. Hull; Jayson Lynch; Suneeta Ramaswami (CoRR, 2017)