jerome monnot

Citata da

	Tutte	Dal 2018
Citazioni	2579	999
Indice H	28	17
i10-index	70	33

220

110

165

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202310 21 17 14 86 33 107 99 86 100 96 142 111 131 159 170 155 176 174 175 167 214 93

Accesso pubblico

Visualizza tutto

18 articoli

3 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
Adria LyraUniversidade Federal Rural do Rio de JaneiroEmail verificata su ufrrj.br
Martin MilaničUniversity of Primorska, Koper, SloveniaEmail verificata su upr.si
Vadim LozinUniversity of WarwickEmail verificata su warwick.ac.uk
Aris PagourtzisNational Technical University of AthensEmail verificata su cs.ntua.gr
Lirong XiaAssociate Professor, Rensselaer Polytechnic Institute (RPI)Email verificata su cs.rpi.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 XiaoSchool of Computer Science and Engineering, The University of Electronic Science andEmail 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	80	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	78	2003
Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006	76	2006
The traveling salesman problem and its variations J Monnot, S Toulouse Paradigms of combinatorial optimization: problems and new approaches, 173-214, 2014	75	2014
Reoptimization of minimum and maximum traveling salesman’s tours G Ausiello, B Escoffier, J Monnot, VT Paschos Algorithm Theory–SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory …, 2006	69	2006
Optimal reallocation under additive and ordinal preferences H Aziz, P Biró, J Lang, J Lesca, J Monnot	65	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	64	2010
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	64	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	64	2002
The path partition problem and related problems in bipartite graphs J Monnot, S Toulouse Operations Research Letters 35 (5), 677-684, 2007	62	2007
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	55	2012
Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007	55	2007
Approximation algorithms for some vehicle routing problems C Bazgan, R Hassin, J Monnot Discrete applied mathematics 146 (1), 27-42, 2005	52	2005
The labeled perfect matching in bipartite graphs J Monnot Information Processing Letters 96 (3), 81-88, 2005	51	2005
Near Fairness in Matroids. L Gourvès, J Monnot, L Tlilane ECAI 14, 393-398, 2014	50	2014
The minimum reload s–t path, trail and walk problems L Gourves, A Lyra, C Martinhon, J Monnot Discrete Applied Mathematics 158 (13), 1404-1417, 2010	47	2010
Approximation algorithms for the traveling salesman problem J Monnot, VT Paschos, S Toulouse Mathematical methods of operations research 56, 387-405, 2003	45	2003
Differential approximation results for the traveling salesman and related problems J Monnot Information Processing Letters 82 (5), 229-235, 2002	45	2002
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	43	2009
On strong equilibria in the max cut game L Gourves, J Monnot Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009	43	2009

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