| 2026 | IPCO | The Integrality Gap of the Traveling Salesman Problem is $\frac{4}{3}$ if the LP Solution Has at Most n + 6 Non-Zero Components. | Tullio Villa, Eleonora Vercesi, Jnos Barta, Monaldo Mastrolilli |
| 2025 | ICALP | On the Degree Automatability of Sum-Of-Squares Proofs. | Alex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas |
| 2025 | ICALP | Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes. | Koppny Istvn Encz, Monaldo Mastrolilli, Eleonora Vercesi |
| 2021 | MFCS | Ideal Membership Problem for Boolean Minority and Dual Discriminator. | Arpitha P. Bharathi, Monaldo Mastrolilli |
| 2020 | MFCS | Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. | Arpitha P. Bharathi, Monaldo Mastrolilli |
| 2019 | SODA | The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. | Monaldo Mastrolilli |
| 2017 | IPCO | High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. | Monaldo Mastrolilli |
| 2016 | ICALP | Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. | Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2016 | IPCO | Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. | Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2016 | IPCO | Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. | Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mmke, Victor Verdugo, Andreas Wiese |
| 2015 | ESA | A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. | Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2015 | ICALP | On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. | Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2014 | WABI | Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. | Nicolas Boria, Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli |
| 2013 | SODA | How to Sell Hyperedges: The Hypermatching Assignment Problem. | Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli |
| 2012 | COCOON | Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. | Monaldo Mastrolilli, Georgios Stamoulis |
| 2012 | ESA | Approximation of Minimum Cost Homomorphisms. | Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey |
| 2012 | LATIN | The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. | Monaldo Mastrolilli |
| 2012 | WAOA | Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. | Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis |
| 2011 | ICALP | Vertex Cover in Graphs with Locally Few Colors. | Fabian Kuhn, Monaldo Mastrolilli |
| 2009 | ICALP | Improved Bounds for Flow Shop Scheduling. | Monaldo Mastrolilli, Ola Svensson |
| 2008 | FOCS | (Acyclic) JobShops are Hard to Approximate. | Monaldo Mastrolilli, Ola Svensson |
| 2007 | FOCS | Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. | Christoph Ambhl, Monaldo Mastrolilli, Ola Svensson |
| 2007 | IPCO | Scheduling with Precedence Constraints of Low Fractional Dimension. | Christoph Ambhl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
| 2006 | ESA | Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. | Christoph Ambhl, Monaldo Mastrolilli |
| 2004 | AAAI | MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? | Monaldo Mastrolilli, Luca Maria Gambardella |
| 2004 | PPSN | Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. | Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Lus Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto |
| 2003 | FCT | Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. | Monaldo Mastrolilli |
| 2003 | ISAAC | On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2002 | PATAT | A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. | Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Lus Paquete, Thomas Sttzle |
| 2002 | PPSN | Metaheuristics for Group Shop Scheduling. | Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria |
| 2001 | ESA | Grouping Techniques for Scheduling Problems: Simpler and Faster. | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2001 | FCT | Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. | Monaldo Mastrolilli |
| 2000 | ICALP | Parallel Machine Scheduling Problems with Controllable Processing Times. | Klaus Jansen, Monaldo Mastrolilli |
| 2000 | LATIN | Approximation Algorithms for Flexible Job Shop Problems. | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |