Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study. - Fabrice Rouillier; Mohab Safey El Din; Éric Schost (Automated Deduction in Geometry, 2000)

Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation. - Fabrice Rouillier; Marie-Françoise Roy; Mohab Safey El Din (J. Complex., 2000)

New Structure Theorem for Subresultants. - Henri Lombardi; Marie-Françoise Roy; Mohab Safey El Din (J. Symb. Comput., 2000)

Real Solving for Positive Dimensional Systems. - Philippe Aubry; Fabrice Rouillier; Mohab Safey El Din (J. Symb. Comput., 2002)

Polar varieties and computation of one point in each connected component of a smooth real algebraic set. - Mohab Safey El Din; Éric Schost (ISSAC, 2003)

Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. - Mohab Safey El Din; Éric Schost (Discret. Comput. Geom., 2004)

Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry - Mohab Safey El Din; Philippe Trebuchet (CoRR, 2006)

Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping. - Mohab Safey El Din (ASCM, 2007)

POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations. - Mohab Safey El Din; Philippe Trebuchet (PASCO, 2007)

Testing Sign Conditions on a Multivariate Polynomial and Applications. - Mohab Safey El Din (Math. Comput. Sci., 2007)

Computing the global optimum of a multivariate polynomial over the reals. - Mohab Safey El Din (ISSAC, 2008)

Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. - Jean-Charles Faugère; Guillaume Moroz; Fabrice Rouillier; Mohab Safey El Din (ISSAC, 2008)

Variant real quantifier elimination: algorithm and application. - Hoon Hong; Mohab Safey El Din (ISSAC, 2009)

A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces - Mohab Safey El Din; Éric Schost (CoRR, 2009)

Computing rational points in convex semi-algebraic sets and SOS decompositions - Mohab Safey El Din; Lihong Zhi (CoRR, 2009)

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

Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (ISSAC, 2010)

Global optimization of polynomials using generalized critical values and sums of squares. - Feng Guo 007; Mohab Safey El Din; Lihong Zhi (ISSAC, 2010)

On the geometry of polar varieties. - Bernd Bank; Marc Giusti; Joos Heintz; Mohab Safey El Din; Éric Schost (Appl. Algebra Eng. Commun. Comput., 2010)

Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (CoRR, 2010)

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. - Mohab Safey El Din; Lihong Zhi (SIAM J. Optim., 2010)

Deciding reachability of the infimum of a multivariate polynomial. - Aurélien Greuet; Mohab Safey El Din (ISSAC, 2011)

A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface. - Mohab Safey El Din; Éric Schost (Discret. Comput. Geom., 2011)

Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (J. Symb. Comput., 2011)

Critical points and Gröbner bases: the unmixed case. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (ISSAC, 2012)

Global optimization of polynomials restricted to a smooth variety using sums of squares. - Aurélien Greuet; Feng Guo 007; Mohab Safey El Din; Lihong Zhi (J. Symb. Comput., 2012)

Variant quantifier elimination. - Hoon Hong; Mohab Safey El Din (J. Symb. Comput., 2012)

Critical point methods and effective real algebraic geometry: new results and trends. - Mohab Safey El Din (ISSAC, 2013)

On the complexity of computing gröbner bases for quasi-homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (ISSAC, 2013)

Computing rational solutions of linear matrix inequalities. - Qingdong Guo; Mohab Safey El Din; Lihong Zhi (ISSAC, 2013)

Computing Gröbner bases for quasi-homogeneous systems - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (CoRR, 2013)

A probabilistic algorithm to compute the real dimension of a semi-algebraic set - Mohab Safey El Din; Elias P. Tsigaridas (CoRR, 2013)

On the complexity of the generalized MinRank problem. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (J. Symb. Comput., 2013)

Computing necessary integrability conditions for planar parametrized homogeneous potentials. - Alin Bostan; Thierry Combot; Mohab Safey El Din (ISSAC, 2014)

On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (CoRR, 2014)

A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. - Saugata Basu; Marie-Françoise Roy; Mohab Safey El Din; Éric Schost (Found. Comput. Math., 2014)

Intrinsic complexity estimates in polynomial optimization. - Bernd Bank; Marc Giusti; Joos Heintz; Mohab Safey El Din (J. Complex., 2014)

Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set. - Aurélien Greuet; Mohab Safey El Din (SIAM J. Optim., 2014)

Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets. - Ivan Bannwarth; Mohab Safey El Din (ISSAC, 2015)

Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety. - Feng Guo 007; Mohab Safey El Din; Chu Wang; Lihong Zhi (ISSAC, 2015)

Real Root Finding for Rank Defects in Linear Hankel Matrices. - Didier Henrion; Simone Naldi; Mohab Safey El Din (ISSAC, 2015)

