Muriel Dulieu

According to our database1, Muriel Dulieu authored at least 16 papers between 2009 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Minimal forcing sets for 1D origami.
CoRR, 2017

2014
Mutual witness proximity graphs.
Inf. Process. Lett., 2014

Witness Rectangle Graphs.
Graphs and Combinatorics, 2014

2013
Witness Gabriel graphs.
Comput. Geom., 2013

How to cover a point set with a V-shape of minimum width.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

On the Union Complexity of Diametral Disks.
Electr. J. Comb., 2013

2011
How to Cover a Point Set with a V-Shape of Minimum Width
CoRR, 2011

Witness Rectangle Graphs
CoRR, 2011

Witness (Delaunay) graphs.
Comput. Geom., 2011

Witness Rectangle Graphs.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

How to Cover a Point Set with a V-Shape of Minimum Width.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010
Witness (Delaunay) Graphs
CoRR, 2010

Witness Gabriel Graphs
CoRR, 2010


2009
Packing 2×2 unit squares into grid polygons is NP-complete.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009


  Loading...