1. Three open problems on arrangements of DP-ribbons
    In Dušan Knop (editor) Midsummer Combinatorial Workshop 2013 (MCW2013), pages 49-51, prepublication 614, UUK-CE-ITI series 2014, Mai 2014, Prague.
  2. LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies (written with L. Habert)
    Discrete Comput. Geom., 50 (3): 552-648, 2013. 10.1007/s00454-013-9532-y - arXiv -
    Preliminary version in Proc. 25th Annu. ACM Sympos. Comput. Geom., pages 314-323, June 2009, Aahrus, Denmark. 10.1145/1542362.1542417
    Preliminary version in Proc. 22th European Workshop on Comput. Geom., pages 211-214, March 2006, Delphi, Greece. pdf - 22th EuroCG, 2006
    Poster version at the Workshop on Geometric and Topological Combinatorics (satellite conference of ICM 2006), September 2006, Alcalá de Henares, Spain.
    slides of my talk at the Conference on Geometric Graph Theory, Lausanne, September 2010
    slides of my talk at the aussois Conference on Combinatorial Optimization, aussois, Janvier 2010
    slides of my talk at the DocCourse, CRM Barcelone, 23 January 2009
    slides of my talk at the Geometry Seminar of the Courant Institute of Mathematical Sciences, New York University, 28 October 2008
  3. Computing pseudotriangulations via branched coverings (written with L. Habert)
    Discrete Comput. Geom., 48 (3): 518-579, 2012. 10.1007/s00454-012-9447-z - arXiv
    Preliminary version in abstracts 20th European Workshop on Comput. Geom. , pages 111-114, March 2004, Seville, Spain. 20th EuroCG, 2004
  4. Multitriangulations, pseudotriangulations and primitive sorting networks (written with V. Pilaud )
    Discrete Comput. Geom., 48 (1): 142-191, 2012. doi - arXiv
    Preliminary version in 25th European Workshop on Comput. Geom. , 4 pages, March 2009, Brussels, Belgium. pdf - 25th EuroCG, 2009
    slides of my talk at the Midsummer Combinatorial Workshop XVI, Prague, July 2010
    slides of my talk at the Congreso de la Real Sociedad Matematica Española, Sesiones especiales, Herramientas algoritmicas y combinatorias en Geometria Algebraica y aplicaciones, February 2009
  5. On a generalization of the greedy flip property for greedy pseudotriangulations
    In Martin Tancer (editor) Midsummer Combinatorial Workshop 2010 (MCW2010), pages 35-40, prepublication 995, KAM-DIMATIA Series, March 2011, Prague.
  6. On the number of simple arrangements of five double pseudolines (written with J. Ferté and V. Pilaud )
    Discrete Comput. Geom., 45 (2): 279-302, 2011 (special issue on Transversal and Helly-type Theorems in Geometry, Combinatorics and Topology). doi - arXiv
    Preliminary version in Jiri Fink (editor) Midsummer Combinatorial Workshop 2009 (MCW2009), prepublication 959, KAM-DIMATIA Series, March 2010, Prague.
    Abbreviated partial version in abstracts 18th Fall Workshop on Comput. Geom. (FWCG2008), 4 pages, October 2008, Troy, NY. pdf
  7. Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm
    (written with H. Brönnimann, L. Kettner, and J. Snoeyink).
    SIAM J. Comput., 36(3):721-739, 2006. doi
    Abbreviated version in Proc. 7th Workshop on Algorithm Engeneering and Experiments (ALENEX05) , pp. 98-110, 2005, SIAM, Vancouver, Canada.
  8. A sum of squares theorem for visibility complexes and applications (written with P. Angelier).
    In B. Aronov, S. Basu, J. Pach, and M. Sharir, editors, Discrete and Computational Geometry-The Goodman-Pollack Festschrift , Algorithms and Combinatorics, volume 25, pages 77-137. Springer-Verlag, June 2003. doi
    Abbreviated version in Proc. 17th Annu. ACM Sympos. Comput. Geom. , pages 302-311, June 2001. doi
  9. Tutte's barycenter method applied to isotopies (written with E. Colin de Verdière and G. Vegter).
    Comput. Geom. Theory Appl., 26(1):81-97, August 2003. doi
    Abbreviated version in Proc. 13th Canadian Conf. Comput. Geom. , August, 2001.
  10. Computing a canonical polygonal schema of an orientable triangulated surface (written with F. Lazarus, G. Vegter and A. Verroust).
    In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 80-89, June 2001. doi
  11. The apolar bilinear form in CAGD: new applications (written with G. Vegter).
    In: P.-J. Laurent, P. Sablonnière and L.L. Schumaker (eds.) Curve and Surface Design, pag. 325-334. Vanderbilt University Press, Nashville, TN, 2000. (Proceedings Curves and Surfaces, Saint-Malo, France, 1999.)
  12. On polygonal covers (written with G. Vegter).
    Contemporary Mathematics, vol. 223, pages 257-268 AMS, 1999. abstract doi
    Abbreviated version in Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 291-300, May 1996 doi
  13. Horizon trees versus pseudo-triangulations.
    In European Workshop on Comput. Geom., March 1997.
  14. Topologically sweeping visibility complexes via pseudotriangulations (written with G. Vegter).
    Discrete Comput. Geom., 16(4):419-453, December 1996. (Special issue devoted to ACM-SoCG'95.) doi
    Abbreviated version in Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 248-257, June 1995, Vancouver, Canada. doi
  15. Minimal tangent visibility graphs (written with G. Vegter).
    Comput. Geom. Theory Appl., 6(5):303-314, September 1996. (Special issue devoted to CCCG'94.) doi
    Abbreviated version in Proc. 6th Canadian Conf. Comput. Geom, pages 24-29, 1994, Saskatoon (Paris des prairies), Canada.
  16. The visibility complex (written with G. Vegter).
    Internat. J. Comput. Geom. Appl., 6(3):279-308, September 1996. (Special issue devoted to ACM-SoCG'93.) doi
    Abbreviated version in Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 328-337, May 1993, Berkeley, USA. doi
  17. Pseudo-triangulations: Theory and applications (written with G. Vegter).
    In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 291-300, May 1996. doi
  18. Random generation of finite Sturmian words (written with J. Berstel).
    Discrete Mathematics, 153:29-39, 1996. doi
  19. Counting problems relating to a Dirichlet's theorem (written with E. Kranakis).
    Comput. Geom. Theory Appl., 4(6):309-325, December 1994. doi
    Abbreviated version in Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 261-270, June 1990 doi
  20. Average cost of Duval's algorithm for generating Lyndon words (written with J. Berstel).
    Theo. Comp. Science A, 132:415-425, September 1994. doi
  21. Camera placement in integer lattices (written with E. Kranakis).
    Discrete Comput. Geom., 12(1):91-104, July 1994. doi
    Abbreviated version in Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 261-270, June 1990 doi
  22. Order types and visibility types of configurations of disjoint convex plane sets (written with G. Vegter)
    Rapport de Recherche du Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris, TR LIENS-94-4, January 1994.
  23. Géométrie algorithmique (written with J. Berstel).
    Le courrier du cnrs, dossiers scientifiques, 80:58-59, Février 1993.
  24. A geometric proof of the enumeration formula for sturmian words (written with J. Berstel).
    Internat. J. Algeb. Comput., 3(3):349-355, 1993. doi
  25. A brief survey of art gallery problems in integer lattice systems (written with E. Kranakis).
    CWI Quaterly, 4(4):269-282, December 1991
  26. Trois thèmes sur la visibilité : enumération, optimization et graphique 2D.
    Ph.D thesis, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris, October 1990.
  27. Graphics in Flatland revisited.
    In: Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, pp. 85-96. - Springer Verlag, Juillet 1990. doi
  28. Mathématiques et informatique. Problèmes résolus 1. algèbre (written with J. Berstel and J.E. Pin).
    Mc Graw-Hill, 1991. 245 pages.
  29. Mathématiques et informatique. Problèmes résolus 2. combinatoire et arithmétique (written with J. Berstel and J.E. Pin).
    Mc Graw-Hill, 1991. 257 pages.