jerome monnot

Citata da

	Tutte	Dal 2019
Citazioni	2802	1067
Indice H	30	16
i10-index	78	35

220

110

165

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320249 20 23 18 68 30 121 99 86 103 100 139 108 134 151 167 144 172 185 169 173 209 184 146

Accesso pubblico

Visualizza tutto

22 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Refael HassinTel Aviv UniversityEmail verificata su post.tau.ac.il
Carlos Alberto MartinhonProfessor de Ciência da Computação, Universidade Federal FluminenseEmail verificata su dcc.ic.uff.br
Martin MilaničUniversity of Primorska, Koper, SloveniaEmail verificata su upr.si
yann chevaleyreProfesseur d'intelligence artificielle, université Paris Dauphine PSLEmail verificata su dauphine.fr
Vadim LozinUniversity of WarwickEmail verificata su warwick.ac.uk
Adria LyraUniversidade Federal Rural do Rio de JaneiroEmail verificata su ufrrj.br
Aris PagourtzisNational Technical University of AthensEmail verificata su cs.ntua.gr
Lirong XiaProfessor of Computer Science, Rutgers University - New Brunswick; Deputy Director of DIMACSEmail verificata su rutgers.edu
Evripidis BampisProfessor of Computer Science, Sorbonne UniversitéEmail verificata su lip6.fr
Petrica PopTechnical University Cluj Napoca, CUNBMEmail verificata su ubm.ro
stefano morettiDirecteur de Recherche, UMR CNRS 7243 Lamsade, Paris Dauphine UniversityEmail verificata su dauphine.fr
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail verificata su cs.rwth-aachen.de
Yasmin A. Rios-SolisTecnológico de Monterrey, Escuela de Ingeniería y CienciasEmail verificata su tec.mx
Mingyu XiaoUniversity of Electronic Science and Technology of ChinaEmail verificata su uestc.edu.cn
Fábio ProttiFull Professor, Fluminense Federal UniversityEmail verificata su ic.uff.br
Giorgio LucarelliLCOMS, University of LorraineEmail verificata su univ-lorraine.fr

Segui

jerome monnot

directeur de recherche, Lamsade, université Paris-Dauphine

Email verificata su lamsade.dauphine.fr - Home page

Théorie de la complexité approximation polynomiale optimisation combinatoire Théorie des jeux algorithmique ré-optimisation


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Approximation algorithms and hardness results for labeled connectivity problems R Hassin, J Monnot, D Segev Journal of Combinatorial Optimization 14, 437-453, 2007	81	2007
Local search for the minimum label spanning tree problem with bounded color classes T Brüggemann, J Monnot, GJ Woeginger Operations Research Letters 31 (3), 195-201, 2003	80	2003
The traveling salesman problem and its variations J Monnot, S Toulouse Paradigms of combinatorial optimization: problems and new approaches, 173-214, 2014	79	2014
The path partition problem and related problems in bipartite graphs J Monnot, S Toulouse Operations Research Letters 35 (5), 677-684, 2007	79	2007
Near fairness in matroids L Gourvès, J Monnot, L Tlilane ECAI 2014, 393-398, 2014	78	2014
Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006	76	2006
Reoptimization of minimum and maximum traveling salesman’s tours G Ausiello, B Escoffier, J Monnot, VT Paschos Scandinavian Workshop on Algorithm Theory, 196-207, 2006	74	2006
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs B Escoffier, L Gourvès, J Monnot Journal of Discrete Algorithms 8 (1), 36-49, 2010	69	2010
Optimal reallocation under additive and ordinal preferences H Aziz, P Biró, J Lang, J Lesca, J Monnot	68	2016
Possible winners when new candidates are added: The case of scoring rules Y Chevaleyre, J Lang, N Maudet, J Monnot Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 762-767, 2010	68	2010
Weighted node coloring: when stable sets are expensive M Demange, D Werra, J Monnot, VT Paschos Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002	63	2002
The labeled perfect matching in bipartite graphs J Monnot Information Processing Letters 96 (3), 81-88, 2005	57	2005
Approximation algorithms for some vehicle routing problems C Bazgan, R Hassin, J Monnot Discrete applied mathematics 146 (1), 27-42, 2005	57	2005
New candidates welcome! Possible winners with respect to the addition of new candidates Y Chevaleyre, J Lang, N Maudet, J Monnot, L Xia Mathematical Social Sciences 64 (1), 74-88, 2012	56	2012
Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007	56	2007
Approximation algorithms for the traveling salesman problem J Monnot, VT Paschos, S Toulouse Mathematical methods of operations research 56, 387-405, 2003	50	2003
On strong equilibria in the max cut game L Gourvès, J Monnot International Workshop on Internet and Network Economics, 608-615, 2009	49	2009
The minimum reload s–t path, trail and walk problems L Gourvès, A Lyra, C Martinhon, J Monnot Discrete Applied Mathematics 158 (13), 1404-1417, 2010	47	2010
Reoptimization of minimum and maximum traveling salesman's tours G Ausiello, B Escoffier, J Monnot, V Paschos Journal of Discrete Algorithms 7 (4), 453-463, 2009	46	2009
Differential approximation results for the traveling salesman and related problems J Monnot Information Processing Letters 82 (5), 229-235, 2002	45	2002

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori