Jérôme MONNOT

Jérôme MONNOT

Université Paris-Dauphine

H-index: 30

Europe-France

About Jérôme MONNOT

Jérôme MONNOT, With an exceptional h-index of 30 and a recent h-index of 16 (since 2020), a distinguished researcher at Université Paris-Dauphine, specializes in the field of Computational complexity, Graphs, Optimization, Algorithmic Game Theory, Computational Social Choice.

His recent articles reflect a diverse array of research interests and contributions to the field:

Extension of some edge graph problems: Standard, parameterized and approximation complexity

Project games

Complexity and algorithms for constant diameter augmentation problems

On the complexity of solution extension of optimization problems

Algorithmic aspects of upper edge domination

Abundant extensions

Strong cliques in diamond-free graphs

The maximum duo-preservation string mapping problem with bounded alphabet

Jérôme MONNOT Information

University

Position

CNRS, France

Citations(all)

3252

Citations(since 2020)

1114

Cited By

2203

hIndex(all)

30

hIndex(since 2020)

16

i10Index(all)

74

i10Index(since 2020)

32

Email

University Profile Page

Université Paris-Dauphine

Google Scholar

View Google Scholar Profile

Jérôme MONNOT Skills & Research Interests

Computational complexity

Graphs

Optimization

Algorithmic Game Theory

Computational Social Choice

Top articles of Jérôme MONNOT

Title

Journal

Author(s)

Publication Date

Extension of some edge graph problems: Standard, parameterized and approximation complexity

Discrete Applied Mathematics

Katrin Casel

Henning Fernau

Mehdi Khosravian Ghadikolaei

Jérôme Monnot

Florian Sikora

2023/12/15

Project games

Theoretical Computer Science

Vittorio Bilò

Laurent Gourvès

Jérôme Monnot

2023/1/9

Complexity and algorithms for constant diameter augmentation problems

Theoretical Computer Science

Eun Jung Kim

Martin Milanič

Jérôme Monnot

Christophe Picouleau

2022/2/15

On the complexity of solution extension of optimization problems

Theoretical Computer Science

Katrin Casel

Henning Fernau

Mehdi Khosravian Ghadikolaei

Jérôme Monnot

Florian Sikora

2022/2/15

Algorithmic aspects of upper edge domination

Theoretical Computer Science

Jérôme Monnot

Henning Fernau

David Manlove

2021/7/20

Abundant extensions

Katrin Casel

Henning Fernau

Mehdi Khosravian Ghadikolaei

Jérôme Monnot

Florian Sikora

2021/5/10

Strong cliques in diamond-free graphs

Theoretical Computer Science

Nina Chiarelli

Berenice Martínez-Barona

Martin Milanič

Jérôme Monnot

Peter Muršič

2021/2/16

The maximum duo-preservation string mapping problem with bounded alphabet

Nicolas Boria

Laurent Gourvès

Vangelis Th Paschos

Jérôme Monnot

2021

Computing and testing Pareto optimal committees

Autonomous Agents and Multi-Agent Systems

Haris Aziz

Jérôme Monnot

2020/4

On the Complexity of the Upper r-Tolerant Edge Cover Problem

Ararat Harutyunyan

Mehdi Khosravian Ghadikolaei

Nikolaos Melissinos

Jérôme Monnot

Aris Pagourtzis

2020

Weighted Upper Edge Cover: Complexity and Approximability.

J. Graph Algorithms Appl.

Kaveh Khoshkhah

Mehdi Khosravian Ghadikolaei

Jérôme Monnot

Florian Sikora

2020

Maximum independent sets in subcubic graphs: New results

Theoretical Computer Science

Ararat Harutyunyan

Michael Lampis

Vadim Lozin

Jérôme Monnot

2020/12/18

See List of Professors in Jérôme MONNOT University(Université Paris-Dauphine)