activity
19982017
most citedAnalysis of Farthest Point Sampling for Approximating Geodesics in a Graph

40 citations · 158 across the 13 of their papers we have counts for

collaborators

14 papers

cs.CG2017

On the Edge-length Ratio of Outerplanar Graphs

Sylvain Lazard, William Lenhart, Giuseppe Liotta

We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tigh…

cs.CG2016

Monotone Simultaneous Embeddings of Paths in R^d

David Bremner, Olivier Devillers, Marc Glisse +5

We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is mono…

cs.CG2014

Improved algorithm for computing separating linear forms for bivariate systems

Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz +2

We address the problem of computing a linear separating form of a system of two bivariate polynomials with integer coefficients, that is a linear combination of the variables that…

cs.CG2013★ 40 cited

Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph

Pegah Kamousi, Sylvain Lazard, Anil Maheshwari +1

A standard way to approximate the distance between any two vertices and on a mesh is to compute, in the associated graph, a shortest path from to that goes through…

cs.SC2013

Rational Univariate Representations of Bivariate Systems and Applications

Yacine Bouzidi, Sylvain Lazard, Marc Pouget +1

We address the problem of solving systems of two bivariate polynomials of total degree at most with integer coefficients of maximum bitsize . It is known that a linear separ…

cs.SC2013

Separating linear forms for bivariate systems

Yacine Bouzidi, Sylvain Lazard, Marc Pouget +1

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that ta…