| Why do hubs in the yeast protein interaction network tend to be essential: reexamining the connection between the network topology and essentiality E Zotenko, J Mestre, DP O'Leary, TM Przytycka PLoS computational biology 4 (8), e1000140, 2008 | 476 | 2008 |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings N Bansal, A Gupta, J Li, J Mestre, V Nagarajan, A Rudra Algorithms–ESA 2010, 218-229, 2010 | 168 | 2010 |
| Greedy in approximation algorithms J Mestre Algorithms–ESA 2006, 528-539, 2006 | 136 | 2006 |
| Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58 (1), 119-136, 2010 | 127 | 2010 |
| Improved approximation guarantees for weighted matching in the semi-streaming model L Epstein, A Levin, J Mestre, D Segev SIAM Journal on Discrete Mathematics 25 (3), 1251-1265, 2011 | 116 | 2011 |
| Popular mixed matchings T Kavitha, J Mestre, M Nasre Theoretical Computer Science 412 (24), 2679-2690, 2011 | 97 | 2011 |
| To fill or not to fill: The gas station problem S Khuller, A Malekian, J Mestre ACM Transactions on Algorithms (TALG) 7 (3), 1-16, 2011 | 81 | 2011 |
| To fill or not to fill: the gas station problem S Khuller, A Malekian, J Mestre Algorithms–ESA 2007, 534-545, 2007 | 76 | 2007 |
| Weighted popular matchings J Mestre Automata, languages and programming, 715-726, 2006 | 61 | 2006 |
| Improved approximations for guarding 1.5-dimensional terrains K Elbassioni, E Krohn, D Matijević, J Mestre, D Ševerdija Algorithmica 60 (2), 451-463, 2011 | 58 | 2011 |
| A primal-dual approximation algorithm for min-sum single-machine scheduling problems M Cheung, J Mestre, DB Shmoys, J Verschae SIAM Journal on Discrete Mathematics 31 (2), 825-838, 2017 | 56 | 2017 |
| Welfare maximization in fractional hedonic games H Aziz, S Gaspers, J Gudmundsson, J Mestre, H Taubig Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 46 | 2015 |
| Universal sequencing on an unreliable machine L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ... SIAM Journal on Computing 41 (3), 565-586, 2012 | 41 | 2012 |
| MobiTribe: Cost efficient distributed user generated content sharing on smartphones K Thilakarathna, H Petander, J Mestre, A Seneviratne IEEE Transactions on Mobile Computing 13 (9), 2058-2070, 2013 | 37 | 2013 |
| Parametric packing of selfish items and the subset sum algorithm L Epstein, E Kleiman, J Mestre Internet and Network Economics, 67-78, 2009 | 35* | 2009 |
| A primal-dual approximation algorithm for partial vertex cover: Making educated guesses J Mestre Algorithmica 55 (1), 227-239, 2009 | 34 | 2009 |
| A distributed algorithm for large-scale generalized matching F Makari, B Awerbuch, R Gemulla, R Khandekar, J Mestre, M Sozio Max-Planck-Institut für Informatik, 2013 | 30 | 2013 |
| Universal sequencing on a single machine L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ... Integer Programming and Combinatorial Optimization, 230-243, 2010 | 26 | 2010 |
| How unsplittable-flow-covering helps scheduling with job-dependent cost functions W Höhn, J Mestre, A Wiese Algorithmica 80 (4), 1191-1213, 2018 | 24 | 2018 |
| Inferring physical protein contacts from large-scale purification data of protein complexes SE Schelhorn, J Mestre, M Albrecht, E Zotenko Molecular & Cellular Proteomics 10 (6), 2011 | 23 | 2011 |
Joachim GudmundssonUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
