Parallel Machine Scheduling Problems with Controllable Processing Times. - Klaus Jansen; Monaldo Mastrolilli (ICALP Satellite Workshops, 2000)

Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. - Monaldo Mastrolilli (FCT, 2001)

Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. - Monaldo Mastrolilli (FSTTCS, 2001)

Job Shop Scheduling Problems with Controllable Processing Times. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (ICTCS, 2001)

An optimization methodology for intermodal terminal management. - Luca Maria Gambardella; Monaldo Mastrolilli; Andrea Emilio Rizzoli; Marco Zaffalon (J. Intell. Manuf., 2001)

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; Luís Paquete; Thomas Stützle (PATAT, 2002)

Metaheuristics for Group Shop Scheduling. - Michael Sampels; Christian Blum 001; Monaldo Mastrolilli; Olivia Rossi-Doria (PPSN, 2002)

A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. - Monaldo Mastrolilli (SWAT, 2002)

Approximation schemes for scheduling problems. - Monaldo Mastrolilli (2002)

Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. - Monaldo Mastrolilli (FCT, 2003)

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. - Aleksei V. Fishkin; Klaus Jansen; Monaldo Mastrolilli (ISAAC, 2003)

Notes on Max Flow Time Minimization with Controllable Processing Times. - Monaldo Mastrolilli (Computing, 2003)

Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. - Monaldo Mastrolilli (J. Sched., 2003)

MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? - Monaldo Mastrolilli; Luca Maria Gambardella (AAAI, 2004)

Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (PPSN, 2004)

Approximation schemes for parallel machine scheduling problems with controllable processing times. - Klaus Jansen; Monaldo Mastrolilli (Comput. Oper. Res., 2004)

Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. - Monaldo Mastrolilli (Int. J. Found. Comput. Sci., 2004)

Approximation schemes for job shop scheduling problems with controllable processing times. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (Eur. J. Oper. Res., 2005)

Core instances for testing: A case study. - Monaldo Mastrolilli; Leonora Bianchi (Eur. J. Oper. Res., 2005)

Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? - Monaldo Mastrolilli; Luca Maria Gambardella (Eur. J. Oper. Res., 2005)

Approximation algorithms for flexible job shop problems. - Klaus Jansen; Monaldo Mastrolilli; Roberto Solis-Oba (Int. J. Found. Comput. Sci., 2005)

On-line scheduling to minimize max flow time: an optimal preemptive algorithm. - Christoph Ambühl; Monaldo Mastrolilli (Oper. Res. Lett., 2005)

Approximating Precedence-Constrained Single Machine Scheduling by Coloring. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (APPROX-RANDOM, 2006)

Hybrid rounding techniques for knapsack problems. - Monaldo Mastrolilli; Marcus Hutter (Discret. Appl. Math., 2006)

A linear time approximation scheme for the single machine scheduling problem with controllable processing times. - Monaldo Mastrolilli (J. Algorithms, 2006)

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. - Leonora Bianchi; Mauro Birattari; Marco Chiarandini; Max Manfrin; Monaldo Mastrolilli; Luís Paquete; Olivia Rossi-Doria; Tommaso Schiavinotto (J. Math. Model. Algorithms, 2006)

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (FOCS, 2007)

Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. - Christian Blum 001; Monaldo Mastrolilli (Hybrid Metaheuristics, 2007)

Scheduling with Precedence Constraints of Low Fractional Dimension. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (IPCO, 2007)

The Robust Traveling Salesman Problem with Interval Data. - Roberto Montemanni; János Barta; Monaldo Mastrolilli; Luca Maria Gambardella (Transp. Sci., 2007)

Approximating Single Machine Scheduling with Scenarios. - Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (APPROX-RANDOM, 2008)

(Acyclic) JobShops are Hard to Approximate. - Monaldo Mastrolilli; Ola Svensson (FOCS, 2008)

Grouping Techniques for Scheduling Problems: Simpler and Faster. - Aleksei V. Fishkin; Klaus Jansen; Monaldo Mastrolilli (Algorithmica, 2008)

Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Bull. EATCS, 2008)

Hybridizations of Metaheuristics With Branch & Bound Derivates. - Christian Blum 001; Carlos Cotta; Antonio J. Fernández 001; José E. Gallardo; Monaldo Mastrolilli (Hybrid Metaheuristics, 2008)

Improved Bounds for Flow Shop Scheduling. - Monaldo Mastrolilli; Ola Svensson (ICALP (1), 2009)

Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. - Christoph Ambühl; Monaldo Mastrolilli (Algorithmica, 2009)

On the use of different types of knowledge in metaheuristics based on constructing solutions. - Monaldo Mastrolilli; Christian Blum 001 (Eng. Appl. Artif. Intell., 2010)

Minimizing the sum of weighted completion times in a concurrent open shop. - Monaldo Mastrolilli; Maurice Queyranne; Andreas S. Schulz; Ola Svensson; Nelson A. Uhan (Oper. Res. Lett., 2010)

