( en | de | ru )

 

Disambiguation of "Monnot, Jérôme"

Author of the publication

copydeleteadd this publication to your clipboard
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.

, , , , and . Discret. Appl. Math., 157 (4): 819-832 (2009)

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 Feret

Jérôme Callut

Jérôme Messineo

Jérôme David

 

Other publications of authors with the same name

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)The Complexity of Bottleneck Labeled Graph Problems., , and . WG, volume 4769 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)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 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)Differential approximation results for the traveling salesman and related problems.. Inf. Process. Lett., 82 (5): 229-235 (2002)Approximation algorithms and hardness results for labeled connectivity problems., , and . J. Comb. Optim., 14 (4): 437-453 (2007)The Price of Optimum: Complexity and Approximation for a Matching Game., , and . Algorithmica, 77 (3): 836-866 (2017)Weighted Upper Edge Cover: Complexity and Approximability., , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 235-247. Springer, (2019)