( en | de | ru )

 

Disambiguation of "Monnot, Jérôme"

Author of the publication

copydeleteadd this publication to your clipboard
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.

, , and . FCT, volume 2138 of Lecture Notes in Computer Science, page 275-286. Springer, (2001)

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

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation., , , , and . Discret. Appl. Math., 157 (4): 819-832 (2009)On a Simple Hedonic Game with Graph-Restricted Communication., , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 252-265. Springer, (2019)Reoptimization of maximum weight induced hereditary subgraph problems., , and . Theor. Comput. Sci., (2013)Selfish Scheduling with Setup Times., , and . WINE, volume 5929 of Lecture Notes in Computer Science, page 292-303. Springer, (2009)Extension of Some Edge Graph Problems: Standard and Parameterized Complexity., , , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 185-200. Springer, (2019)Maximum Independent Sets in Subcubic Graphs: New Results., , , and . CoRR, (2018)Minimum regulation of uncoordinated matchings, , and . CoRR, (2010)Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2., , and . FCT, volume 2138 of Lecture Notes in Computer Science, page 275-286. Springer, (2001)Complexity and Approximation Results for the Connected Vertex Cover Problem., , and . WG, volume 4769 of Lecture Notes in Computer Science, page 202-213. Springer, (2007)