Sylvain Gravier

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 37

Top Venues

Publications

Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau
Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theor. Comput. Sci. 990 (2024)
Sylvain Gravier, Hippolyte Signargout, Souad Slimani
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs. Discuss. Math. Graph Theory 44 (4) (2024)
Florian Galliot, Sylvain Gravier, Isabelle Sivignon
An update on the coin-moving game on the square grid. CoRR (2023)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Partitions and well-coveredness: The graph sandwich problem. Discret. Math. 346 (3) (2023)
Florian Galliot, Sylvain Gravier, Isabelle Sivignon
(k-2)-linear connected components in hypergraphs of rank k. CoRR (2023)
Wilder P. Mendes, Simone Dantas, Sylvain Gravier
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals. Discret. Appl. Math. 333 (2023)
Florian Galliot, Sylvain Gravier, Isabelle Sivignon
Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability. CoRR (2022)
Wilder P. Mendes, Simone Dantas, Sylvain Gravier
The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles. LAGOS (2021)
Erika Morais Martins Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein
On the Oriented Coloring of the Disjoint Union of Graphs. IWOCA (2021)
Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna
On clique-inverse graphs of graphs with bounded clique number. J. Graph Theory 94 (4) (2020)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. Discret. Appl. Math. 281 (2020)
Sylvain Gravier, Hippolyte Signargout, Souad Slimani
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs. CoRR (2020)
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. LATIN (2020)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
On Caterpillars of Game Chromatic Number 4. LAGOS (2019)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
Timber game as a counting problem. Discret. Appl. Math. 261 (2019)
Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa Furtado, Sylvain Gravier
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. Discret. Math. 342 (5) (2019)
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746 (2018)
Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani
Game distinguishing numbers of Cartesian products. Ars Math. Contemp. 14 (1) (2018)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the forbidden induced subgraph probe and sandwich problems. Discret. Appl. Math. 234 (2018)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69 (2018)
Clément Charpentier, Sylvain Gravier, Thomas Lecorre
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. J. Comb. Optim. 33 (2) (2017)
Sylvain Gravier, Élise Vandomme
-covering codes. Discuss. Math. Graph Theory 37 (4) (2017)
Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani
A New Game Invariant of Graphs: the Game Distinguishing Number. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Discret. Appl. Math. 198 (2016)
Sylvain Gravier, Frédéric Maffray, Lucas Pastor
On the Choosability of Claw-Free Perfect Graphs. Graphs Comb. 32 (6) (2016)
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR (2016)
Méziane Aïder, Sylvain Gravier, Souad Slimani
Relaxed Locally Identifying Coloring of Graphs. Graphs Comb. 32 (5) (2016)
Méziane Aïder, Sylvain Gravier, Souad Slimani
Relaxed Locally Identifying Coloring of Graphs. CTW (2015)
Simone Dantas, Sylvain Gravier, Telma Pará
Solitaire Clobber played on Cartesian product of graphs. Discret. Appl. Math. 182 (2015)
Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs. Electron. J. Comb. 22 (4) (2015)
Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic
On disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs. WG (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the forbidden induced subgraph probe problem. CTW (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. Electron. Notes Discret. Math. 50 (2015)
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
On weak odd domination and graph-based quantum secret sharing. Theor. Comput. Sci. 598 (2015)
Kahina Meslem, Sylvain Gravier, Souad Slimani
Distinguishing Number and Circulant Graphs. CTW (2015)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
Timber Game with Caterpillars. CTW (2015)
Telma Pará, Simone Dantas, Sylvain Gravier
Solitaire clobber on circulant graphs. Discret. Math. 329 (2014)
Sylvain Gravier, Aline Parreau, Sara Rottey, Leo Storme, Élise Vandomme
Identifying codes in vertex-transitive graphs. CoRR (2014)
Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau
New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69 (2) (2013)
Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier
LAD models, trees, and an analog of the fundamental theorem of arithmetic. Discret. Appl. Math. 161 (7-8) (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW (2013)
Sylvain Gravier, Anne Lacroix, Souad Slimani
. Discret. Appl. Math. 161 (4-5) (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. Electron. Notes Discret. Math. 44 (2013)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying Codes in Line Graphs. J. Graph Theory 73 (4) (2013)
Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the Oriented Chromatic Number of Union of Graphs. CTW (2012)
Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau
New results on variants of covering codes in Sierpinski graphs CoRR (2012)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19 (2) (2012)
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
Quantum Secret Sharing with Graph States. MEMICS (2012)
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
On Weak Odd Domination and Graph-based Quantum Secret Sharing CoRR (2011)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18 (1) (2011)
Telma Pará, Simone Dantas, Sylvain Gravier
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber. Electron. Notes Discret. Math. 37 (2011)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Edge identifying codes. Electron. Notes Discret. Math. 38 (2011)
Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau
On two variations of identifying codes. Discret. Math. 311 (17) (2011)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying codes in line graphs CoRR (2011)
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
Optimal accessing and non-accessing structures for graph protocols CoRR (2011)
Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12 (3) (2010)
Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau
On two variations of identifying codes CoRR (2010)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally identifying coloring of graphs CoRR (2010)
Paul Dorbec, Sylvain Gravier
Paired-Domination in Subdivided Star-Free Graphs. Graphs Comb. 26 (1) (2010)
Méziane Aïder, Sylvain Gravier, Kahina Meslem
Isometric embeddings of subdivided connected graphs into hypercubes. Discret. Math. 309 (22) (2009)
Laurent Beaudou, Sylvain Gravier, Kahina Meslem
Subdivided graphs as isometric subgraphs of Hamming graphs. Eur. J. Comb. 30 (5) (2009)
Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski
Another bridge between Nim and Wythoff. Australas. J Comb. 44 (2009)
Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard
Weighted perfect codes in Lee metric. Electron. Notes Discret. Math. 34 (2009)
Éric Duchêne, Sylvain Gravier, Mehdi Mhalla
Combinatorial graph games. Ars Comb. 90 (2009)
Telma Pará, Sylvain Gravier, Simone Dantas
Impartial Solitaire Clobber played on Powers of Paths. Electron. Notes Discret. Math. 35 (2009)
Éric Duchêne, Sylvain Gravier
Geometrical extensions of Wythoff's game. Discret. Math. 309 (11) (2009)
Éric Duchêne, Sylvain Gravier, Julien Moncel
New results about impartial solitaire clobber. RAIRO Oper. Res. 43 (4) (2009)
Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha
On Planarity of Direct Product of multipartite Complete Graphs. Discret. Math. Algorithms Appl. 1 (1) (2009)
Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard
Weighted codes in Lee metrics. Des. Codes Cryptogr. 52 (2) (2009)
Mohamed El-Zahar, Sylvain Gravier, Antoaneta Klobucar
On the total domination number of cross products of graphs. Discret. Math. 308 (10) (2008)
Paul Dorbec, Sylvain Gravier
-Free Graphs. Graphs Comb. 24 (4) (2008)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive identification in graphs. J. Comb. Theory, Ser. A 115 (7) (2008)
Paul Dorbec, Sylvain Gravier, Gábor N. Sárközy
-tight Berge-cycles in hypergraphs. J. Graph Theory 59 (1) (2008)
Laurent Beaudou, Sylvain Gravier, Kahina Meslem
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube. SIAM J. Discret. Math. 22 (3) (2008)
Sylvain Gravier, Ralf Klasing, Julien Moncel
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3 (1) (2008)
Sylvain Gravier, Julien Moncel, Ahmed Semri
Identifying Codes of Cartesian Product of Two Cliques of the Same Size. Electron. J. Comb. 15 (1) (2008)
Sylvain Gravier, Julien Moncel
On graphs having a V\{x} set as an identifying code. Discret. Math. 307 (3-5) (2007)
Laurent Beaudou, Sylvain Gravier, Kahina Meslem
Isometric embeddings of subdivided complete graphs in the hypercube. Electron. Notes Discret. Math. 29 (2007)
Paul Dorbec, Sylvain Gravier, Michael A. Henning
Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14 (1) (2007)
Sylvain Gravier, Julien Moncel, Charles Payan
A generalization of the pentomino exclusion problem: Dislocation of graphs. Discret. Math. 307 (3-5) (2007)
Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan
Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26 (1) (2006)
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
Extended skew partition problem. Discret. Math. 306 (19-20) (2006)
Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154 (8) (2006)
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi
On maximum planar induced subgraphs. Discret. Appl. Math. 154 (13) (2006)
Méziane Aïder, Sylvain Gravier, Kahina Meslem
Isometric embedding of subdivided Connected graphs in the hypercube. Electron. Notes Discret. Math. 24 (2006)
Sylvain Gravier, Julien Moncel, Ahmed Semri
Identifying codes of cycles. Eur. J. Comb. 27 (5) (2006)
Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan
Quantum Octal Games. Int. J. Found. Comput. Sci. 17 (4) (2006)
Éric Duchêne, Sylvain Gravier, Mehdi Mhalla
Around Wythoff's game. Electron. Notes Discret. Math. 22 (2005)
Sylvain Gravier, Julien Moncel
Construction of Codes Identifying Sets of Vertices. Electron. J. Comb. 12 (2005)
C. N. Campos, Simone Dantas, Luérbio Faria, Sylvain Gravier
-Partition Problem. Electron. Notes Discret. Math. 22 (2005)
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
Finding H-partitions efficiently. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets. Eur. J. Comb. 25 (5) (2004)
Sylvain Gravier, Frédéric Maffray
On the choice number of claw-free perfect graphs. Discret. Math. 276 (1-3) (2004)
Simone Dantas, Sylvain Gravier, Frédéric Maffray
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Discret. Appl. Math. 141 (1-3) (2004)
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17 (3) (2004)
Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales
-free graphs. Electron. Notes Discret. Math. 18 (2004)
Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein
Graph covers using t-colourable vertex sets. Discret. Math. 278 (1-3) (2004)
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi
-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18 (2004)

Sylvain Gravier.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sylvain Gravier