Sylvain Laubé < Sylvain Lazard < Sylvain Lefebvre

Facettes : AffPays.f AffRegion.f AffOrg.f Author.f

List of bibliographic references

Number of relevant bibliographic references: 107.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000016 (2010)	Eric Berberich [Allemagne] ; Michael Hemmer [Allemagne] ; Sylvain Lazard [France] ; Luis Pe Aranda [France] ; Monique Teillaud [France]	Algebraic kernel
000084 (2008-03-18)	Sylvain Lazard [France] ; Luis Pe Aranda [France] ; Elias P. Tsigaridas [France]	A CGAL-based Univariate Algebraic Kernel and Application to Arrangements
000365 (2002)	Thérèse Biedl [Canada] ; Erik Demaine [Canada] ; Martin Demaine [Canada] ; Sylvain Lazard [France] ; Anna Lubiw [Canada] ; Joseph O'Rourke [Canada] ; Steve Robbins [Canada] ; Ileana Streinu [Canada] ; Godfried Toussaint [Canada] ; Sue Whitesides [Canada]	A Note on Reconfiguring Tree Linkages: Trees can Lock
000503 (2010)	Sylvain Lazard [France] ; Christophe Weibel [Canada] ; Sue Whitesides [Canada] ; Linqiao Zhang [Canada]	A Succinct 3D Visibility Skeleton
000823 (2003)	Jean-Daniel Boissonnat [France] ; Sylvain Lazard [France]	A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
000C97 (2005-08-09)	Hazel Everett [France] ; Sylvain Lazard [France] ; Sylvain Petitjean [France] ; Linqiao Zhang [France]	An Experimental Assessment of the 2D Visibility Complex
000D46 (2008)	Marc Glisse [France] ; Sylvain Lazard [France]	An Upper Bound on the Average Size of Silhouettes
000D58 (2002)	Jean-Daniel Boissonnat [France] ; Subir Kumar Ghosh [Canada] ; Telikepalli Kavitha [Canada] ; Sylvain Lazard [France]	An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
000E45 (2013-11)	Pegah Kamousi [Belgique] ; Sylvain Lazard [France] ; Anil Maheshwari [Canada] ; Stefanie Wuhrer [Allemagne]	Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
000E46 (2016)	Pegah Kamousi [Belgique] ; Sylvain Lazard [France] ; Anil Maheshwari [Canada] ; Stefanie Wuhrer [France]	Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
001237 (2007-06-06)	Julien Demouth [France] ; Olivier Devillers [France] ; Hazel Everett [France] ; Marc Glisse [France] ; Sylvain Lazard [France] ; Raimund Seidel [Allemagne]	Between umbra and penumbra
001273 (2015-09-17)	Sylvain Lazard [France] ; Marc Pouget [France] ; Fabrice Rouillier [France]	Bivariate Triangular Decompositions in the Presence of Asymptotes
001291 (2013)	Xavier Goaoc [France] ; Hyo-Sil Kim [Corée du Sud] ; Sylvain Lazard [France]	Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization
001292 (2010)	Xavier Goaoc [France] ; Hyo-Sil Kim [Corée du Sud] ; Sylvain Lazard [France]	Bounded-Curvature Shortest Paths through a Sequence of Points
001428 (2000)	Abhishek Pandey [France] ; Bernard Mourrain [France] ; Sylvain Lazard [France]	Certificated and Efficient Solver for Intersection of three quadric surfaces
001624 (2006)	Ciprian Borcea [États-Unis] ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Sylvain Petitjean [France]	Common Tangents to Spheres in $R3$
001625 (2004)	Ciprian Borcea ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Sylvain Petitjean [France]	Common Tangents to Spheres in R^3
001934 (1999-12-16)	Therese C. Biedl [Canada] ; Erik D. Demaine [Canada] ; Sylvain Lazard [France] ; Steven M. Robbins [Canada] ; Michael A. Soss [Canada]	Convexifying Monotone Polygons
001935 (1998)	Hazel Everett [France] ; Sylvain Lazard [France] ; Steve Robbins [Canada] ; H. Schröder [Royaume-Uni] ; Sue Whitesides [Canada]	Convexifying Star-Shaped Polygons
001A10 (1998-06)	Pankaj K. Agarwal [États-Unis] ; Thérèse Biedl [Canada] ; Sylvain Lazard [France] ; Steve Robbins [Canada] ; Subhash Suri [États-Unis] ; Sue Whitesides [Canada]	Curvature-Constrained Shortest Paths in a Convex Polygon
001A11 (2000)	Pankaj K. Agarwal [États-Unis] ; Thérèse Biedl [Canada] ; Sylvain Lazard [France] ; Steve Robbins [Canada] ; Subhash Suri [États-Unis] ; Sue Whitesides [Canada]	Curvature-Constrained Shortest Paths in a Convex Polygon

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Curation/Author.i -k "Sylvain Lazard" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Hal/Curation/Author.i  \
                -Sk "Sylvain Lazard" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Curation
   |type=    indexItem
   |index=    Author.i
   |clé=    Sylvain Lazard
}}

---

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022