The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
André Raspaud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Broadcasting and Multicasting in Cut-through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:734-738 [Conf]
  2. Guillaume Fertin, André Raspaud
    k-Neighborhood Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:133-146 [Conf]
  3. Guillaume Fertin, André Raspaud, Ondrej Sýkora
    No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:138-148 [Conf]
  4. Francesc Comellas, Guillaume Fertin, André Raspaud
    Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:73-87 [Conf]
  5. André Raspaud, Ondrej Sýkora, Imrich Vrto
    Congestion and dilation, similarities and differences: A survey. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:269-280 [Conf]
  6. Guillaume Fertin, André Raspaud
    Families of Graphs Having Broadcasting and Gossiping Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:63-77 [Conf]
  7. Guillaume Fertin, André Raspaud, Bruce A. Reed
    On Star Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:140-153 [Conf]
  8. Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Diameter of the Knödel Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:149-160 [Conf]
  9. Ginette Gauyacq, C. Micheneau, André Raspaud
    Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:227-241 [Conf]
  10. Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Small k-Dominating Sets in Planar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:201-216 [Conf]
  11. Dominique Barth, Johny Bond, André Raspaud
    Compatible Eulerian Circuits in Kn**. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:127-136 [Journal]
  12. Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    Acyclic colouring of 1-planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:29-41 [Journal]
  13. Guillaume Fertin, André Raspaud
    A survey on Knödel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:173-195 [Journal]
  14. Roger Labahn, André Raspaud
    Periodic Gossiping in Back-to-back Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:2, pp:157-168 [Journal]
  15. Denise Amar, André Raspaud, Olivier Togni
    All-to-all wavelength-routing in all-optical compound networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:353-363 [Journal]
  16. Matt DeVos, Jaroslav Nesetril, André Raspaud
    Antisymmetric flows and edge-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:161-167 [Journal]
  17. Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    On nice graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:39-51 [Journal]
  18. Mickaël Montassier, André Raspaud, Weifan Wang
    Bordeaux 3-color conjecture and 3-choosability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:573-579 [Journal]
  19. Dominique Barth, André Raspaud
    Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:4, pp:175-179 [Journal]
  20. Guillaume Fertin, Emmanuel Godard, André Raspaud
    Minimum feedback vertex set and acyclic coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:131-139 [Journal]
  21. Guillaume Fertin, Emmanuel Godard, André Raspaud
    Acyclic and k-distance coloring of the grid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:51-58 [Journal]
  22. Guillaume Fertin, André Raspaud, Arup Roychowdhury
    On the oriented chromatic number of grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:261-266 [Journal]
  23. André Raspaud, Eric Sopena
    Good and Semi-Strong Colorings of Oriented Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:4, pp:171-174 [Journal]
  24. Mickaël Montassier, André Raspaud
    A note on 2-facial coloring of plane graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:6, pp:235-241 [Journal]
  25. Min Chen, André Raspaud, Weifan Wang
    Three-coloring planar graphs without short cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:134-138 [Journal]
  26. Dominique Barth, François Pellegrini, André Raspaud, Jean Roman
    On Bandwidth, Cutwidth, and Quotient Graphs. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:6, pp:487-508 [Journal]
  27. André Raspaud, Ondrej Sýkora, Imrich Vrto
    Cutwidth of the Bruijn Graph. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:6, pp:509-514 [Journal]
  28. Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    On Deeply Critical Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:150-155 [Journal]
  29. Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour
    Planar graphs without cycles of length from 4 to 7 are 3-colorable. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:303-311 [Journal]
  30. Oleg V. Borodin, André Raspaud
    A sufficient condition for planar graphs to be 3-colorable. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:17-27 [Journal]
  31. Genghua Fan, André Raspaud
    Fulkerson's Conjecture and Circuit Covers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:133-138 [Journal]
  32. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    Nilpotent Families of Endomorphisms of (p(V)+, cup). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:100-108 [Journal]
  33. Ury Jamshy, André Raspaud, Michael Tarsi
    Short circuit covers for regular matroids with a nowhere zero 5-flow. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:3, pp:354-357 [Journal]
  34. Jaroslav Nesetril, André Raspaud
    Colored Homomorphisms of Colored Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:147-155 [Journal]
  35. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:788-802 [Journal]
  36. Mickaël Montassier, André Raspaud
    (d, 1)-total labeling of graphs with a given maximum average degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:2, pp:93-109 [Journal]
  37. Mickaël Montassier, Pascal Ochem, André Raspaud
    On the acyclic choosability of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:4, pp:281-300 [Journal]
  38. Edita Mácajová, André Raspaud
    On the strong circular 5-flow conjecture. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:4, pp:307-316 [Journal]
  39. Mickaël Montassier, André Raspaud, Weifan Wang
    Acyclic 5-choosability of planar graphs without small cycles. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:3, pp:245-260 [Journal]
  40. Guillaume Fertin, André Raspaud, Bruce A. Reed
    Star coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:163-182 [Journal]
  41. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On the maximum average degree and the oriented chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:77-89 [Journal]
  42. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On universal graphs for planar oriented graphs of a given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:73-85 [Journal]
  43. Oscar Ordaz, Denise Amar, André Raspaud
    Hamiltonian properties and the bipartite independence number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:207-215 [Journal]
  44. Jarik Nesetril, André Raspaud, Eric Sopena
    Colorings and girth of oriented planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:519-530 [Journal]
  45. Denise Amar, André Raspaud
    Covering the vertices of a digraph by cycles of prescribed length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:2, pp:111-118 [Journal]
  46. André Raspaud
    Postman tours and cycle covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:447-454 [Journal]
  47. Guillaume Fertin, André Raspaud
    L(p, q) labeling of d-dimensional grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2132-2140 [Journal]
  48. Fabrice Bazzaro, Mickaël Montassier, André Raspaud
    (d, 1)-total labelling of planar graphs with large girth and high maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2141-2151 [Journal]

  49. On Injective Colourings of Chordal Graphs. [Citation Graph (, )][DBLP]


  50. Injective Oriented Colourings. [Citation Graph (, )][DBLP]


  51. Injective coloring of planar graphs. [Citation Graph (, )][DBLP]


  52. A note on the acyclic 3-choosability of some planar graphs. [Citation Graph (, )][DBLP]


  53. Homomorphisms of 2-edge-colored graphs. [Citation Graph (, )][DBLP]


  54. Linear choosability of graphs. [Citation Graph (, )][DBLP]


  55. On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP]


  56. Preface. [Citation Graph (, )][DBLP]


  57. Antibandwidth and cyclic antibandwidth of meshes and hypercubes. [Citation Graph (, )][DBLP]


  58. Linear coloring of planar graphs with large girth. [Citation Graph (, )][DBLP]


  59. Some bounds on the injective chromatic number of graphs. [Citation Graph (, )][DBLP]


  60. Planar graphs without adjacent cycles of length at most seven are 3-colorable. [Citation Graph (, )][DBLP]


  61. Decomposition of sparse graphs, with application to game coloring number. [Citation Graph (, )][DBLP]


  62. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. [Citation Graph (, )][DBLP]


  63. Acyclic 3-choosability of sparse graphs with girth at least 7. [Citation Graph (, )][DBLP]


  64. Homomorphisms from sparse graphs to the Petersen graph. [Citation Graph (, )][DBLP]


  65. Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. [Citation Graph (, )][DBLP]


  66. On acyclic 4-choosability of planar graphs without short cycles. [Citation Graph (, )][DBLP]


  67. On the vertex-arboricity of planar graphs. [Citation Graph (, )][DBLP]


  68. Projective, affine, and abelian colorings of cubic graphs. [Citation Graph (, )][DBLP]


  69. An upper bound on adaptable choosability of graphs. [Citation Graph (, )][DBLP]


  70. Perfect matchings with restricted intersection in cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.455secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002