Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Julián Mestre
2010 – today
- 2013
[j17]Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemula, Rohit Khandekar, Julián Mestre, Mauro Sozio: A Distributed Algorithm for Large-Scale Generalized Matching. PVLDB 6(9): 613-624 (2013)- [c25]Nicole Megow, Julián Mestre: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS 2013: 495-504
- 2012
- [j16]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012)
- [j15]Telikepalli Kavitha, Julián Mestre: Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24(1): 1-14 (2012)
- [j14]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012)
- [j13]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012)
- [c24]Kanchana Thilakarathna, Henrik Petander, Julián Mestre, Aruna Seneviratne: Enabling mobile distributed social networking on smartphones. MSWiM 2012: 357-366
- [c23]Danny Hermelin, Julián Mestre, Dror Rawitz: Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56
- [e2]Julián Mestre (Ed.): Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. CRPIT 128, Australian Computer Society 2012, ISBN 978-1-921770-09-8
- [e1]Joachim Gudmundsson, Julián Mestre, Taso Viglas (Eds.): Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Lecture Notes in Computer Science 7434, Springer 2012, ISBN 978-3-642-32240-2
- 2011
- [j12]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011)
- [j11]Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011)
- [j10]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discrete Math. 25(3): 1251-1265 (2011)
- [j9]Samir Khuller, Azarakhsh Malekian, Julián Mestre: To fill or not to fill: The gas station problem. ACM Transactions on Algorithms 7(3): 36 (2011)
- [j8]Telikepalli Kavitha, Julián Mestre, Meghana Nasre: Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011)
- [c22]Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre: On Tree-Constrained Matchings and Generalizations. ICALP (1) 2011: 98-109
- 2010
- [j7]Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre: Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010)
- [j6]
- [j5]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz: Approximation of Partial Capacitated Vertex Cover. SIAM J. Discrete Math. 24(4): 1441-1469 (2010)
- [c21]Stefan Canzar, Khaled M. Elbassioni, Julián Mestre: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. ALENEX 2010: 23-33
- [c20]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The Checkpoint Problem. APPROX-RANDOM 2010: 219-231
- [c19]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229
- [c18]Stephan Seufert, Srikanta J. Bedathur, Julián Mestre, Gerhard Weikum: Bonsai: Growing Interesting Small Trees. ICDM 2010: 1013-1018
- [c17]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on a Single Machine. IPCO 2010: 230-243
- [c16]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358
- [i7]
- [i6]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010)
2000 – 2009
- 2009
- [j4]Rajiv Gandhi, Julián Mestre: Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. Algorithmica 54(1): 54-71 (2009)
- [j3]Julián Mestre: A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Algorithmica 55(1): 227-239 (2009)
- [c15]
- [c14]Telikepalli Kavitha, Julián Mestre: Max-Coloring Paths: Tight Bounds and Extensions. ISAAC 2009: 87-96
- [c13]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371
- [c12]Leah Epstein, Elena Kleiman, Julián Mestre: Parametric Packing of Selfish Items and the Subset Sum Algorithm. WINE 2009: 67-78
- [i5]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved approximation guarantees for weighted matching in the semi-streaming model. CoRR abs/0907.0305 (2009)
- [i4]Leah Epstein, Elena Kleiman, Julián Mestre: Parametric packing of selfish items and the subset sum algorithm. CoRR abs/0907.4311 (2009)
- 2008
- [j2]Elena Zotenko, Julián Mestre, Dianne P. O'Leary, Teresa M. Przytycka: Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality. PLoS Computational Biology 4(8) (2008)
- [c11]Samir Khuller, Julián Mestre: An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. ESA 2008: 601-610
- [c10]
- [c9]
- [c8]Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221
- [r1]
- [i3]Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. CoRR abs/0809.0159 (2008)
- 2007
- [c7]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz: Approximation of Partial Capacitated Vertex Cover. ESA 2007: 335-346
- [c6]Samir Khuller, Azarakhsh Malekian, Julián Mestre: To Fill or Not to Fill: The Gas Station Problem. ESA 2007: 534-545
- [i2]
- [i1]
- 2006
- [j1]
- [c5]Rajiv Gandhi, Julián Mestre: Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. APPROX-RANDOM 2006: 128-139
- [c4]
- [c3]
- 2005
- [c2]Julián Mestre: A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. APPROX-RANDOM 2005: 182-191
- 2004
- [c1]Maria-Esther Vidal, Louiqa Raschid, Julián Mestre: Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan. WebDB 2004: 61-66
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:10 CEST by the dblp team