jerome monnot

Citat de

	Toate	Din 2018
Referințe bibliografice	2658	1094
h-index	29	17
i10-index	73	37

220

110

165

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220239 20 23 15 83 30 109 99 85 98 99 138 107 133 158 167 147 177 175 171 172 215 182

Acces public

Afișați-le pe toate

20 de articole

2 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Refael HassinTel Aviv UniversityAdresă de e-mail confirmată pe post.tau.ac.il
Carlos Alberto MartinhonProfessor de Ciência da Computação, Universidade Federal FluminenseAdresă de e-mail confirmată pe dcc.ic.uff.br
Adria LyraUniversidade Federal Rural do Rio de JaneiroAdresă de e-mail confirmată pe ufrrj.br
yann chevaleyreProfesseur d'intelligence artificielle, université Paris Dauphine PSLAdresă de e-mail confirmată pe dauphine.fr
Martin MilaničUniversity of Primorska, Koper, SloveniaAdresă de e-mail confirmată pe upr.si
Vadim LozinUniversity of WarwickAdresă de e-mail confirmată pe warwick.ac.uk
Aris PagourtzisNational Technical University of AthensAdresă de e-mail confirmată pe cs.ntua.gr
Lirong XiaAssociate Professor, Rensselaer Polytechnic Institute (RPI)Adresă de e-mail confirmată pe cs.rpi.edu
Evripidis BampisProfessor of Computer Science, Sorbonne UniversitéAdresă de e-mail confirmată pe lip6.fr
Petrica PopTechnical University Cluj Napoca, CUNBMAdresă de e-mail confirmată pe ubm.ro
stefano morettiDirecteur de Recherche, UMR CNRS 7243 Lamsade, Paris Dauphine UniversityAdresă de e-mail confirmată pe dauphine.fr
Gerhard WoegingerProfessor of Computer Science, RWTH AachenAdresă de e-mail confirmată pe cs.rwth-aachen.de
Yasmin A. Rios-SolisTecnológico de Monterrey, Escuela de Ingeniería y CienciasAdresă de e-mail confirmată pe tec.mx
Mingyu XiaoSchool of Computer Science and Engineering, The University of Electronic Science andAdresă de e-mail confirmată pe uestc.edu.cn
Fábio ProttiFull Professor, Fluminense Federal UniversityAdresă de e-mail confirmată pe ic.uff.br
Giorgio LucarelliLCOMS, University of LorraineAdresă de e-mail confirmată pe univ-lorraine.fr

Urmăriți

jerome monnot

directeur de recherche, Lamsade, université Paris-Dauphine

Adresă de e-mail confirmată pe lamsade.dauphine.fr - Pagina de pornire

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


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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
The traveling salesman problem and its variations J Monnot, S Toulouse Paradigms of combinatorial optimization: problems and new approaches, 173-214, 2014	77	2014
Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006	74	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	70	2006
Optimal reallocation under additive and ordinal preferences H Aziz, P Biró, J Lang, J Lesca, J Monnot	66	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	65	2010
The path partition problem and related problems in bipartite graphs J Monnot, S Toulouse Operations Research Letters 35 (5), 677-684, 2007	64	2007
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	63	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
Near Fairness in Matroids. L Gourvès, J Monnot, L Tlilane ECAI 14, 393-398, 2014	61	2014
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	55	2007
Approximation algorithms for some vehicle routing problems C Bazgan, R Hassin, J Monnot Discrete applied mathematics 146 (1), 27-42, 2005	54	2005
The labeled perfect matching in bipartite graphs J Monnot Information Processing Letters 96 (3), 81-88, 2005	51	2005
Approximation algorithms for the traveling salesman problem J Monnot, VT Paschos, S Toulouse Mathematical methods of operations research 56, 387-405, 2003	47	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	46	2010
On strong equilibria in the max cut game L Gourves, J Monnot International Workshop on Internet and Network Economics, 608-615, 2009	45	2009
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

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori