Julián Mestre

102 papers A* 3A 10B 12C 1Misc 3Journal 54Unranked 13

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