From Spider Robots to Half Disk Robots. - Jean-Daniel Boissonnat; Olivier Devillers; Sylvain Lazard (ICRA, 1994)

Convex Hulls of Bounded Curvature. - Jean-Daniel Boissonnat; Sylvain Lazard (CCCG, 1996)

A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). - Jean-Daniel Boissonnat; Sylvain Lazard (SCG, 1996)

Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes. (Motion planning of non-holonomic mobile robots and legged robots). - Sylvain Lazard (1996)

On reconfiguring tree linkages: Trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (CCCG, 1998)

Convexifying star-shaped polygons. - Hazel Everett; Sylvain Lazard; Steven M. Robbins; H. Schröder; Sue Whitesides (CCCG, 1998)

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). - Pankaj K. Agarwal; Therese Biedl; Sylvain Lazard; Steve Robbins; Subhash Suri; Sue Whitesides (SCG, 1998)

Convexifying Monotone Polygons. - Therese C. Biedl; Erik D. Demaine; Sylvain Lazard; Steven M. Robbins; Michael A. Soss (ISAAC, 1999)

Locked and Unlocked Polygonal Chains in 3D. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Mark H. Overmars; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (SODA, 1999)

Motion Planning of Legged Robots. - Jean-Daniel Boissonnat; Olivier Devillers; Sylvain Lazard (SIAM J. Comput., 2000)

Locked and Unlocked Polygonal Chains in Three Dimensions. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Mark H. Overmars; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Comput. Geom., 2001)

The virtual mesh: a geometric abstraction for efficiently computing radiosity. - Laurent Alonso; François Cuny; Sylvain Petitjean; Jean-Claude Paul; Sylvain Lazard; Eric Wies (ACM Trans. Graph., 2001)

On the number of lines tangent to four convex polyhedra. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (CCCG, 2002)

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. - Jean-Daniel Boissonnat; Subir Kumar Ghosh; Telikepalli Kavitha; Sylvain Lazard (Algorithmica, 2002)

A note on reconfiguring tree linkages: trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Appl. Math., 2002)

Curvature-Constrained Shortest Paths in a Convex Polygon. - Pankaj K. Agarwal; Therese Biedl; Sylvain Lazard; Steve Robbins; Subhash Suri; Sue Whitesides (SIAM J. Comput., 2002)

Transversals to line segments in R3. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CCCG, 2003)

Near-optimal parameterization of the intersection of quadrics. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (SCG, 2003)

The number of transversals to line segments in R^3 - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CoRR, 2003)

A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. - Jean-Daniel Boissonnat; Sylvain Lazard (Int. J. Comput. Geom. Appl., 2003)

The Expected Number of 3D Visibility Events Is Linear. - Olivier Devillers; Vida Dujmovic; Hazel Everett; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sylvain Petitjean (SIAM J. Comput., 2003)

On the number of line tangents to four triangles in three-dimensional space. - Hervé Brönnimann; Olivier Devillers; Sylvain Lazard; Frank Sottile (CCCG, 2004)

The number of lines tangent to arbitrary convex polyhedra in 3D. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (SCG, 2004)

An Experimental Assessment of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (CCCG, 2005)

Drawing Kn in Three Dimensions with One Bend Per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (GD, 2005)

Transversals to Line Segments in Three-Dimensional Space. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (Discret. Comput. Geom., 2005)

Throwing Stones Inside Simple Polygons . - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (AAIM, 2006)

Predicates for Line Transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Jeremy Redburn; Linqiao Zhang (CCCG, 2006)

Intersecting quadrics: an efficient and exact implementation. - Sylvain Lazard; Luis Mariano Peñaranda; Sylvain Petitjean (Comput. Geom., 2006)

Common Tangents to Spheres in R3. - Ciprian Borcea; Xavier Goaoc; Sylvain Lazard; Sylvain Petitjean (Discret. Comput. Geom., 2006)

Drawing Kn in Three Dimensions with One Bend per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (J. Graph Algorithms Appl., 2006)

Problèmes de Géométrie Algorithmique sur les Droites et les Quadriques en Trois Dimensions. (Non-Linear Computational Geometry for Lines and Quadrics in Three Dimensions). - Sylvain Lazard (2007)

Between umbra and penumbra. - Julien Demouth; Olivier Devillers; Hazel Everett; Marc Glisse; Sylvain Lazard; Raimund Seidel (SCG, 2007)

Towards an implementation of the 3D visibility skeleton. - Linqiao Zhang; Hazel Everett; Sylvain Lazard; Sue Whitesides (SCG, 2007)

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (GD, 2007)

Lines Tangent to Four Triangles in Three-Dimensional Space. - Hervé Brönnimann; Olivier Devillers; Sylvain Lazard; Frank Sottile (Discret. Comput. Geom., 2007)

Parabola Separation Queries and their Application to Stone Throwing. - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (Int. J. Comput. Geom. Appl., 2007)

On the Expected Size of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (Int. J. Comput. Geom. Appl., 2007)

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (SIAM J. Comput., 2007)

Walking your dog in the woods in polynomial time. - Erin W. Chambers; Éric Colin de Verdière; Jeff Erickson 001; Sylvain Lazard; Francis Lazarus; Shripad Thite (SCG, 2008)

Predicates for line transversals to lines and line segments in three-dimensional space. - Olivier Devillers; Marc Glisse; Sylvain Lazard (SCG, 2008)

On the Size of the 3D Visibility Skeleton: Experimental Results. - Linqiao Zhang; Hazel Everett; Sylvain Lazard; Christophe Weibel; Sue Whitesides (ESA, 2008)

