jerome monnot

Dikutip oleh

	Semua	Sejak 2020
Kutipan	2923	988
indeks-h	30	16
indeks-i10	82	35

220

110

165

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202510 21 24 18 82 30 101 99 98 98 100 148 111 133 144 167 150 175 182 171 180 203 183 198 52

Akses publik

Lihat semua

22 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

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

Ikuti

jerome monnot

directeur de recherche, Lamsade, université Paris-Dauphine

Email yang diverifikasi di lamsade.dauphine.fr - Beranda

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


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Near fairness in matroids L Gourvès, J Monnot, L Tlilane ECAI 2014, 393-398, 2014	87	2014
Approximation algorithms and hardness results for labeled connectivity problems R Hassin, J Monnot, D Segev Journal of Combinatorial Optimization 14, 437-453, 2007	83	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	82	2003
The path partition problem and related problems in bipartite graphs J Monnot, S Toulouse Operations Research Letters 35 (5), 677-684, 2007	79	2007
The traveling salesman problem and its variations J Monnot, S Toulouse Paradigms of combinatorial optimization: problems and new approaches, 173-214, 2014	78	2014
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	77	2006
Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006	75	2006
Optimal reallocation under additive and ordinal preferences H Aziz, P Biró, J Lang, J Lesca, J Monnot Proceedings of the 15th International Conference on Autonomous Agents and …, 2016	71	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	70	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	70	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	62	2002
The labeled perfect matching in bipartite graphs J Monnot Information Processing Letters 96 (3), 81-88, 2005	60	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	59	2012
Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007	58	2007
Approximation algorithms for some vehicle routing problems C Bazgan, R Hassin, J Monnot Discrete applied mathematics 146 (1), 27-42, 2005	57	2005
On strong equilibria in the max cut game L Gourvès, J Monnot International Workshop on Internet and Network Economics, 608-615, 2009	52	2009
Approximation algorithms for the traveling salesman problem J Monnot, VT Paschos, S Toulouse Mathematical methods of operations research 56, 387-405, 2003	52	2003
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	49	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	48	2009
The many facets of upper domination C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... Theoretical Computer Science 717, 2-25, 2018	47	2018

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama