Jean‐Sébastien Sereni

Author

Centre National de la Recherche Scientifique

Also Known As

J.-S. SERENI, JEAN-SÉBASTIEN SERENI, Jean-Sebastien Sereni, Jean-Sébastien Sereni, Jean-sébastien Sereni, Jean‐Sébastien Sereni, SERENI, Jean-Sébastien, Sereni, Jean-S\'ebastien, Sereni, Jean-Sebastien, Sereni, Jean-Sébastien

128

Publications

Citations

H-Index

Concepts

All Affiliations

Centre National de la Recherche Scientifique Charles University Laboratoire d'Informatique Algorithmique: Fondements et Applications Université Paris Cité Institut national de recherche en sciences et technologies du numérique

About

Jean‐Sébastien Sereni is an author at Centre National de la Recherche Scientifique specializing in graph theory, discrete mathematics, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	6	6	153
2	Computer Science	5	5	143
3	Education	4	4	52
4	Natural Sciences	3	3	79
5	Biology	1	1	22

Jean‐Sébastien Sereni

Publications

836

Citations

H-Index

Page 1

	Year	Citations
Collaborative search on the plane without communication Ofer Feinerman, Amos Korman, Zvi Lotker,	2012	88
Total-Coloring of Plane Graphs with Maximum Degree Nine Łukasz Kowalik, Jean‐Sébastien Sereni, Riste Škrekovski SIAM Journal on Discrete Mathematics Geometric Graph TheoryMaximum Degree NineGraph TheoryExtremal Graph TheoryTopological Graph Theory	2008	64
Improper choosability of graphs and maximum average degree Frédéric Havet, Jean‐Sébastien Sereni Journal of Graph Theory Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryExtremal Graph Theory	2006	53
Fullerene graphs have exponentially many perfect matchings František Kardoš, Daniel Král͏̌, J. Miškuf, Journal of Mathematical Chemistry Graph TheoryPhysicsFullerene GraphsNatural SciencesTopological Graph Theory	2008	48
A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs Nicolas Lichiardopol, Attila Pór, Jean‐Sébastien Sereni SIAM Journal on Discrete Mathematics Graph MinorOut-degree TwoDisjoint CyclesGraph TheoryAlgebraic Graph Theory	2009	37
Griggs and Yeh's Conjecture and $L(p,1)$-labelings Frédéric Havet, Bruce Reed, Jean‐Sébastien Sereni SIAM Journal on Discrete Mathematics \Delta\geqslant \Delta_pGraph MinorGeometry Of NumberGeometric Graph TheoryGraph Theory	2012	36
Identifying and Locating–Dominating Codes in (Random) Geometric Networks Tobias M. Müller, Jean‐Sébastien Sereni Combinatorics Probability Computing Theory Of ComputingLocating–dominating CodeNetwork ScienceGraph TheoryEngineering	2009	36
Toward more localized local algorithms: removing assumptions concerning global knowledge Amos Korman, Jean‐Sébastien Sereni, Laurent Viennot Distributed Computing Artificial IntelligenceEngineeringData ScienceAutomated ReasoningKnowledge Discovery	2012	33
L(2,1)-labelling of graphs Frédéric Havet, Bruce Reed, Jean‐Sébastien Sereni HAL (Le Centre pour la Communication Scientifique Directe)	2008	30
Toward more localized local algorithms Amos Korman, Jean‐Sébastien Sereni, Laurent Viennot Mathematical ProgrammingEngineeringNetwork AnalysisComputational ComplexityLocalization Technique	2011	29

Page 1