Jérémie Chalopin 个人学术档案

引用次数

	总计	2019 年至今
引用	1718	710
h 指数	25	16
i10 指数	53	25

160

120

200520062007200820092010201120122013201420152016201720182019202020212022202320247 20 31 53 19 62 55 95 92 109 98 107 129 101 128 98 143 102 106 127

开放获取的出版物数量

查看全部

20 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Shantanu DasAix-Marseille University, France在 lif.univ-mrs.fr 的电子邮件经过验证
Yves MétivierProfesseur émérite LaBRI Université de Bordeaux在 labri.fr 的电子邮件经过验证
Matúš MihalákAssistant Professor, Department of Data Science and Knowledge Engineering, Maastricht University在 maastrichtuniversity.nl 的电子邮件经过验证
Yann DisserProfessor for Combinatorial Optimization, Department of Mathematics, TU Darmstadt在 mathematik.tu-darmstadt.de 的电子邮件经过验证
Nicola SantoroDistingushed Research Professor, Carleton University在 scs.carleton.ca 的电子邮件经过验证
Daniel GonçalvesLIRMM, CNRS, Université de Montpellier在 lirmm.fr 的电子邮件经过验证
olivier bournezProfessor of Computer Science, Ecole Polytechnique, France在 lix.polytechnique.fr 的电子邮件经过验证
Johanne CohenCNRS, LISN, Université Paris-Saclay在 lri.fr 的电子邮件经过验证
Xavier KoeglerUniversité Paris 7在 liafa.jussieu.fr 的电子邮件经过验证
Pascal OchemLIRMM - CNRS在 lirmm.fr 的电子邮件经过验证
Andrzej PelcProfessor of Computer Science, Universite du Quebec en Outaouais在 uqo.ca 的电子邮件经过验证
Adrian KosowskiCo-founder, CPO at Pathway在 pathway.com 的电子邮件经过验证
Euripides MarkouDept of Computer Science & Biomedical Informatics, University of Thessaly, Lamia, Greece在 dib.uth.gr 的电子邮件经过验证
Boštjan BrešarProfessor of Mathematics, University of Maribor在 um.si 的电子邮件经过验证
Andreas BärtschiScientist, Los Alamos National Laboratory在 lanl.gov 的电子邮件经过验证
Daniel PaulusmaDepartment of Computer Science, Durham University在 durham.ac.uk 的电子邮件经过验证
Bernard MansMacquarie University在 mq.edu.au 的电子邮件经过验证
Paola FlocchiniUniversity of Ottawa在 eecs.uottawa.ca 的电子邮件经过验证
Paolo PennaIOG在 iohk.io 的电子邮件经过验证
Daniel Wolleb-GrafApple Inc.在 apple.com 的电子邮件经过验证

关注

Jérémie Chalopin

LIS, CNRS & Aix-Marseille Université

在 lis-lab.fr 的电子邮件经过验证


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Every planar graph is the intersection graph of segments in the plane J Chalopin, D Gonçalves Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	116	2009
Weakly modular graphs and nonpositive curvature J Chalopin, V Chepoi, H Hirai, D Osajda American Mathematical Society 268 (1309), 2020	76	2020
Rendezvous of mobile agents in unknown graphs with faulty links J Chalopin, S Das, N Santoro International Symposium on Distributed Computing, 108-122, 2007	70	2007
Network exploration by silent and oblivious robots J Chalopin, P Flocchini, B Mans, N Santoro International Workshop on Graph-Theoretic Concepts in Computer Science, 208-219, 2010	65	2010
Constructing a map of an anonymous graph: Applications of universal sequences J Chalopin, S Das, A Kosowski Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010	65	2010
Mobile agent algorithms versus message passing algorithms J Chalopin, E Godard, Y Métivier, R Ossamy International Conference On Principles Of Distributed Systems, 187-201, 2006	60	2006
Cop and robber games when the robber can hide and ride J Chalopin, V Chepoi, N Nisse, Y Vaxès SIAM Journal on Discrete Mathematics 25 (1), 333-359, 2011	55	2011
Helly groups J Chalopin, V Chepoi, A Genevois, H Hirai, D Osajda arXiv preprint arXiv:2002.06895, 2020	53	2020
Data delivery by energy-constrained mobile agents on a line J Chalopin, R Jacob, M Mihalák, P Widmayer Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014	38	2014
Black hole search with finite automata scattered in a synchronous torus J Chalopin, S Das, A Labourel, E Markou Distributed Computing: 25th International Symposium, DISC 2011, Rome, Italy …, 2011	38	2011
Data delivery by energy-constrained mobile agents J Chalopin, S Das, M Mihal’ák, P Penna, P Widmayer Algorithms for Sensor Systems: 9th International Symposium on Algorithms and …, 2014	37	2014
An efficient message passing election algorithm based on Mazurkiewicz's algorithm J Chalopin, Y Métivier Fundamenta Informaticae 80 (1-3), 221-246, 2007	36	2007
Unlabeled sample compression schemes and corner peelings for ample and maximum classes J Chalopin, V Chepoi, S Moran, MK Warmuth Journal of Computer and System Sciences 127, 1-28, 2022	33	2022
Bucolic complexes B Brešar, J Chalopin, V Chepoi, T Gologranc, D Osajda Advances in mathematics 243, 127-167, 2013	33	2013
Planar graphs have 1-string representations J Chalopin, D Gonçalves, P Ochem Discrete & Computational Geometry 43 (3), 626, 2010	33	2010
Collaborative delivery with energy-constrained mobile robots A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ... Theoretical Computer Science 810, 2-14, 2020	30	2020
Restricted frame graphs and a conjecture of Scott J Chalopin, L Esperet, Z Li, PO de Mendez arXiv preprint arXiv:1406.0338, 2014	30	2014
Local computations in graphs: the case of cellular edge local computations J Chalopin, Y Métivier, W Zielonka Fundamenta Informaticae 74 (1), 85-114, 2006	30	2006
Rendezvous in networks in spite of delay faults J Chalopin, Y Dieudonné, A Labourel, A Pelc Distributed Computing 29, 187-205, 2016	28*	2016
Energy-efficient delivery by heterogeneous mobile agents A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna arXiv preprint arXiv:1610.02361, 2016	27	2016

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用