Marco Molinaro

97 papers A* 19A 1B 5Journal 64Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Learning Perspective on Random-Order Covering Problems. SOSA Anupam Gupta, Marco Molinaro, Matteo Russo
2026	A*	`conf`	Learning Packing and Covering from Samples. SODA Anupam Gupta, Marco Molinaro
2026	J	`jnl`	Non-Monotonicity of Branching Rules with Respect to Linear Relaxations. INFORMS J. Comput. Prachi Shah, Santanu S. Dey, Marco Molinaro
2025	J	`jnl`	A Learning Perspective on Random-Order Covering Problems. CoRR Anupam Gupta, Marco Molinaro, Matteo Russo
2025	J	`jnl`	Decision trees with short explainable rules. Theor. Comput. Sci. Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2025	J	`jnl`	Information complexity of mixed-integer convex optimization. Math. Program. Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
2025	A*	`conf`	Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives. FOCS Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla
2025	J	`jnl`	Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives. CoRR Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla
2024	A*	`conf`	A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles. ICML Phillip A. Kerger, Marco Molinaro, Hongyi Jiang, Amitabh Basu
2024	J	`jnl`	A theoretical and computational analysis of full strong-branching. Math. Program. Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
2024	A*	`conf`	Supermodular Approximation of Norms and Applications. STOC Thomas Kesselheim, Marco Molinaro, Sahil Singla
2024	J	`jnl`	Supermodular Approximation of Norms and Applications. CoRR Thomas Kesselheim, Marco Molinaro, Sahil Singla
2024	J	`jnl`	The Power of Migrations in Dynamic Bin Packing. CoRR Konstantina Mellou, Marco Molinaro, Rudy Zhou
2024	J	`jnl`	The Power of Migrations in Dynamic Bin Packing. Proc. ACM Meas. Anal. Comput. Syst. Konstantina Mellou, Marco Molinaro, Rudy Zhou
2023	J	`jnl`	Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. Santanu S. Dey, Yatharth Dubey, Marco Molinaro
2023	B	`conf`	Information Complexity of Mixed-Integer Convex Optimization. IPCO Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
2023	J	`jnl`	Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. C. J. Argue, Anupam Gupta, Marco Molinaro
2023	J	`jnl`	Lower bounds on the size of general branch-and-bound trees. Math. Program. Santanu S. Dey, Yatharth Dubey, Marco Molinaro
2023	A*	`conf`	Online Demand Scheduling with Failovers. ICALP Konstantina Mellou, Marco Molinaro, Rudy Zhou
2023	A*	`conf`	Online and Bandit Algorithms Beyond ℓ SODA Thomas Kesselheim, Marco Molinaro, Sahil Singla
2023	J	`jnl`	Solving sparse principal component analysis with global support. Math. Program. Santanu S. Dey, Marco Molinaro, Guanyi Wang
2023	J	`jnl`	Strong Convexity of Feasible Sets in Off-line and Online Optimization. Math. Oper. Res. Marco Molinaro
2023	J	`jnl`	Time-constrained learning. Pattern Recognit. Sérgio Freitas, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
2022	A*	`conf`	Decision Trees with Short Explainable Rules. NeurIPS Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2022	J	`jnl`	Online Demand Scheduling with Failovers. CoRR Konstantina Mellou, Marco Molinaro, Rudy Zhou
2022	J	`jnl`	Online and Bandit Algorithms Beyond 𝓁 CoRR Thomas Kesselheim, Marco Molinaro, Sahil Singla
2022	A*	`conf`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2022	J	`jnl`	Sparse PSD approximation of the PSD cone. Math. Program. Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
2022	J	`jnl`	Time-Constrained Learning. CoRR Sergio Filho, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
2021	A*	`conf`	Branch-and-Bound Solves Random Binary IPs in Polytime. SODA Santanu S. Dey, Yatharth Dubey, Marco Molinaro
2021	J	`jnl`	Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro
2021	J	`jnl`	Lower Bounds on the Size of General Branch-and-Bound Trees. CoRR Santanu S. Dey, Yatharth Dubey, Marco Molinaro
2021	A*	`conf`	Robust Algorithms for Online Convex Problems via Primal-Dual. SODA Marco Molinaro
2021	J	`jnl`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2020	J	`jnl`	Branch-and-Bound Solves Random Binary Packing IPs in Polytime. CoRR Santanu S. Dey, Yatharth Dubey, Marco Molinaro
2020	J	`jnl`	Curvature of Feasible Sets in Offline and Online Optimization. CoRR Marco Molinaro
2020	A*	`conf`	Knapsack Secretary with Bursty Adversary. ICALP Thomas Kesselheim, Marco Molinaro
2020	J	`jnl`	Knapsack Secretary with Bursty Adversary. CoRR Thomas Kesselheim, Marco Molinaro
2020	J	`jnl`	Robust Algorithms for Online Convex Problems via Primal-Dual. CoRR Marco Molinaro
2020	A*	`conf`	Teaching with Limited Information on the Learner's Behaviour. ICML Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro
2019	A*	`conf`	Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method. SODA Marco Molinaro
2019	A*	`conf`	k-Servers with a Smile: Online Algorithms via Projections. SODA Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
2018	J	`jnl`	Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta
2018	J	`jnl`	Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. Math. Oper. Res. Santanu S. Dey, Marco Molinaro, Qianyi Wang
2018	A*	`conf`	Binary Partitions with Approximate Minimum Impurity. ICML Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira
2018	J	`jnl`	Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
2018	A*	`conf`	Maximizing Profit with Convex Costs in the Random-order Model. ICALP Anupam Gupta, Ruta Mehta, Marco Molinaro
2018	J	`jnl`	Maximizing Profit with Convex Costs in the Random-order Model. CoRR Anupam Gupta, Ruta Mehta, Marco Molinaro
2018	J	`jnl`	Minimal cut-generating functions are nearly extreme. Math. Program. Amitabh Basu, Robert Hildebrand, Marco Molinaro
2018	J	`jnl`	Stochastic 𝓁 CoRR Marco Molinaro
2018	J	`jnl`	Theoretical challenges towards cutting-plane selection. Math. Program. Santanu S. Dey, Marco Molinaro
2018	J	`jnl`	k-Servers with a Smile: Online Algorithms via Projections. CoRR Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
2017	J	`jnl`	Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink
2017	J	`jnl`	Mixed-integer quadratic programming is in NP. Math. Program. Alberto Del Pia, Santanu S. Dey, Marco Molinaro
2017	A*	`conf`	Online and Random-order Load Balancing Simultaneously. SODA Marco Molinaro
2016	J	`jnl`	Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2016	J	`jnl`	How the Experts Algorithm Can Help Solve LPs Online. Math. Oper. Res. Anupam Gupta, Marco Molinaro
2016	B	`conf`	Minimal Cut-Generating Functions are Nearly Extreme. IPCO Amitabh Basu, Robert Hildebrand, Marco Molinaro
2016	J	`jnl`	Online and Random-order Load Balancing Simultaneously. CoRR Marco Molinaro
2016	J	`jnl`	Testing Lipschitz Functions on Hypergrid Domains. Algorithmica Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2015	—	`conf`	Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. ICALP (1) Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
2015	J	`jnl`	Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. Electron. Colloquium Comput. Complex. Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
2015	J	`jnl`	Approximating polyhedra with sparse inequalities. Math. Program. Santanu S. Dey, Marco Molinaro, Qianyi Wang
2015	J	`jnl`	Characterization of the split closure via geometric lifting. Eur. J. Oper. Res. Amitabh Basu, Marco Molinaro
2015	J	`jnl`	On the relative strength of different generalizations of split cuts. Discret. Optim. Sanjeeb Dash, Oktay Günlük, Marco Molinaro
2015	J	`jnl`	Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. Santanu S. Dey, Andres Iroume, Marco Molinaro
2014	A	`conf`	How Experts Can Solve LPs Online. ESA Anupam Gupta, Marco Molinaro
2014	B	`conf`	How Good Are Sparse Cutting-Planes? IPCO Santanu S. Dey, Marco Molinaro, Qianyi Wang
2014	J	`jnl`	How the Experts Algorithm Can Help Solve LPs Online. CoRR Anupam Gupta, Marco Molinaro
2014	J	`jnl`	Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2014	J	`jnl`	Limitations of Local Filters of Lipschitz and Monotone Functions. ACM Trans. Comput. Theory Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2014	J	`jnl`	Mixed-integer Quadratic Programming is in NP. CoRR Alberto Del Pia, Santanu S. Dey, Marco Molinaro
2014	J	`jnl`	The Geometry of Online Packing Linear Programs. Math. Oper. Res. Marco Molinaro, R. Ravi
2013	J	`jnl`	A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro
2013	J	`jnl`	A 3-Slope Theorem for the infinite relaxation in the plane. Math. Program. Gérard Cornuéjols, Marco Molinaro
2013	A*	`conf`	Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. SODA Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
2013	J	`jnl`	Cutting planes from two-term disjunctions. Oper. Res. Lett. Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
2013	J	`jnl`	Lifting Gomory cuts with bounded variables. Oper. Res. Lett. Gérard Cornuéjols, Tamás Kis, Marco Molinaro
2012	J	`jnl`	Geometry of Online Packing Linear Programs CoRR Marco Molinaro, R. Ravi
2012	—	`conf`	Geometry of Online Packing Linear Programs. ICALP (1) Marco Molinaro, R. Ravi
2012	—	`conf`	Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2012	J	`jnl`	Limitations of Local Filters of Lipschitz and Monotone Functions. Electron. Colloquium Comput. Complex. Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2012	—	`conf`	Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2012	J	`jnl`	Testing Lipschitz Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
2011	B	`conf`	A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
2011	J	`jnl`	An Approximation Algorithm for Binary Searching in Trees. Algorithmica Eduardo Sany Laber, Marco Molinaro
2011	J	`jnl`	Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits CoRR Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011	A*	`conf`	Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011	B	`conf`	Capacitated Vehicle Routing with Non-uniform Speeds. IPCO Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2011	J	`jnl`	Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms Eduardo Sany Laber, Marco Molinaro
2011	J	`jnl`	On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2011	J	`jnl`	The Query-commit Problem CoRR Marco Molinaro, R. Ravi
2010	J	`jnl`	Capacitated Vehicle Routing with Non-Uniform Speeds CoRR Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2010	—	`conf`	On Greedy Algorithms for Decision Trees. ISAAC (2) Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
2010	—	`conf`	On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2009	J	`jnl`	On the Complexity of Searching in Trees: Average-case Minimization CoRR Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
2008	—	`conf`	An Approximation Algorithm for Binary Searching in Trees. ICALP (1) Eduardo Sany Laber, Marco Molinaro