The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roger Labahn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn
    Preface: ODSA. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:1- [Journal]
  2. Roger Labahn
    A minimum broadcast graph on 63 vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:247-250 [Journal]
  3. Roger Labahn, Stephen T. Hedetniemi, Renu Laskar
    Periodic gossiping on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:235-245 [Journal]
  4. Roger Labahn, Arthur L. Liestman, Erich Prisner
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:125-126 [Journal]
  5. 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]
  6. Gustav Burosch, Waleri Wassiljewitsch Gorlow, Roger Labahn, Mario Szegedy
    The Telephone Problem for Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1984, v:20, n:10/11, pp:557-573 [Journal]
  7. Roger Labahn
    The Telephone Problem for Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:9, pp:475-485 [Journal]
  8. Guillaume Fertin, Roger Labahn
    Compounding of gossip graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:126-137 [Journal]
  9. Hans-Dietrich O. F. Gronau, Roger Labahn
    An extremal coloring problem on matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:321-324 [Journal]
  10. Roger Labahn
    Information flows on hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:71-97 [Journal]
  11. Roger Labahn
    Kernels of minimum size gossip schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:99-139 [Journal]

  12. Extremal broadcasting problems. [Citation Graph (, )][DBLP]


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