An Upper Bound on the Average Size of Silhouettes. - Marc Glisse; Sylvain Lazard (Discret. Comput. Geom., 2008)

Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. - Laurent Dupont 004; Daniel Lazard; Sylvain Lazard; Sylvain Petitjean (J. Symb. Comput., 2008)

On the topology of planar algebraic curves. - Jin-San Cheng; Sylvain Lazard; Luis Mariano Peñaranda; Marc Pouget; Fabrice Rouillier; Elias P. Tsigaridas (SCG, 2009)

Univariate Algebraic Kernel and Application to Arrangements. - Sylvain Lazard; Luis Mariano Peñaranda; Elias P. Tsigaridas (SEA, 2009)

On the complexity of umbra and penumbra. - Julien Demouth; Olivier Devillers; Hazel Everett; Marc Glisse; Sylvain Lazard; Raimund Seidel (Comput. Geom., 2009)

On the degree of standard geometric predicates for line transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Linqiao Zhang (Comput. Geom., 2009)

The Voronoi Diagram of Three Lines. - Hazel Everett; Daniel Lazard; Sylvain Lazard; Mohab Safey El Din (Discret. Comput. Geom., 2009)

On the Computation of 3D Visibility Skeletons. - Sylvain Lazard; Christophe Weibel; Sue Whitesides; Linqiao Zhang (COCOON, 2010)

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. - Erin W. Chambers; Éric Colin de Verdière; Jeff Erickson 001; Sylvain Lazard; Francis Lazarus; Shripad Thite (Comput. Geom., 2010)

Editorial. - Sylvain Lazard (Comput. Geom., 2010)

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (Discret. Comput. Geom., 2010)

A Succinct 3D Visibility Skeleton. - Sylvain Lazard; Christophe Weibel; Sue Whitesides; Linqiao Zhang (Discret. Math. Algorithms Appl., 2010)

On the Topology of Real Algebraic Plane Curves. - Jin-San Cheng; Sylvain Lazard; Luis Mariano Peñaranda; Marc Pouget; Fabrice Rouillier; Elias P. Tsigaridas (Math. Comput. Sci., 2010)

Foreword. - Laureano González-Vega; Sylvain Lazard (Math. Comput. Sci., 2010)

Farthest-polygon Voronoi diagrams. - Otfried Cheong; Hazel Everett; Marc Glisse; Joachim Gudmundsson; Samuel Hornus; Sylvain Lazard; Mira Lee; Hyeon-Suk Na (Comput. Geom., 2011)

On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. - Marc Glisse; Sylvain Lazard (Discret. Comput. Geom., 2012)

Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (CCCG, 2013)

Rational univariate representations of bivariate systems and applications. - Yacine Bouzidi; Sylvain Lazard; Marc Pouget; Fabrice Rouillier (ISSAC, 2013)

Separating linear forms for bivariate systems. - Yacine Bouzidi; Sylvain Lazard; Marc Pouget; Fabrice Rouillier (ISSAC, 2013)

On point-sets that support planar graphs. - Vida Dujmovic; William S. Evans; Sylvain Lazard; William J. Lenhart; Giuseppe Liotta; David Rappaport; Stephen K. Wismath (Comput. Geom., 2013)

Solving bivariate systems: Efficient worst-case algorithm for computing Rational Univariate Representations and applications - Yacine Bouzidi; Sylvain Lazard; Marc Pouget; Fabrice Rouillier (CoRR, 2013)

Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization. - Xavier Goaoc; Hyo-Sil Kim; Sylvain Lazard (SIAM J. Comput., 2013)

Improved algorithm for computing separating linear forms for bivariate systems. - Yacine Bouzidi; Sylvain Lazard; Guillaume Moroz; Marc Pouget; Fabrice Rouillier (ISSAC, 2014)

Universal Point Sets for Drawing Planar Graphs with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Separating linear forms and Rational Univariate Representations of bivariate systems. - Yacine Bouzidi; Sylvain Lazard; Marc Pouget; Fabrice Rouillier (J. Symb. Comput., 2015)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

Analysis of farthest point sampling for approximating geodesics in a graph. - Pegah Kamousi; Sylvain Lazard; Anil Maheshwari; Stefanie Wuhrer (Comput. Geom., 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

Solving bivariate systems using Rational Univariate Representations. - Yacine Bouzidi; Sylvain Lazard; Guillaume Moroz; Marc Pouget; Fabrice Rouillier; Michael Sagraloff (J. Complex., 2016)

Recognizing shrinkable complexes is NP-complete. - Dominique Attali; Olivier Devillers; Marc Glisse; Sylvain Lazard (J. Comput. Geom., 2016)

Silhouette of a random polytope. - Marc Glisse; Sylvain Lazard; Julien Michel; Marc Pouget (J. Comput. Geom., 2016)

Bivariate triangular decompositions in the presence of asymptotes. - Sylvain Lazard; Marc Pouget; Fabrice Rouillier (J. Symb. Comput., 2017)

3D Snap Rounding. - Olivier Devillers; Sylvain Lazard; William J. Lenhart (SoCG, 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

On the edge-length ratio of outerplanar graphs. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2019)

Rounding Meshes in 3D. - Olivier Devillers; Sylvain Lazard; William J. Lenhart (Discret. Comput. Geom., 2020)

Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2020)

Variable-width contouring for additive manufacturing. - Samuel Hornus; Tim Kuipers; Olivier Devillers; Monique Teillaud; Jonàs Martínez; Marc Glisse; Sylvain Lazard; Sylvain Lefebvre 001 (ACM Trans. Graph., 2020)

Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves. - George Krait; Sylvain Lazard; Guillaume Moroz; Marc Pouget (J. Comput. Appl. Math., 2021)