Polynomial Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (RP, 2015)

Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. - Bernard Bonnard; Jean-Charles Faugère; Alain Jacquemard; Mohab Safey El Din; Thibaut Verron (ISSAC, 2016)

Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. - Mohab Safey El Din; Pierre-Jean Spaenlehauer (ISSAC, 2016)

On the complexity of computing Gröbner bases for weighted homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (J. Symb. Comput., 2016)

Real root finding for determinants of linear matrices. - Didier Henrion; Simone Naldi; Mohab Safey El Din (J. Symb. Comput., 2016)

Exact Algorithms for Linear Matrix Inequalities. - Didier Henrion; Simone Naldi; Mohab Safey El Din (SIAM J. Optim., 2016)

Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials. - Victor Magron; Mohab Safey El Din; Markus Schweighofer (CoRR, 2017)

A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. - Mohab Safey El Din; Éric Schost (J. ACM, 2017)

On the Complexity of Computing Real Radicals of Polynomial Systems. - Mohab Safey El Din; Zhi-Hong Yang; Lihong Zhi (ISSAC, 2018)

On Exact Polya and Putinar's Representations. - Victor Magron; Mohab Safey El Din (ISSAC, 2018)

Real Root Finding for Equivariant Semi-algebraic Systems. - Cordian Riener; Mohab Safey El Din (ISSAC, 2018)

Realcertify: a maple package for certifying non-negativity. - Victor Magron; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2018)

On Exact Polya, Hilbert-Artin and Putinar's Representations. - Victor Magron; Mohab Safey El Din (CoRR, 2018)

Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization. - Mohab Safey El Din; Éric Schost (J. Symb. Comput., 2018)

A Lower Bound on the Positive Semidefinite Rank of Convex Bodies. - Hamza Fawzi; Mohab Safey El Din (SIAM J. Appl. Algebra Geom., 2018)

Computing the Volume of Compact Semi-Algebraic Sets. - Pierre Lairez; Marc Mezzarobba; Mohab Safey El Din (ISSAC, 2019)

Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. - Victor Magron; Mohab Safey El Din; Markus Schweighofer (J. Symb. Comput., 2019)

SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic. - Didier Henrion; Simone Naldi; Mohab Safey El Din (Optim. Methods Softw., 2019)

Robots, computer algebra and eight connected components. - Jose Capco; Mohab Safey El Din; Josef Schicho (ISSAC, 2020)

Computing the real isolated points of an algebraic hypersurface. - Huu Phuoc Le; Mohab Safey El Din; Timo de Wolff (ISSAC, 2020)

Real root finding for low rank linear matrices. - Didier Henrion; Simone Naldi; Mohab Safey El Din (Appl. Algebra Eng. Commun. Comput., 2020)

Towards fast one-block quantifier elimination through generalised critical values. - Jérémy Berthomieu; Andrew Ferguson; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2020)

Guessing Gr{ö}bner Bases of Structured Ideals of Relations of Sequences. - Jérémy Berthomieu; Mohab Safey El Din (CoRR, 2020)

Connectivity in Semi-Algebraic Sets I. - Hoon Hong; James Rohal; Mohab Safey El Din; Éric Schost (CoRR, 2020)

Special Issue on Symbolic and Algebraic Computation: ISSAC 2017. - Mohab Safey El Din; Chee Yap (J. Symb. Comput., 2020)

msolve: A Library for Solving Polynomial Systems. - Jérémy Berthomieu; Christian Eder; Mohab Safey El Din (ISSAC, 2021)

Computing the Dimension of Real Algebraic Sets. - Pierre Lairez; Mohab Safey El Din (ISSAC, 2021)

Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations. - Huu Phuoc Le; Mohab Safey El Din (ISSAC, 2021)

On the computation of asymptotic critical values of polynomial maps and applications. - Jérémy Berthomieu; Andrew Ferguson; Mohab Safey El Din (CoRR, 2021)

Computing the dimension of a real algebraic set. - Pierre Lairez; Mohab Safey El Din (CoRR, 2021)

Polynomial interrupt timed automata: Verification and expressiveness. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (Inf. Comput., 2021)

Complete Singularity Analysis for the Perspective-Four-Point Problem. - Beatriz Pascual-Escudero; Abhilash Nayak; Sébastien Briot; Olivier Kermorgant; Philippe Martinet; Mohab Safey El Din; François Chaumette (Int. J. Comput. Vis., 2021)

Homotopy techniques for solving sparse column support determinantal polynomial systems. - George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Complex., 2021)

Computing real radicals and S-radicals of polynomial systems. - Mohab Safey El Din; Zhi-Hong Yang; Lihong Zhi (J. Symb. Comput., 2021)

