2009 |
17 | EE | Khaled M. Elbassioni,
Erik Krohn,
Domagoj Matijevic,
Julián Mestre,
Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains.
STACS 2009: 361-371 |
2008 |
16 | EE | Samir Khuller,
Julián Mestre:
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.
ESA 2008: 601-610 |
15 | EE | Julián Mestre:
Adaptive local ratio.
SODA 2008: 152-160 |
14 | EE | Julián Mestre:
Lagrangian Relaxation and Partial Cover (Extended Abstract).
STACS 2008: 539-550 |
13 | EE | Ernst Althaus,
Stefan Canzar,
Khaled M. Elbassioni,
Andreas Karrenbauer,
Julián Mestre:
Approximating the Interval Constrained Coloring Problem.
SWAT 2008: 210-221 |
12 | EE | Julián Mestre:
Weighted Popular Matchings.
Encyclopedia of Algorithms 2008 |
11 | EE | Khaled M. Elbassioni,
Domagoj Matijevic,
Julián Mestre,
Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains
CoRR abs/0809.0159: (2008) |
2007 |
10 | EE | Reuven Bar-Yehuda,
Guy Flysher,
Julián Mestre,
Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover.
ESA 2007: 335-346 |
9 | EE | Samir Khuller,
Azarakhsh Malekian,
Julián Mestre:
To Fill or Not to Fill: The Gas Station Problem.
ESA 2007: 534-545 |
8 | EE | Julián Mestre:
Weighted Popular Matchings
CoRR abs/0707.0546: (2007) |
7 | EE | Julián Mestre:
Lagrangian Relaxation and Partial Cover
CoRR abs/0712.3936: (2007) |
2006 |
6 | EE | Rajiv Gandhi,
Julián Mestre:
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.
APPROX-RANDOM 2006: 128-139 |
5 | EE | Julián Mestre:
Greedy in Approximation Algorithms.
ESA 2006: 528-539 |
4 | EE | Julián Mestre:
Weighted Popular Matchings.
ICALP (1) 2006: 715-726 |
3 | EE | Julián Mestre:
On the multi-radius cover problem.
Inf. Process. Lett. 99(5): 195-198 (2006) |
2005 |
2 | EE | Julián Mestre:
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.
APPROX-RANDOM 2005: 182-191 |
2004 |
1 | EE | 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: 61-66 |