A Logical Approach to Decomposable Matroids - Yann Strozecki (CoRR, 2009)

From patches to pixels in Non-Local methods: Weighted-average reprojection. - Joseph Salmon; Yann Strozecki (ICIP, 2010)

Enumeration of the Monomials of a Polynomial and Related Complexity Classes. - Yann Strozecki (MFCS, 2010)

Enumeration Complexity of Logical Query Problems with Second-order Variables. - Arnaud Durand 001; Yann Strozecki (CSL, 2011)

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. - Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (FSTTCS, 2011)

The Complexity of Acyclic Subhypergraph Problems. - David Duris; Yann Strozecki (WALCOM, 2011)

Monadic second-order model-checking on decomposable matroids. - Yann Strozecki (Discret. Appl. Math., 2011)

Approximate Verification and Enumeration Problems. - Sylvain Peyronnet; Michel de Rougemont; Yann Strozecki (ICTAC, 2012)

Patch reprojections for Non-Local methods. - Joseph Salmon; Yann Strozecki (Signal Process., 2012)

Factoring bivariate lacunary polynomials without heights. - Arkadev Chattopadhyay; Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (ISSAC, 2013)

On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation. - Yann Strozecki (Theory Comput. Syst., 2013)

Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. - David Auger; Pierre Coucheney; Yann Strozecki (TAMC, 2014)

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. - David Auger; Pierre Coucheney; Yann Strozecki (CoRR, 2014)

Efficient Generation of Stable Planar Cages for Chemistry. - Dominique Barth; Olivier David 003; Franck Quessette; Vincent Reinhard; Yann Strozecki; Sandrine Vial (SEA, 2015)

On The Complexity of Enumeration. - Florent Capelli; Yann Strozecki (CoRR, 2017)

Deterministic Scheduling of Periodic Messages for Cloud RAN. - Dominique Barth; Maël Guiraud; Brice Leclerc; Olivier Marcé; Yann Strozecki (ICT, 2018)

Deterministic Scheduling of Periodic Messages for Cloud RAN. - Dominique Barth; Maël Guiraud; Yann Strozecki (CoRR, 2018)

Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring. - Dominique Barth; Maël Guiraud; Yann Strozecki (ONDM, 2019)

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. - David Auger; Pierre Coucheney; Yann Strozecki (STACS, 2019)

Incremental delay enumeration: Space and time. - Florent Capelli; Yann Strozecki (Discret. Appl. Math., 2019)

Efficient enumeration of solutions produced by closure operations. - Arnaud Mary; Yann Strozecki (Discret. Math. Theor. Comput. Sci., 2019)

Enumeration Complexity. - Yann Strozecki (Bull. EATCS, 2019)

Scheduling periodic messages on a shared link. - Maël Guiraud; Yann Strozecki (CoRR, 2020)

A Generic Strategy Improvement Method for Simple Stochastic Games. - David Auger; Xavier Badin de Montjoye; Yann Strozecki (MFCS, 2021)

A Generic Strategy Iteration Method for Simple Stochastic Games. - David Auger; Xavier Badin de Montjoye; Yann Strozecki (CoRR, 2021)

Enumerating models of DNF faster: Breaking the dependency on the formula size. - Florent Capelli; Yann Strozecki (Discret. Appl. Math., 2021)

Computing the multilinear factors of lacunary polynomials without heights. - Arkadev Chattopadhyay; Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (J. Symb. Comput., 2021)

Geometric Amortization of Enumeration Algorithms. - Florent Capelli; Yann Strozecki (STACS, 2023)

Enumeration Complexity: Incremental Time, Delay and Space. - Yann Strozecki (CoRR, 2023)

Scheduling periodic messages on a shared link without buffering. - Maël Guiraud; Yann Strozecki (J. Sched., 2024)

Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks. - Jérémie Cabessa; Yann Strozecki (Inf. Sci., 2025)

Demand Selection for VRP with Emission Quota. - Farid Najar; Dominique Barth; Yann Strozecki (CoRR, 2025)

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN. - Dominique Barth; Maël Guiraud; Yann Strozecki (J. Netw. Syst. Manag., 2025)