( en | de | ru )

 

Disambiguation of "Monnot, Jérôme"

Author of the publication

copydeleteadd this publication to your clipboard
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.

, , and . FCT, volume 8070 of Lecture Notes in Computer Science, page 171-182. Springer, (2013)

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.

Jérôme Huppertz

Modulation inflammatorischer Prozesse mittels GPI-verankerter Chemokin-Analoga. Uni München, (2009)

Jérôme Clerc

Jérôme Boucher

Jérôme Krets

Jérôme Feret

 

Other publications of authors with the same name

The Price of Optimum: Complexity and Approximation for a Matching Game., , and . Algorithmica, 77 (3): 836-866 (2017)The Minimum Reload s-tPath/Trail/Walk Problems., , , and . SOFSEM, volume 5404 of Lecture Notes in Computer Science, page 621-632. Springer, (2009)On the complexity of the selective graph coloring problem in some special classes of graphs., , , and . Theor. Comput. Sci., (2014)The Complexity of Bottleneck Labeled Graph Problems., , and . WG, volume 4769 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 233-246. Springer, (2011)On the Performance of Congestion Games for Optimum Satisfiability Problems., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 220-231. Springer, (2007)The labeled perfect matching in bipartite graphs.. Inf. Process. Lett., 96 (3): 81-88 (2005)The maximum f-depth spanning tree problem.. Inf. Process. Lett., 80 (4): 179-187 (2001)Approximation algorithms and hardness results for labeled connectivity problems., , and . J. Comb. Optim., 14 (4): 437-453 (2007)Weighted Upper Edge Cover: Complexity and Approximability., , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 235-247. Springer, (2019)