Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Molinaro 0001
Person information
- affiliation: Pontifical Catholic University of Rio de Janeiro (PUC-RIo), Brazil
Other persons with the same name
- Marco Molinaro 0002
![[0000-0001-8922-6978]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8922-6978")
— University of California Davis, CA, USA - Marco Molinaro 0003 — INAF-Astronomical Observatory of Trieste, Italy
- Marco Molinaro 0004 — Microsoft Research, Redmond, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah:
A theoretical and computational analysis of full strong-branching. Math. Program. 205(1): 303-336 (2024)- [c30]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Supermodular Approximation of Norms and Applications. STOC 2024: 1841-1852 - [i25]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Supermodular Approximation of Norms and Applications. CoRR abs/2406.15180 (2024) - 2023
- [j32]C. J. Argue, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. 70(3): 773-789 (2023) - [j31]Marco Molinaro:
Strong Convexity of Feasible Sets in Off-line and Online Optimization. Math. Oper. Res. 48(2): 865-884 (2023) - [j30]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1): 539-559 (2023) - [j29]Santanu S. Dey, Marco Molinaro, Guanyi Wang:
Solving sparse principal component analysis with global support. Math. Program. 199(1): 421-459 (2023) - [j28]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200(1): 569-587 (2023) - [j27]Sérgio Freitas, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro:
Time-constrained learning. Pattern Recognit. 142: 109672 (2023) - [c29]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
Online Demand Scheduling with Failovers. ICALP 2023: 92:1-92:20 - [c28]Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro:
Information Complexity of Mixed-Integer Convex Optimization. IPCO 2023: 1-13 - [c27]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond ℓp Norms. SODA 2023: 1566-1593 - 2022
- [j26]Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun:
Sparse PSD approximation of the PSD cone. Math. Program. 191(2): 981-1004 (2022) - [c26]Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
Decision Trees with Short Explainable Rules. NeurIPS 2022 - [c25]C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA 2022: 1273-1297 - [i24]Sergio Filho, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro:
Time-Constrained Learning. CoRR abs/2202.01913 (2022) - [i23]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
Online Demand Scheduling with Failovers. CoRR abs/2209.00710 (2022) - [i22]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond 𝓁p Norms. CoRR abs/2210.13755 (2022) - 2021
- [c24]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-Bound Solves Random Binary IPs in Polytime. SODA 2021: 579-591 - [c23]Marco Molinaro:
Robust Algorithms for Online Convex Problems via Primal-Dual. SODA 2021: 2078-2092 - [i21]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower Bounds on the Size of General Branch-and-Bound Trees. CoRR abs/2103.09807 (2021) - [i20]C. J. Argue, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR abs/2104.07487 (2021) - [i19]C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR abs/2112.12920 (2021) - 2020
- [c22]Thomas Kesselheim, Marco Molinaro:
Knapsack Secretary with Bursty Adversary. ICALP 2020: 72:1-72:15 - [c21]Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro:
Teaching with Limited Information on the Learner's Behaviour. ICML 2020: 2016-2026 - [i18]Marco Molinaro:
Curvature of Feasible Sets in Offline and Online Optimization. CoRR abs/2002.03213 (2020) - [i17]Thomas Kesselheim, Marco Molinaro:
Knapsack Secretary with Bursty Adversary. CoRR abs/2006.11607 (2020) - [i16]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-Bound Solves Random Binary Packing IPs in Polytime. CoRR abs/2007.15192 (2020) - [i15]Marco Molinaro:
Robust Algorithms for Online Convex Problems via Primal-Dual. CoRR abs/2011.01435 (2020)
2010 – 2019
- 2019
- [j25]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco S. Molinaro:
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. SIAM J. Optim. 29(1): 55-76 (2019) - [c20]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor:
k-Servers with a Smile: Online Algorithms via Projections. SODA 2019: 98-116 - [c19]Marco Molinaro:
Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method. SODA 2019: 343-354 - 2018
- [j24]Santanu S. Dey, Marco Molinaro, Qianyi Wang:
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. Math. Oper. Res. 43(1): 304-332 (2018) - [j23]Santanu S. Dey, Marco Molinaro:
Theoretical challenges towards cutting-plane selection. Math. Program. 170(1): 237-266 (2018) - [j22]Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta:
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171(1-2): 331-359 (2018) - [j21]Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal cut-generating functions are nearly extreme. Math. Program. 172(1-2): 329-349 (2018) - [j20]Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin:
Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. 28(1): 355-378 (2018) - [c18]Anupam Gupta, Ruta Mehta, Marco Molinaro:
Maximizing Profit with Convex Costs in the Random-order Model. ICALP 2018: 71:1-71:14 - [c17]Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira:
Binary Partitions with Approximate Minimum Impurity. ICML 2018: 2860-2868 - [i14]Anupam Gupta, Ruta Mehta, Marco Molinaro:
Maximizing Profit with Convex Costs in the Random-order Model. CoRR abs/1804.08172 (2018) - [i13]Marco Molinaro:
Stochastic 𝓁p Load Balancing and Moment Problems via the L-Function Method. CoRR abs/1810.05245 (2018) - [i12]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor:
k-Servers with a Smile: Online Algorithms via Projections. CoRR abs/1810.07508 (2018) - 2017
- [j19]Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer quadratic programming is in NP. Math. Program. 162(1-2): 225-240 (2017) - [j18]Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink:
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162(1-2): 523-535 (2017) - [c16]Marco Molinaro:
Online and Random-order Load Balancing Simultaneously. SODA 2017: 1638-1650 - 2016
- [j17]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. Algorithmica 74(3): 1055-1081 (2016) - [j16]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41(1): 318-331 (2016) - [j15]Anupam Gupta, Marco Molinaro:
How the Experts Algorithm Can Help Solve LPs Online. Math. Oper. Res. 41(4): 1404-1431 (2016) - [c15]Amitabh Basu, Robert Hildebrand, Marco Molinaro:
Minimal Cut-Generating Functions are Nearly Extreme. IPCO 2016: 202-213 - [i11]Marco Molinaro:
Online and Random-order Load Balancing Simultaneously. CoRR abs/1610.07639 (2016) - 2015
- [j14]Sanjeeb Dash, Oktay Günlük, Marco Molinaro:
On the relative strength of different generalizations of split cuts. Discret. Optim. 16: 36-50 (2015) - [j13]Amitabh Basu, Marco Molinaro:
Characterization of the split closure via geometric lifting. Eur. J. Oper. Res. 243(3): 745-751 (2015) - [j12]Santanu S. Dey, Marco Molinaro, Qianyi Wang:
Approximating polyhedra with sparse inequalities. Math. Program. 154(1-2): 329-352 (2015) - [j11]Santanu S. Dey, Andres Iroume, Marco Molinaro:
Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43(3): 323-328 (2015) - [c14]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. ICALP (1) 2015: 960-972 - [i10]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j10]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68(4): 1045-1074 (2014) - [j9]Marco Molinaro, R. Ravi:
The Geometry of Online Packing Linear Programs. Math. Oper. Res. 39(1): 46-59 (2014) - [j8]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. ACM Trans. Comput. Theory 7(1): 2:1-2:16 (2014) - [c13]Anupam Gupta, Marco Molinaro:
How Experts Can Solve LPs Online. ESA 2014: 517-529 - [c12]Santanu S. Dey, Marco Molinaro, Qianyi Wang:
How Good Are Sparse Cutting-Planes? IPCO 2014: 261-272 - [i9]Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer Quadratic Programming is in NP. CoRR abs/1407.4798 (2014) - [i8]Anupam Gupta, Marco Molinaro:
How the Experts Algorithm Can Help Solve LPs Online. CoRR abs/1407.5298 (2014) - 2013
- [j7]Gérard Cornuéjols, Marco Molinaro:
A 3-Slope Theorem for the infinite relaxation in the plane. Math. Program. 142(1-2): 83-105 (2013) - [j6]Gérard Cornuéjols, Tamás Kis, Marco Molinaro:
Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41(2): 142-146 (2013) - [j5]Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5): 442-444 (2013) - [j4]Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro:
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23(2): 1021-1040 (2013) - [c11]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. SODA 2013: 1738-1756 - 2012
- [c10]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM 2012: 374-386 - [c9]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM 2012: 387-398 - [c8]Marco Molinaro, R. Ravi:
Geometry of Online Packing Linear Programs. ICALP (1) 2012: 701-713 - [i7]Marco Molinaro, R. Ravi:
Geometry of Online Packing Linear Programs. CoRR abs/1204.5810 (2012) - [i6]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i5]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j3]Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59(4): 601-620 (2011) - [j2]Eduardo Sany Laber, Marco Molinaro:
Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms 7(3): 39:1-39:34 (2011) - [j1]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412(50): 6879-6896 (2011) - [c7]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836 - [c6]Amitabh Basu, Gérard Cornuéjols, Marco Molinaro:
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011: 27-38 - [c5]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247 - [i4]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits. CoRR abs/1102.3749 (2011) - [i3]Marco Molinaro, R. Ravi:
The Query-commit Problem. CoRR abs/1110.0990 (2011) - 2010
- [c4]Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 - [c3]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On Greedy Algorithms for Decision Trees. ISAAC (2) 2010: 206-217 - [i2]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Non-Uniform Speeds. CoRR abs/1012.1850 (2010)
2000 – 2009
- 2009
- [i1]Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-case Minimization. CoRR abs/0904.3503 (2009) - 2008
- [c2]Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. ICALP (1) 2008: 459-471 - 2006
- [c1]José Alberto R. P. Sardinha, Marco S. Molinaro, Patrick M. Paranhos, Pedro M. Cunha, Ruy Luiz Milidiú, Carlos José Pereira de Lucena:
A Multi-Agent Architecture for a Dynamic Supply Chain Management. FLAIRS 2006: 178-179
Coauthor Index
aka: Santanu S. Dey
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
