A Multi-Agent Architecture for a Dynamic Supply Chain Management. - José Alberto R. P. Sardinha; Marco S. Molinaro 001; Patrick M. Paranhos; Pedro M. Cunha; Ruy Luiz Milidiú; Carlos José Pereira de Lucena (FLAIRS, 2006)

On the Complexity of Searching in Trees: Average-case Minimization - Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (CoRR, 2009)

On the Complexity of Searching in Trees: Average-Case Minimization. - Tobias Jacobs; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (ICALP (1), 2010)

On Greedy Algorithms for Decision Trees. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (ISAAC (2), 2010)

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. - Anupam Gupta 001; Ravishankar Krishnaswamy; Marco Molinaro 001; R. Ravi 001 (FOCS, 2011)

A Probabilistic Analysis of the Strength of the Split and Triangle Closures. - Amitabh Basu; Gérard Cornuéjols; Marco Molinaro 001 (IPCO, 2011)

Capacitated Vehicle Routing with Non-uniform Speeds. - Inge Li Gørtz; Marco Molinaro 001; Viswanath Nagarajan; R. Ravi 001 (IPCO, 2011)

An Approximation Algorithm for Binary Searching in Trees. - Eduardo Sany Laber; Marco Molinaro 001 (Algorithmica, 2011)

The Query-commit Problem - Marco Molinaro 001; R. Ravi 001 (CoRR, 2011)

Improved approximations for the hotlink assignment problem. - Eduardo Sany Laber; Marco Molinaro 001 (ACM Trans. Algorithms, 2011)

On the complexity of searching in trees and partially ordered structures. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2011)

Limitations of Local Filters of Lipschitz and Monotone Functions. - Pranjal Awasthi; Madhav Jha; Marco Molinaro 001; Sofya Raskhodnikova (Electron. Colloquium Comput. Complex., 2012)

Testing Lipschitz Functions on Hypergrid Domains. - Pranjal Awasthi; Madhav Jha; Marco Molinaro 001; Sofya Raskhodnikova (Electron. Colloquium Comput. Complex., 2012)

Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. - Marco Molinaro 001; David P. Woodruff; Grigory Yaroslavtsev (SODA, 2013)

A 3-Slope Theorem for the infinite relaxation in the plane. - Gérard Cornuéjols; Marco Molinaro 001 (Math. Program., 2013)

Cutting planes from two-term disjunctions. - Pierre Bonami; Michele Conforti; Gérard Cornuéjols; Marco Molinaro 001; Giacomo Zambelli (Oper. Res. Lett., 2013)

Lifting Gomory cuts with bounded variables. - Gérard Cornuéjols; Tamás Kis; Marco Molinaro 001 (Oper. Res. Lett., 2013)

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. - Amitabh Basu; Robert Hildebrand; Matthias Köppe; Marco Molinaro 001 (SIAM J. Optim., 2013)

How Experts Can Solve LPs Online. - Anupam Gupta 001; Marco Molinaro 001 (ESA, 2014)

How Good Are Sparse Cutting-Planes? - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (IPCO, 2014)

Improved Approximation Algorithms for the Average-Case Tree Searching Problem. - Ferdinando Cicalese; Tobias Jacobs; Eduardo Sany Laber; Marco Molinaro 001 (Algorithmica, 2014)

The Geometry of Online Packing Linear Programs. - Marco Molinaro 001; R. Ravi 001 (Math. Oper. Res., 2014)

On the relative strength of different generalizations of split cuts. - Sanjeeb Dash; Oktay Günlük; Marco Molinaro 001 (Discret. Optim., 2015)

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. - Marco Molinaro 001; David P. Woodruff; Grigory Yaroslavtsev (Electron. Colloquium Comput. Complex., 2015)

Characterization of the split closure via geometric lifting. - Amitabh Basu; Marco Molinaro 001 (Eur. J. Oper. Res., 2015)

Approximating polyhedra with sparse inequalities. - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (Math. Program., 2015)

Some lower bounds on sparse outer approximations of polytopes. - Santanu S. Dey; Andres Iroume; Marco Molinaro 001 (Oper. Res. Lett., 2015)

Capacitated Vehicle Routing with Nonuniform Speeds. - Inge Li Gørtz; Marco Molinaro 001; Viswanath Nagarajan; R. Ravi 001 (Math. Oper. Res., 2016)

How the Experts Algorithm Can Help Solve LPs Online. - Anupam Gupta 001; Marco Molinaro 001 (Math. Oper. Res., 2016)

Online and Random-order Load Balancing Simultaneously. - Marco Molinaro 001 (SODA, 2017)

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. - Natashia Boland; Santanu S. Dey; Thomas Kalinowski; Marco Molinaro 001; Fabian Rigterink (Math. Program., 2017)

Mixed-integer quadratic programming is in NP. - Alberto Del Pia; Santanu S. Dey; Marco Molinaro 001 (Math. Program., 2017)

