default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Sébastien Sereni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j62]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: 233-270 (2023)- [j61]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): 942-953 (2023) - 2022
- [j60]Christian J. Michel, Baptiste Mouillon, Jean-Sébastien Sereni:
Trinucleotide k-circular codes I: Theory. Biosyst. 217: 104667 (2022) - [j59]Christian J. Michel, Jean-Sébastien Sereni:
Trinucleotide k-circular codes II: Biology. Biosyst. 217: 104668 (2022) - [j58]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) - 2021
- [j57]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): 1136-1148 (2021) - [j56]François Pirot, Jean-Sébastien Sereni:
Fractional Chromatic Number, Maximum Degree, and Girth. SIAM J. Discret. Math. 35(4): 2815-2843 (2021) - 2020
- [j55]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): 1 (2020) - [j54]François Pirot, Jean-Sébastien Sereni, Riste Skrekovski:
Variations on the Petersen Colouring Conjecture. Electron. J. Comb. 27(1): 1 (2020) - [j53]Zdenek Dvorák, Jean-Sébastien Sereni:
On Fractional Fragility Rates of Graph Classes. Electron. J. Comb. 27(4): 4 (2020) - [j52]Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma:
Eccentricity of networks with structural constraints. Discuss. Math. Graph Theory 40(4): 1141-1162 (2020) - [i9]Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni:
On the effect of symmetry requirement for rendezvous on the complete graph. CoRR abs/2002.03764 (2020) - [i8]Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni:
An algorithmic framework for colouring locally sparse graphs. CoRR abs/2004.07151 (2020)
2010 – 2019
- 2019
- [j51]Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni:
On Generalized Choice and Coloring Numbers. Electron. J. Comb. 26(1): 1 (2019) - 2018
- [j50]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): 3 (2018) - 2017
- [j49]Zdenek Dvorák, Jean-Sébastien Sereni:
Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? Electron. J. Comb. 24(3): 3 (2017) - [j48]Rémi de Joannis de Verclos, Jean-Sébastien Sereni:
Equitable colorings of $K_4$-minor-free graphs. J. Graph Algorithms Appl. 21(6): 1091-1105 (2017) - 2016
- [j47]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): 474-490 (2016) - 2015
- [j46]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. 22(4): 4 (2015) - [j45]Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni:
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19(1): 1-9 (2015) - [c6]Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec:
Limits of Order Types. SoCG 2015: 300-314 - [i7]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. CoRR abs/1512.03306 (2015) - 2014
- [j44]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean Lattice. Integers 14A: A4 (2014) - [j43]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): 299-329 (2014) - [j42]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): 641-662 (2014) - [j41]Dieter Rautenbach, Jean-Sébastien Sereni:
Transversals of Longest Paths and Cycles. SIAM J. Discret. Math. 28(1): 335-341 (2014) - 2013
- [j40]Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma:
Multiple Petersen Subdivisions in Permutation Graphs. Electron. J. Comb. 20(1): 37 (2013) - [j39]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): 384-393 (2013) - [j38]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. 26(5-6): 289-308 (2013) - [j37]Jean-Sébastien Sereni, Zelealem B. Yilma:
A tight bound on the set chromatic number. Discuss. Math. Graph Theory 33(2): 461-465 (2013) - [i6]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. CoRR abs/1301.5296 (2013) - [i5]Dieter Rautenbach, Jean-Sébastien Sereni:
Transversals of Longest Paths and Cycles. CoRR abs/1302.5503 (2013) - [i4]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean lattice. CoRR abs/1303.4336 (2013) - 2012
- [j36]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): 487-498 (2012) - [j35]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): 145-168 (2012) - [j34]Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho:
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26(3): 884-895 (2012) - [c5]Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni:
Collaborative search on the plane without communication. PODC 2012: 77-86 - [i3]Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma:
A new bound for the 2/3 conjecture. CoRR abs/1204.2519 (2012) - [i2]Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni:
Collaborative Search on the Plane without Communication. CoRR abs/1205.2170 (2012) - 2011
- [j33]Pierre Charbit, Jean-Sébastien Sereni:
The fractional chromatic number of Zykov products of graphs. Appl. Math. Lett. 24(4): 432-437 (2011) - [j32]Tobias Müller, Attila Pór, Jean-Sébastien Sereni:
Graphs with Four Boundary Vertices. Electron. J. Comb. 18(1) (2011) - [j31]David Coudert, Jean-Sébastien Sereni:
Characterization of graphs and digraphs with small process numbers. Discret. Appl. Math. 159(11): 1094-1109 (2011) - [j30]Jean-Sébastien Sereni, Matej Stehlík:
Edge-face coloring of plane graphs with maximum degree nine. J. Graph Theory 66(4): 332-346 (2011) - [j29]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): 514-533 (2011) - [c4]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. PODC 2011: 49-58 - 2010
- [j28]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): 557-560 (2010) - [j27]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): 320-324 (2010) - [j26]Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski:
Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010) - [j25]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 B 100(4): 351-358 (2010) - [j24]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 B 100(6): 554-559 (2010) - [j23]Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni:
The Last Fraction of a Fractional Conjecture. SIAM J. Discret. Math. 24(2): 699-707 (2010) - [j22]Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu:
Equitable Coloring of Sparse Planar Graphs. SIAM J. Discret. Math. 24(4): 1572-1583 (2010)
2000 – 2009
- 2009
- [j21]Ricardo C. Corrêa, Frédéric Havet, Jean-Sébastien Sereni:
About a Brooks-type theorem for improper colouring. Australas. J Comb. 43: 219-230 (2009) - [j20]Tobias Müller, Jean-Sébastien Sereni:
Identifying and Locating-Dominating Codes in (Random) Geometric Networks. Comb. Probab. Comput. 18(6): 925-952 (2009) - [j19]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): 53-69 (2009) - [j18]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: 525-529 (2009) - [j17]Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Circular choosability. J. Graph Theory 61(4): 241-270 (2009) - [j16]Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper coloring of unit disk graphs. Networks 54(3): 150-164 (2009) - [j15]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): 979-992 (2009) - [j14]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): 1465-1483 (2009) - 2008
- [j13]Jean-Sébastien Sereni:
Randomly colouring graphs (a combinatorial view). Comput. Sci. Rev. 2(2): 63-95 (2008) - [j12]Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Improper colouring of (random) unit disk graphs. Discret. Math. 308(8): 1438-1454 (2008) - [j11]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): 6581-6583 (2008) - [j10]Serguei Norine, Jean-Sébastien Sereni:
Graphs with full rank 3-color matrix and few 3-colorings. J. Comb. Theory B 98(5): 1115-1116 (2008) - [j9]Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
List colorings with measurable sets. J. Graph Theory 59(3): 229-238 (2008) - [j8]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-Facial Coloring of Plane Graphs. SIAM J. Discret. Math. 22(1): 231-247 (2008) - [j7]Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski:
Total-Coloring of Plane Graphs with Maximum Degree Nine. SIAM J. Discret. Math. 22(4): 1462-1479 (2008) - [c3]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs. SODA 2008: 621-630 - [c2]Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé:
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT 2008: 41-52 - 2007
- [j6]Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electron. Notes Discret. Math. 28: 47-53 (2007) - [j5]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: 17-21 (2007) - [j4]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: 23-27 (2007) - [j3]David Coudert, Florian Huc, Jean-Sébastien Sereni:
Pathwidth of outerplanar graphs. J. Graph Theory 55(1): 27-41 (2007) - 2006
- [b1]Jean-Sébastien Sereni:
Colorations de graphes et applications. (Graph colorings and applications). University of Nice Sophia Antipolis, France, 2006 - [j2]Frédéric Havet, Jean-Sébastien Sereni:
Improper choosability of graphs and maximum average degree. J. Graph Theory 52(3): 181-199 (2006) - [i1]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-facial colouring of plane graphs. CoRR abs/cs/0607008 (2006) - 2005
- [j1]Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper Colourings of Unit Disk Graphs. Electron. Notes Discret. Math. 22: 123-128 (2005) - [c1]Frédéric Havet, Jean-Sébastien Sereni:
Channel Assignment and Improper Choosability of Graphs. WG 2005: 81-90
Coauthor Index
aka: Daniel Král'
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
