( en | de | ru )

 

Disambiguation of "Mestre, Julián"

Author of the publication

copydeleteadd this publication to your clipboard
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.

, , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Edgardo Mestre

Julián Pacho

Julián Gallego Llerena

Julián Blanco Rodríguez

Julián Aranda Martínez

 

Other publications of authors with the same name

Approximating weighted induced matchings., , and . Discret. Appl. Math., (2018)Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality., , , and . PLoS Comput. Biol., (2008)A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems., , , and . CoRR, (2016)How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions., , and . Algorithmica, 80 (4): 1191-1213 (2018)An Optimal Incremental Algorithm for Minimizing Lateness with Rejection., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 601-610. Springer, (2008)Weighted Popular Matchings.. Encyclopedia of Algorithms, Springer, (2008)Greedy in Approximation Algorithms.. ESA, volume 4168 of Lecture Notes in Computer Science, page 528-539. Springer, (2006)Editorial: COCOON 2012 Special Issue., , and . Algorithmica, 70 (1): 1 (2014)Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Ad Types Problem., , , and . WINE, volume 12495 of Lecture Notes in Computer Science, page 45-58. Springer, (2020)