The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Farber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans-Jürgen Bandelt, Martin Farber, Pavol Hell
    Absolute Reflexive Retracts and Absolute Bipartite Retracts. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:9-20 [Journal]
  2. Richard P. Anstee, Martin Farber
    Characterizations of Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:2, pp:215-230 [Journal]
  3. Martin Farber, J. Mark Keil
    Domination in Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:309-321 [Journal]
  4. Richard P. Anstee, Martin Farber
    On bridged graphs and cop-win graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:22-28 [Journal]
  5. Martin Farber, Gena Hahn, Pavol Hell, Donald Miller
    Concerning the achromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:21-39 [Journal]
  6. Gerhard J. Chang, Martin Farber, Zsolt Tuza
    Algorithmic Aspects of Neighborhood Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:1, pp:24-29 [Journal]
  7. Martin Farber
    Characterizations of strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:173-189 [Journal]
  8. Martin Farber
    Bridged graphs and geodesic convexity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:249-257 [Journal]
  9. Martin Farber, Robert E. Jamison
    On local convexity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:231-247 [Journal]
  10. Martin Farber
    Basis pair graphs of transversal matroids are connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:3, pp:245-248 [Journal]
  11. Martin Farber
    On diameters and radii of bridged graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:3, pp:249-260 [Journal]

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