The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olivier Togni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mustapha Kchikech, Olivier Togni
    Paths Coloring Algorithms in Mesh Networks. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:193-202 [Conf]
  2. Mustapha Kchikech, Olivier Togni
    Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:165-176 [Conf]
  3. Olivier Togni
    Optical All-to-All Communication in Inflated Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:78-87 [Conf]
  4. 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]
  5. Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
    The irregularity strength of circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:1-10 [Journal]
  6. Olivier Togni
    Irregularity strength and compound graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:235-243 [Journal]
  7. Denise Amar, Olivier Togni
    Irregularity strength of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:15-38 [Journal]
  8. Olivier Togni
    Irregularity strength of the toroidal grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:609-620 [Journal]
  9. Mustapha Kchikech, Olivier Togni
    Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:159-172 [Journal]

  10. Multilevel Bandwidth and Radio Labelings of Graphs. [Citation Graph (, )][DBLP]


  11. Total and fractional total colourings of circulant graphs. [Citation Graph (, )][DBLP]


  12. Neighbor-distinguishing k-tuple edge-colorings of graphs. [Citation Graph (, )][DBLP]


  13. Strong Chromatic Index of Products of Graphs. [Citation Graph (, )][DBLP]


  14. Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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