Julian Mestre, Ph.D. - Publications

Affiliations: 
2007 Computer Science University of Maryland, College Park, College Park, MD 
Area:
Theoretical Computer Science,Big Data

28 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Gaspers S, Gudmundsson J, Jones M, Mestre J, Rümmele S. Turbocharging Treewidth Heuristics Algorithmica. 81: 439-475. DOI: 10.1007/S00453-018-0499-1  0.423
2018 Lin MC, Mestre J, Vasiliev S. Approximating weighted neighborhood independent sets Information Processing Letters. 130: 11-15. DOI: 10.1016/J.Ipl.2017.09.014  0.494
2018 Lin MC, Mestre J, Vasiliev S. Approximating weighted induced matchings Discrete Applied Mathematics. 243: 304-310. DOI: 10.1016/J.Dam.2018.01.009  0.446
2018 Höhn W, Mestre J, Wiese A. How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions Algorithmica. 80: 1191-1213. DOI: 10.1007/S00453-017-0300-X  0.51
2017 Cheung M, Mestre J, Shmoys DB, Verschae J. A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems Siam Journal On Discrete Mathematics. 31: 825-838. DOI: 10.1137/16M1086819  0.473
2016 Canzar S, Elbassioni K, Jones M, Mestre J. Resolving Conflicting Predictions from Multimapping Reads. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 26745826 DOI: 10.1089/Cmb.2015.0164  0.327
2016 Epstein L, Kleiman E, Mestre J. Parametric Packing of Selfish Items and the Subset Sum Algorithm Algorithmica. 74: 177-207. DOI: 10.1007/S00453-014-9942-0  0.509
2015 Aziz H, Brandt F, Brill M, Mestre J. Computational aspects of random serial dictatorship Sigecom Exchanges. 13: 26-30. DOI: 10.1145/2728732.2728735  0.441
2015 Canzar S, Elbassioni K, Klau GW, Mestre J. On Tree-Constrained Matchings and Generalizations Algorithmica. 71: 98-119. DOI: 10.1007/S00453-013-9785-0  0.529
2014 Mestre J. Weighted popular matchings Acm Transactions On Algorithms. 10: 2. DOI: 10.1145/2556951  0.429
2014 Thilakarathna K, Petander H, Mestre J, Seneviratne A. MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones Ieee Transactions On Mobile Computing. 13: 2058-2070. DOI: 10.1109/Tmc.2013.89  0.327
2014 Aziz H, Mestre J. Parametrized algorithms for random serial dictatorship Mathematical Social Sciences. 72: 1-6. DOI: 10.1016/J.Mathsocsci.2014.07.002  0.42
2014 Hermelin D, Mestre J, Rawitz D. Optimization problems in dotted interval graphs Discrete Applied Mathematics. 174: 66-72. DOI: 10.1016/J.Dam.2014.04.014  0.492
2013 Canzar S, Elbassioni K, Mestre J. A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem Acm Journal of Experimental Algorithms. 18. DOI: 10.1145/2444016.2493372  0.415
2012 Epstein L, Levin A, Marchetti-Spaccamela A, Megow N, Mestre J, Skutella M, Stougie L. Universal Sequencing on an Unreliable Machine Siam Journal On Computing. 41: 565-586. DOI: 10.1137/110844210  0.414
2012 Hajiaghayi M, Khandekar R, Kortsarz G, Mestre J. The checkpoint problem Theoretical Computer Science. 452: 88-99. DOI: 10.1016/J.Tcs.2012.05.021  0.568
2012 Kavitha T, Mestre J. Max-coloring paths: tight bounds and extensions Journal of Combinatorial Optimization. 24: 1-14. DOI: 10.1007/S10878-010-9290-1  0.473
2011 Khuller S, Malekian A, Mestre J. To fill or not to fill: The gas station problem Acm Transactions On Algorithms. 7: 36. DOI: 10.1145/1978782.1978791  0.58
2011 Epstein L, Levin A, Mestre J, Segev D. Improved approximation guarantees for weighted matching in the semi-streaming model Siam Journal On Discrete Mathematics. 25: 1251-1265. DOI: 10.1137/100801901  0.463
2011 Kavitha T, Mestre J, Nasre M. Popular mixed matchings Theoretical Computer Science. 412: 2679-2690. DOI: 10.1016/J.Tcs.2010.03.028  0.394
2011 Bansal N, Gupta A, Li J, Mestre J, Nagarajan V, Rudra A. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings Algorithmica (New York). 1-30. DOI: 10.1007/S00453-011-9511-8  0.506
2011 Althaus E, Canzar S, Elbassioni K, Karrenbauer A, Mestre J. Approximation Algorithms for the Interval Constrained Coloring Problem Algorithmica. 61: 342-361. DOI: 10.1007/S00453-010-9406-0  0.471
2011 Elbassioni K, Krohn E, Matijević D, Mestre J, Ševerdija D. Improved Approximations for Guarding 1.5-Dimensional Terrains Algorithmica. 60: 451-463. DOI: 10.1007/S00453-009-9358-4  0.514
2010 Mestre J. Adaptive Local Ratio Siam Journal On Computing. 39: 3038-3057. DOI: 10.1137/080731712  0.457
2010 Bar-Yehuda R, Flysher G, Mestre J, Rawitz D. Approximation of Partial Capacitated Vertex Cover Siam Journal On Discrete Mathematics. 24: 1441-1469. DOI: 10.1137/080728044  0.437
2010 Garg N, Kavitha T, Kumar A, Mehlhorn K, Mestre J. Assigning Papers to Referees Algorithmica. 58: 119-136. DOI: 10.1007/S00453-009-9386-0  0.42
2009 Gandhi R, Mestre J. Combinatorial Algorithms for Data Migration to Minimize Average Completion Time Algorithmica. 54: 54-71. DOI: 10.1007/S00453-007-9118-2  0.637
2006 Mestre J. On the multi-radius cover problem Information Processing Letters. 99: 195-198. DOI: 10.1016/J.Ipl.2006.04.012  0.48
Show low-probability matches.