Jean-Sébastien Sereni

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 18

Top Venues

Electron. J. Comb.

CoRR

SIAM J. Discret. Math.

Biosyst.

University of Nice Sophia Antipolis, France (PHD)

Education History

University of Nice Sophia Antipolis, France

PHD

Publications

Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. 48 (2) (2023)
Elena Fimmel, Christian J. Michel, François Pirot, Jean-Sébastien Sereni, Lutz Strüngmann
Diletter and triletter comma-free codes over finite alphabets. Australas. J Comb. 86 (2023)
Christian J. Michel, Baptiste Mouillon, Jean-Sébastien Sereni
Trinucleotide k-circular codes I: Theory. Biosyst. 217 (2022)
Jakub Pekárek, Jean-Sébastien Sereni, Zelealem B. Yilma
The Minimum Number of Spanning Trees in Regular Multigraphs. Electron. J. Comb. 29 (4) (2022)
Christian J. Michel, Jean-Sébastien Sereni
Trinucleotide k-circular codes II: Biology. Biosyst. 217 (2022)
Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder, Lea Weber
Bipartite Independence Number in Graphs with Bounded Maximum Degree. SIAM J. Discret. Math. 35 (2) (2021)
François Pirot, Jean-Sébastien Sereni
Fractional Chromatic Number, Maximum Degree, and Girth. SIAM J. Discret. Math. 35 (4) (2021)
Zdenek Dvorák, Jean-Sébastien Sereni
On Fractional Fragility Rates of Graph Classes. Electron. J. Comb. 27 (4) (2020)
François Pirot, Jean-Sébastien Sereni, Riste Skrekovski
Variations on the Petersen Colouring Conjecture. Electron. J. Comb. 27 (1) (2020)
Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Eccentricity of networks with structural constraints. Discuss. Math. Graph Theory 40 (4) (2020)
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27 (1) (2020)
Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni
An algorithmic framework for colouring locally sparse graphs. CoRR (2020)
Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni
On the effect of symmetry requirement for rendezvous on the complete graph. CoRR (2020)
Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni
On Generalized Choice and Coloring Numbers. Electron. J. Comb. 26 (1) (2019)
Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25 (3) (2018)
Zdenek Dvorák, Jean-Sébastien Sereni
Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? Electron. J. Comb. 24 (3) (2017)
Rémi de Joannis de Verclos, Jean-Sébastien Sereni
Equitable colorings of $K_4$-minor-free graphs. J. Graph Algorithms Appl. 21 (6) (2017)
Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma
Closeness centralization measure for two-mode data of prescribed sizes. Netw. Sci. 4 (4) (2016)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. 22 (4) (2015)
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19 (1) (2015)
Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec
Limits of Order Types. SoCG (2015)
Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
Toward more localized local algorithms: removing assumptions concerning global knowledge. CoRR (2015)
Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77 (4) (2014)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond. Math. Soc. 89 (3) (2014)
Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni
Supersaturation in the Boolean Lattice. Integers (2014)
Dieter Rautenbach, Jean-Sébastien Sereni
Transversals of Longest Paths and Cycles. SIAM J. Discret. Math. 28 (1) (2014)
Jean-Sébastien Sereni, Zelealem B. Yilma
A tight bound on the set chromatic number. Discuss. Math. Graph Theory 33 (2) (2013)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Subcubic triangle-free graphs have fractional chromatic number at most 14/5 CoRR (2013)
Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. 26 (5-6) (2013)
Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni
Supersaturation in the Boolean lattice CoRR (2013)
Dieter Rautenbach, Jean-Sébastien Sereni
Transversals of Longest Paths and Cycles CoRR (2013)
Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma
Multiple Petersen Subdivisions in Permutation Graphs. Electron. J. Comb. 20 (1) (2013)
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma
A New Bound for the 2/3 Conjecture. Comb. Probab. Comput. 22 (3) (2013)
Daniel Král', Lukás Mach, Jean-Sébastien Sereni
A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 48 (2) (2012)
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. 26 (1) (2012)
Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
Collaborative Search on the Plane without Communication CoRR (2012)
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma
A new bound for the 2/3 conjecture CoRR (2012)
Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
Collaborative search on the plane without communication. PODC (2012)
Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26 (3) (2012)
David Coudert, Jean-Sébastien Sereni
Characterization of graphs and digraphs with small process numbers. Discret. Appl. Math. 159 (11) (2011)
Amos Korman, Jean-Sébastien Sereni, Laurent Viennot
Toward more localized local algorithms: removing assumptions concerning global knowledge. PODC (2011)
Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. SIAM J. Discret. Math. 25 (2) (2011)
Tobias Müller, Attila Pór, Jean-Sébastien Sereni
Graphs with Four Boundary Vertices. Electron. J. Comb. 18 (1) (2011)
Jean-Sébastien Sereni, Matej Stehlík
Edge-face coloring of plane graphs with maximum degree nine. J. Graph Theory 66 (4) (2011)
Pierre Charbit, Jean-Sébastien Sereni
The fractional chromatic number of Zykov products of graphs. Appl. Math. Lett. 24 (4) (2011)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discret. Math. 310 (3) (2010)
Zdenek Dvorák, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni
A note on antisymmetric flows in graphs. Eur. J. Comb. 31 (1) (2010)
Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni
The Last Fraction of a Fractional Conjecture. SIAM J. Discret. Math. 24 (2) (2010)
Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz
Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100 (6) (2010)
Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory, Ser. B 100 (4) (2010)
Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski
Facial colorings using Hall's Theorem. Eur. J. Comb. 31 (3) (2010)
Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu
Equitable Coloring of Sparse Planar Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discret. Math. 23 (3) (2009)
Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. SIAM J. Discret. Math. 23 (2) (2009)
Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
Circular choosability. J. Graph Theory 61 (4) (2009)
Ricardo C. Corrêa, Frédéric Havet, Jean-Sébastien Sereni
About a Brooks-type theorem for improper colouring. Australas. J Comb. 43 (2009)
Tobias Müller, Jean-Sébastien Sereni
Identifying and Locating-Dominating Codes in (Random) Geometric Networks. Comb. Probab. Comput. 18 (6) (2009)
Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30 (1) (2009)
Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni
Improper coloring of unit disk graphs. Networks 54 (3) (2009)
Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
Circular edge-colorings of cubic graphs with girth six. Electron. Notes Discret. Math. 34 (2009)
Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
Improper colouring of (random) unit disk graphs. Discret. Math. 308 (8) (2008)
Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
3-Facial Coloring of Plane Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Tobias Müller, Attila Pór, Jean-Sébastien Sereni
Lower bounding the boundary of a graph in terms of its maximum or minimum degree. Discret. Math. 308 (24) (2008)
Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
List colorings with measurable sets. J. Graph Theory 59 (3) (2008)
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
L(2, 1)-labelling of graphs. SODA (2008)
Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski
Total-Coloring of Plane Graphs with Maximum Degree Nine. SIAM J. Discret. Math. 22 (4) (2008)
Serguei Norine, Jean-Sébastien Sereni
Graphs with full rank 3-color matrix and few 3-colorings. J. Comb. Theory, Ser. B 98 (5) (2008)
Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT (2008)
Jean-Sébastien Sereni
Randomly colouring graphs (a combinatorial view). Comput. Sci. Rev. 2 (2) (2008)
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
Characterization of affine Steiner triple systems and Hall triple systems. Electron. Notes Discret. Math. 29 (2007)
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electron. Notes Discret. Math. 29 (2007)
David Coudert, Florian Huc, Jean-Sébastien Sereni
Pathwidth of outerplanar graphs. J. Graph Theory 55 (1) (2007)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electron. Notes Discret. Math. 28 (2007)
Frédéric Havet, Jean-Sébastien Sereni
Improper choosability of graphs and maximum average degree. J. Graph Theory 52 (3) (2006)
Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
3-facial colouring of plane graphs CoRR (2006)
Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni
Improper Colourings of Unit Disk Graphs. Electron. Notes Discret. Math. 22 (2005)
Frédéric Havet, Jean-Sébastien Sereni
Channel Assignment and Improper Choosability of Graphs. WG (2005)

Jean-Sébastien Sereni.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-Sébastien Sereni