Julián Mestre

According to our database1, Julián Mestre authored at least 55 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
The Ad Types Problem.
CoRR, 2019

Turbocharging Treewidth Heuristics.
Algorithmica, 2019

2018
Approximating weighted neighborhood independent sets.
Inf. Process. Lett., 2018

Approximating weighted induced matchings.
Discrete Applied Mathematics, 2018

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
Algorithmica, 2018

2017
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems.
SIAM J. Discrete Math., 2017

Precedence-Constrained Min Sum Set Cover.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Towards Memory-Optimal Schedules for SDF.
Proceedings of the Euro-Par 2017: Parallel Processing Workshops, 2017

Barrier Coverage with Uniform Radii in 2D.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Universal Sequencing on an Unreliable Machine.
Encyclopedia of Algorithms, 2016

Weighted Popular Matchings.
Encyclopedia of Algorithms, 2016

Subset Sum Algorithm for Bin Packing.
Encyclopedia of Algorithms, 2016

Resolving Conflicting Predictions from Multimapping Reads.
Journal of Computational Biology, 2016

Parametric Packing of Selfish Items and the Subset Sum Algorithm.
Algorithmica, 2016

2015
On the intersection of independence systems.
Oper. Res. Lett., 2015

On Tree-Constrained Matchings and Generalizations.
Algorithmica, 2015

Welfare Maximization in Fractional Hedonic Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones.
IEEE Trans. Mob. Comput., 2014

Weighted popular matchings.
ACM Trans. Algorithms, 2014

Computational aspects of random serial dictatorship.
SIGecom Exchanges, 2014

Parametrized algorithms for random serial dictatorship.
Mathematical Social Sciences, 2014

Optimization problems in dotted interval graphs.
Discrete Applied Mathematics, 2014

Editorial: COCOON 2012 Special Issue.
Algorithmica, 2014

2013
A Distributed Algorithm for Large-Scale Generalized Matching.
PVLDB, 2013

A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem.
ACM Journal of Experimental Algorithmics, 2013

Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
The checkpoint problem.
Theor. Comput. Sci., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Max-coloring paths: tight bounds and extensions.
J. Comb. Optim., 2012

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.
Algorithmica, 2012

Enabling mobile distributed social networking on smartphones.
Proceedings of the 15th ACM International Conference on Modeling, 2012

2011
Popular mixed matchings.
Theor. Comput. Sci., 2011

To fill or not to fill: The gas station problem.
ACM Trans. Algorithms, 2011

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.
SIAM J. Discrete Math., 2011

Improved Approximations for Guarding 1.5-Dimensional Terrains.
Algorithmica, 2011

Approximation Algorithms for the Interval Constrained Coloring Problem.
Algorithmica, 2011

2010
Approximation of Partial Capacitated Vertex Cover.
SIAM J. Discrete Math., 2010

Adaptive Local Ratio.
SIAM J. Comput., 2010

Assigning Papers to Referees.
Algorithmica, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Bonsai: Growing Interesting Small Trees.
Proceedings of the ICDM 2010, 2010

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).
Proceedings of the Algorithms, 2010

2009
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.
Algorithmica, 2009

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.
Algorithmica, 2009

2008
Weighted Popular Matchings.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

Improved Approximations for Guarding 1.5-Dimensional Terrains
CoRR, 2008

Approximating the Interval Constrained Coloring Problem.
Proceedings of the Algorithm Theory, 2008

Lagrangian Relaxation and Partial Cover (Extended Abstract).
Proceedings of the STACS 2008, 2008

An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.
Proceedings of the Algorithms, 2008

2007
Lagrangian Relaxation and Partial Cover
CoRR, 2007

2006
On the multi-radius cover problem.
Inf. Process. Lett., 2006

Greedy in Approximation Algorithms.
Proceedings of the Algorithms, 2006

2004
Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan.
Proceedings of the Seventh International Workshop on the Web and Databases, 2004


  Loading...