The SCEAS System
| |||||||

## Search the dblp DataBase
Julián Mestre:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Julián Mestre
**A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:182-191 [Conf] - Rajiv Gandhi, Julián Mestre
**Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:128-139 [Conf] - Julián Mestre
**Greedy in Approximation Algorithms.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:528-539 [Conf] - Julián Mestre
**Weighted Popular Matchings.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:715-726 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] WebDB, 2004, pp:61-66 [Conf] - Julián Mestre
**On the multi-radius cover problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:5, pp:195-198 [Journal] - Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
**Approximation of Partial Capacitated Vertex Cover.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:335-346 [Conf] - Samir Khuller, Azarakhsh Malekian, Julián Mestre
**To Fill or Not to Fill: The Gas Station Problem.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:534-545 [Conf] - Julián Mestre
**Weighted Popular Matchings**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem.**[Citation Graph (, )][DBLP]**The Checkpoint Problem.**[Citation Graph (, )][DBLP]**An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.**[Citation Graph (, )][DBLP]**When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).**[Citation Graph (, )][DBLP]**Popular Mixed Matchings.**[Citation Graph (, )][DBLP]**Universal Sequencing on a Single Machine.**[Citation Graph (, )][DBLP]**Max-Coloring Paths: Tight Bounds and Extensions.**[Citation Graph (, )][DBLP]**Adaptive local ratio.**[Citation Graph (, )][DBLP]**Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.**[Citation Graph (, )][DBLP]**Lagrangian Relaxation and Partial Cover (Extended Abstract).**[Citation Graph (, )][DBLP]**Improved Approximations for Guarding 1.5-Dimensional Terrains.**[Citation Graph (, )][DBLP]**Approximating the Interval Constrained Coloring Problem.**[Citation Graph (, )][DBLP]**Parametric Packing of Selfish Items and the Subset Sum Algorithm.**[Citation Graph (, )][DBLP]**Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.**[Citation Graph (, )][DBLP]**A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.**[Citation Graph (, )][DBLP]**Lagrangian Relaxation and Partial Cover**[Citation Graph (, )][DBLP]**Improved Approximations for Guarding 1.5-Dimensional Terrains**[Citation Graph (, )][DBLP]**Improved approximation guarantees for weighted matching in the semi-streaming model**[Citation Graph (, )][DBLP]**Parametric packing of selfish items and the subset sum algorithm**[Citation Graph (, )][DBLP]**Improved bounds for stochastic matching**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings**[Citation Graph (, )][DBLP]
Search in 0.420secs, Finished in 0.420secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |