Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan. - Maria-Esther Vidal; Louiqa Raschid; Julián Mestre (WebDB, 2004)

Greedy in Approximation Algorithms. - Julián Mestre (ESA, 2006)

On the multi-radius cover problem. - Julián Mestre (Inf. Process. Lett., 2006)

Lagrangian Relaxation and Partial Cover - Julián Mestre (CoRR, 2007)

Primal-Dual Algorithms for Combinatorial Optimization Problems. - Julián Mestre (2007)

An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. - Samir Khuller; Julián Mestre (ESA, 2008)

Lagrangian Relaxation and Partial Cover (Extended Abstract). - Julián Mestre (STACS, 2008)

Approximating the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (SWAT, 2008)

Improved Approximations for Guarding 1.5-Dimensional Terrains - Khaled M. Elbassioni; Domagoj Matijevic; Julián Mestre; Domagoj Severdija (CoRR, 2008)

Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality. - Elena Zotenko; Julián Mestre; Dianne P. O'Leary; Teresa M. Przytycka (PLoS Comput. Biol., 2008)

Weighted Popular Matchings. - Julián Mestre (Encyclopedia of Algorithms, 2008)

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. - Rajiv Gandhi; Julián Mestre (Algorithmica, 2009)

A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. - Julián Mestre (Algorithmica, 2009)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (ESA (2), 2010)

Bonsai: Growing Interesting Small Trees. - Stephan Seufert; Srikanta J. Bedathur; Julián Mestre; Gerhard Weikum (ICDM, 2010)

Universal Sequencing on a Single Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (IPCO, 2010)

Assigning Papers to Referees. - Naveen Garg 001; Telikepalli Kavitha; Amit Kumar 001; Kurt Mehlhorn; Julián Mestre (Algorithmica, 2010)

Adaptive Local Ratio. - Julián Mestre (SIAM J. Comput., 2010)

Approximation of Partial Capacitated Vertex Cover. - Reuven Bar-Yehuda; Guy Flysher; Julián Mestre; Dror Rawitz (SIAM J. Discret. Math., 2010)

Approximation Algorithms for the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (Algorithmica, 2011)

Improved Approximations for Guarding 1.5-Dimensional Terrains. - Khaled M. Elbassioni; Erik Krohn; Domagoj Matijevic; Julián Mestre; Domagoj Severdija (Algorithmica, 2011)

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. - Leah Epstein; Asaf Levin; Julián Mestre; Danny Segev (SIAM J. Discret. Math., 2011)

To fill or not to fill: The gas station problem. - Samir Khuller; Azarakhsh Malekian; Julián Mestre (ACM Trans. Algorithms, 2011)

Popular mixed matchings. - Telikepalli Kavitha; Julián Mestre; Meghana Nasre (Theor. Comput. Sci., 2011)

Enabling mobile distributed social networking on smartphones. - Kanchana Thilakarathna; Henrik Petander; Julián Mestre; Aruna Seneviratne (MSWiM, 2012)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (Algorithmica, 2012)

Max-coloring paths: tight bounds and extensions. - Telikepalli Kavitha; Julián Mestre (J. Comb. Optim., 2012)

Universal Sequencing on an Unreliable Machine. - Leah Epstein; Asaf Levin; Alberto Marchetti-Spaccamela; Nicole Megow; Julián Mestre; Martin Skutella; Leen Stougie (SIAM J. Comput., 2012)

The checkpoint problem. - MohammadTaghi Hajiaghayi; Rohit Khandekar; Guy Kortsarz; Julián Mestre (Theor. Comput. Sci., 2012)

Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. - Nicole Megow; Julián Mestre (ITCS, 2013)

A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. - Stefan Canzar; Khaled M. Elbassioni; Julián Mestre (ACM J. Exp. Algorithmics, 2013)

A Distributed Algorithm for Large-Scale Generalized Matching. - Faraz Makari Manshadi; Baruch Awerbuch; Rainer Gemulla; Rohit Khandekar; Julián Mestre; Mauro Sozio (Proc. VLDB Endow., 2013)

Editorial: COCOON 2012 Special Issue. - Joachim Gudmundsson; Julián Mestre; Taso Viglas (Algorithmica, 2014)

Optimization problems in dotted interval graphs. - Danny Hermelin; Julián Mestre; Dror Rawitz (Discret. Appl. Math., 2014)

Parametrized algorithms for random serial dictatorship. - Haris Aziz 001; Julián Mestre (Math. Soc. Sci., 2014)

Computational aspects of random serial dictatorship. - Haris Aziz 001; Felix Brandt 001; Markus Brill; Julián Mestre (SIGecom Exch., 2014)

