I agree that this site is using cookies. You can find further informations here.
X
Molinaro, Marco
549  results:
Search for persons X
?
1

Systemic advantage has a meaningful relationship with grade..:

Castle, Sarah D. ; Byrd, W. Carson ; Koester, Benjamin P....
International Journal of STEM Education.  11 (2024)  1 - p. , 2024
Link: https://doi.org/10.1186/..
 
?
2

Evidence of Kelvin-Helmholtz and tearing mode instabilities..:

Biasiotti, Lorenzo ; Ivanovski, Stavro ; Calderone, Lorenzo...
Frontiers in Astronomy and Space Sciences.  11 (2024)  - p. , 2024
Link: https://doi.org/10.3389/..
 
?
3

Supermodular Approximation of Norms and Applications:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Kesselheim, Thomas ; Molinaro, Marco ; Singla, Sahil - p. 1841-1852 , 2024
Link: https://dl.acm.org/doi/1..
 
?
4

Information complexity of mixed-integer convex optimization:

Basu, Amitabh ; Jiang, Hongyi ; Kerger, Phillip.
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
5

Time-constrained learning:

Freitas, Sergio ; Laber, Eduardo ; Lazera, Pedro.
Pattern Recognition.  142 (2023)  - p. 109672 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Lipschitz Selectors May Not Yield Competitive Algorithms fo..:

Argue, C. J. ; Gupta, Anupam ; Molinaro, Marco
Discrete & Computational Geometry.  70 (2023)  3 - p. 773-789 , 2023
Link: https://doi.org/10.1007/..
 
?
7

A theoretical and computational analysis of full strong-bra..:

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco.
Mathematical Programming.  205 (2023)  1-2 - p. 303-336 , 2023
Link: https://doi.org/10.1007/..
 
?
8

Information Complexity of Mixed-Integer Convex Optimization:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Basu, Amitabh ; Jiang, Hongyi ; Kerger, Phillip. - p. 1-13 , 2023
Link: https://doi.org/10.1007/..
 
?
9

The benefits of cognitive style versatility for collaborati..:

Aggarwal, Ishani ; Schilpzand, Marieke C. ; Martins, Luis L...
Journal of Applied Psychology.  108 (2023)  4 - p. 647-659 , 2023
Link: https://doi.org/10.1037/..
 
?
10

Branch-and-bound solves random binary IPs in poly(n)-time:

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco
Mathematical Programming.  200 (2022)  1 - p. 569-587 , 2022
Link: https://doi.org/10.1007/..
 
?
11

Solving sparse principal component analysis with global sup..:

Dey, Santanu S. ; Molinaro, Marco ; Wang, Guanyi
Mathematical Programming.  199 (2022)  1-2 - p. 421-459 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Lower bounds on the size of general branch-and-bound trees:

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco
Mathematical Programming.  198 (2022)  1 - p. 539-559 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Branch-and-bound solves random binary IPs in polytime:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco - p. 579-591 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Branch-and-Bound Solves Random Binary IPs in Polytime:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco - p. 579-591 , 2021
Link: https://doi.org/10.1137/..
 
?
15

Robust Algorithms for Online Convex Problems via Primal-Dua:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Molinaro, Marco - p. 2078-2092 , 2021
Link: https://doi.org/10.1137/..
 
1-15