Maximizing Profit with Convex Costs in the Random-order Model. - Anupam Gupta 001; Ruta Mehta; Marco Molinaro 001 (ICALP, 2018)

Binary Partitions with Approximate Minimum Impurity. - Eduardo Sany Laber; Marco Molinaro 001; Felipe de A. Mello Pereira (ICML, 2018)

Stochastic 𝓁p Load Balancing and Moment Problems via the L-Function Method. - Marco Molinaro 001 (CoRR, 2018)

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (Math. Oper. Res., 2018)

Minimal cut-generating functions are nearly extreme. - Amitabh Basu; Robert Hildebrand; Marco Molinaro 001 (Math. Program., 2018)

Aggregation-based cutting-planes for packing and covering integer programs. - Merve Bodur; Alberto Del Pia; Santanu S. Dey; Marco Molinaro 001; Sebastian Pokutta (Math. Program., 2018)

Theoretical challenges towards cutting-plane selection. - Santanu S. Dey; Marco Molinaro 001 (Math. Program., 2018)

Improving the Randomization Step in Feasibility Pump. - Santanu S. Dey; Andres Iroume; Marco Molinaro 001; Domenico Salvagnin (SIAM J. Optim., 2018)

k-Servers with a Smile: Online Algorithms via Projections. - Niv Buchbinder; Anupam Gupta 001; Marco Molinaro 001; Joseph (Seffi) Naor (SODA, 2019)

Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method. - Marco Molinaro 001 (SODA, 2019)

Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. - Merve Bodur; Alberto Del Pia; Santanu S. Dey; Marco S. Molinaro 001 (SIAM J. Optim., 2019)

Knapsack Secretary with Bursty Adversary. - Thomas Kesselheim; Marco Molinaro 001 (ICALP, 2020)

Teaching with Limited Information on the Learner's Behaviour. - Ferdinando Cicalese; Sergio Filho; Eduardo Sany Laber; Marco Molinaro 001 (ICML, 2020)

Curvature of Feasible Sets in Offline and Online Optimization. - Marco Molinaro 001 (CoRR, 2020)

Branch-and-Bound Solves Random Binary Packing IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (CoRR, 2020)

Branch-and-Bound Solves Random Binary IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (SODA, 2021)

Robust Algorithms for Online Convex Problems via Primal-Dual. - Marco Molinaro 001 (SODA, 2021)

Robust Secretary and Prophet Algorithms for Packing Integer Programs. - C. J. Argue; Anupam Gupta 001; Marco Molinaro 001; Sahil Singla 001 (SODA, 2022)

Time-Constrained Learning. - Sergio Filho; Eduardo Sany Laber; Pedro Lazera; Marco Molinaro 001 (CoRR, 2022)

Online and Bandit Algorithms Beyond 𝓁p Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (CoRR, 2022)

Sparse PSD approximation of the PSD cone. - Grigoriy Blekherman; Santanu S. Dey; Marco Molinaro 001; Shengding Sun (Math. Program., 2022)

Online Demand Scheduling with Failovers. - Konstantina Mellou; Marco Molinaro 001; Rudy Zhou (ICALP, 2023)

Online and Bandit Algorithms Beyond ℓp Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (SODA, 2023)

Branch-and-bound solves random binary IPs in poly(n)-time. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

Lower bounds on the size of general branch-and-bound trees. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

Strong Convexity of Feasible Sets in Off-line and Online Optimization. - Marco Molinaro 001 (Math. Oper. Res., 2023)

Solving sparse principal component analysis with global support. - Santanu S. Dey; Marco Molinaro 001; Guanyi Wang (Math. Program., 2023)

Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. - C. J. Argue; Anupam Gupta 001; Marco Molinaro 001 (Discret. Comput. Geom., 2023)

Time-constrained learning. - Sérgio Freitas; Eduardo Sany Laber; Pedro Lazera; Marco Molinaro 001 (Pattern Recognit., 2023)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles. - Phillip A. Kerger; Marco Molinaro 001; Hongyi Jiang; Amitabh Basu (ICML, 2024)

Supermodular Approximation of Norms and Applications. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (STOC, 2024)

A theoretical and computational analysis of full strong-branching. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001; Prachi Shah (Math. Program., 2024)

The Power of Migrations in Dynamic Bin Packing. - Konstantina Mellou; Marco Molinaro 001; Rudy Zhou (Proc. ACM Meas. Anal. Comput. Syst., 2024)

Decision trees with short explainable rules. - Victor Feitosa Souza; Ferdinando Cicalese; Eduardo Sany Laber; Marco Molinaro 001 (Theor. Comput. Sci., 2025)

Information complexity of mixed-integer convex optimization. - Amitabh Basu; Hongyi Jiang; Phillip A. Kerger; Marco Molinaro 001 (Math. Program., 2025)