Yann Strozecki

1. Monadic second-order model-checking on decomposable matroids
   2009/08/31 by Yann Strozecki, Strozecki, Yann · 2 citations
   Computer Science · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.DM #cs.DS #cs.LO
2. Efficient enumeration of solutions produced by closure operations
   2015/09/18 by Arnaud Mary, Yann Strozecki, Mary, Arnaud +1 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Formal Methods in Verification #cs.CC
3. On The Complexity of Enumeration
   2017/03/06 by Florent Capelli, Capelli, Florent, Yann Strozecki +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences