| Publication | Date of Publication | Type |
|---|
Symbolic computations of first integrals for polynomial vector fields
Foundations of Computational Mathematics | 2020-09-07 | Paper |
| Envy-free cake cutting: A polynomial number of queries with high probability | 2020-05-05 | Paper |
How to share a cake with a secret agent
Mathematical Social Sciences | 2019-11-08 | Paper |
Cake cutting: explicit examples for impossibility results
Mathematical Social Sciences | 2019-11-08 | Paper |
On the nonexistence of Liouvillian first integrals for generalized Liénard polynomial differential systems
Journal of Nonlinear Mathematical Physics | 2019-08-29 | Paper |
How to cut a cake with a Gram matrix
Linear Algebra and its Applications | 2018-11-29 | Paper |
Topological aggregation, the twin paradox and the No Show paradox
Social Choice and Welfare | 2018-03-08 | Paper |
Existence of a simple and equitable fair division: a short proof
Mathematical Social Sciences | 2017-10-04 | Paper |
Computing nearest gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation | 2017-02-03 | Paper |
Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
Mathematics of Computation | 2016-03-09 | Paper |
Bounding the number of remarkable values via Jouanolou's theorem
Journal of Differential Equations | 2015-03-23 | Paper |
Darboux theory of integrability in the sparse case
Journal of Differential Equations | 2014-05-09 | Paper |
A recombination algorithm for the decomposition of multivariate rational functions
Mathematics of Computation | 2013-07-23 | Paper |
Specializations of indecomposable polynomials
Manuscripta Mathematica | 2012-12-06 | Paper |
On the total order of reducibility of a pencil of algebraic plane curves
Journal of Algebra | 2012-02-11 | Paper |
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science | 2011-09-12 | Paper |
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
Journal of Complexity | 2011-04-13 | Paper |
Noether forms for the study of non-composite rational functions and their spectrum
Acta Arithmetica | 2011-03-04 | Paper |
Modular Las Vegas algorithms for polynomial absolute factorization
Journal of Symbolic Computation | 2010-11-19 | Paper |
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
Journal of Complexity | 2010-09-01 | Paper |
Indecomposability of polynomials via Jacobian matrix
Journal of Algebra | 2010-07-20 | Paper |
| Four lectures on polynomial absolute factorization | 2009-01-26 | Paper |
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation | 2007-10-23 | Paper |
Lifting and recombination techniques for absolute factorization
Journal of Complexity | 2007-07-04 | Paper |
| scientific article; zbMATH DE number 2145002 (Why is no real title available?) | 2005-03-14 | Paper |
