default search action
Julián Mestre
Person information
- affiliation: University of Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j36]Ellis Hoag
, Kyungwoo Lee
Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up. ACM Trans. Embed. Comput. Syst. 23(4): 54:1-54:54 (2024) - [e3]Julián Mestre
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. LIPIcs 322, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-354-6 [contents] - 2023
- [c40]Ellis Hoag, Kyungwoo Lee
Optimizing Function Layout for Mobile Applications. LCTES 2023: 52-63 - 2022
- [j35]Wenlei He, Julián Mestre, Sergey Pupyrev, Lei Wang, Hongtao Yu:
Profile inference revisited. Proc. ACM Program. Lang. 6(POPL): 1-24 (2022) - [c39]Julián Mestre, Sergey Pupyrev:
Approximating the Minimum Logarithmic Arrangement Problem. ISAAC 2022: 7:1-7:15 - [c38]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c37]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [i16]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i15]Li Chen, Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev:
Minimum Coverage Instrumentation. CoRR abs/2208.13907 (2022) - [i14]Ellis Hoag, Kyungwoo Lee, Julián Mestre, Sergey Pupyrev:
Optimizing Function Layout for Mobile Applications. CoRR abs/2211.09285 (2022) - 2021
- [j34]Joachim Gudmundsson, Julián Mestre, Seeun William Umboh
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305: 199-204 (2021) - [c36]Julián Mestre, Sergey Pupyrev, Seeun William Umboh
On the Extended TSP Problem. ISAAC 2021: 42:1-42:14 - [i13]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 abs/2103.16816 (2021) - [i12]Julián Mestre, Sergey Pupyrev, Seeun William Umboh:
On the Extended TSP Problem. CoRR abs/2107.07815 (2021) - 2020
- [c35]Patrick Eades
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. COCOON 2020: 222-233 - [c34]Julián Mestre, Nicolás E. Stier Moses
Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. COCOON 2020: 324-334 - [c33]Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens:
The Ad Types Problem. WINE 2020: 45-58
2010 – 2019
- 2019
- [j33]Serge Gaspers, Joachim Gudmundsson
Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475 (2019) - [i11]Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens:
The Ad Types Problem. CoRR abs/1907.04400 (2019) - 2018
- [j32]Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Algorithmica 80(4): 1191-1213 (2018) - [j31]Min Chih Lin
Approximating weighted induced matchings. Discret. Appl. Math. 243: 304-310 (2018) - [j30]Min Chih Lin
Approximating weighted neighborhood independent sets. Inf. Process. Lett. 130: 11-15 (2018) - 2017
- [j29]Maurice Cheung, Julián Mestre, David B. Shmoys
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. 31(2): 825-838 (2017) - [c32]Andrew Cherry, Joachim Gudmundsson
Barrier Coverage with Uniform Radii in 2D. ALGOSENSORS 2017: 57-69 - [c31]Mitchell Jones
Towards Memory-Optimal Schedules for SDF. Euro-Par Workshops 2017: 94-105 - [c30]Serge Gaspers, Joachim Gudmundsson
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: 37:1-37:13 - [c29]Jessica McClintock, Julián Mestre, Anthony Wirth:
Precedence-Constrained Min Sum Set Cover. ISAAC 2017: 55:1-55:12 - [i10]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR abs/1709.10285 (2017) - 2016
- [j28]Leah Epstein, Elena Kleiman, Julián Mestre:
Parametric Packing of Selfish Items and the Subset Sum Algorithm. Algorithmica 74(1): 177-207 (2016) - [j27]Stefan Canzar
Resolving Conflicting Predictions from Multimapping Reads. J. Comput. Biol. 23(3): 203-217 (2016) - [c28]Serge Gaspers, Joachim Gudmundsson
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13 - [r4]Julián Mestre:
Subset Sum Algorithm for Bin Packing. Encyclopedia of Algorithms 2016: 2126-2129 - [r3]Julián Mestre, Nicole Megow:
Universal Sequencing on an Unreliable Machine. Encyclopedia of Algorithms 2016: 2304-2308 - [r2]Julián Mestre:
Weighted Popular Matchings. Encyclopedia of Algorithms 2016: 2363-2365 - [i9]Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR abs/1612.03339 (2016) - 2015
- [j26]Stefan Canzar
On Tree-Constrained Matchings and Generalizations. Algorithmica 71(1): 98-119 (2015) - [j25]Julián Mestre:
On the intersection of independence systems. Oper. Res. Lett. 43(1): 7-9 (2015) - [c27]Haris Aziz
Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: 461-467 - 2014
- [j24]Joachim Gudmundsson
Editorial: COCOON 2012 Special Issue. Algorithmica 70(1): 1 (2014) - [j23]Danny Hermelin
Optimization problems in dotted interval graphs. Discret. Appl. Math. 174: 66-72 (2014) - [j22]Haris Aziz
Parametrized algorithms for random serial dictatorship. Math. Soc. Sci. 72: 1-6 (2014) - [j21]Haris Aziz
Computational aspects of random serial dictatorship. SIGecom Exch. 13(2): 26-30 (2014) - [j20]Julián Mestre:
Weighted popular matchings. ACM Trans. Algorithms 10(1): 2:1-2:16 (2014) - [j19]Kanchana Thilakarathna
MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones. IEEE Trans. Mob. Comput. 13(9): 2058-2070 (2014) - [c26]Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. ICALP (1) 2014: 625-636 - [i8]Haris Aziz, Julián Mestre:
Parametrized Algorithms for Random Serial Dictatorship. CoRR abs/1403.0974 (2014) - [i7]Wiebke Höhn, Julián Mestre, Andreas Wiese:
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions. CoRR abs/1403.1376 (2014) - 2013
- [j18]Stefan Canzar
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. ACM J. Exp. Algorithmics 18 (2013) - [j17]Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla
A Distributed Algorithm for Large-Scale Generalized Matching. Proc. VLDB Endow. 6(9): 613-624 (2013) - [c25]Nicole Megow
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
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
Enabling mobile distributed social networking on smartphones. MSWiM 2012: 357-366 - [c23]Danny Hermelin
Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56 - [e2]Julián Mestre:
Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. CRPIT 128, Australian Computer Society 2012, ISBN 978-1-921770-09-8 [contents] - [e1]Joachim Gudmundsson, Julián Mestre, Taso Viglas:
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 [contents] - 2011
- [j12]Khaled M. Elbassioni
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011) - [j11]Ernst Althaus, Stefan Canzar
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011) - [j10]Leah Epstein, Asaf Levin
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. 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 Trans. Algorithms 7(3): 36:1-36:16 (2011) - [j8]Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular mixed matchings. Theor. Comput. Sci. 412(24): 2679-2690 (2011) - [c22]Stefan Canzar
On Tree-Constrained Matchings and Generalizations. ICALP (1) 2011: 98-109 - 2010
- [j7]Naveen Garg
Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010) - [j6]Julián Mestre:
Adaptive Local Ratio. SIAM J. Comput. 39(7): 3038-3057 (2010) - [j5]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24(4): 1441-1469 (2010) - [c21]Stefan Canzar
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
Universal Sequencing on a Single Machine. IPCO 2010: 230-243 - [c16]Leah Epstein, Asaf Levin
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358 - [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]Telikepalli Kavitha, Julián Mestre, Meghana Nasre
Popular Mixed Matchings. ICALP (1) 2009: 574-584 - [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
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) - [c11]Samir Khuller, Julián Mestre:
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. ESA 2008: 601-610 - [c10]Julián Mestre:
Adaptive local ratio. SODA 2008: 152-160 - [c9]Julián Mestre:
Lagrangian Relaxation and Partial Cover (Extended Abstract). STACS 2008: 539-550 - [c8]Ernst Althaus, Stefan Canzar
Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 - [r1]Julián Mestre:
Weighted Popular Matchings. Encyclopedia of Algorithms 2008 - [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]Julián Mestre:
Weighted Popular Matchings. CoRR abs/0707.0546 (2007) - [i1]Julián Mestre:
Lagrangian Relaxation and Partial Cover. CoRR abs/0712.3936 (2007) - 2006
- [j1]Julián Mestre:
On the multi-radius cover problem. Inf. Process. Lett. 99(5): 195-198 (2006) - [c5]Rajiv Gandhi, Julián Mestre:
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. APPROX-RANDOM 2006: 128-139 - [c4]Julián Mestre:
Greedy in Approximation Algorithms. ESA 2006: 528-539 - [c3]Julián Mestre:
Weighted Popular Matchings. ICALP (1) 2006: 715-726 - 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
Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan. WebDB 2004: 61-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: