• 2017
    • T. Place and M. Zeitoun, Concatenation Hierarchies: New Bottle, Old Wine. In: Weil P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science, vol 10304. Springer, 2017.
    • T. Place and M. Zeitoun, Separation for Dot-depth 2. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science. LICS 2017.
    • W. Czerwinski, W. Martens, L. van Rooijen, and M. Zeitoun, G. Zetzsche. A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science, 2017.
    • J. Almeida, J. C. Costa and M. Zeitoun. Reducibility of Pointlike Problems. Semigroup Forum, 94(2):325–335, 2017. DOI 10.1007/s00233-015-9769-2.
    • T. Brihaye, G. Geeraerts, A. Haddad, and B. Monmege. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica, 54(1):85–125, February 2017. DOI 10.1007/s00236-016-0276-z
    • P. Gallot, A. Muscholl, G. Puppis and S. Salvati. On the decomposition of finite-valued streaming string transducers. In Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
  • 2016 (from october 1st).
    • F. Bassino, C. Nicaud, P. Weil. Generic properties of subgroups of free groups and of finite presentations, Contemporary Mathematics 677 (2016) 1-44. DOI 10.1090/conm/677/13619