André Galligo

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 9

Top Topics

Symmetric Difference

Machine Learning Approaches

Minimal Surface

Top Venues

Comput. Aided Des.

J. Comput. Phys.

Publications

André Galligo, Didier Clamond
Certified Study of Internal Solitary Waves. CASC (2023)
André Galligo
Modeling complex root motion of real random polynomials under differentiation. CoRR (2022)
André Galligo
Modeling Complex Root Motion of Real Random Polynomials under Differentiation. ISSAC (2022)
Riccardo Dio, André Galligo, Angelos Mantzaflaris, Benjamin Mauroy
Spirometry-based airways disease simulation and recognition using Machine Learning approaches. CoRR (2021)
Riccardo Dio, André Galligo, Angelos Mantzaflaris, Benjamin Mauroy
Spirometry-Based Airways Disease Simulation and Recognition Using Machine Learning Approaches. LION (2021)
Laurent Busé, André Galligo
Extraction of tori from minimal point sets. Comput. Aided Geom. Des. 58 (2017)
Mohamed Elkadi, André Galligo
On mixed polynomials of bidegree (n, 1). Theor. Comput. Sci. 681 (2017)
Laurent Busé, André Galligo, Jiajun Zhang
Extraction of cylinders and cones from minimal point sets. Graph. Model. 86 (2016)
Laurent Busé, André Galligo, Jiajun Zhang
Extraction of cylinders and cones from minimal point sets. CoRR (2016)
Gang Xu, Yaguang Zhu, Guozhao Wang, André Galligo, Li Zhang, Kin-Chuen Hui
Explicit form of parametric polynomial minimal surfaces with arbitrary degree. Appl. Math. Comput. 259 (2015)
Didier Clamond, Denys Dutykh, André Galligo
Computer Algebra Applied to a Solitary Waves Study. ISSAC (2015)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Corrigendum to "Constructing analysis-suitable parameterization of computational domain from CAD boundary by variational harmonic method" [J. Comput. Phys. 252(2013) 275-289]. J. Comput. Phys. 272 (2014)
Mohamed Elkadi, André Galligo
Exploring univariate mixed polynomials. SNC (2014)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Constructing analysis-suitable parameterization of computational domain from CAD boundary by variational harmonic method. J. Comput. Phys. 252 (2013)
André Galligo
Budan tables of real univariate polynomials. J. Symb. Comput. 53 (2013)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Analysis-suitable volume parameterization of multi-block computational domain in isogeometric applications. Comput. Aided Des. 45 (2) (2013)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Optimal analysis-aware parameterization of computational domain in 3D isogeometric analysis. Comput. Aided Des. 45 (4) (2013)
André Galligo
Deformation of roots of polynomials via fractional derivatives. J. Symb. Comput. 52 (2013)
Maria Emilia Alonso Garcia, André Galligo
A root isolation algorithm for sparse univariate polynomials. ISSAC (2012)
André Galligo, Laurent Miclo
On the cut-off phenomenon for the transitivity of randomly generated subgroups. Random Struct. Algorithms 40 (2) (2012)
Mohamed Elkadi, André Galligo, Thang Luu Ba
Approximate GCD of several univariate polynomials with small degree perturbations. J. Symb. Comput. 47 (4) (2012)
Daniel Bembé, André Galligo
Virtual roots of a real polynomial and fractional derivatives. ISSAC (2011)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Variational Harmonic Method for Parameterization of Computational Domain in 2D Isogeometric Analysis. CAD/Graphics (2011)
Thien Nguyen, Bernard Mourrain, André Galligo, Gang Xu
A construction of injective parameterizations of domains for isogeometric applications. SNC (2011)
André Galligo
Roots of the derivatives of some random polynomials. SNC (2011)
André Galligo, Adrien Poteaux
Computing monodromy via continuation methods on random Riemann surfaces. Theor. Comput. Sci. 412 (16) (2011)
Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn
A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. 412 (35) (2011)
Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas
Random polynomials and expected complexity of bisection methods for real solving. ISSAC (2010)
Gang Xu, Bernard Mourrain, Régis Duvigneau, André Galligo
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis. GMP (2010)
Cristina Bertone, Guillaume Chèze, André Galligo
Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. 45 (12) (2010)
Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas
Random polynomials and expected complexity of bisection methods for real solving CoRR (2010)
Laurent Busé, Mohamed Elkadi, André Galligo
A computational study of ruled surfaces. J. Symb. Comput. 44 (3) (2009)
Cristina Bertone, Guillaume Chèze, André Galligo
Probabilistic algorithms for polynomial absolute factorization. ACM Commun. Comput. Algebra 43 (3/4) (2009)
André Galligo, Luis Miguel Pardo, Josef Schicho
Effective methods in algebraic geometry. J. Symb. Comput. 44 (9) (2009)
Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain
Computing nearest Gcd with certification. SNC (2009)
André Galligo, Adrien Poteaux
Continuations and monodromy on random riemann surfaces. SNC (2009)
Mohamed Elkadi, André Galligo, Martin Weimann
Towards toric absolute factorization. J. Symb. Comput. 44 (9) (2009)
Guillaume Chèze, Mohamed Elkadi, André Galligo, Martin Weimann
Absolute factoring of bidegree bivariate polynomials. ACM Commun. Comput. Algebra 42 (3) (2008)
Laurent Busé, Mohamed Elkadi, André Galligo
Intersection and self-intersection of surfaces by means of Bezoutian matrices. Comput. Aided Geom. Des. 25 (2) (2008)
André Galligo
Preface. Theor. Comput. Sci. 392 (1-3) (2008)
André Galligo, Mark van Hoeij
Approximate bivariate factorization: a geometric viewpoint. SNC (2007)
Mohamed Elkadi, André Galligo
Systems of three polynomials with two separated variables. ISSAC (2007)
André Galligo, Michael Eugene Stillman
On the geometry of parametrized bicubic surfaces. J. Symb. Comput. 42 (1-2) (2007)
Guillaume Chèze, André Galligo
From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. 41 (6) (2006)
Laurent Busé, André Galligo
Semi-implicit representations of surfaces in , resultants and applications. J. Symb. Comput. 39 (3-4) (2005)
André Galligo, Jean Pascal Pavone
Selfintersections of a bézier bicubic surface. ISSAC (2005)
Mohamed Elkadi, André Galligo, Thi Ha Lê
of bidegree(1,2). ISSAC (2004)
Laurent Busé, André Galligo
Using Semi-Implicit Representation of Algebraic Surfaces. SMI (2004)
Robert M. Corless, André Galligo, Ilias S. Kotsireas, Stephen M. Watt
A geometric-numeric algorithm for absolute factorization of multivariate polynomials. ISSAC (2002)
André Galligo, David Rupprecht
Irreducible Decomposition of Curves. J. Symb. Comput. 33 (5) (2002)
André Galligo, David Rupprecht
Semi-numerical determination of irreducible branches of a reduced space curve. ISSAC (2001)
André Galligo, Stephen M. Watt
A Numerical Absolute Primality Test for Bivariate Polynomials. ISSAC (1997)
Ioannis Z. Emiris, André Galligo
Book Review: Polynomial and Matrix Computations Volume 1: Fundamental Algorithms by D. Bini and V. Pan. SIGSAM Bull. 30 (3) (1996)
André Galligo, Nicolai N. Vorobjov Jr.
Complexity of Finding Irreducible Components of a Semialgebraic Set. J. Complex. 11 (1) (1995)
C. Faure, André Galligo, J. Grimm, Loic Pottier
The Extensions of the Sisyphe Computer Algebra System: ulysse and athena. DISCO (1992)
Leandro Caniglia, André Galligo, Joos Heintz
Equations for the projective closure and effective Nullstellensatz. Discret. Appl. Math. 33 (1-3) (1991)
André Galligo, J. Grimm, Loic Pottier
The design of SISYPHE: a system for doing symbolic and algebraic computations. DISCO (1990)
André Galligo, Carlo Traverso
Practical Determination of the Dimension of an Algebraic Variety. Computers and Mathematics (1989)
André Galligo, Loic Pottier, Carlo Traverso
Greater Easy Common Divisor and Standard Basis Completion Algorithms. ISSAC (1988)
Leandro Caniglia, André Galligo, Joos Heintz
Some New Effectivity Bounds in Computational Geometry. AAECC (1988)
André Galligo
Some Algorithmic Questions of Constructing Standard Bases. European Conference on Computer Algebra (2) (1985)