Concepedia

Jérôme Monnot

JM

Statistics

Publications

39

Citations

1.2K

H-Index

21

Active since

1999

Affiliations

Université Paris Dauphine-PSL(Current)

Centre National de la Recherche Scientifique

Université Paris Cité

Université Sorbonne Paris Nord

Jérôme Monnot is an author at Université Paris Dauphine-PSL specializing in combinatorial optimization, engineering, and discrete mathematics.

Top concepts

EngineeringCombinatorial OptimizationDiscrete MathematicsMathematical ProgrammingComputer ScienceComputational ComplexityGraph TheoryApproximation TheoryOperations ResearchMechanism Design

Publications per year

1999–2021

39

Publications

39

The path partition problem and related problems in bipartite graphs

Jérôme Monnot, Sophie Toulouse · Operations Research Letters · 2007 · 75 citations

Graph Minor, Path Partition Problem, Network Science +11

Approximation algorithms and hardness results for labeled connectivity problems

Refael Hassin, Jérôme Monnot, Danny Segev · Journal of Combinatorial Optimization · 2007 · 71 citations

Engineering, Graph Theory, Network Algorithm +9

Local search for the minimum label spanning tree problem with bounded color classes

Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger · Operations Research Letters · 2003 · 59 citations

Mathematical Programming, Local Search, Engineering +12

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

Bruno Escoffier, Laurent Gourvès, Jérôme Monnot · Journal of Discrete Algorithms · 2009 · 55 citations

Geometric Graph Theory, Engineering, Graph Theory +9

Weighted Coloring: further complexity and approximability results

Bruno Escoffier, Jérôme Monnot · Information Processing Letters · 2005 · 55 citations

1–5 of 39