|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 3 keywords
|
|
|
|
|
Results
Found 44 publication records. Showing 44 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Telikepalli Kavitha, Julián Mestre |
Max-coloring paths: tight bounds and extensions.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre, Meghana Nasre |
Popular mixed matchings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija |
Improved Approximations for Guarding 1.5-Dimensional Terrains. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre |
Approximation Algorithms for the Interval Constrained Coloring Problem. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Azarakhsh Malekian, Julián Mestre |
To fill or not to fill: The gas station problem. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre |
On Tree-Constrained Matchings and Generalizations. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre |
Assigning Papers to Referees. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Jian Li, Julián Mestre |
Improved bounds for stochastic matching |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz |
Approximation of Partial Capacitated Vertex Cover. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Adaptive Local Ratio. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Seufert, Srikanta J. Bedathur, Julián Mestre, Gerhard Weikum |
Bonsai: Growing Interesting Small Trees. |
ICDM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Canzar, Khaled M. Elbassioni, Julián Mestre |
A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. |
ALENEX |
2010 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie |
Universal Sequencing on a Single Machine. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre |
The Checkpoint Problem. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Julián Mestre |
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Min-sum scheduling problems, Approximation algorithms, Primal-dual algorithms |
| 1 | Julián Mestre |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Vertex cover, Primal-dual algorithms |
| 1 | Leah Epstein, Elena Kleiman, Julián Mestre |
Parametric packing of selfish items and the subset sum algorithm |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved approximation guarantees for weighted matching in the semi-streaming model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Elena Kleiman, Julián Mestre |
Parametric Packing of Selfish Items and the Subset Sum Algorithm. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre, Meghana Nasre |
Popular Mixed Matchings. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija |
Improved Approximations for Guarding 1.5-Dimensional Terrains. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre |
Max-Coloring Paths: Tight Bounds and Extensions. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Zotenko, Julian 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 Computational Biology |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija |
Improved Approximations for Guarding 1.5-Dimensional Terrains |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Julián Mestre |
Weighted Popular Matchings. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Julián Mestre |
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Adaptive local ratio. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Lagrangian Relaxation and Partial Cover (Extended Abstract). |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre |
Approximating the Interval Constrained Coloring Problem. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Weighted Popular Matchings |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Julián Mestre |
Lagrangian Relaxation and Partial Cover |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz |
Approximation of Partial Capacitated Vertex Cover. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Azarakhsh Malekian, Julián Mestre |
To Fill or Not to Fill: The Gas Station Problem. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
On the multi-radius cover problem. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Greedy in Approximation Algorithms. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
Weighted Popular Matchings. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Julián Mestre |
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julián Mestre |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
Displaying result #1 - #44 of 44 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")