The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal Ochem: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lucian Ilie, Pascal Ochem, Jeffrey Shallit
    A Generalization of Repetition Threshold. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:818-826 [Conf]
  2. Gregory Kucherov, Pascal Ochem, Michaël Rao
    How Many Square Occurrences Must a Binary Sequence Contain? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  3. Pascal Ochem
    Oriented colorings of triangle-free planar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:71-76 [Journal]
  4. Louis Esperet, Pascal Ochem
    Oriented colorings of 2-outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:5, pp:215-219 [Journal]
  5. Lucian Ilie, Pascal Ochem, Jeffrey Shallit
    A generalization of repetition threshold. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:359-369 [Journal]
  6. 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]
  7. József Balogh, Pascal Ochem, András Pluhár
    On the interval number of special graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:4, pp:241-253 [Journal]
  8. Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
    Avoiding Approximate Squares. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:278-289 [Conf]
  9. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
    Planar graphs are in 1-STRING. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:609-617 [Conf]
  10. Pascal Ochem
    Letter frequency in infinite repetition-free words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:388-392 [Journal]

  11. On maximal repetitions of arbitrary exponent [Citation Graph (, )][DBLP]


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


  13. Planar Graphs Have 1-string Representations. [Citation Graph (, )][DBLP]


  14. On star and caterpillar arboricity. [Citation Graph (, )][DBLP]


  15. On circle graphs with girth at least five. [Citation Graph (, )][DBLP]


  16. Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. [Citation Graph (, )][DBLP]


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