| 2026 | SODA | Learning Packing and Covering from Samples. | Anupam Gupta, Marco Molinaro |
| 2025 | FOCS | Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives. | Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla |
| 2025 | OSDI | Kamino: Efficient VM Allocation at Scale with Latency-Driven Cache-Aware Scheduling. | David Domingo, Hugo Barbalho, Marco Molinaro, Kuan Liu, Abhisek Pan, David Dion, Thomas Moscibroda, Sudarsun Kannan, Ishai Menache |
| 2025 | SIGMETRICS | The Power of Migrations in Dynamic Bin Packing. | Konstantina Mellou, Marco Molinaro, Rudy Zhou |
| 2024 | ICML | A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles. | Phillip A. Kerger, Marco Molinaro, Hongyi Jiang, Amitabh Basu |
| 2024 | STOC | Supermodular Approximation of Norms and Applications. | Thomas Kesselheim, Marco Molinaro, Sahil Singla |
| 2023 | ICALP | Online Demand Scheduling with Failovers. | Konstantina Mellou, Marco Molinaro, Rudy Zhou |
| 2023 | IPCO | Information Complexity of Mixed-Integer Convex Optimization. | Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro |
| 2023 | SODA | Online and Bandit Algorithms Beyond ℓ | Thomas Kesselheim, Marco Molinaro, Sahil Singla |
| 2022 | SODA | Robust Secretary and Prophet Algorithms for Packing Integer Programs. | C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla |
| 2021 | SODA | Branch-and-Bound Solves Random Binary IPs in Polytime. | Santanu S. Dey, Yatharth Dubey, Marco Molinaro |
| 2021 | SODA | Robust Algorithms for Online Convex Problems via Primal-Dual. | Marco Molinaro |
| 2020 | ICALP | Knapsack Secretary with Bursty Adversary. | Thomas Kesselheim, Marco Molinaro |
| 2020 | ICML | Teaching with Limited Information on the Learner's Behaviour. | Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro |
| 2019 | SODA | k-Servers with a Smile: Online Algorithms via Projections. | Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor |
| 2019 | SODA | Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method. | Marco Molinaro |
| 2018 | ICALP | Maximizing Profit with Convex Costs in the Random-order Model. | Anupam Gupta, Ruta Mehta, Marco Molinaro |
| 2018 | ICML | Binary Partitions with Approximate Minimum Impurity. | Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira |
| 2017 | LAK | Developing institutional learning analytics 'communities of transformation' to support student success. | Leah Macfadyen, Dennis P. Groth, George Rehrey, Linda Shepard, Jim E. Greer, Douglas Ward, Caroline Bennett, Jake Kaupp, Marco Molinaro, Matthew Steinwachs |
| 2017 | SODA | Online and Random-order Load Balancing Simultaneously. | Marco Molinaro |
| 2016 | IPCO | Minimal Cut-Generating Functions are Nearly Extreme. | Amitabh Basu, Robert Hildebrand, Marco Molinaro |
| 2016 | LAK | Learning analytics for curriculum and program quality improvement (PCLA 2016). | Jim E. Greer, Marco Molinaro, Xavier Ochoa, Timothy A. McKay |
| 2016 | LAK | Promoting Instructor and Department Action via Simple, Actionable Tools and Analyses. | Marco Molinaro, Matthew Steinwachs, Qiwei Li, Alberto Guzman-Alvarez |
| 2015 | ICALP | Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2014 | ESA | How Experts Can Solve LPs Online. | Anupam Gupta, Marco Molinaro |
| 2014 | IPCO | How Good Are Sparse Cutting-Planes? | Santanu S. Dey, Marco Molinaro, Qianyi Wang |
| 2013 | SODA | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2012 | ICALP | Geometry of Online Packing Linear Programs. | Marco Molinaro, R. Ravi |
| 2011 | FOCS | Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi |
| 2011 | IPCO | A Probabilistic Analysis of the Strength of the Split and Triangle Closures. | Amitabh Basu, Grard Cornujols, Marco Molinaro |
| 2011 | IPCO | Capacitated Vehicle Routing with Non-uniform Speeds. | Inge Li Grtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi |
| 2010 | ICALP | On the Complexity of Searching in Trees: Average-Case Minimization. | Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro |
| 2010 | ISAAC | On Greedy Algorithms for Decision Trees. | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro |
| 2008 | ICALP | An Approximation Algorithm for Binary Searching in Trees. | Eduardo Sany Laber, Marco Molinaro |