The following pages link to Julián Mestre (Q261355):
Displaying 50 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Parametrized algorithms for random serial dictatorship (Q477775) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- Popular mixed matchings (Q541674) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- The checkpoint problem (Q714790) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On the intersection of independence systems (Q1785309) (← links)
- Assigning papers to referees (Q1959732) (← links)
- An optimal lower bound for hierarchical universal solutions for TSP on the plane (Q2019459) (← links)
- Tight approximation for the minimum bottleneck generalized matching problem (Q2019475) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- The ad types problem (Q2692266) (← links)
- Universal Sequencing on an Unreliable Machine (Q2910853) (← links)
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (Q2986896) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * (Q3113762) (← links)
- To fill or not to fill (Q3189019) (← links)
- Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model (Q3225117) (← links)
- Approximating the Interval Constrained Coloring Problem (Q3512460) (← links)
- To Fill or Not to Fill: The Gas Station Problem (Q3527241) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- Universal Sequencing on a Single Machine (Q3569821) (← links)
- (Q3579440) (← links)
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Q3586398) (← links)
- The Checkpoint Problem (Q3588409) (← links)
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time (Q3595373) (← links)
- Weighted Popular Matchings (Q3613803) (← links)
- Popular Mixed Matchings (Q3638064) (← links)
- Max-Coloring Paths: Tight Bounds and Extensions (Q3652194) (← links)
- (Q4634396) (← links)
- (Q4910703) (← links)
- Barrier Coverage with Uniform Radii in 2D (Q5056051) (← links)
- Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements (Q5136256) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (Q5167778) (← links)
- A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem (Q5178741) (← links)
- Optimization Problems in Dotted Interval Graphs (Q5200493) (← links)
- A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem (Q5233591) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