Weighted popular matchings. - Julián Mestre (ACM Trans. Algorithms, 2014)

MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones. - Kanchana Thilakarathna; Henrik Petander; Julián Mestre; Aruna Seneviratne (IEEE Trans. Mob. Comput., 2014)

Welfare Maximization in Fractional Hedonic Games. - Haris Aziz 001; Serge Gaspers; Joachim Gudmundsson; Julián Mestre; Hanjo Täubig (IJCAI, 2015)

On Tree-Constrained Matchings and Generalizations. - Stefan Canzar; Khaled M. Elbassioni; Gunnar W. Klau; Julián Mestre (Algorithmica, 2015)

On the intersection of independence systems. - Julián Mestre (Oper. Res. Lett., 2015)

Parametric Packing of Selfish Items and the Subset Sum Algorithm. - Leah Epstein; Elena Kleiman; Julián Mestre (Algorithmica, 2016)

Resolving Conflicting Predictions from Multimapping Reads. - Stefan Canzar; Khaled M. Elbassioni; Mitchell Jones; Julián Mestre (J. Comput. Biol., 2016)

Subset Sum Algorithm for Bin Packing. - Julián Mestre (Encyclopedia of Algorithms, 2016)

Weighted Popular Matchings. - Julián Mestre (Encyclopedia of Algorithms, 2016)

Universal Sequencing on an Unreliable Machine. - Julián Mestre; Nicole Megow (Encyclopedia of Algorithms, 2016)

Barrier Coverage with Uniform Radii in 2D. - Andrew Cherry; Joachim Gudmundsson; Julián Mestre (ALGOSENSORS, 2017)

Towards Memory-Optimal Schedules for SDF. - Mitchell Jones; Julián Mestre; Bernhard Scholz (Euro-Par Workshops, 2017)

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. - Serge Gaspers; Joachim Gudmundsson; Julián Mestre; Stefan Rümmele (ISAAC, 2017)

Precedence-Constrained Min Sum Set Cover. - Jessica McClintock; Julián Mestre; Anthony Wirth (ISAAC, 2017)

A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. - Maurice Cheung; Julián Mestre; David B. Shmoys; José Verschae (SIAM J. Discret. Math., 2017)

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. - Wiebke Höhn; Julián Mestre; Andreas Wiese (Algorithmica, 2018)

Approximating weighted induced matchings. - Min Chih Lin; Julián Mestre; Saveliy Vasiliev (Discret. Appl. Math., 2018)

Approximating weighted neighborhood independent sets. - Min Chih Lin; Julián Mestre; Saveliy Vasiliev (Inf. Process. Lett., 2018)

Turbocharging Treewidth Heuristics. - Serge Gaspers; Joachim Gudmundsson; Mitchell Jones; Julián Mestre; Stefan Rümmele (Algorithmica, 2019)

An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. - Patrick Eades; Julián Mestre (COCOON, 2020)

Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. - Julián Mestre; Nicolás E. Stier Moses (COCOON, 2020)

The Ad Types Problem. - Riccardo Colini-Baldeschi; Julián Mestre; Okke Schrijvers; Christopher A. Wilkens (WINE, 2020)

On the Extended TSP Problem. - Julián Mestre; Sergey Pupyrev; Seeun William Umboh (ISAAC, 2021)

QUEST: Queue Simulation for Content Moderation at Scale. - Rahul Makhijani; Parikshit Shah; Vashist Avadhanula; Caner Gocmen; Nicolás E. Stier Moses; Julián Mestre (CoRR, 2021)

Bounded-degree light approximate shortest-path trees in doubling metrics. - Joachim Gudmundsson; Julián Mestre; Seeun William Umboh (Discret. Appl. Math., 2021)

Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (ISAAC, 2022)

Approximating the Minimum Logarithmic Arrangement Problem. - Julián Mestre; Sergey Pupyrev (ISAAC, 2022)

Brief Announcement: Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (SPAA, 2022)

Minimum Coverage Instrumentation. - Li Chen 028; Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev (CoRR, 2022)

Profile inference revisited. - Wenlei He; Julián Mestre; Sergey Pupyrev; Lei Wang; Hongtao Yu (Proc. ACM Program. Lang., 2022)

Optimizing Function Layout for Mobile Applications. - Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev (LCTES, 2023)

Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up. - Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev; Yongkang Zhu (ACM Trans. Embed. Comput. Syst., 2024)

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design. - Clément L. Canonne; Kenny Chen; Julián Mestre (CoRR, 2025)