The following works benefited the support of the grant (in the research, writing and/or revision phase).

In Press

• Fractional coloring of triangle-free planar graphs, Z. Dvořák, J.-S. Sereni and J. Volec.
  The Electronic Journal of Combinatorics, forthcoming.

2015

• Coloring perfect graphs with no balanced skew-partitions, M. Chudnovsky, N. Trotignon, T. Trunck and K. Vušković.
  Journal of Combinatorial Theory, ser. B, 115:26--65, 2015.
• On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph, L. Esperet and G. Mazzuoccolo.
  Discrete Mathematics, 338(8):1509--1514, 2015.
• The graph formulation of the union-closed sets conjecture, P. Charbit, H. Bruhn, O. Schaudt and J. A. Telle.
  European Journal of Combinatorics, 43:210--219, 2015.
• Two-floor building needing eight colors, S. Bessy, D. Gonçalves and J.-S. Sereni.
  Journal of Graph Algorithms and Applications, 19:1--9, 2015.
• Vertex elimination orderings for hereditary graph classes, P. Aboulker, P. Charbit, N. Trotignon and K. Vušković.
  Discrete Mathematics, 338(5):825--834, 2015.
• Wheel-free planar graphs, P. Aboulker, M. Chudnovsky, P. D. Seymour and N. Trotignon.
  European Journal of Combinatorics, 49:57--67, 2015.

2014

• Coloring planar graphs with three colors and no large monochromatic components, L. Esperet and G. Joret.
  Combinatorics, Probability and Computing, 23(4):551--570, 2014.
• Complexity of colouring problems restricted to unichord-free and {square,unichord}-free graphs, R. C. S. Machado, C. M. H. de Figueiredo and N. Trotignon.
  Discrete Applied Mathematics, 164(1):191--199, 2014.
• Detecting wheels, E. Diot, S. Tavenas and N. Trotignon.
  Applicable Analysis and Discrete Mathematics, 8(1):111--122, 2014.
• Distance-two coloring of sparse graphs, Z. Dvořák and L. Esperet.
  European Journal of Combinatorics, 36:406--415, 2014.
• Extensions of fractional precolorings show discontinuous behavior, J. van den Heuvel, D. Král', M. Kupec, J.-S. Sereni and J. Volec.
  Journal of Graph Theory, 77:299--329, 2014.
• Influence of the tie-break rule on the end-vertex problem, P. Charbit, M. Habib and A. Mamcarz.
  Discrete Mathematics and Theoretical Computer Science, 16(2):57--72, 2014.
• Linear balanceable and subcubic balanceable graphs, P. Aboulker, M. Radovanović, N. Trotignon, T. Trunck and K. Vušković.
  Journal of Graph Theory, 75(2):150--166, 2014.
• List-coloring claw-free graphs with small clique number, L. Esperet, A. Gyárfás and F. Maffray.
  Graphs and Combinatorics, 30(2):365--375, 2014.
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings, L. Esperet and G. Mazzuoccolo.
  Journal of Graph Theory, 77(2):144--157, 2014.
• Subcubic triangle-free graphs have fractional chromatic number at most 14/5, Z. Dvořák, J.-S. Sereni and J. Volec.
  Journal of the London Mathematics Society, 89(3):641--662, 2014.
• Supersaturation in the Boolean lattice, A. P. Dove, J. R. Griggs, R. J. Kang and J.-S. Sereni.
  Integers, 14A:A4 (The Dick deBruijn Memorial Issue), 2014.
• Transversals of longest paths and cycles, D. Rautenbach and J.-S. Sereni.
  SIAM Journal on Discrete Mathematics, 28(1):335--341, 2014.

2013

• A complexity dichotomy for the coloring of sparse graphs, L. Esperet, M. Montassier, P. Ochem and A. Pinlou.
  Journal of Graph Theory, 73(3):267--279, 2013.
• Acyclic edge-coloring using entropy compression, L. Esperet and A. Parreau.
  European Journal of Combinatorics, 34(6):1019--1027, 2013.
• A new bound for the 2/3 conjecture, D. Král', C.-H. Liu, J.-S. Sereni, P. Whalen and Z. B. Yilma
  Combinatorics, Probability and Computing, 22(3):384--393, 2013.
• A tight bound on the set chromatic number, J.-S. Sereni and Z. B. Yilma.
  Discussiones Mathematicae Graph Theory, 33(2):461--465, 2013.
• Boxicity of graphs on surfaces, L. Esperet and G. Joret.
  Graphs and Combinatorics, 29(3):417--427, 2013.
• Complements of nearly perfect graphs, A. Gyárfás, Z. Li, R. C. S. Machado, A. Sebő S. Thomassé and N. Trotignon.
  Journal of Combinatorics, 4(3):299--310, 2013.
• Detecting an induced net subdivision, M. Chudnovsky, P. D. Seymour and N. Trotignon.
  Journal of Combinatorial Theory, Series B, 103(5):630--641, 2013.
