Jean-Sébastien Sereni

79 papers A* 4B 1Journal 72Unranked 1

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