Absolute polynomial factorization in two variables and the knapsack problem. - Guillaume Chèze (ISSAC, 2004)

From an approximate to an exact absolute polynomial factorization. - Guillaume Chèze; André Galligo (J. Symb. Comput., 2006)

Lifting and recombination techniques for absolute factorization. - Guillaume Chèze; Grégoire Lecerf (J. Complex., 2007)

Absolute factoring of bidegree bivariate polynomials. - Guillaume Chèze; Mohamed Elkadi; André Galligo; Martin Weimann (ACM Commun. Comput. Algebra, 2008)

On the total order of reducibility of a pencil of algebraic plane curves. - Laurent Busé; Guillaume Chèze (CoRR, 2008)

Computing nearest Gcd with certification. - Guillaume Chèze; Jean-Claude Yakoubsohn; André Galligo; Bernard Mourrain (SNC, 2009)

Probabilistic algorithms for polynomial absolute factorization. - Cristina Bertone; Guillaume Chèze; André Galligo (ACM Commun. Comput. Algebra, 2009)

Noether's forms for the study of non-composite rational functions and their spectrum - Laurent Busé; Guillaume Chèze; Salah Najib (CoRR, 2009)

Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem - Guillaume Chèze (CoRR, 2010)

Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. - Guillaume Chèze (J. Complex., 2010)

Modular Las Vegas algorithms for polynomial absolute factorization. - Cristina Bertone; Guillaume Chèze; André Galligo (J. Symb. Comput., 2010)

Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. - Guillaume Chèze (J. Complex., 2011)

A subdivision method for computing nearest gcd with certification. - Guillaume Chèze; André Galligo; Bernard Mourrain; Jean-Claude Yakoubsohn (Theor. Comput. Sci., 2011)

A recombination algorithm for the decomposition of multivariate rational functions. - Guillaume Chèze (Math. Comput., 2013)

Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields. - Alin Bostan; Guillaume Chèze; Thomas Cluzeau; Jacques-Arthur Weil (Math. Comput., 2016)

How to cut a cake with a gram matrix. - Guillaume Chèze; Luca Amodei (CoRR, 2017)

Existence of a simple and equitable fair division: A short proof. - Guillaume Chèze (Math. Soc. Sci., 2017)

Topological aggregation, the twin paradox and the No Show paradox. - Guillaume Chèze (Soc. Choice Welf., 2017)

Don't cry to be the first! Symmetric fair division algorithms exist. - Guillaume Chèze (CoRR, 2018)

How to share a cake with a secret agent. - Guillaume Chèze (Math. Soc. Sci., 2019)

Cake cutting: Explicit examples for impossibility results. - Guillaume Chèze (Math. Soc. Sci., 2019)

Envy-free cake cutting: A polynomial number of queries with high probability. - Guillaume Chèze (CoRR, 2020)

Symbolic Computations of First Integrals for Polynomial Vector Fields. - Guillaume Chèze; Thierry Combot (Found. Comput. Math., 2020)

The Inversion Paradox and Ranking Methods in Tournaments. - Guillaume Chèze; Etienne Fieux (CoRR, 2025)