• Edge-colouring and total-colouring chordless graphs, R. C. S. Machado, C. M. H. de Figueiredo and N. Trotignon.
  Discrete Mathematics, 313(14):1547--1552, 2013.
• Fire containment in planar graphs, L. Esperet, J. van den Heuvel, F. Maffray and F. Sipma.
  Journal of Graph Theory, 73(1):85--102, 2013.
• Multiple Petersen subdivisions in permutation graphs, T. Kaiser, J.-S. Sereni and Z. B. Yilma.
  The Electronic Journal of Combinatorics, 20:#P11, 9pp., 2013.
• Substitution and χ-Boundedness, M. Chudnovsky, I. Penev, A. Scott and N. Trotignon.
  Journal of Combinatorial Theory, Series B, 103(5):567--586, 2013.
• Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge, A. Korman, J.-S. Sereni and L. Viennot.
  Distributed Computing, 26(5-6):289--308, 2013.

2012

• A new lower bound based on Gromov’s method of selecting heavily covered points, D. Král', L. Mach and J.-S. Sereni.
  Discrete and Computational Geometry, 48(2):487--498, 2012.
• Combinatorial optimization with 2-joins, N. Trotignon and K. Vušković.
  Journal of Combinatorial Theory, Series B, 102(1):153--185, 2012.
• Detecting 2-joins faster, P. Charbit, M. Habib, N. Trotignon and K. Vušković.
  Journal of Discrete Algorithms, 17:60--66, 2012.
• Excluding induced subdivisions of the bull and related graphs, M. Chudnovsky, I. Penev, A. Scott and N. Trotignon.
  Journal of Graph Theory, 71:49--68, 2012.
• Finding an induced subdivision of a digraph, J. Bang-Jensen, F. Havet and N. Trotignon.
  Theoretical Computer Science, 443:10--24, 2012.
• Graphs that do not contain a cycle with a node that has at least two neighbors on it, P. Aboulker, M. Radovanović, N. Trotignon and K. Vušković.
  SIAM Journal on Discrete Mathematics, 26(4):1510--1531, 2012.
• Griggs and Yeh's Conjecture and L(p,1)-labelings, F. Havet, B. Reed and J.-S. Sereni.
  SIAM Journal on Discrete Mathematics, 26(1):145--168, 2012.
• Min-max relations for odd cycles in planar graphs, D. Král', J.-S. Sereni and L. Stacho.
  SIAM Journal on Discrete Mathematics, 26(3):884--895, 2012.
• On graphs with no induced subdivision of K4, B. Lévêque, F. Maffray and N. Trotignon.
  Journal of Combinatorial Theory, Series B, 102(4):924--947, 2012.
• The chromatic gap and its extremes, A. Gyárfás, A. Sebő and N. Trotignon.
  Journal of Combinatorial Theory, Series B, 102(5):1155--1178, 2012.

2011

• Characterization of graphs and digraphs with small process number, D. Coudert and J.-S. Sereni.
  Discrete Applied Mathematics, 159(11):1094--1109, 2011.
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem, M. Pouzet, H. SiKaddour and N. Trotignon.
  Contributions to Discrete Mathematics, 6(1):86--97, 2011.
• Every plane graph of maximum degree 8 has an edge-face 9-colouring, R. J. Kang, J.-S. Sereni and M. Stehlík.
  SIAM Journal on Discrete Mathematics 25(2):514--533, 2011.
• Exponentially perfect matchings in cubic graphs, L. Esperet, F. Kardoš, A. King, D. Kráľ and S. Norine.
  Advances in Mathematics 227(4):1646--1664, 2011.
• Graphs with four boundary vertices, T. Müller, A. Pór and J.-S. Sereni.
  The Electronic Journal of Combinatorics, 18:#P11, 18pp., 2011.
• On Roussel-Rubio-type lemmas and their consequences, N. Trotignon and K. Vušković.
  Discrete Mathematics, 311(8-9):684--687, 2011.
• The Fractional Chromatic Number of Zykov Products of Graphs, P. Charbit and J.-S. Sereni.
  Applied Mathematics Letters, 24(4):432--437, 2011.

• Limits of Order Types, X. Goaoc, A. Hubard, R. de Joannis de Verclos, J.-S. Sereni and J. Volec.
  In Proceedings of the 29th ACM Symposium on Computational Geometry (SoCG), pp. 600--614, 2015.
• Subcubic triangle-free graphs have fractional chromatic number at most 14/5, Z. Dvořák, J.-S. Sereni and J. Volec.
  In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2013), CRM Series 16, pages 497--502, 2013.
• Collaborative Search on the Plane without Communication, O. Feinerman, A. Korman, Z. Lotker and J.-S. Sereni.
  In Proceedings of the 31th ACM Symposium on Principles in Distributing Computing (PODC), pp. 77--86, 2012.
• Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge, A. Korman, J.-S. Sereni and L. Viennot.
  In Proceedings of the 30th ACM Symposium on Principles in Distributing Computing (PODC), pp. 49--58, 2011.