Julián Mestre

Available identifiers

zbMath Open mestre.julianMaRDI QIDQ261355

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147549	2024-01-15	Paper
The ad types problem	2023-03-21	Paper
Barrier Coverage with Uniform Radii in 2D	2022-12-09	Paper
Bounded-degree light approximate shortest-path trees in doubling metrics	2021-10-21	Paper
An optimal lower bound for hierarchical universal solutions for TSP on the plane	2021-04-21	Paper
Tight approximation for the minimum bottleneck generalized matching problem	2021-04-21	Paper
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements	2020-11-25	Paper
Precedence-Constrained Min Sum Set Cover	2020-11-25	Paper
A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem	2019-09-11	Paper
Turbocharging treewidth heuristics	2019-02-14	Paper
On the intersection of independence systems	2018-09-28	Paper
Approximating weighted induced matchings	2018-05-24	Paper
How unsplittable-flow-covering helps scheduling with job-dependent cost functions	2018-05-23	Paper
https://portal.mardi4nfdi.de/entity/Q4634396	2018-04-10	Paper
Approximating weighted neighborhood independent sets	2017-11-22	Paper
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems	2017-05-24	Paper
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints	2017-05-16	Paper
Parametric packing of selfish items and the subset sum algorithm	2016-03-23	Paper
Weighted popular matchings	2015-08-14	Paper
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem	2015-03-16	Paper
On tree-constrained matchings and generalizations	2015-03-02	Paper
Parametrized algorithms for random serial dictatorship	2014-12-09	Paper
To fill or not to fill	2014-09-09	Paper
Optimization problems in dotted interval graphs	2014-08-22	Paper
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions	2014-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4910703	2013-03-19	Paper
When LP is the cure for your matching woes: improved bounds for stochastic matchings	2012-12-06	Paper
Optimization Problems in Dotted Interval Graphs	2012-11-06	Paper
The checkpoint problem	2012-10-11	Paper
Max-coloring paths: tight bounds and extensions	2012-10-01	Paper
Universal Sequencing on an Unreliable Machine	2012-09-12	Paper
Improved Approximations for Guarding 1.5-Dimensional Terrains	2012-04-24	Paper
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model	2012-03-15	Paper
IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL *	2012-01-23	Paper
Approximation algorithms for the interval constrained coloring problem	2011-09-20	Paper
Approximation of Partial Capacitated Vertex Cover	2011-07-18	Paper
On Tree-Constrained Matchings and Generalizations	2011-07-06	Paper
Popular mixed matchings	2011-06-07	Paper
Improved approximations for guarding 1.5-dimensional terrains	2011-05-10	Paper
Adaptive Local Ratio	2011-04-04	Paper
Assigning papers to referees	2010-10-07	Paper
The Checkpoint Problem	2010-09-10	Paper
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings	2010-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q3579440	2010-08-06	Paper
Universal Sequencing on a Single Machine	2010-06-22	Paper
On the multi-radius cover problem	2010-01-29	Paper
Max-Coloring Paths: Tight Bounds and Extensions	2009-12-17	Paper
A primal-dual approximation algorithm for partial vertex cover: Making educated guesses	2009-07-24	Paper
Popular Mixed Matchings	2009-07-14	Paper
Combinatorial algorithms for data migration to minimize average completion time	2009-06-16	Paper
Weighted Popular Matchings	2009-03-12	Paper
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection	2008-11-25	Paper
To Fill or Not to Fill: The Gas Station Problem	2008-09-25	Paper
Approximation of Partial Capacitated Vertex Cover	2008-09-25	Paper
Approximating the Interval Constrained Coloring Problem	2008-07-15	Paper
Greedy in Approximation Algorithms	2008-03-11	Paper
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time	2007-08-28	Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques	2006-07-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Julián Mestre