Guillaume Chèze

34 papers B 1Journal 32Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Between proportionnality and envy-freeness: k -proportionality. Math. Soc. Sci. Guillaume Chèze
2025	J	`jnl`	Between proportionnality and envy-freeness: k-proportionality. CoRR Guillaume Chèze
2025	J	`jnl`	The Inversion Paradox and Ranking Methods in Tournaments. CoRR Guillaume Chèze, Etienne Fieux
2020	J	`jnl`	Envy-free cake cutting: A polynomial number of queries with high probability. CoRR Guillaume Chèze
2020	J	`jnl`	Symbolic Computations of First Integrals for Polynomial Vector Fields. Found. Comput. Math. Guillaume Chèze, Thierry Combot
2019	J	`jnl`	Cake cutting: Explicit examples for impossibility results. CoRR Guillaume Chèze
2019	J	`jnl`	Cake cutting: Explicit examples for impossibility results. Math. Soc. Sci. Guillaume Chèze
2019	J	`jnl`	How to share a cake with a secret agent. Math. Soc. Sci. Guillaume Chèze
2018	J	`jnl`	Don't cry to be the first! Symmetric fair division algorithms exist. CoRR Guillaume Chèze
2018	J	`jnl`	How to share a cake with a secret agent. CoRR Guillaume Chèze
2017	J	`jnl`	Existence of a simple and equitable fair division: A short proof. Math. Soc. Sci. Guillaume Chèze
2017	J	`jnl`	Existence of a simple and equitable fair division: a short proof. CoRR Guillaume Chèze
2017	J	`jnl`	How to cut a cake with a gram matrix. CoRR Guillaume Chèze, Luca Amodei
2017	J	`jnl`	Symbolic Computations of First Integrals for Polynomial Vector Fields. CoRR Guillaume Chèze, Thierry Combot
2017	J	`jnl`	Topological aggregation, the twin paradox and the No Show paradox. Soc. Choice Welf. Guillaume Chèze
2016	J	`jnl`	Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields. Math. Comput. Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil
2016	J	`jnl`	Topological aggregation, the twin paradox and the no show paradox. CoRR Guillaume Chèze
2013	J	`jnl`	A recombination algorithm for the decomposition of multivariate rational functions. Math. Comput. Guillaume Chèze
2013	J	`jnl`	Efficient Algorithms for Computing Rational First Integrals and Darboux Polynomials of Planar Polynomial Vector Fields. CoRR Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil
2011	J	`jnl`	A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn
2011	J	`jnl`	Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. J. Complex. Guillaume Chèze
2010	J	`jnl`	A recombination algorithm for the decomposition of multivariate rational functions CoRR Guillaume Chèze
2010	J	`jnl`	Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time CoRR Guillaume Chèze
2010	J	`jnl`	Modular Las Vegas algorithms for polynomial absolute factorization. J. Symb. Comput. Cristina Bertone, Guillaume Chèze, André Galligo
2010	J	`jnl`	Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem CoRR Guillaume Chèze
2010	J	`jnl`	Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem. J. Complex. Guillaume Chèze
2009	—	`conf`	Computing nearest Gcd with certification. SNC Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain
2009	J	`jnl`	Noether's forms for the study of non-composite rational functions and their spectrum CoRR Laurent Busé, Guillaume Chèze, Salah Najib
2009	J	`jnl`	Probabilistic algorithms for polynomial absolute factorization. ACM Commun. Comput. Algebra Cristina Bertone, Guillaume Chèze, André Galligo
2008	J	`jnl`	Absolute factoring of bidegree bivariate polynomials. ACM Commun. Comput. Algebra Guillaume Chèze, Mohamed Elkadi, André Galligo, Martin Weimann
2008	J	`jnl`	On the total order of reducibility of a pencil of algebraic plane curves. CoRR Laurent Busé, Guillaume Chèze
2007	J	`jnl`	Lifting and recombination techniques for absolute factorization. J. Complex. Guillaume Chèze, Grégoire Lecerf
2006	J	`jnl`	From an approximate to an exact absolute polynomial factorization. J. Symb. Comput. Guillaume Chèze, André Galligo
2004	B	`conf`	Absolute polynomial factorization in two variables and the knapsack problem. ISSAC Guillaume Chèze