Hardness of Approximating Flow and Job Shop Scheduling Problems. - Monaldo Mastrolilli; Ola Svensson (J. ACM, 2011)

On the Approximability of Single-Machine Scheduling with Precedence Constraints. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Math. Oper. Res., 2011)

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (SIAM J. Comput., 2011)

Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. - Monaldo Mastrolilli; Georgios Stamoulis (COCOON, 2012)

Approximation of Minimum Cost Homomorphisms. - Pavol Hell; Monaldo Mastrolilli; Mayssam Mohammadi Nevisi; Arash Rafiey (ESA, 2012)

Constrained Matching Problems in Bipartite Graphs. - Monaldo Mastrolilli; Georgios Stamoulis (ISCO, 2012)

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. - Adam Kurpisz; Monaldo Mastrolilli; Georgios Stamoulis (WAOA, 2012)

How to Sell Hyperedges: The Hypermatching Assignment Problem. - Marek Cygan; Fabrizio Grandoni 001; Monaldo Mastrolilli (SODA, 2013)

Lasserre Integrality Gaps for Certain Capacitated Covering Problems. - Monaldo Mastrolilli (CoRR, 2013)

On the approximation of minimum cost homomorphism to bipartite graphs. - Monaldo Mastrolilli; Arash Rafiey (Discret. Appl. Math., 2013)

Vertex cover in graphs with locally few colors. - Fabian Kuhn; Monaldo Mastrolilli (Inf. Comput., 2013)

Single machine scheduling with scenarios. - Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Theor. Comput. Sci., 2013)

Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. - Nicolas Boria; Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (WABI, 2014)

The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. - Monaldo Mastrolilli (Algorithmica, 2014)

On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (CoRR, 2014)

Bi-criteria and approximation algorithms for restricted matchings. - Monaldo Mastrolilli; Georgios Stamoulis (Theor. Comput. Sci., 2014)

A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ESA, 2015)

On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ICALP (1), 2015)

Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ICALP, 2016)

Sum-of-squares hierarchy lower bounds for symmetric formulations. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Electron. Colloquium Comput. Complex., 2016)

High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. - Monaldo Mastrolilli (IPCO, 2017)

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Math. Oper. Res., 2017)

An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (Math. Program., 2017)

On Bounded Pitch Inequalities for the Min-Knapsack Polytope. - Yuri Faenza; Igor Malinovic; Monaldo Mastrolilli; Ola Svensson (ISCO, 2018)

Sum-of-squares rank upper bounds for matching problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (J. Comb. Optim., 2018)

Semidefinite and linear programming integrality gaps for scheduling identical machines. - Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese (Math. Program., 2018)

The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain. - Monaldo Mastrolilli (CoRR, 2019)

Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. - Arpitha P. Bharathi; Monaldo Mastrolilli (MFCS, 2020)

Ideal Membership Problem for Boolean Minority. - Arpitha P. Bharathi; Monaldo Mastrolilli (CoRR, 2020)

High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy, and Chvátal-Gomory Cuts. - Monaldo Mastrolilli (SIAM J. Optim., 2020)

The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. - Monaldo Mastrolilli (ACM Trans. Algorithms, 2021)

On inequalities with bounded coefficients and pitch for the min knapsack polytope. - Daniel Bienstock; Yuri Faenza; Igor Malinovic; Monaldo Mastrolilli; Ola Svensson; Mark Zuckerberg (Discret. Optim., 2022)

Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism. - Arpitha P. Bharathi; Monaldo Mastrolilli (SIAM J. Discret. Math., 2022)

On the generation of metric TSP instances with a large integrality gap by branch-and-cut. - Eleonora Vercesi; Stefano Gualandi; Monaldo Mastrolilli; Luca Maria Gambardella (Math. Program. Comput., 2023)

On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation. - Ambrogio Maria Bernardelli; Eleonora Vercesi; Stefano Gualandi; Monaldo Mastrolilli; Luca Maria Gambardella (CoRR, 2024)

Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. - Adam Kurpisz; Samuli Leppänen; Monaldo Mastrolilli (ACM Trans. Comput. Theory, 2024)

On the Degree Automatability of Sum-Of-Squares Proofs. - Alex Bortolotti; Monaldo Mastrolilli; Luis Felipe Vargas (ICALP, 2025)

Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes. - Koppány István Encz; Monaldo Mastrolilli; Eleonora Vercesi (ICALP, 2025)

On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach. - Eleonora Vercesi; János Barta; Luca Maria Gambardella; Stefano Gualandi; Monaldo Mastrolilli (Discret. Optim., 2025)

Ideal Membership Problem for Boolean Minority and Dual Discriminator. - Arpitha P. Bharathi; Monaldo Mastrolilli (SIAM J. Discret. Math., 2025)

Computational complexity of sum-of-squares bounds for copositive programs. - Marilena Palomba; Lucas Slot; Luis Felipe Vargas; Monaldo Mastrolilli (CoRR, 2025)

The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components. - Tullio Villa; Eleonora Vercesi; János Barta; Monaldo Mastrolilli (CoRR, 2025)