Solving determinantal systems using homotopy techniques. - Jonathan D. Hauenstein; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2021)

Exact algorithms for semidefinite programs with degenerate feasible set. - Didier Henrion; Simone Naldi; Mohab Safey El Din (J. Symb. Comput., 2021)

On exact Reznick, Hilbert-Artin and Putinar's representations. - Victor Magron; Mohab Safey El Din (J. Symb. Comput., 2021)

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. - Jérémy Berthomieu; Vincent Neiger; Mohab Safey El Din (ISSAC, 2022)

Algorithms for Discrete Differential Equations of Order 1. - Alin Bostan; Frédéric Chyzak; Hadrien Notarantonio; Mohab Safey El Din (ISSAC, 2022)

Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry. - Damien Chablat; Rémi Prébet; Mohab Safey El Din; Durgesh Haribhau Salunkhe; Philippe Wenger (ISSAC, 2022)

Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. - Victor Magron; Mohab Safey El Din; Markus Schweighofer; Trung Hieu Vu (ISSAC, 2022)

Towards signature-based gröbner basis algorithms for computing the nondegenerate locus of a polynomial system. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2022)

Computer algebra methods for polynomial system solving at the service of image-based visual servoing. - Jorge García Fontán; Alessandro Colotti; Sébastien Briot; Alexandre Goldsztejn; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2022)

New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon). - Jérémy Berthomieu; Christian Eder; Mohab Safey El Din (CoRR, 2022)

Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems. - Alin Bostan; Jérémy Berthomieu; Andrew Ferguson; Mohab Safey El Din (CoRR, 2022)

Singularity Analysis for the Perspective-Four and Five-Line Problems. - Jorge García Fontán; Abhilash Nayak; Sébastien Briot; Mohab Safey El Din (Int. J. Comput. Vis., 2022)

Guessing Gröbner bases of structured ideals of relations of sequences. - Jérémy Berthomieu; Mohab Safey El Din (J. Symb. Comput., 2022)

Solving parametric systems of polynomial equations over the reals through Hermite matrices. - Huu Phuoc Le; Mohab Safey El Din (J. Symb. Comput., 2022)

Globally Optimal Solution to Inverse Kinematics of 7DOF Serial Manipulator. - Pavel Trutman; Mohab Safey El Din; Didier Henrion; Tomás Pajdla (IEEE Robotics Autom. Lett., 2022)

Fast Algorithms for Discrete Differential Equations. - Alin Bostan; Hadrien Notarantonio; Mohab Safey El Din (ISSAC, 2023)

A Direttissimo Algorithm for Equidimensional Decomposition. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (ISSAC, 2023)

Refined F5 Algorithms for Ideals of Minors of Square Matrices. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (ISSAC, 2023)

Faster real root decision algorithm for symmetric polynomials. - George Labahn; Cordian Riener; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (ISSAC, 2023)

Refined $F_5$ Algorithms for Ideals of Minors of Square Matrices. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (CoRR, 2023)

Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics. - Jose Capco; Mohab Safey El Din; Josef Schicho (J. Symb. Comput., 2023)

A signature-based algorithm for computing the nondegenerate locus of a polynomial system. - Christian Eder; Pierre Lairez; Rafael Mohr; Mohab Safey El Din (J. Symb. Comput., 2023)

Computing critical points for invariant algebraic systems. - Jean-Charles Faugère; George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2023)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. - Victor Magron; Mohab Safey El Din; Trung Hieu Vu (SIAM J. Optim., 2023)

Solving parameter-dependent semi-algebraic systems. - Louis Gaillard; Mohab Safey El Din (ISSAC, 2024)

Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations. - Sriram Gopalakrishnan; Vincent Neiger; Mohab Safey El Din (ISSAC, 2024)

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity. - Rémi Prébet; Mohab Safey El Din; Éric Schost (CoRR, 2024)

Algebraic Proofs of Path Disconnectedness using Time-Dependent Barrier Functions. - Didier Henrion; Jared Miller; Mohab Safey El Din (CoRR, 2024)

Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results. - Rémi Prébet; Mohab Safey El Din; Éric Schost (J. Symb. Comput., 2024)

Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing. - Alessandro Colotti; Jorge García Fontán; Alexandre Goldsztejn; Sébastien Briot; François Chaumette; Olivier Kermorgant; Mohab Safey El Din (IEEE Trans. Robotics, 2024)

Solving generic parametric linear matrix inequalities. - Simone Naldi; Mohab Safey El Din; Adrien Taylor; Weijia Wang (CoRR, 2025)

Probabilistic algorithm for computing all local minimizers of Morse functions on a compact domain. - Mohab Safey El Din; Georgy Scholten; Emmanuel Trélat (CoRR, 2025)