| 2020 | CiE | Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs. | Cyril Banderier, Massimiliano Goldwurm |
| 2019 | DLT | Analysis of Symbol Statistics in Bicomponent Rational Models. | Massimiliano Goldwurm, Jianyi Lin, Marco Vignati |
| 2016 | AAIM | On the Complexity of Clustering with Relaxed Size Constraints. | Massimiliano Goldwurm, Jianyi Lin, Francesco Sacc |
| 2015 | SOFSEM | Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane. | Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin |
| 2007 | STACS | On the Complexity of Unary Tiling-Recognizable Picture Languages. | Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati |
| 2005 | STACS | Pattern Occurrences in Multicomponent Models. | Massimiliano Goldwurm, Violetta Lonati |
| 2004 | DLT | On the Maximum Coefficients of Rational Formal Series in Commuting Variables. | Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
| 2004 | STACS | Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
| 2003 | DLT | Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models. | Diego de Falco, Massimiliano Goldwurm, Violetta Lonati |
| 2001 | STACS | On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. | Massimiliano Goldwurm, Beatrice Palano, Massimo Santini |
| 2000 | STACS | Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. | Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini |
| 1992 | MFCS | Rational Transductions and Complexity of Counting Problems. | Christian Choffrut, Massimiliano Goldwurm |
| 1987 | STACS | Computing the Counting Function of Context-Free Languages. | Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini |