Independent domination in chordal graphs. - Martin Farber (Oper. Res. Lett., 1982)

Characterizations of strongly chordal graphs. - Martin Farber (Discret. Math., 1983)

Domination, independent domination, and duality in strongly chordal graphs. - Martin Farber (Discret. Appl. Math., 1984)

Characterizations of Totally Balanced Matrices. - Richard P. Anstee; Martin Farber (J. Algorithms, 1984)

Domination in Permutation Graphs. - Martin Farber; J. Mark Keil (J. Algorithms, 1985)

Edge-disjoint spanning trees: A connectedness theorem. - Martin Farber; B. Richter; H. Shank (J. Graph Theory, 1985)

Steiner trees, connected domination and strongly chordal graphs. - Kevin White 001; Martin Farber; William R. Pulleyblank (Networks, 1985)

Concerning the achromatic number of graphs. - Martin Farber; Gena Hahn; Pavol Hell; Donald J. Miller (J. Comb. Theory B, 1986)

Bridged graphs and geodesic convexity. - Martin Farber (Discret. Math., 1987)

On local convexity in graphs. - Martin Farber; Robert E. Jamison (Discret. Math., 1987)

On bridged graphs and cop-win graphs. - Richard P. Anstee; Martin Farber (J. Comb. Theory B, 1988)

Basis pair graphs of transversal matroids are connected. - Martin Farber (Discret. Math., 1989)

On diameters and radii of bridged graphs. - Martin Farber (Discret. Math., 1989)

Absolute Reflexive Retracts and Absolute Bipartite Retracts. - Hans-Jürgen Bandelt; Martin Farber; Pavol Hell (Discret. Appl. Math., 1993)

An upper bound on the number of cliques in a graph. - Martin Farber; Mihály Hujter; Zsolt Tuza (Networks, 1993)

Algorithmic Aspects of Neighborhood Numbers. - Gerard J. Chang; Martin Farber; Zsolt Tuza (SIAM J. Discret. Math., 1993)