Faster real feasibility via circuit discriminants. - Frédéric Bihan; J. Maurice Rojas; Casey E. Stella (ISSAC, 2009)

Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes. - Frédéric Bihan; Pierre-Jean Spaenlehauer (CoRR, 2015)

Maximally positive polynomial systems supported on circuits. - Frédéric Bihan (J. Symb. Comput., 2015)

Descartes' Rule of Signs for Polynomial Systems supported on Circuits. - Frédéric Bihan; Alicia Dickenstein (CoRR, 2016)

Irrational Mixed Decomposition and Sharp Fewnomial Bounds for Tropical Polynomial Systems. - Frédéric Bihan (Discret. Comput. Geom., 2016)

A sharp bound on the number of real intersection points of a sparse plane curve with a line. - Frédéric Bihan; Boulos El Hilany (J. Symb. Comput., 2017)

A Polyhedral Method for Sparse Systems with Many Positive Solutions. - Frédéric Bihan; Francisco Santos; Pierre-Jean Spaenlehauer (SIAM J. Appl. Algebra Geom., 2018)

Optimal Descartes' Rule of Signs for Circuits. - Frédéric Bihan; Alicia Dickenstein; Jens Forsgård (CoRR, 2020)

Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract). - Frédéric Bihan; Erika Croy; Weixun Deng; Kaitlyn Phillipson; Robert J. Rennie; J. Maurice Rojas (ACM Commun. Comput. Algebra, 2023)