- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j5 |      | Gérard Cornuéjols, Tamás Kis, Marco Molinaro: Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41(2): 142-146 (2013) |
| c10 | | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev: Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. SODA 2013: 1738-1756 |
| 2012 | ||
| c9 | | Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova: Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM 2012: 374-386 |
| c8 | | Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova: Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM 2012: 387-398 |
| c7 | | |
| i7 | | |
| i6 | | Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova: Limitations of Local Filters of Lipschitz and Monotone Functions. Electronic Colloquium on Computational Complexity (ECCC) 19: 75 (2012) |
| i5 | | Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova: Testing Lipschitz Functions on Hypergrid Domains. Electronic Colloquium on Computational Complexity (ECCC) 19: 76 (2012) |
| 2011 | ||
| j4 | | Eduardo Sany Laber, Marco Molinaro: An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59(4): 601-620 (2011) |
| j3 | | Eduardo Sany Laber, Marco Molinaro: Improved approximations for the hotlink assignment problem. ACM Transactions on Algorithms 7(3): 39 (2011) |
| j2 | | 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) |
| c6 | | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836 |
| c5 | | Amitabh Basu, Gérard Cornuéjols, Marco Molinaro: A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011: 27-38 |
| c4 | | 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 | | |
| 2010 | ||
| j1 | | Giuliano Taffoni, Santi Cassisi, Patrizia Manzato, Marco Molinaro, Fabio Pasian, Adriano Pietrinferni, Maurizio Salaris, Claudio Vuerli: Grid and Databases: BaSTI as a Practical Integration Example. J. Grid Comput. 8(2): 223-240 (2010) |
| c3 | | Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro: On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 |
| c2 | | 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) |
| 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 | ||
| c1 | | Eduardo Sany Laber, Marco Molinaro: An Approximation Algorithm for Binary Searching in Trees. ICALP (1) 2008: 459-471 |
Colors in the list of coauthors
Last update Thu May 23 08:36:08 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page