The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sylvain Gravier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rachid Chérifi, Sylvain Gravier, Ismaïl Zighem
    Bounds on domination number of complete grid graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  2. Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
    A linear algorithm for minimum 1-identifying codes in oriented trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1246-1253 [Journal]
  3. Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem
    Domination Number of the Cross Product of Paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:101-139 [Journal]
  4. Simone Dantas, Celina M. Herrera de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
    Stable skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:17-22 [Journal]
  5. Simone Dantas, Sylvain Gravier, Frédéric Maffray
    Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:93-101 [Journal]
  6. Sylvain Gravier
    Total domination number of grid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:119-128 [Journal]
  7. Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak
    Complexity of list coloring problems with a fixed total number of colors. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:65-79 [Journal]
  8. Sylvain Gravier, Michel Mollard
    On Domination Numbers of Cartesian Product of Paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:247-250 [Journal]
  9. Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi
    On maximum planar induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1774-1782 [Journal]
  10. Sylvain Gravier, Charles Payan
    On the Pentomino Exclusion Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:375-386 [Journal]
  11. Celina M. Herrera de Figueiredo, Sylvain Gravier, Cláudia Linhares Sales
    On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:105-108 [Journal]
  12. Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
    Coloring the hypergraph of maximal cliques of a graph with no long path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:285-290 [Journal]
  13. Sylvain Gravier, Jeannette Janssen, Kyriakos Kilakos, Sulamita Klein
    Graph covers using t-colourable vertex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:61-80 [Journal]
  14. Sylvain Gravier, Sandi Klavzar, Michel Mollard
    Isometric embeddings of subdivided wheels in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:287-293 [Journal]
  15. Sylvain Gravier, Frédéric Maffray
    On the choice number of claw-free perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:211-218 [Journal]
  16. Sylvain Gravier, Frédéric Maffray, Bojan Mohar
    On a list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:303-308 [Journal]
  17. Sylvain Gravier, Michel Mollard, Charles Payan
    On the nonexistence of three-dimensional tiling in the Lee metric II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:151-157 [Journal]
  18. Simone Dantas, Celina M. Herrera de Figueiredo, Sylvain Gravier, Sulamita Klein
    Extended skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2438-2449 [Journal]
  19. Sylvain Gravier, Julien Moncel
    On graphs having a V\{x} set as an identifying code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:432-434 [Journal]
  20. Sylvain Gravier, Julien Moncel, Charles Payan
    A generalization of the pentomino exclusion problem: Dislocation of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:435-444 [Journal]
  21. Sylvain Gravier, Michel Mollard, Charles Payan
    On the Non-existence of 3-Dimensional Tiling in the Lee Metric. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:5, pp:567-572 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:5, pp:719-734 [Journal]
  23. Sylvain Gravier, Julien Moncel, Ahmed Semri
    Identifying codes of cycles. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:5, pp:767-776 [Journal]
  24. Sylvain Gravier, Charles Payan
    Flips Signés et Triangulations d'un Polygone. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:7, pp:817-821 [Journal]
  25. Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan
    Quantum Octal Games. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:4, pp:919-932 [Journal]
  26. Shalom Eliahou, Sylvain Gravier, Charles Payan
    Three Moves on Signed Surface Triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:118-125 [Journal]
  27. Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
    Coloring the Maximal Cliques of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:361-376 [Journal]
  28. Marc Daniel, Sylvain Gravier, Julien Moncel
    Identifying codes in some subgraphs of the square lattice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:411-421 [Journal]
  29. Sylvain Gravier, Mehdi Mhalla, Eric Tannier
    On a modular domination game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:291-303 [Journal]
  30. Sylvain Gravier
    On Tucker vertices of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:121-131 [Journal]
  31. Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak
    On the complexity of a restricted list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:103-109 [Journal]
  32. Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray
    An algorithm for coloring some perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:1-16 [Journal]
  33. Sylvain Gravier
    Hamiltonicity of the cross product of two Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:253-257 [Journal]
  34. Sylvain Gravier, Frédéric Maffray
    Choice number of 3-colorable elementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:353-358 [Journal]
  35. Sylvain Gravier, Abdelkader Khelladi
    On the domination number of cross products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:273-277 [Journal]
  36. Sylvain Gravier
    A Hajós-like theorem for list coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:299-302 [Journal]
  37. Hacène Aït Haddadène, Sylvain Gravier
    On weakly diamond-free Berge graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:237-240 [Journal]
  38. Paul Dorbec, Sylvain Gravier, Michael A. Henning
    Paired-domination in generalized claw-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:1, pp:1-7 [Journal]

  39. Construction of Codes Identifying Sets of Vertices. [Citation Graph (, )][DBLP]


  40. On two variations of identifying codes [Citation Graph (, )][DBLP]


  41. Weighted codes in Lee metrics. [Citation Graph (, )][DBLP]


  42. On the total domination number of cross products of graphs. [Citation Graph (, )][DBLP]


  43. Isometric embeddings of subdivided connected graphs into hypercubes. [Citation Graph (, )][DBLP]


  44. Geometrical extensions of Wythoff's game. [Citation Graph (, )][DBLP]


  45. Subdivided graphs as isometric subgraphs of Hamming graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002