Julián Mestre

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 31

Top Topics

Travelling Salesman

Top Venues

Discret. Appl. Math.

Publications

Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev, Yongkang Zhu
Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up. ACM Trans. Embed. Comput. Syst. 23 (4) (2024)
Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev
Optimizing Function Layout for Mobile Applications. LCTES (2023)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. CoRR (2022)
Julián Mestre, Sergey Pupyrev
Approximating the Minimum Logarithmic Arrangement Problem. ISAAC (2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Brief Announcement: Nested Active-Time Scheduling. SPAA (2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. ISAAC (2022)
Li Chen, Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev
Minimum Coverage Instrumentation. CoRR (2022)
Wenlei He, Julián Mestre, Sergey Pupyrev, Lei Wang, Hongtao Yu
Profile inference revisited. Proc. ACM Program. Lang. 6 (POPL) (2022)
Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev
Optimizing Function Layout for Mobile Applications. CoRR (2022)
Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. ISAAC (2021)
Joachim Gudmundsson, Julián Mestre, Seeun William Umboh
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305 (2021)
Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. CoRR (2021)
Rahul Makhijani, Parikshit Shah, Vashist Avadhanula, Caner Gocmen, Nicolás E. Stier Moses, Julián Mestre
QUEST: Queue Simulation for Content Moderation at Scale. CoRR (2021)
Patrick Eades, Julián Mestre
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. COCOON (2020)
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens
The Ad Types Problem. WINE (2020)
Julián Mestre, Nicolás E. Stier Moses
Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. COCOON (2020)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. Algorithmica 81 (2) (2019)
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens
The Ad Types Problem. CoRR (2019)
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
Approximating weighted neighborhood independent sets. Inf. Process. Lett. 130 (2018)
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
Approximating weighted induced matchings. Discret. Appl. Math. 243 (2018)
Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Algorithmica 80 (4) (2018)
Mitchell Jones, Julián Mestre, Bernhard Scholz
Towards Memory-Optimal Schedules for SDF. Euro-Par Workshops (2017)
Andrew Cherry, Joachim Gudmundsson, Julián Mestre
Barrier Coverage with Uniform Radii in 2D. ALGOSENSORS (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR (2017)
Jessica McClintock, Julián Mestre, Anthony Wirth
Precedence-Constrained Min Sum Set Cover. ISAAC (2017)
Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. 31 (2) (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC (2017)
Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR (2016)
Stefan Canzar, Khaled M. Elbassioni, Mitchell Jones, Julián Mestre
Resolving Conflicting Predictions from Multimapping Reads. J. Comput. Biol. 23 (3) (2016)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. IPEC (2016)
Leah Epstein, Elena Kleiman, Julián Mestre
Parametric Packing of Selfish Items and the Subset Sum Algorithm. Algorithmica 74 (1) (2016)
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
Welfare Maximization in Fractional Hedonic Games. IJCAI (2015)
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre
On Tree-Constrained Matchings and Generalizations. Algorithmica 71 (1) (2015)
Julián Mestre
On the intersection of independence systems. Oper. Res. Lett. 43 (1) (2015)
Haris Aziz, Julián Mestre
Parametrized algorithms for random serial dictatorship. Math. Soc. Sci. 72 (2014)
Julián Mestre
Weighted popular matchings. ACM Trans. Algorithms 10 (1) (2014)
Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. ICALP (1) (2014)
Haris Aziz, Julián Mestre
Parametrized Algorithms for Random Serial Dictatorship. CoRR (2014)
Danny Hermelin, Julián Mestre, Dror Rawitz
Optimization problems in dotted interval graphs. Discret. Appl. Math. 174 (2014)
Kanchana Thilakarathna, Henrik Petander, Julián Mestre, Aruna Seneviratne
MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones. IEEE Trans. Mob. Comput. 13 (9) (2014)
Joachim Gudmundsson, Julián Mestre, Taso Viglas
Editorial: COCOON 2012 Special Issue. Algorithmica 70 (1) (2014)
Haris Aziz, Felix Brandt, Markus Brill, Julián Mestre
Computational aspects of random serial dictatorship. SIGecom Exch. 13 (2) (2014)
Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions. CoRR (2014)
Nicole Megow, Julián Mestre
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. ITCS (2013)
Stefan Canzar, Khaled M. Elbassioni, Julián Mestre
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. ACM J. Exp. Algorithmics 18 (2013)
Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla, Rohit Khandekar, Julián Mestre, Mauro Sozio
A Distributed Algorithm for Large-Scale Generalized Matching. Proc. VLDB Endow. 6 (9) (2013)
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) (2012)
Kanchana Thilakarathna, Henrik Petander, Julián Mestre, Aruna Seneviratne
Enabling mobile distributed social networking on smartphones. MSWiM (2012)
Danny Hermelin, Julián Mestre, Dror Rawitz
Optimization Problems in Dotted Interval Graphs. WG (2012)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
The checkpoint problem. Theor. Comput. Sci. 452 (2012)
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) (2012)
Telikepalli Kavitha, Julián Mestre
Max-coloring paths: tight bounds and extensions. J. Comb. Optim. 24 (1) (2012)
Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60 (2) (2011)
Samir Khuller, Azarakhsh Malekian, Julián Mestre
To fill or not to fill: The gas station problem. ACM Trans. Algorithms 7 (3) (2011)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular mixed matchings. Theor. Comput. Sci. 412 (24) (2011)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. Math. 25 (3) (2011)
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre
On Tree-Constrained Matchings and Generalizations. ICALP (1) (2011)
Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61 (2) (2011)
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)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS (2010)
Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
Assigning Papers to Referees. Algorithmica 58 (1) (2010)
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 (2010)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
The Checkpoint Problem. APPROX-RANDOM (2010)
Stephan Seufert, Srikanta J. Bedathur, Julián Mestre, Gerhard Weikum
Bonsai: Growing Interesting Small Trees. ICDM (2010)
Stefan Canzar, Khaled M. Elbassioni, Julián Mestre
A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. ALENEX (2010)
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
Universal Sequencing on a Single Machine. IPCO (2010)
Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24 (4) (2010)
Julián Mestre
Adaptive Local Ratio. SIAM J. Comput. 39 (7) (2010)
Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular Mixed Matchings. ICALP (1) (2009)
Rajiv Gandhi, Julián Mestre
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. Algorithmica 54 (1) (2009)
Telikepalli Kavitha, Julián Mestre
Max-Coloring Paths: Tight Bounds and Extensions. ISAAC (2009)
Leah Epstein, Elena Kleiman, Julián Mestre
Parametric Packing of Selfish Items and the Subset Sum Algorithm. WINE (2009)
Julián Mestre
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Algorithmica 55 (1) (2009)
Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija
Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS (2009)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved approximation guarantees for weighted matching in the semi-streaming model CoRR (2009)
Leah Epstein, Elena Kleiman, Julián Mestre
Parametric packing of selfish items and the subset sum algorithm CoRR (2009)
Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre
Approximating the Interval Constrained Coloring Problem. SWAT (2008)
Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija
Improved Approximations for Guarding 1.5-Dimensional Terrains CoRR (2008)
Julián Mestre
Adaptive local ratio. SODA (2008)
Samir Khuller, Julián Mestre
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. ESA (2008)
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 Comput. Biol. 4 (8) (2008)
Julián Mestre
Lagrangian Relaxation and Partial Cover (Extended Abstract). STACS (2008)
Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
Approximation of Partial Capacitated Vertex Cover. ESA (2007)
Julián Mestre
Lagrangian Relaxation and Partial Cover CoRR (2007)
Samir Khuller, Azarakhsh Malekian, Julián Mestre
To Fill or Not to Fill: The Gas Station Problem. ESA (2007)
Julián Mestre
Weighted Popular Matchings CoRR (2007)
Julián Mestre
Greedy in Approximation Algorithms. ESA (2006)
Julián Mestre
Weighted Popular Matchings. ICALP (1) (2006)
Julián Mestre
On the multi-radius cover problem. Inf. Process. Lett. 99 (5) (2006)
Rajiv Gandhi, Julián Mestre
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. APPROX-RANDOM (2006)
Julián Mestre
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. APPROX-RANDOM (2005)
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)